{"$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":"D7","name":"Architectural Integrity","shortDescription":{"text":"Architectural Integrity"},"helpUri":"https://codehealth.canine.dev/dimensions/D7"},{"id":"D8","name":"Code Coverage","shortDescription":{"text":"Code Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/D8"},{"id":"D9","name":"Test Distribution","shortDescription":{"text":"Test Distribution"},"helpUri":"https://codehealth.canine.dev/dimensions/D9"},{"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"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"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":"D18","name":"Solution Shape","shortDescription":{"text":"Solution Shape"},"helpUri":"https://codehealth.canine.dev/dimensions/D18"},{"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":"D22","name":"Internal API Consistency","shortDescription":{"text":"Internal API Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D22"},{"id":"D24","name":"Comment Value","shortDescription":{"text":"Comment Value"},"helpUri":"https://codehealth.canine.dev/dimensions/D24"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D27","name":"Navigability","shortDescription":{"text":"Navigability"},"helpUri":"https://codehealth.canine.dev/dimensions/D27"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"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"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"]}},{"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"]}],"properties":{"cwe":["CWE-1395","CWE-937"]}},{"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"]}],"properties":{"cwe":["CWE-1032","CWE-732","CWE-16"]}},{"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"]}],"properties":{"cwe":["CWE-1357","CWE-494"]}},{"id":"D39","name":"IL Efficiency","shortDescription":{"text":"IL Efficiency"},"helpUri":"https://codehealth.canine.dev/dimensions/D39"},{"id":"D40","name":"Network Egress Confinement","shortDescription":{"text":"Network Egress Confinement"},"helpUri":"https://codehealth.canine.dev/dimensions/D40"},{"id":"D41","name":"Kernel \u0026 Syscall Confinement","shortDescription":{"text":"Kernel \u0026 Syscall Confinement"},"helpUri":"https://codehealth.canine.dev/dimensions/D41"},{"id":"AC1","name":"Text alternatives","shortDescription":{"text":"Text alternatives"},"helpUri":"https://codehealth.canine.dev/dimensions/AC1"},{"id":"AC2","name":"Forms \u0026 labels","shortDescription":{"text":"Forms \u0026 labels"},"helpUri":"https://codehealth.canine.dev/dimensions/AC2"},{"id":"AC3","name":"Page structure","shortDescription":{"text":"Page structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AC3"},{"id":"AC4","name":"Keyboard semantics","shortDescription":{"text":"Keyboard semantics"},"helpUri":"https://codehealth.canine.dev/dimensions/AC4"},{"id":"AC5","name":"ARIA correctness","shortDescription":{"text":"ARIA correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/AC5"},{"id":"AC6","name":"Visual \u0026 motion safety","shortDescription":{"text":"Visual \u0026 motion safety"},"helpUri":"https://codehealth.canine.dev/dimensions/AC6"},{"id":"AC7","name":"A11y enforcement","shortDescription":{"text":"A11y enforcement"},"helpUri":"https://codehealth.canine.dev/dimensions/AC7"},{"id":"AX1","name":"Captive dependencies","shortDescription":{"text":"Captive dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/AX1"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX2","name":"Stateful singletons","shortDescription":{"text":"Stateful singletons"},"helpUri":"https://codehealth.canine.dev/dimensions/AX2"},{"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":"AX5","name":"Architecture \u0026 structure","shortDescription":{"text":"Architecture \u0026 structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AX5"},{"id":"AX6","name":"Interface segregation","shortDescription":{"text":"Interface segregation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX6"},{"id":"AX8","name":"Test isolation","shortDescription":{"text":"Test isolation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX8"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"C1","name":"Data Protection","shortDescription":{"text":"Data Protection"},"helpUri":"https://codehealth.canine.dev/dimensions/C1"},{"id":"C2","name":"Access Controls","shortDescription":{"text":"Access Controls"},"helpUri":"https://codehealth.canine.dev/dimensions/C2"},{"id":"C3","name":"Audit Trail","shortDescription":{"text":"Audit Trail"},"helpUri":"https://codehealth.canine.dev/dimensions/C3"},{"id":"C4","name":"Data Retention","shortDescription":{"text":"Data Retention"},"helpUri":"https://codehealth.canine.dev/dimensions/C4"},{"id":"C5","name":"Data-Subject Rights","shortDescription":{"text":"Data-Subject Rights"},"helpUri":"https://codehealth.canine.dev/dimensions/C5"},{"id":"DM1","name":"Aggregate boundaries","shortDescription":{"text":"Aggregate boundaries"},"helpUri":"https://codehealth.canine.dev/dimensions/DM1"},{"id":"DM10","name":"One transaction, one aggregate","shortDescription":{"text":"One transaction, one aggregate"},"helpUri":"https://codehealth.canine.dev/dimensions/DM10"},{"id":"DM11","name":"Constructible invalid state","shortDescription":{"text":"Constructible invalid state"},"helpUri":"https://codehealth.canine.dev/dimensions/DM11"},{"id":"DM5","name":"Encapsulated state","shortDescription":{"text":"Encapsulated state"},"helpUri":"https://codehealth.canine.dev/dimensions/DM5"},{"id":"DM6","name":"Domain \u2194 infrastructure boundary","shortDescription":{"text":"Domain \u2194 infrastructure boundary"},"helpUri":"https://codehealth.canine.dev/dimensions/DM6"},{"id":"DM8","name":"Value-object opportunities","shortDescription":{"text":"Value-object opportunities"},"helpUri":"https://codehealth.canine.dev/dimensions/DM8"},{"id":"DM9","name":"Scattered domain decisions","shortDescription":{"text":"Scattered domain decisions"},"helpUri":"https://codehealth.canine.dev/dimensions/DM9"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"ES1","name":"Fold determinism","shortDescription":{"text":"Fold determinism"},"helpUri":"https://codehealth.canine.dev/dimensions/ES1"},{"id":"ES2","name":"Immutable events","shortDescription":{"text":"Immutable events"},"helpUri":"https://codehealth.canine.dev/dimensions/ES2"},{"id":"ES3","name":"PII in the event store","shortDescription":{"text":"PII in the event store"},"helpUri":"https://codehealth.canine.dev/dimensions/ES3"},{"id":"GD1","name":"Unfinished \u0026 placeholder code","shortDescription":{"text":"Unfinished \u0026 placeholder code"},"helpUri":"https://codehealth.canine.dev/dimensions/GD1"},{"id":"IC1","name":"Incompleteness \u0026 stubs","shortDescription":{"text":"Incompleteness \u0026 stubs"},"helpUri":"https://codehealth.canine.dev/dimensions/IC1"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P5","name":"DR \u0026 Backup","shortDescription":{"text":"DR \u0026 Backup"},"helpUri":"https://codehealth.canine.dev/dimensions/P5"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"P9","name":"Domain vs controller coverage","shortDescription":{"text":"Domain vs controller coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/P9"},{"id":"PF1","name":"Benchmark discipline","shortDescription":{"text":"Benchmark discipline"},"helpUri":"https://codehealth.canine.dev/dimensions/PF1"},{"id":"PF2","name":"Allocation hygiene","shortDescription":{"text":"Allocation hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF2"},{"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":"R8","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/R8"},{"id":"R9","name":"Circular Imports","shortDescription":{"text":"Circular Imports"},"helpUri":"https://codehealth.canine.dev/dimensions/R9"},{"id":"S1","name":"Web-Security Posture","shortDescription":{"text":"Web-Security Posture"},"helpUri":"https://codehealth.canine.dev/dimensions/S1"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X16","name":"Unfloored truncation loop","shortDescription":{"text":"Unfloored truncation loop"},"helpUri":"https://codehealth.canine.dev/dimensions/X16"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X2","name":"Cancellation propagation","shortDescription":{"text":"Cancellation propagation"},"helpUri":"https://codehealth.canine.dev/dimensions/X2"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X3","name":"Exception handling","shortDescription":{"text":"Exception handling"},"helpUri":"https://codehealth.canine.dev/dimensions/X3"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"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":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"id":"X5","name":"Nullable reference types","shortDescription":{"text":"Nullable reference types"},"helpUri":"https://codehealth.canine.dev/dimensions/X5"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"DependencyHygieneAnalyzer.RunAsync (cyclomatic 252): DependencyHygieneAnalyzer.RunAsync has cyclomatic complexity 252 (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":"engine/src/CodeHealth.Dimensions.Dependencies/DependencyHygieneAnalyzer.cs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b4f60e7e595ec9b16cb415f3963454ae9aec07ffccf8c064965eb41541da166"}},{"ruleId":"D1","level":"warning","message":{"text":"dimension-routing.main (cyclomatic 171): dimension-routing.main has cyclomatic complexity 171 (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":"tools/train/dimension-routing.py"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c60bc8d4e2cc113ffb02a1872f811839eddb07db3ac4621ed9dce8395b50ed5"}},{"ruleId":"D1","level":"warning","message":{"text":"AnalyzeCommand.ExecuteCoreAsync (cyclomatic 144): AnalyzeCommand.ExecuteCoreAsync has cyclomatic complexity 144 (threshold 15). Of this number, 141 points are the body\u0027s own statements and 3 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Cli/Commands/AnalyzeCommand.cs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"c239a247d6decf5e713c949009d9d4b9eed26bf304b01b6b5b1680f3c5f51d1f"}},{"ruleId":"D1","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.RunAsync (cyclomatic 135): SupplyChainProvenanceAnalyzer.RunAsync has cyclomatic complexity 135 (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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":2625}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cc4696ebcb150c679a187fdcc64700139d3bda804c14ed88d44261cf4f5267b"}},{"ruleId":"D1","level":"warning","message":{"text":"CSharpCorrectnessAnalyzer.AnalyzeAsync (cyclomatic 130): CSharpCorrectnessAnalyzer.AnalyzeAsync has cyclomatic complexity 130 (threshold 15). Of this number, 125 points are the body\u0027s own statements and 5 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":"engine/src/CodeHealth.Core/ModelAware/CSharpCorrectnessAnalyzer.cs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8664eecf071752bb4e4b29fe01ab521b4de18ad6d5a2d32ea7bd100e9ab26c5"}},{"ruleId":"D1","level":"warning","message":{"text":"ComplianceSecurityAnalyzer.S1 (cyclomatic 128): ComplianceSecurityAnalyzer.S1 has cyclomatic complexity 128 (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":"engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs"},"region":{"startLine":5493}}}],"partialFingerprints":{"codehealthFindingId/v1":"394298a64bb3c9133d31bd4ba8ff52e05328f0cead327eaeeea3fba39d19bcea"}},{"ruleId":"D1","level":"warning","message":{"text":"SecretsHistoryAnalyzer.GateCorpusAndDocumentedExampleFindings (cyclomatic 119): SecretsHistoryAnalyzer.GateCorpusAndDocumentedExampleFindings has cyclomatic complexity 119 (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":"engine/src/CodeHealth.Dimensions.Security/SecretsHistoryAnalyzer.cs"},"region":{"startLine":897}}}],"partialFingerprints":{"codehealthFindingId/v1":"4edd9e703cc8e3c080c3e314bb019ba2a7726dbdee14a88f7bc1dad6e9067aed"}},{"ruleId":"D1","level":"warning","message":{"text":"ProductionReadinessAnalyzer.SecurityAndPerf (cyclomatic 114): ProductionReadinessAnalyzer.SecurityAndPerf has cyclomatic complexity 114 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs"},"region":{"startLine":4675}}}],"partialFingerprints":{"codehealthFindingId/v1":"3605ff86689c5b2fcaf81c57f9651ab1a0e208929c0c3942bf495390b56ea5d5"}},{"ruleId":"D1","level":"warning","message":{"text":"judge-routing.main (cyclomatic 107): judge-routing.main has cyclomatic complexity 107 (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":"tools/train/judge-routing.py"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2a2b6a510ac375617600e190c4475b19c2d88a8dc0a6924faf3ccaba74121c3"}},{"ruleId":"D1","level":"warning","message":{"text":"AccessibilityAnalyzer.AssessEnforcement (cyclomatic 105): AccessibilityAnalyzer.AssessEnforcement has cyclomatic complexity 105 (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":"engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs"},"region":{"startLine":6348}}}],"partialFingerprints":{"codehealthFindingId/v1":"78582a09a962986159c5ff685e3d67cc912ace95bd9c01b3aa3ef82b2749accb"}},{"ruleId":"D1","level":"warning","message":{"text":"JsDuplicationDetector.BuildDeclarationEntryMask (cyclomatic 102): JsDuplicationDetector.BuildDeclarationEntryMask has cyclomatic complexity 102 (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":"engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs"},"region":{"startLine":860}}}],"partialFingerprints":{"codehealthFindingId/v1":"260b397a8f5a1c644fab2c9a536693807d3115f626906471e31690efadb9d287"}},{"ruleId":"D1","level":"warning","message":{"text":"MaturityAnalyzer.FolderStructure (cyclomatic 97): MaturityAnalyzer.FolderStructure has cyclomatic complexity 97 (threshold 15). Of this number, 95 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Maturity/MaturityAnalyzer.cs"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"68f42274be25f178482dcb5ac87bbb71ee27dca51bbd18f51a7e55eb4b0a8e82"}},{"ruleId":"D1","level":"warning","message":{"text":"programme-status.main (cyclomatic 95): programme-status.main has cyclomatic complexity 95 (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":"tools/train/programme-status.py"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cda95e4bf616ea5285f06d4ea67b86f31cf8ba91de501ee7432ca0dab76dcf3"}},{"ruleId":"D1","level":"warning","message":{"text":"SemgrepClaimRecheck.PremiseRefutedByTheCitedSource (cyclomatic 94): SemgrepClaimRecheck.PremiseRefutedByTheCitedSource has cyclomatic complexity 94 (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":"engine/src/CodeHealth.Dimensions.Security/Scanners/SemgrepClaimRecheck.cs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd2f28244eb7d8f98d843226afed966fcc39a1f916c0acc946ffd67b52d18e5b"}},{"ruleId":"D1","level":"warning","message":{"text":"AccessibilityAnalyzer.KeyboardSemantics (cyclomatic 84): AccessibilityAnalyzer.KeyboardSemantics has cyclomatic complexity 84 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs"},"region":{"startLine":3353}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a2edb2e2bb7b56bcb31008fee6e3cf1dd24a82c57590af763bc2aaf2ecbd4cf"}},{"ruleId":"D1","level":"warning","message":{"text":"CoverageAnalyzer.RunAsync (cyclomatic 79): CoverageAnalyzer.RunAsync has cyclomatic complexity 79 (threshold 15). Of this number, 75 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":"engine/src/CodeHealth.Dimensions.Testing/CoverageAnalyzer.cs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6db44ff3091d6daaff0e3df86b0f3397a22dc5d293c8b69953053457e850f04"}},{"ruleId":"D1","level":"warning","message":{"text":"SolutionShapeAnalyzer.RunAsync (cyclomatic 78): SolutionShapeAnalyzer.RunAsync has cyclomatic complexity 78 (threshold 15). Of this number, 69 points are the body\u0027s own statements and 9 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.CodeQuality/SolutionShape/SolutionShapeAnalyzer.cs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"46635ce882c48c114cc42affcfcbc8ea10f533e0ec75c771638b65df51e08b99"}},{"ruleId":"D1","level":"warning","message":{"text":"judge_verification.main (cyclomatic 78): judge_verification.main has cyclomatic complexity 78 (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":"tools/train/judge_verification.py"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"859d62c29c025b31b58b539e45d01c91ee2f57760eb8b20e42cd5efed5bbd234"}},{"ruleId":"D1","level":"warning","message":{"text":"IncompletenessAnalyzer.AnalyzeAsync (cyclomatic 76): IncompletenessAnalyzer.AnalyzeAsync has cyclomatic complexity 76 (threshold 15). Of this number, 75 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/IncompletenessAnalyzer.cs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"686ed335458373ee8b1c21c5af28b163c21bff13ba562b832f9edf93917c8bf7"}},{"ruleId":"D1","level":"warning","message":{"text":"ProductionReadinessAnalyzer.ObservabilityAsync (cyclomatic 75): ProductionReadinessAnalyzer.ObservabilityAsync has cyclomatic complexity 75 (threshold 15). Of this number, 74 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs"},"region":{"startLine":4266}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bc62d8438e44b6aa60c2a688720f9e895be0e7820561a8aabb827e995e73d84"}},{"ruleId":"D1","level":"warning","message":{"text":"SourceClassifier.EcosystemMarkerVerdict (cyclomatic 74): SourceClassifier.EcosystemMarkerVerdict has cyclomatic complexity 74 (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":"engine/src/CodeHealth.Core/Classification/SourceClassifier.cs"},"region":{"startLine":3231}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6e131f5934dd6098842ef274c32c9cb86d9dc94796976e586ec88a829988f4a"}},{"ruleId":"D1","level":"warning","message":{"text":"AppKindDetector.DetectAsync (cyclomatic 74): AppKindDetector.DetectAsync has cyclomatic complexity 74 (threshold 15). Of this number, 72 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/AppKindDetector.cs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff15a603a958b87378bfe4657cccc0d7118d8d91936db10afc9a0eb725655878"}},{"ruleId":"D1","level":"warning","message":{"text":"judge-k3-report.main (cyclomatic 74): judge-k3-report.main has cyclomatic complexity 74 (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":"tools/train/judge-k3-report.py"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"096e4fa8bf2ea5e1a2babab0d47f4ea38c9d760b79884798a28d3572cb3c6b17"}},{"ruleId":"D1","level":"warning","message":{"text":"EventDrivenAnalyzer.OutboxDualWrite (cyclomatic 73): EventDrivenAnalyzer.OutboxDualWrite has cyclomatic complexity 73 (threshold 15). Of this number, 63 points are the body\u0027s own statements and 10 belong to 4 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs"},"region":{"startLine":1680}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e617482d4590a1b2991c0c0cde2925943a39648f3fa314bfacc9108e6b6dc5f"}},{"ruleId":"D1","level":"warning","message":{"text":"GodClassAnalyzer.RunAsync (cyclomatic 73): GodClassAnalyzer.RunAsync has cyclomatic complexity 73 (threshold 15). Of this number, 38 points are the body\u0027s own statements and 35 belong to 5 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.CodeQuality/CodeShape/GodClassAnalyzer.cs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"006ced6f6e5567809e523946e4a9d06e519df80ad2b5a21b88fe39343475564d"}},{"ruleId":"D1","level":"warning","message":{"text":"ModuleSyntaxScanner.Scan (cyclomatic 71): ModuleSyntaxScanner.Scan has cyclomatic complexity 71 (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":"engine/src/CodeHealth.Core/Frontend/ModuleSyntaxScanner.cs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"544e087094c55fb45b78f11ee4da7aed9f91b4980d1767d9f08a48cdd39fa60e"}},{"ruleId":"D1","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.WorkflowTokenHygiene (cyclomatic 70): SupplyChainProvenanceAnalyzer.WorkflowTokenHygiene has cyclomatic complexity 70 (threshold 15). Of this number, 61 points are the body\u0027s own statements and 9 belong to 8 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":8699}}}],"partialFingerprints":{"codehealthFindingId/v1":"12de76f078da89883c4e13644ee16bf0ef1a8e57f0d10363144ed1e6e2aeaf20"}},{"ruleId":"D1","level":"warning","message":{"text":"DomainModelAnalyzer.AnemicDomainModel (cyclomatic 69): DomainModelAnalyzer.AnemicDomainModel has cyclomatic complexity 69 (threshold 15). Of this number, 37 points are the body\u0027s own statements and 32 belong to 12 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs"},"region":{"startLine":2379}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd5483f43242f4d177320051e052328452f8c4874b6352a8b0999fdd73f81b0e"}},{"ruleId":"D1","level":"warning","message":{"text":"SecretNoiseFilter.IsGenericRuleNoise (cyclomatic 69): SecretNoiseFilter.IsGenericRuleNoise has cyclomatic complexity 69 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/SecretNoiseFilter.cs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2f1089baa71cf0c72e9878856a4ae7f1244a243411f7ce171b745012c549135"}},{"ruleId":"D1","level":"warning","message":{"text":"RoslynDuplicationDetector.ScanAsync (cyclomatic 67): RoslynDuplicationDetector.ScanAsync has cyclomatic complexity 67 (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":"engine/src/CodeHealth.Core/CodeShape/RoslynDuplicationDetector.cs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd1cf82d654a9258fb2e6c624561a0731051a6c8550438e0bf88dc280b3c91e7"}},{"ruleId":"D1","level":"warning","message":{"text":"RepoProfiler.DetectDdd (cyclomatic 66): RepoProfiler.DetectDdd has cyclomatic complexity 66 (threshold 15). Of this number, 53 points are the body\u0027s own statements and 13 belong to 7 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/RepoProfiler.cs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3e375124584e2ea9ec07eed478d263dca594b1833f950fbfb8dc12c4aee5db4"}},{"ruleId":"D1","level":"warning","message":{"text":"HotspotAnalyzer.RunAsync (cyclomatic 66): HotspotAnalyzer.RunAsync has cyclomatic complexity 66 (threshold 15). Of this number, 58 points are the body\u0027s own statements and 8 belong to 6 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":"engine/src/CodeHealth.Dimensions.GitMining/HotspotAnalyzer.cs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"85f94d14c1c2851eef63cc39fcb49c7eeaea76429a891c42ef93d43a5e088c41"}},{"ruleId":"D1","level":"warning","message":{"text":"tokenize.tokenizeBody (cyclomatic 66): tokenize.tokenizeBody has cyclomatic complexity 66 (threshold 15). Most of this is not in the body itself: 5 of the 66 points are its own statements and the rest belongs to 14 function literals inside it that branch (lines 42, 49, 57, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/ruby-frontend/tokenize.mjs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2cf0b2ab26f8e0e3f11dd5229ac224603aa1ebbf00bb8b0f5c2a2b90f64ce27"}},{"ruleId":"D1","level":"warning","message":{"text":"dimension-coverage.main (cyclomatic 65): dimension-coverage.main has cyclomatic complexity 65 (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":"tools/multilang/dimension-coverage.py"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"21748eef8217d986e0b5731d20f658630a6c3ff74245e7dbd3e51d15af2e393b"}},{"ruleId":"D1","level":"warning","message":{"text":"ProductionReadinessAnalyzer.DisasterRecovery (cyclomatic 64): ProductionReadinessAnalyzer.DisasterRecovery has cyclomatic complexity 64 (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":"engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs"},"region":{"startLine":1889}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f117340467b159e9ed564a3128327cc327904df4e823b40011c283df61a928a"}},{"ruleId":"D1","level":"warning","message":{"text":"agg_holdout5.main (cyclomatic 64): agg_holdout5.main has cyclomatic complexity 64 (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":"tools/multilang/agg_holdout5.py"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"07453ce0063998e317aad951c9616c5dfa8127561ad63a6f3987d9a2238c3cef"}},{"ruleId":"D1","level":"warning","message":{"text":"AccessibilityAnalyzer.FormsAndLabels (cyclomatic 62): AccessibilityAnalyzer.FormsAndLabels has cyclomatic complexity 62 (threshold 15). Of this number, 58 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":"engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs"},"region":{"startLine":2246}}}],"partialFingerprints":{"codehealthFindingId/v1":"648bd580cb80d4a02835daf62d5b24adb12dce5fc76341babdcc74c40953ad17"}},{"ruleId":"D1","level":"warning","message":{"text":"FrontendBoundaries.CollectCrossPackageViolations (cyclomatic 61): FrontendBoundaries.CollectCrossPackageViolations has cyclomatic complexity 61 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/FrontendBoundaries.cs"},"region":{"startLine":1055}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcc72a37db7e1fce3f890989d5d52c1cf7217ee7b16996c2311fb40a4ae4c790"}},{"ruleId":"D1","level":"warning","message":{"text":"report_round.main (cyclomatic 61): report_round.main has cyclomatic complexity 61 (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":"tools/train/report_round.py"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8dddbae097a3cb9d66094f1592109d710a724c987f1b6efa480bff319ce5ce8"}},{"ruleId":"D1","level":"warning","message":{"text":"agg_combined.main (cyclomatic 60): agg_combined.main has cyclomatic complexity 60 (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":"tools/multilang/agg_combined.py"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ae1389e37e471086683b25912f683ece26d60a1f9d13b90b98a23e9c877540a"}},{"ruleId":"D1","level":"warning","message":{"text":"DartDeadLibraryField.StripNonCode (cyclomatic 59): DartDeadLibraryField.StripNonCode has cyclomatic complexity 59 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Dart/DartDeadLibraryField.cs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"53f54e205a8d58440a83a7d50c68f66b44e43a9c1263023b92658134eaf6cfb2"}},{"ruleId":"D1","level":"warning","message":{"text":"FrontendTestReachability.Analyze (cyclomatic 59): FrontendTestReachability.Analyze has cyclomatic complexity 59 (threshold 15). Of this number, 57 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":"engine/src/CodeHealth.Core/Frontend/FrontendTestReachability.cs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5249fdbda909e5846c21d4c1f937391f606dab5ddd7cdf41b109f7420074c1e"}},{"ruleId":"D1","level":"warning","message":{"text":"check.main (cyclomatic 59): check.main has cyclomatic complexity 59 (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":"engine/sidecars/kotlin-frontend/selftest/check.py"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"446c7da580229962e5a97385ab4c7241df46dd8ff8466bf352846fb44b543dee"}},{"ruleId":"D1","level":"warning","message":{"text":"JsDuplicationDetector.TryMergeNearCloneSegment (cyclomatic 58): JsDuplicationDetector.TryMergeNearCloneSegment has cyclomatic complexity 58 (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":"engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs"},"region":{"startLine":4204}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f67ebabf254159da7146b6bf9288195a972c2b07e921ffc7e828348a9b6eaec"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeSecretScanner.ScanLines (cyclomatic 58): NativeSecretScanner.ScanLines has cyclomatic complexity 58 (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":"engine/src/CodeHealth.Core/Security/NativeSecretScanner.cs"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"af99be7433d60adac232376725624e2812b320f7c1730a2f0ed4d573d4d5a8e9"}},{"ruleId":"D1","level":"warning","message":{"text":"TestQualityAnalyzer.RunAsync (cyclomatic 58): TestQualityAnalyzer.RunAsync has cyclomatic complexity 58 (threshold 15). Of this number, 51 points are the body\u0027s own statements and 7 belong to 6 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":"engine/src/CodeHealth.Dimensions.Testing/TestQualityAnalyzer.cs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e23ed34ac0f3d8e4180a4a22248d1a7ff3a3e210fc97e1cb91c7f3269185dfe"}},{"ruleId":"D1","level":"warning","message":{"text":"agg_holdout6.main (cyclomatic 56): agg_holdout6.main has cyclomatic complexity 56 (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":"tools/multilang/agg_holdout6.py"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bbc2e53509ee31e2035c86a4f4d645a5105f651a9dd7c2c6b07fb380cd6373b"}},{"ruleId":"D1","level":"warning","message":{"text":"check.main (cyclomatic 56): check.main has cyclomatic complexity 56 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/ruby-frontend/selftest/check.mjs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"26f9eca66bef38f90914b88acbdedfa40eead2e9548b10c13677969985092293"}},{"ruleId":"D1","level":"warning","message":{"text":"agg_holdout4.main (cyclomatic 55): agg_holdout4.main has cyclomatic complexity 55 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/multilang/agg_holdout4.py"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3f1577bd8064db38ef37f753e49c4ad71ff1b3d43db3f0b1ec699190c650484"}},{"ruleId":"D1","level":"warning","message":{"text":"UpstreamAttribution.ForRepo (cyclomatic 54): UpstreamAttribution.ForRepo has cyclomatic complexity 54 (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":"engine/src/CodeHealth.Core/FileQuality/UpstreamAttribution.cs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f50f1faef7a14c416a21aeaaad57e3c75df7d0a909f7fba3a1676f4b18eff34"}},{"ruleId":"D1","level":"warning","message":{"text":"AccessibilityAnalyzer.PageLevelChecks (cyclomatic 54): AccessibilityAnalyzer.PageLevelChecks has cyclomatic complexity 54 (threshold 15). Of this number, 42 points are the body\u0027s own statements and 12 belong to 4 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs"},"region":{"startLine":2971}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bcd7f1bad983a56f6d0e78b8aad5aba933bf2bd5ffd7400d0ff04736933987d"}},{"ruleId":"D1","level":"warning","message":{"text":"ProductionReadinessAnalyzer.DeploymentRollback (cyclomatic 54): ProductionReadinessAnalyzer.DeploymentRollback has cyclomatic complexity 54 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs"},"region":{"startLine":993}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d9aff379677765a8fe8a920d5a621e24c813b871ebf46ec3faf088f9d4bab70"}},{"ruleId":"D1","level":"warning","message":{"text":"ReportViewModelFactory.Build (cyclomatic 54): ReportViewModelFactory.Build has cyclomatic complexity 54 (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":"engine/src/CodeHealth.Reporting/Templates/ReportViewModelFactory.cs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"26315f1b756f3566c79f8b3e8339ef38858f794a1035e5a5246b6ae7dc542cc7"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 54): (anonymous) has cyclomatic complexity 54 (threshold 15). Most of this is not in the body itself: 3 of the 54 points are its own statements and the rest belongs to 19 function items inside it that branch (patchBars::(anonymous), onLifecycle, connect, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Kennel.Ui/wwwroot/kennel-ui.js"},"region":{"startLine":1927}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0a53fb65b3d840bb47544263c30e36d77a3d9e4e84cf1d977145595b239ccf8"}},{"ruleId":"D1","level":"warning","message":{"text":"FrontendBundlerConfigRefs.CollectBundlerEntries (cyclomatic 53): FrontendBundlerConfigRefs.CollectBundlerEntries has cyclomatic complexity 53 (threshold 15). Of this number, 52 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/FrontendBundlerConfigRefs.cs"},"region":{"startLine":848}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b880cd1ba0ac383572992af898201a5f946316003b3b96ba867d56f45331721"}},{"ruleId":"D1","level":"warning","message":{"text":"FrontendPathLiteralRefs.CollectPathLiteralRefs (cyclomatic 53): FrontendPathLiteralRefs.CollectPathLiteralRefs has cyclomatic complexity 53 (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":"engine/src/CodeHealth.Core/Frontend/FrontendPathLiteralRefs.cs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"b11af5726e8091c22c45098427c34d0925ea51a8a44df6a06a2d6eb8beeb9016"}},{"ruleId":"D1","level":"warning","message":{"text":"ChangeCouplingAnalyzer.HasExplicitDependency (cyclomatic 53): ChangeCouplingAnalyzer.HasExplicitDependency has cyclomatic complexity 53 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.GitMining/ChangeCouplingAnalyzer.cs"},"region":{"startLine":3346}}}],"partialFingerprints":{"codehealthFindingId/v1":"20e8946bf292cb22ca3bc3ffb71be02a3ca589ab97afd127d7b8690ab0689ab9"}},{"ruleId":"D1","level":"warning","message":{"text":"check.main (cyclomatic 53): check.main has cyclomatic complexity 53 (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":"engine/sidecars/python-frontend/selftest/check.py"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"42372cfda58922de314a56604e680df43fc48425b72f21dde0a6a23e296c60fd"}},{"ruleId":"D1","level":"warning","message":{"text":"MemberFamilyRollup.Collapse (cyclomatic 52): MemberFamilyRollup.Collapse has cyclomatic complexity 52 (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":"engine/src/CodeHealth.Core/CodeShape/MemberFamilyRollup.cs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"af0e716339cd6c93c487b51eee4c4157649f3d1545b7c24acf1fe0e5980ed65c"}},{"ruleId":"D1","level":"warning","message":{"text":"CouplingAnalyzer.RunAsync (cyclomatic 52): CouplingAnalyzer.RunAsync has cyclomatic complexity 52 (threshold 15). Of this number, 40 points are the body\u0027s own statements and 12 belong to 7 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":"engine/src/CodeHealth.Dimensions.Architecture/CouplingAnalyzer.cs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"3416d3ef1c4c8ed48f371b7c19c75ae3d8a5474fb6044e660601ca6d81562e4f"}},{"ruleId":"D1","level":"warning","message":{"text":"TestReliabilityAnalyzer.RunAsync (cyclomatic 52): TestReliabilityAnalyzer.RunAsync has cyclomatic complexity 52 (threshold 15). Of this number, 51 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Testing/TestReliabilityAnalyzer.cs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"f68ee9b78d7afc207bdeb79baae9109a02ead73a4082ee84fd17e273796233fe"}},{"ruleId":"D1","level":"warning","message":{"text":"fallback-judge.cmd_score (cyclomatic 51): fallback-judge.cmd_score has cyclomatic complexity 51 (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":"tools/train/fallback-judge.py"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"d196314e33dc4f42656699c8c95c7fc36cdd01d8082cf87003a9e54b09227360"}},{"ruleId":"D1","level":"warning","message":{"text":"FrontendDeadCode.CountStandaloneReferences (cyclomatic 50): FrontendDeadCode.CountStandaloneReferences has cyclomatic complexity 50 (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":"engine/src/CodeHealth.Core/Frontend/FrontendDeadCode.cs"},"region":{"startLine":1736}}}],"partialFingerprints":{"codehealthFindingId/v1":"a27f1f1aaa8988b03457d4357dd0a3cc7994d658bc3355d730ff409af818960a"}},{"ruleId":"D1","level":"warning","message":{"text":"ProductionReadinessAnalyzer.ReleaseHygiene (cyclomatic 50): ProductionReadinessAnalyzer.ReleaseHygiene has cyclomatic complexity 50 (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":"engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs"},"region":{"startLine":2546}}}],"partialFingerprints":{"codehealthFindingId/v1":"759dce5ab15a9abc77689574e08fa6c8bdd527d13df6b964676cf9c252b5dda5"}},{"ruleId":"D1","level":"warning","message":{"text":"FSharpSyntaxModel.build (cyclomatic 49): FSharpSyntaxModel.build has cyclomatic complexity 49 (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":"engine/src/CodeHealth.CodeModel.FSharp/SyntaxModel.fs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3f4ce0e6118d1b19caf309d12eab9c1f361adbc6eab66961e7f6be1144a9b9e"}},{"ruleId":"D1","level":"warning","message":{"text":"agg_combined4.main (cyclomatic 49): agg_combined4.main has cyclomatic complexity 49 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/multilang/agg_combined4.py"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"49ba8f4771f969fe119ae55a5b90ac7fe7b84f073e4b74c5a3888632f11cfe29"}},{"ruleId":"D1","level":"warning","message":{"text":"agg_combined5.main (cyclomatic 49): agg_combined5.main has cyclomatic complexity 49 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/multilang/agg_combined5.py"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3edff162aeedaca873df669e4423e2afad24ff062a6b8f67985490fe9103804"}},{"ruleId":"D1","level":"warning","message":{"text":"agg_combined6.main (cyclomatic 49): agg_combined6.main has cyclomatic complexity 49 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/multilang/agg_combined6.py"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"57a43907ad4e439bb31ded223960637cf0f6d554e7f5eebecec15ee22aca2f3c"}},{"ruleId":"D1","level":"warning","message":{"text":"ExplicitDebtAnalyzer.RunAsync (cyclomatic 48): ExplicitDebtAnalyzer.RunAsync has cyclomatic complexity 48 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 20 belong to 17 function literals inside it that branch. To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.ExplicitDebt/ExplicitDebtAnalyzer.cs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3b400acf42c4048808be2c40ad2e0446c26aa1c119ffb0fce8679e8e79ba49d"}},{"ruleId":"D1","level":"warning","message":{"text":"model-sweep.main (cyclomatic 48): model-sweep.main has cyclomatic complexity 48 (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":"tools/train/model-sweep.py"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a6c604677988c9973e3e3e89515775d578600d17ccfa56d55cfc0a77101547a"}},{"ruleId":"D1","level":"warning","message":{"text":"SourceClassifier.ScanStringState (cyclomatic 47): SourceClassifier.ScanStringState has cyclomatic complexity 47 (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":"engine/src/CodeHealth.Core/Classification/SourceClassifier.cs"},"region":{"startLine":1489}}}],"partialFingerprints":{"codehealthFindingId/v1":"12b29d99bbf8832f18845f9282b59de9df40eaa7fd3bad351d04fd01b7d8b4a7"}},{"ruleId":"D1","level":"warning","message":{"text":"FrontendDeadCode.FindUnusedExports (cyclomatic 47): FrontendDeadCode.FindUnusedExports has cyclomatic complexity 47 (threshold 15). Of this number, 45 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":"engine/src/CodeHealth.Core/Frontend/FrontendDeadCode.cs"},"region":{"startLine":1254}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a58cfe946d50647b46b4383ab37cd5cfe4f30a19c114b29086c10d63544812f"}},{"ruleId":"D1","level":"warning","message":{"text":"IncompletenessAnalyzer.Classify (cyclomatic 47): IncompletenessAnalyzer.Classify has cyclomatic complexity 47 (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":"engine/src/CodeHealth.Core/ModelAware/IncompletenessAnalyzer.cs"},"region":{"startLine":989}}}],"partialFingerprints":{"codehealthFindingId/v1":"717db6b9ec44df90fbd771ea3c4f64e432e9d81713cda5b199234dd5adafdf9f"}},{"ruleId":"D1","level":"warning","message":{"text":"ChangeCouplingAnalyzer.ImportedModulesOf (cyclomatic 47): ChangeCouplingAnalyzer.ImportedModulesOf has cyclomatic complexity 47 (threshold 15). 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":"engine/src/CodeHealth.Dimensions.GitMining/ChangeCouplingAnalyzer.cs"},"region":{"startLine":4851}}}],"partialFingerprints":{"codehealthFindingId/v1":"3210cdc81f28a2ecec2270eddacd4f99add57f6e218865639ce131a254618a84"}},{"ruleId":"D1","level":"warning","message":{"text":"Tokenizer.tokenize (cyclomatic 47): Tokenizer.tokenize has cyclomatic complexity 47 (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":"engine/sidecars/scala-frontend/src/main/scala/dev/canine/codehealth/scala/Tokenizer.scala"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6db2181933fa3e8d9a9e28edc566a63fb3551a375966d773d4068fd15ca8069"}},{"ruleId":"D1","level":"warning","message":{"text":"MaturityAnalyzer.ArchitectureDocs (cyclomatic 46): MaturityAnalyzer.ArchitectureDocs has cyclomatic complexity 46 (threshold 15). Of this number, 30 points are the body\u0027s own statements and 16 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":"engine/src/CodeHealth.Core/Maturity/MaturityAnalyzer.cs"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fe77cbc972aab32577ca39be4a7c5ac5f645ae357be8580611249e18a099f78"}},{"ruleId":"D1","level":"warning","message":{"text":"AccessibilityAnalyzer.TextAlternatives (cyclomatic 46): AccessibilityAnalyzer.TextAlternatives has cyclomatic complexity 46 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs"},"region":{"startLine":959}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcb9727f831618c4e30e55954903a8f0f4cb730302e51eaf41e2c2b34a1953d0"}},{"ruleId":"D1","level":"warning","message":{"text":"ScanParsers.DependencyDetail (cyclomatic 46): ScanParsers.DependencyDetail has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/ScanParsers.cs"},"region":{"startLine":2102}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc044a10e856e598daa6f9c4bb5c8fad43461f7e5ba4821ba03d8dda375196af"}},{"ruleId":"D1","level":"warning","message":{"text":"agg_combined3.main (cyclomatic 46): agg_combined3.main has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/multilang/agg_combined3.py"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"e495080e828022416cd78a693f53aef95d5375f787f5ea3954b91055639a46ca"}},{"ruleId":"D1","level":"warning","message":{"text":"memberEmitters (cyclomatic 46): memberEmitters has cyclomatic complexity 46 (threshold 15). Most of this is not in the body itself: 1 of the 46 points is its own statement and the rest belongs to 11 function items inside it that branch (typeRefOfNode, emitAccessor, emitMember, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/tsjs-frontend/extract-file.mjs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8559b516ec190bfcc93235946f1631858b8e65045cb9b0d47d5012ab79e9149"}},{"ruleId":"D1","level":"warning","message":{"text":"EntryPointCatalog.DetectApplication (cyclomatic 45): EntryPointCatalog.DetectApplication has cyclomatic complexity 45 (threshold 15). 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":"engine/src/CodeHealth.Core/Frontend/EntryPointCatalog.cs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5153c2970460499c35b12af7c9bd0254ee425bac8d1d93c6341be11efe1a5fd"}},{"ruleId":"D1","level":"warning","message":{"text":"JsDuplicationDetector.BestEditedCopy (cyclomatic 45): JsDuplicationDetector.BestEditedCopy has cyclomatic complexity 45 (threshold 15). Of this number, 44 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs"},"region":{"startLine":5457}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d627dad8a668b8cd0367168fc349c0db720c125e29f11c11ba89f83991fbaf"}},{"ruleId":"D1","level":"warning","message":{"text":"RustTestCensus.Strip (cyclomatic 45): RustTestCensus.Strip has cyclomatic complexity 45 (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":"engine/src/CodeHealth.Core/Testing/RustTestCensus.cs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"305129e013bf1cde6944e2c4c7cca98aaaaa65dfed25773eb6ec3b613912a328"}},{"ruleId":"D1","level":"warning","message":{"text":"Check.run (cyclomatic 45): Check.run has cyclomatic complexity 45 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/elixir-frontend/selftest/check.exs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4f9126623fb993ca730147d8a72a808a517b9817ff253efcf609fd41d689615"}},{"ruleId":"D1","level":"warning","message":{"text":"RoslynTestQualityCollector.AnalyzeRoot (cyclomatic 44): RoslynTestQualityCollector.AnalyzeRoot has cyclomatic complexity 44 (threshold 15). Of this number, 42 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":"engine/src/CodeHealth.Core/Testing/RoslynTestQualityCollector.cs"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8ffa6f21d2d92e7623380fd569c01063a049d9ab5dc39c9267524bea862a122"}},{"ruleId":"D1","level":"warning","message":{"text":"TestDistributionAnalyzer.RunAsync (cyclomatic 44): TestDistributionAnalyzer.RunAsync has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Testing/TestDistributionAnalyzer.cs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"58a1371848bb94409532cebb66cad9f4bcfab7284aea23db46b22a7ef0334e77"}},{"ruleId":"D1","level":"warning","message":{"text":"MaturityAnalyzer.Documentation (cyclomatic 43): MaturityAnalyzer.Documentation has cyclomatic complexity 43 (threshold 15). Of this number, 39 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":"engine/src/CodeHealth.Core/Maturity/MaturityAnalyzer.cs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cf63dd3f3e23b8dafa5c6fc18b76d3ca8fc5230acae12dceae7244711d6d5a9"}},{"ruleId":"D1","level":"warning","message":{"text":"KnowledgeConcentrationAnalyzer.RunAsync (cyclomatic 43): KnowledgeConcentrationAnalyzer.RunAsync has cyclomatic complexity 43 (threshold 15). Of this number, 40 points are the body\u0027s own statements and 3 belong to 3 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.GitMining/KnowledgeConcentrationAnalyzer.cs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1958540469b3fe82deb352dfc6411f9fe6489bb97ef87d938bd3f4bf3866c07"}},{"ruleId":"D1","level":"warning","message":{"text":"Tokenizer.tokenize (cyclomatic 43): Tokenizer.tokenize has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/kotlin-frontend/src/main/kotlin/dev/canine/codehealth/kotlin/Tokenizer.kt"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"d878856178654cf602689df956e1e45c229692752e2e9098e81ff723c2aed4e5"}},{"ruleId":"D1","level":"warning","message":{"text":"ComplianceSecurityAnalyzer.AnalyzeAsync (cyclomatic 42): ComplianceSecurityAnalyzer.AnalyzeAsync has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6a1379f80449bf77019b031cabf41850dc9b84526b182e73c9efbd918861164"}},{"ruleId":"D1","level":"warning","message":{"text":"ComplianceSecurityAnalyzer.ScanSubstring (cyclomatic 42): ComplianceSecurityAnalyzer.ScanSubstring has cyclomatic complexity 42 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"cecf9fe0cc85090be6da1bcae1c1afc27feea3bf9d5b4fd9ef44a2b1d5154b7b"}},{"ruleId":"D1","level":"warning","message":{"text":"FrontendAnalyzer.Analyze (cyclomatic 42): FrontendAnalyzer.Analyze has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Discovery/FrontendAnalyzer.cs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"845cc163005d3742a375d54f70bef14329e79b450c4a11d1b4def7c32df94f6c"}},{"ruleId":"D1","level":"warning","message":{"text":"AttributeConsumptionScanner.CollectAsync (cyclomatic 42): AttributeConsumptionScanner.CollectAsync has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ExplicitDebt/AttributeConsumptionScanner.cs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f8e8ef16be37759376be70d49db0752ceb2db41c181c537ac5b7b7b69615471"}},{"ruleId":"D1","level":"warning","message":{"text":"ArchitectureModelAnalyzer.SliceCohesion (cyclomatic 42): ArchitectureModelAnalyzer.SliceCohesion has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/ArchitectureModelAnalyzer.cs"},"region":{"startLine":2008}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0e0d97a4b10d20ece4d8e72a5f65146f59fb1311ae3994845bb1f4185a1e09b"}},{"ruleId":"D1","level":"warning","message":{"text":"RepoProfiler.DetectEventSourcing (cyclomatic 42): RepoProfiler.DetectEventSourcing has cyclomatic complexity 42 (threshold 15). Of this number, 38 points are the body\u0027s own statements and 4 belong to 3 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/RepoProfiler.cs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba21ebe5d7090a109faaa757b2f5597491807502e821e9944569b4e770c47416"}},{"ruleId":"D1","level":"warning","message":{"text":"ProductionReadinessAnalyzer.Cicd (cyclomatic 42): ProductionReadinessAnalyzer.Cicd has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: ProductionReadinessAnalyzer.HasDedicatedSastSignal (cyclomatic 48) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs"},"region":{"startLine":3435}}}],"partialFingerprints":{"codehealthFindingId/v1":"094c2e82f9b9ab32872f3ae606b30226a3bf5d186c255f4431b80054c8c6fb22"}},{"ruleId":"D1","level":"warning","message":{"text":"Tokenizer.tokenize (cyclomatic 42): Tokenizer.tokenize has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/java-spoon/src/main/java/dev/canine/codehealth/java/Tokenizer.java"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"b46a36024d46908c5474fb2dc26978b3041fa12c0439a8057c308c4e6c047d1b"}},{"ruleId":"D1","level":"warning","message":{"text":"judge-calibration.cmd_judge (cyclomatic 42): judge-calibration.cmd_judge has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/judge-calibration.py"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"6264a15095bd45620fd7ae1f76bf0cb0757973c8ae982926103dfe479f35a18f"}},{"ruleId":"D1","level":"warning","message":{"text":"ComplianceSecurityAnalyzer.ScanCryptoStreamModeContradiction (cyclomatic 41): ComplianceSecurityAnalyzer.ScanCryptoStreamModeContradiction has cyclomatic complexity 41 (threshold 15). Of this number, 40 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs"},"region":{"startLine":2622}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa823ca6fdc1c43bf8a3c4d0776a80cae45bf67dbd7a7aa0a35ef3a21b986ced"}},{"ruleId":"D1","level":"warning","message":{"text":"OperabilityExtrasAnalyzer.AnalyzeAsync (cyclomatic 40): OperabilityExtrasAnalyzer.AnalyzeAsync has cyclomatic complexity 40 (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":"engine/src/CodeHealth.Core/ModelAware/OperabilityExtrasAnalyzer.cs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf2d9ee97b8641de73c4593bd8fed35c5b63d30858ee77d4cc4a9dbf95212096"}},{"ruleId":"D1","level":"warning","message":{"text":"CloneSpanShape.Of (cyclomatic 40): CloneSpanShape.Of has cyclomatic complexity 40 (threshold 15). Of this number, 37 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.CodeQuality/CodeShape/DuplicationAnalyzer.cs"},"region":{"startLine":4123}}}],"partialFingerprints":{"codehealthFindingId/v1":"006be63dbdcbd9e5d7cd8f5e0d5658ac2ae4f29555e337f3a77db3b3daf3bab1"}},{"ruleId":"D1","level":"warning","message":{"text":"ChangeCouplingAnalyzer.BuildCoupledPairs (cyclomatic 40): ChangeCouplingAnalyzer.BuildCoupledPairs has cyclomatic complexity 40 (threshold 15). Of this number, 39 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, 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":"engine/src/CodeHealth.Dimensions.GitMining/ChangeCouplingAnalyzer.cs"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"17f8f7d85773aec30a1166a9c94b2c27816d622e70686c61ac1c047b662e394e"}},{"ruleId":"D1","level":"warning","message":{"text":"FrontendDependencyHygiene.CollectUnlisted (cyclomatic 39): FrontendDependencyHygiene.CollectUnlisted has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/FrontendDependencyHygiene.cs"},"region":{"startLine":2010}}}],"partialFingerprints":{"codehealthFindingId/v1":"63569a90b77959a2ab1ea48d8d5fd907fc08b4f68fdbb9f630a42df9eca9f40d"}},{"ruleId":"D1","level":"warning","message":{"text":"JsScopeBindings.Build (cyclomatic 39): JsScopeBindings.Build has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/JsScopeBindings.cs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad1cf92aacfb73d70d3adb22aa926d5f60335b727b2195c0112f7f308166a89e"}},{"ruleId":"D1","level":"warning","message":{"text":"ModuleSyntaxScanner.ScanExportDeclaration (cyclomatic 39): ModuleSyntaxScanner.ScanExportDeclaration has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/ModuleSyntaxScanner.cs"},"region":{"startLine":956}}}],"partialFingerprints":{"codehealthFindingId/v1":"6884fa8b84910ab7815a43ce42bb941141496e5cc4318ba5ef676a1c1f8dc0f4"}},{"ruleId":"D1","level":"warning","message":{"text":"DomainModelAnalyzer.MutableEntities (cyclomatic 39): DomainModelAnalyzer.MutableEntities has cyclomatic complexity 39 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 11 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":"engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs"},"region":{"startLine":3324}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf9ed3d82246970072d767fb5f42d161a03e050b7a1a7c1183a719a3a84336c2"}},{"ruleId":"D1","level":"warning","message":{"text":"NodeTestReliabilityCollector.CollectAsync (cyclomatic 39): NodeTestReliabilityCollector.CollectAsync has cyclomatic complexity 39 (threshold 15). Of this number, 35 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":"engine/src/CodeHealth.Core/Testing/NodeTestReliabilityCollector.cs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"60e07fc117363d139a877fd7b1157002a92d8c7d28f0fd5eb1a150973f6f95da"}},{"ruleId":"D1","level":"warning","message":{"text":"ChangeCouplingAnalyzer.RunAsync (cyclomatic 39): ChangeCouplingAnalyzer.RunAsync has cyclomatic complexity 39 (threshold 15). Of this number, 30 points are the body\u0027s own statements and 9 belong to 9 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":"engine/src/CodeHealth.Dimensions.GitMining/ChangeCouplingAnalyzer.cs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"451bfef6263e6b33bf131f80edca585694425e3f8985695f62fb1395eab3a944"}},{"ruleId":"D1","level":"warning","message":{"text":"KnowledgeFreshnessAnalyzer.RunAsync (cyclomatic 39): KnowledgeFreshnessAnalyzer.RunAsync has cyclomatic complexity 39 (threshold 15). Of this number, 38 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, 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":"engine/src/CodeHealth.Dimensions.GitMining/KnowledgeFreshnessAnalyzer.cs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"db853183daebbba72a5eb0bbb324474fae95eee665114e3a2d23f1cc810f56c7"}},{"ruleId":"D1","level":"warning","message":{"text":"IndentedMarkupProducer.TryParseTag (cyclomatic 38): IndentedMarkupProducer.TryParseTag has cyclomatic complexity 38 (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":"engine/src/CodeHealth.Core/Markup/IndentedMarkupProducer.cs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5b1afc6c9c675a0ad7d8231cfcdcfed709bfc6c4b66416b6b360017308b3d2e"}},{"ruleId":"D1","level":"warning","message":{"text":"MarkupParser.Build (cyclomatic 38): MarkupParser.Build has cyclomatic complexity 38 (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":"engine/src/CodeHealth.Core/Markup/MarkupParser.cs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5bed18fd1500cd043357ddf3cc23bc2db3c3f75cd141a212ec2f59717371fa7"}},{"ruleId":"D1","level":"warning","message":{"text":"MaturityAnalyzer.DeclaredWorkspaceMembers (cyclomatic 38): MaturityAnalyzer.DeclaredWorkspaceMembers has cyclomatic complexity 38 (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":"engine/src/CodeHealth.Core/Maturity/MaturityAnalyzer.cs"},"region":{"startLine":1475}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcf759dae677fb57ac12f1c113a1d565951217b7f50e2a3d194b326812ebb736"}},{"ruleId":"D1","level":"warning","message":{"text":"EventDrivenAnalyzer.OutboxDualWrite (cyclomatic 38): EventDrivenAnalyzer.OutboxDualWrite has cyclomatic complexity 38 (threshold 15). Of this number, 29 points are the body\u0027s own statements and 9 belong to 4 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"2312574114049fd958d00c26bc237a5ce587f5ced0f58fd27d74f573d28ae09b"}},{"ruleId":"D1","level":"warning","message":{"text":"JvmSidecar.RunAsync (cyclomatic 38): JvmSidecar.RunAsync has cyclomatic complexity 38 (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":"engine/src/CodeHealth.Cli/Commands/JvmSidecar.cs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cd1c648dde0f9cec6e1e956716a1576b1cd8807214870470db0b856d415222a"}},{"ruleId":"D1","level":"warning","message":{"text":"callsOf (cyclomatic 38): callsOf has cyclomatic complexity 38 (threshold 15). Most of this is not in the body itself: 3 of the 38 points are its own statements and the rest belongs to 7 function items inside it that branch (ownerFqnOf, declOf, record, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/tsjs-frontend/ts-helpers.mjs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"c418874d56bf720d0c417255e90add8ea657712cee7d13708ac12b9f8d12a3d9"}},{"ruleId":"D1","level":"warning","message":{"text":"collectModuleUnits (cyclomatic 38): collectModuleUnits has cyclomatic complexity 38 (threshold 15). Most of this is not in the body itself: 8 of the 38 points are its own statements and the rest belongs to 8 function items inside it that branch (insideTypeCarrier, unwrapCall, carriedByLogical, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/tsjs-frontend/extract-file.mjs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb1762dbe279d4fc93ff17ef2b049bd11b48f3e98c7cfe1eb7ae94067fa1e4c3"}},{"ruleId":"D1","level":"warning","message":{"text":"AccessibilityAnalyzer.Analyze (cyclomatic 37): AccessibilityAnalyzer.Analyze has cyclomatic complexity 37 (threshold 15). Of this number, 35 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2ba4dca6a418601fb297e31ae575afbafe0ce7c74130367aac77f08ba2a005c"}},{"ruleId":"D1","level":"warning","message":{"text":"AccessibilityAnalyzer.AriaCorrectness (cyclomatic 37): AccessibilityAnalyzer.AriaCorrectness has cyclomatic complexity 37 (threshold 15). Of this number, 32 points are the body\u0027s own statements and 5 belong to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs"},"region":{"startLine":4055}}}],"partialFingerprints":{"codehealthFindingId/v1":"26a19e5bed8ee1fedb877b306691923d6a986791df710bc16435a98750d0ab81"}},{"ruleId":"D1","level":"warning","message":{"text":"SecretNoiseFilter.IsNoisyPath (cyclomatic 37): SecretNoiseFilter.IsNoisyPath has cyclomatic complexity 37 (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":"engine/src/CodeHealth.Dimensions.Security/Scanners/SecretNoiseFilter.cs"},"region":{"startLine":3867}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b38cd70642aee1b23cf6d7c8cc664f07f0b6fabc7b6079b51dfd5db3ea5cc6b"}},{"ruleId":"D1","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.SigningAdvice (cyclomatic 37): SupplyChainProvenanceAnalyzer.SigningAdvice has cyclomatic complexity 37 (threshold 15). Of this number, 36 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":3448}}}],"partialFingerprints":{"codehealthFindingId/v1":"826c43115d2deed8063e8d8d7c62c00c657e8ec1d7cd0b1464b5477b4ba854ba"}},{"ruleId":"D1","level":"warning","message":{"text":"bakeoff.run_model (cyclomatic 37): bakeoff.run_model has cyclomatic complexity 37 (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":"tools/llm-bakeoff/bakeoff.py"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e8060795b7b18d5893ead0d2f0076d7f8496ca2584a6417f3d091675fb48fc4"}},{"ruleId":"D1","level":"warning","message":{"text":"LineBasedGodClassDetector.DetectAsync (cyclomatic 36): LineBasedGodClassDetector.DetectAsync has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/CodeShape/LineBasedGodClassDetector.cs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"e529895bf82a3c4a1983bf931e9f23d7ebbbb53c067d1b2410a589916cdc69ad"}},{"ruleId":"D1","level":"warning","message":{"text":"ComplianceSecurityAnalyzer.ScanSyntax (cyclomatic 36): ComplianceSecurityAnalyzer.ScanSyntax has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs"},"region":{"startLine":1164}}}],"partialFingerprints":{"codehealthFindingId/v1":"923ecfabbd874e4e9a087883d0365fb919ae7912fd7957b8c246c3d7cb12cc41"}},{"ruleId":"D1","level":"warning","message":{"text":"FrontendEngine.ModelGeneratedModules (cyclomatic 36): FrontendEngine.ModelGeneratedModules has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/FrontendEngine.cs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"53ba2c4d8330356601e90f3269e41d8d58db4a8b5630c7626d797cf80576e15c"}},{"ruleId":"D1","level":"warning","message":{"text":"FrontendModuleGraph.Build (cyclomatic 36): FrontendModuleGraph.Build has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/FrontendModuleGraph.cs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8b8dd821c2fdafac31ac8e2331b159abce35881316458796a2f28498040307d"}},{"ruleId":"D1","level":"warning","message":{"text":"ArchitectureModelAnalyzer.SliceCohesion (cyclomatic 36): ArchitectureModelAnalyzer.SliceCohesion has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/ArchitectureModelAnalyzer.cs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"809d74cce67c29d99fac53c3d7b87f1fb3453a088c93d29c0c04ff0ae15155a7"}},{"ruleId":"D1","level":"warning","message":{"text":"DomainConventions.ClassifyHandler (cyclomatic 36): DomainConventions.ClassifyHandler has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/DomainConventions.cs"},"region":{"startLine":1634}}}],"partialFingerprints":{"codehealthFindingId/v1":"708f2b36baa99fa222d00dbe4a7e546bf68bb09f20dbbe191dfe4219e84187cd"}},{"ruleId":"D1","level":"warning","message":{"text":"BodyFacts.node (cyclomatic 36): BodyFacts.node has cyclomatic complexity 36 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/php-frontend/body.php"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b92c340645e61e6baa2b87f149f21489f4d56fe6951f6bd049ff2aadd326045"}},{"ruleId":"D1","level":"warning","message":{"text":"extractFile (cyclomatic 36): extractFile has cyclomatic complexity 36 (threshold 15). Most of this is not in the body itself: 7 of the 36 points are its own statements and the rest belongs to 8 function items inside it that branch (visitOrmCall, visit, visitTypeAlias, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/tsjs-frontend/extract-file.mjs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc9839cbec678be12ee34c4b48bbb5744c5f203af86c6fcef6bdf95fdb884ba5"}},{"ruleId":"D1","level":"warning","message":{"text":"NeutralFileLengthScanner.CountBraces (cyclomatic 35): NeutralFileLengthScanner.CountBraces has cyclomatic complexity 35 (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":"engine/src/CodeHealth.Core/CodeShape/NeutralFileLengthScanner.cs"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"8366e80640b08fdb119448a6d796a27092ec38837b6554b23d09f0620dd7adc9"}},{"ruleId":"D1","level":"warning","message":{"text":"JsFunctionScanner.ScanMember (cyclomatic 35): JsFunctionScanner.ScanMember has cyclomatic complexity 35 (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":"engine/src/CodeHealth.Core/Frontend/JsFunctionScanner.cs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"67fed57f385ca9a3dda1eb599a73f5dfbc7ddbd4cb3a629adc5e4f354773ca78"}},{"ruleId":"D1","level":"warning","message":{"text":"ModuleSyntaxScanner.ScanImportStatement (cyclomatic 35): ModuleSyntaxScanner.ScanImportStatement has cyclomatic complexity 35 (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":"engine/src/CodeHealth.Core/Frontend/ModuleSyntaxScanner.cs"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"f60fe8a7cbb3bb523453f943dd27ddc27405f70610ac755913a6620b0f0ee46d"}},{"ruleId":"D1","level":"warning","message":{"text":"CSharpTokenizer.TokenizeLine (cyclomatic 35): CSharpTokenizer.TokenizeLine has cyclomatic complexity 35 (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":"engine/src/CodeHealth.Dimensions.Security/Scanners/SqlBuilderCompositionWalk.cs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"16d3873796c54e04d88702f4e50bc0dd03edf02e45f28d657c664fe3c2425612"}},{"ruleId":"D1","level":"warning","message":{"text":"scope-evidence.evidence_for (cyclomatic 35): scope-evidence.evidence_for has cyclomatic complexity 35 (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":"tools/train/scope-evidence.py"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"e577765b6ffe432b90efa25c5795345320ae59a9cf63edc8719fbc90e6274721"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 35): (anonymous) has cyclomatic complexity 35 (threshold 15). Most of this is not in the body itself: 3 of the 35 points are its own statements and the rest belongs to 17 function items inside it that branch (wire::load, renderMd, wire, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Kennel.Ui/wwwroot/kennel-ui.js"},"region":{"startLine":1600}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3ba2b6736d20ee865bfae1cef2a0534ab84f7bf3d8b61a2e94085d0f13478a7"}},{"ruleId":"D1","level":"warning","message":{"text":"ContainerDetector.HostKind (cyclomatic 34): ContainerDetector.HostKind has cyclomatic complexity 34 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Architecture/ContainerDetector.cs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bf610c68bb250093d1e8e66afc1671167cc2311fbdc50a0418d094c335fc370"}},{"ruleId":"D1","level":"warning","message":{"text":"RustInlineTestModule.BlankLiteralsAndComments (cyclomatic 34): RustInlineTestModule.BlankLiteralsAndComments has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Classification/RustInlineTestModule.cs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3d979ae8b32080a02e70ab35e5afbf7ea6d89ef4e338abc5e81ffc9f8842d2a"}},{"ruleId":"D1","level":"warning","message":{"text":"ComplianceSecurityAnalyzer.ResolveConstantKeyRoot (cyclomatic 34): ComplianceSecurityAnalyzer.ResolveConstantKeyRoot has cyclomatic complexity 34 (threshold 15). Of this number, 33 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs"},"region":{"startLine":3310}}}],"partialFingerprints":{"codehealthFindingId/v1":"21125bb6c9a5f77ee4d8c7f038ae34e6b1c4db036b5304bca88a1503d34638aa"}},{"ruleId":"D1","level":"warning","message":{"text":"ComplianceSecurityAnalyzer.C2 (cyclomatic 34): ComplianceSecurityAnalyzer.C2 has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs"},"region":{"startLine":5123}}}],"partialFingerprints":{"codehealthFindingId/v1":"cacc741721e2552461debae2103ee60086d64e0bf0784d03ac6f3b55181b25ee"}},{"ruleId":"D1","level":"warning","message":{"text":"FrontendDependencyHygiene.CandidateBinNames (cyclomatic 34): FrontendDependencyHygiene.CandidateBinNames has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/FrontendDependencyHygiene.cs"},"region":{"startLine":1541}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eabc5e0bc9d31d576c17ef7a1f116269a7b044a49889fbda07cf9636db2f4d3"}},{"ruleId":"D1","level":"warning","message":{"text":"FrontendTestSuiteMasking.CollectFromBenchmarkTree (cyclomatic 34): FrontendTestSuiteMasking.CollectFromBenchmarkTree has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/FrontendTestSuiteMasking.cs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"84f60a401a134f9561e498d3b34b9bdc6c398629a8c46aea6cadf971c53fec77"}},{"ruleId":"D1","level":"warning","message":{"text":"IndentedMarkupProducer.ParseAttributes (cyclomatic 34): IndentedMarkupProducer.ParseAttributes has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Markup/IndentedMarkupProducer.cs"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1b962010445186d339899c514847dc93fd6c48e730f91056b0b1a9cdb85aaac"}},{"ruleId":"D1","level":"warning","message":{"text":"DomainModelAnalyzer.RepositoryPerAggregateRoot (cyclomatic 34): DomainModelAnalyzer.RepositoryPerAggregateRoot has cyclomatic complexity 34 (threshold 15). Of this number, 31 points are the body\u0027s own statements and 3 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs"},"region":{"startLine":4981}}}],"partialFingerprints":{"codehealthFindingId/v1":"26a413e95e82998ad764edd7821dc13b5257e5359f55480c0d37e502ac16adac"}},{"ruleId":"D1","level":"warning","message":{"text":"ReportViewModelFactory.DeterministicBusinessBrief (cyclomatic 34): ReportViewModelFactory.DeterministicBusinessBrief has cyclomatic complexity 34 (threshold 15). Of this number, 32 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Reporting/Templates/ReportViewModelFactory.cs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c3117caeed0b7bc30c0fd207fc430cbef0aafe457ee6562e7fc53121cc8cf3a"}},{"ruleId":"D1","level":"warning","message":{"text":"DuplicationAnalyzer.GuardRegionOf (cyclomatic 34): DuplicationAnalyzer.GuardRegionOf has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.CodeQuality/CodeShape/DuplicationAnalyzer.cs"},"region":{"startLine":2994}}}],"partialFingerprints":{"codehealthFindingId/v1":"4670fb86b3841f5e6bd523776541d3cc260bbc9b1be141048baa668f1420150c"}},{"ruleId":"D1","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.WorkflowGrantsWiderThanJobsUse (cyclomatic 34): SupplyChainProvenanceAnalyzer.WorkflowGrantsWiderThanJobsUse has cyclomatic complexity 34 (threshold 15). Of this number, 32 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":7913}}}],"partialFingerprints":{"codehealthFindingId/v1":"498c8a6efe06b16f73ca5a3c57dccf87782514930d98e46e0a26fe4d370ff096"}},{"ruleId":"D1","level":"warning","message":{"text":"ChangeCouplingAnalyzer.FactsFor (cyclomatic 34): ChangeCouplingAnalyzer.FactsFor has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.GitMining/ChangeCouplingAnalyzer.cs"},"region":{"startLine":4453}}}],"partialFingerprints":{"codehealthFindingId/v1":"3117036c870b703404c4dc7d935ce8cef16c169a2589d57963f971fbed69452e"}},{"ruleId":"D1","level":"warning","message":{"text":"judge_assignment.census_failures (cyclomatic 34): judge_assignment.census_failures has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/judge_assignment.py"},"region":{"startLine":1483}}}],"partialFingerprints":{"codehealthFindingId/v1":"630128eb0e203f76f03b96b01a31e4fe773e50e0d91a933e83357ea76b4c5f04"}},{"ruleId":"D1","level":"warning","message":{"text":"SourceClassifier.IsTestPath (cyclomatic 33): SourceClassifier.IsTestPath has cyclomatic complexity 33 (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":"engine/src/CodeHealth.Core/Classification/SourceClassifier.cs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"329cab763f4ec3401634b28321d0cdf60115ee9235f647f36397f3ef0fd4d2d2"}},{"ruleId":"D1","level":"warning","message":{"text":"JsDuplicationDetector.BuildTopLevelBindingMask (cyclomatic 33): JsDuplicationDetector.BuildTopLevelBindingMask has cyclomatic complexity 33 (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":"engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f215db276407a1d32317394732464ad243b7007d136de52d514adeedb22f1c4"}},{"ruleId":"D1","level":"warning","message":{"text":"DomainModelAnalyzer.AggregateBoundaries (cyclomatic 33): DomainModelAnalyzer.AggregateBoundaries has cyclomatic complexity 33 (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":"engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs"},"region":{"startLine":1930}}}],"partialFingerprints":{"codehealthFindingId/v1":"72e9d1c83e005080c17171b4321d541625d87149d27f550cee42f91fab27ad89"}},{"ruleId":"D1","level":"warning","message":{"text":"GdprPersonalDataAnalyzer.AnalyzeAsync (cyclomatic 33): GdprPersonalDataAnalyzer.AnalyzeAsync has cyclomatic complexity 33 (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":"engine/src/CodeHealth.Core/ModelAware/GdprPersonalDataAnalyzer.cs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebc72401b63b5461289adf195bd1afb3ca7867da30769aa377c503c225a66e8f"}},{"ruleId":"D1","level":"warning","message":{"text":"LogicDefectAnalyzer.AnalyzeAsync (cyclomatic 33): LogicDefectAnalyzer.AnalyzeAsync has cyclomatic complexity 33 (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":"engine/src/CodeHealth.Core/ModelAware/LogicDefectAnalyzer.cs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c0c8d2d9cd68741cf3eeb4127773d729ea0c94df23a8afdd70995f41b1d1023"}},{"ruleId":"D1","level":"warning","message":{"text":"ArchGraphSvg.RenderClustered (cyclomatic 33): ArchGraphSvg.RenderClustered has cyclomatic complexity 33 (threshold 15). Of this number, 30 points are the body\u0027s own statements and 3 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Reporting/Svg/ArchGraphSvg.cs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"80c75e3695f1332326cc62096c87ae61d5d83d37bdff37680512101487749908"}},{"ruleId":"D1","level":"warning","message":{"text":"JsSiblingScopeReadScan.IsRead (cyclomatic 33): JsSiblingScopeReadScan.IsRead has cyclomatic complexity 33 (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":"engine/src/CodeHealth.Dimensions.Security/Scanners/JsSiblingScopeReadScan.cs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad28ec56d8fd872c6573e469aa6997a7cef0575a8b8de4f60e4d3d90476110bc"}},{"ruleId":"D1","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.WorkflowSteps (cyclomatic 33): SupplyChainProvenanceAnalyzer.WorkflowSteps has cyclomatic complexity 33 (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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":6850}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fe525d71cc4d2988e1517ca3eccf83c749b5767ce1976c0c8f9ed3dfdf599f7"}},{"ruleId":"D1","level":"warning","message":{"text":"check.main (cyclomatic 33): check.main has cyclomatic complexity 33 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/scala-frontend/selftest/check.py"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6c369edf7be5d9d0d918b9630528fc46402ad8a45bcbefc9276940a333238fe"}},{"ruleId":"D1","level":"warning","message":{"text":"evidence-ab.main (cyclomatic 33): evidence-ab.main has cyclomatic complexity 33 (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":"tools/train/evidence-ab.py"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ee99f50c41d43055b0d466eea6e13469d797230d24dd71d16bdddb731393aca"}},{"ruleId":"D1","level":"warning","message":{"text":"gold-draw.cmd_verify (cyclomatic 33): gold-draw.cmd_verify has cyclomatic complexity 33 (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":"tools/train/gold-draw.py"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"11bc0423985b0c461cca0dd99fa859bf34af2ded5a737107494fa2fbf5652842"}},{"ruleId":"D1","level":"warning","message":{"text":"branchWalker.stmt (cyclomatic 33): branchWalker.stmt has cyclomatic complexity 33 (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":"engine/sidecars/go/bodybranch.go"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"776c6c18769343ebd7959a9d84e7765108cf7071f6d6f9357bb231995af63d6e"}},{"ruleId":"D1","level":"warning","message":{"text":"CSharpSourceScanner.Tokenize (cyclomatic 32): CSharpSourceScanner.Tokenize has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ApiSurface/CSharpSourceScanner.cs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f9b4b815e102200d39c8c6e78b4ff6fe266c138537286c88d9f3434ff97814b"}},{"ruleId":"D1","level":"warning","message":{"text":"ArchitectureMapBuilder.BuildAsync (cyclomatic 32): ArchitectureMapBuilder.BuildAsync has cyclomatic complexity 32 (threshold 15). Of this number, 31 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Architecture/ArchitectureMapBuilder.cs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bfe79186fb0cc5630d295e9148724080bb91d6c376ef9a274d920db4609fdb4"}},{"ruleId":"D1","level":"warning","message":{"text":"RoslynDeadCodeDetector.IsCandidate (cyclomatic 32): RoslynDeadCodeDetector.IsCandidate has cyclomatic complexity 32 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ExplicitDebt/RoslynDeadCodeDetector.cs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac13eecd8353daaf7205468f499feb07359ba0ba019b9092d61a50efe2e6356c"}},{"ruleId":"D1","level":"warning","message":{"text":"FrontendEngineDimensions.DeadCodeDimension (cyclomatic 32): FrontendEngineDimensions.DeadCodeDimension has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/FrontendEngineDimensions.cs"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0ce2b9eacdb6135501ee6d30c4cda6cab12e587f1f3077942ec3d006a24b800"}},{"ruleId":"D1","level":"warning","message":{"text":"JsDuplicationDetector.DetectWholesaleFileCopies (cyclomatic 32): JsDuplicationDetector.DetectWholesaleFileCopies has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs"},"region":{"startLine":5081}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6f07fcaaed196c763e1a7b423dd9ba6ba9f52477f1ea4daf086cfca472319c6"}},{"ruleId":"D1","level":"warning","message":{"text":"JsScopeBindings.FunctionBodyParams (cyclomatic 32): JsScopeBindings.FunctionBodyParams has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/JsScopeBindings.cs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cf6aafad340852b21e5035f8e5317e68e2c81dfb21de63fecb8eb46e3593473"}},{"ruleId":"D1","level":"warning","message":{"text":"AccessibilityAnalyzer.OrphanedLabels (cyclomatic 32): AccessibilityAnalyzer.OrphanedLabels has cyclomatic complexity 32 (threshold 15). 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, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs"},"region":{"startLine":2157}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fde300705a8408474b9bfbd31ebdf3d416e24ad3a19673626e6267995a6219e"}},{"ruleId":"D1","level":"warning","message":{"text":"CodebaseSize.FromProjectsAsync (cyclomatic 32): CodebaseSize.FromProjectsAsync has cyclomatic complexity 32 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Scoring/CodebaseSize.cs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"3edb10addda7cbd8bcb376233d73bda93ecb6cebc0d3320cc29e0e8b90f0d437"}},{"ruleId":"D1","level":"warning","message":{"text":"SecretsHistoryAnalyzer.CountBraceDelta (cyclomatic 32): SecretsHistoryAnalyzer.CountBraceDelta has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/SecretsHistoryAnalyzer.cs"},"region":{"startLine":1537}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ff11bcac1058fabb7d03a8c847422e5dcfccaab6fb5e9b1972e0a712170a9a0"}},{"ruleId":"D1","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.BuildIntegrityArms (cyclomatic 32): SupplyChainProvenanceAnalyzer.BuildIntegrityArms has cyclomatic complexity 32 (threshold 15). Of this number, 31 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":2265}}}],"partialFingerprints":{"codehealthFindingId/v1":"54bc6f6320b71807be6d1189ac68bac53c2c86cd2862b72f1076e9fd4c0fd258"}},{"ruleId":"D1","level":"warning","message":{"text":"render.render (cyclomatic 32): render.render has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/marketing/whitepapers/render.py"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d880728f32cdd97961d6e760ff73f6abc4aba9e1b92d1190b4d0b734c558af4"}},{"ruleId":"D1","level":"warning","message":{"text":"agg_scala_dm6.main (cyclomatic 32): agg_scala_dm6.main has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/multilang/agg_scala_dm6.py"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4465224f1eb5fa4a6f640443e0cf3d0910129d35e61f4b6a42220732c754908"}},{"ruleId":"D1","level":"warning","message":{"text":"EntryPointCatalog.DetectTests (cyclomatic 31): EntryPointCatalog.DetectTests has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/EntryPointCatalog.cs"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"bef26fa006286102017bfba7b988496d146d5a781558945ee1af930ba68ce37f"}},{"ruleId":"D1","level":"warning","message":{"text":"FrontendEngineDimensions.CloneRemediation (cyclomatic 31): FrontendEngineDimensions.CloneRemediation has cyclomatic complexity 31 (threshold 15). Of this number, 29 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, 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":"engine/src/CodeHealth.Core/Frontend/FrontendEngineDimensions.cs"},"region":{"startLine":1477}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bfdac4f54d920982d0ec5035c4a78b533a8c6141abe5d89df590878f204d066"}},{"ruleId":"D1","level":"warning","message":{"text":"DomainConventions.ClassifyHandler (cyclomatic 31): DomainConventions.ClassifyHandler has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/DomainConventions.cs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"217543e4a641ea4ab805a989b2cfda942d57dfa1c5dbfc94f0d485d178db9f31"}},{"ruleId":"D1","level":"warning","message":{"text":"GoTestCensus.Strip (cyclomatic 31): GoTestCensus.Strip has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Testing/GoTestCensus.cs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c96ef9b2774baf9bfe5b7704fa8e0c43ac9925abf99e591aca0233b102e1ba8"}},{"ruleId":"D1","level":"warning","message":{"text":"ExplicitDebtAnalyzer.ToFinding (cyclomatic 31): ExplicitDebtAnalyzer.ToFinding has cyclomatic complexity 31 (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":"engine/src/CodeHealth.Dimensions.ExplicitDebt/ExplicitDebtAnalyzer.cs"},"region":{"startLine":1039}}}],"partialFingerprints":{"codehealthFindingId/v1":"b41910597c7e65de4647027cc4a009e508e2a9d251c3acc2551f2eb3e4a6258c"}},{"ruleId":"D1","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.AdvisoryMonitoringFor (cyclomatic 31): SupplyChainProvenanceAnalyzer.AdvisoryMonitoringFor has cyclomatic complexity 31 (threshold 15). Of this number, 30 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":10185}}}],"partialFingerprints":{"codehealthFindingId/v1":"2523537f27607292c70eaeeb06fcb1ebe0f25c191b993d4ab0df5cd31b8f6776"}},{"ruleId":"D1","level":"warning","message":{"text":"RepoFindings.razor \u203A HideRuleAsync (cyclomatic 31): RepoFindings.razor \u203A HideRuleAsync has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Kennel.Watchdog.Core/Agents/Ui/RepoFindings.razor"},"region":{"startLine":1267}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e0c8ad232c564a06723bfdae8be2cbcab6d4056612528b5772ab2017a484806"}},{"ruleId":"D1","level":"warning","message":{"text":"agg_go.main (cyclomatic 31): agg_go.main has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/multilang/agg_go.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"f42c18a273554a8645f3d9c09013efe52c4c565c9001eac850ed4fd23c9c311e"}},{"ruleId":"D1","level":"warning","message":{"text":"ChainedCorrespondence.Aggregate (cyclomatic 30): ChainedCorrespondence.Aggregate has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/CodeShape/ChainedCorrespondence.cs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"acb14c3e29de3c87cb6cc1433fb07d251bf1053d52b0fe38590dcb7558d62cfb"}},{"ruleId":"D1","level":"warning","message":{"text":"FrontendTestReachability.IsRegistrationDataModule (cyclomatic 30): FrontendTestReachability.IsRegistrationDataModule has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/FrontendTestReachability.cs"},"region":{"startLine":1492}}}],"partialFingerprints":{"codehealthFindingId/v1":"b32172e5aad44e62b352bbed81edad87b7ceb3a2af7fe6458de369155a586cea"}},{"ruleId":"D1","level":"warning","message":{"text":"FrontendTestReachability.ScanDataInitialiser (cyclomatic 30): FrontendTestReachability.ScanDataInitialiser has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/FrontendTestReachability.cs"},"region":{"startLine":1716}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ebea480083f39d1adddcd0a9b5768480696a00f9502e9b922566bc6945bf919"}},{"ruleId":"D1","level":"warning","message":{"text":"JsDuplicationDetector.ExtendRunsThroughSupersetRelations (cyclomatic 30): JsDuplicationDetector.ExtendRunsThroughSupersetRelations has cyclomatic complexity 30 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs"},"region":{"startLine":5923}}}],"partialFingerprints":{"codehealthFindingId/v1":"d15d3ae485186c1f31407ec76a2f0f805b882785942f3400ef1efa5cff9748d3"}},{"ruleId":"D1","level":"warning","message":{"text":"ModuleSyntaxScanner.SelfDirectoryCompositionArg (cyclomatic 30): ModuleSyntaxScanner.SelfDirectoryCompositionArg has cyclomatic complexity 30 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/ModuleSyntaxScanner.cs"},"region":{"startLine":1174}}}],"partialFingerprints":{"codehealthFindingId/v1":"a327dd4ac1933e18c4bb65e67f80f6fe1476df12da2b87063cd77e0c737f9428"}},{"ruleId":"D1","level":"warning","message":{"text":"EventDrivenAnalyzer.AnalyzeAsync (cyclomatic 30): EventDrivenAnalyzer.AnalyzeAsync has cyclomatic complexity 30 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"86d25f317bc3301ed40a295f11c3cd371da44a31b4d5f2e151f54475442eff3c"}},{"ruleId":"D1","level":"warning","message":{"text":"LogicDefectAnalyzer.InspectDisposalDuties (cyclomatic 30): LogicDefectAnalyzer.InspectDisposalDuties has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/LogicDefectAnalyzer.cs"},"region":{"startLine":1165}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bfad91dbedd12933d67bbcfb721885f953c0eb29b94066046ab1773de4ef019"}},{"ruleId":"D1","level":"warning","message":{"text":"RuleRecommendationEngine.ForDimension (cyclomatic 30): RuleRecommendationEngine.ForDimension has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Reporting/Recommendations/RuleRecommendationEngine.cs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5db1cc3bfa891bdb4a387592cd08b553b46df5e94c3c036dc828845a89f3119"}},{"ruleId":"D1","level":"warning","message":{"text":"FileModel.ExpressionNeutralises (cyclomatic 30): FileModel.ExpressionNeutralises has cyclomatic complexity 30 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/SqlBuilderCompositionWalk.cs"},"region":{"startLine":892}}}],"partialFingerprints":{"codehealthFindingId/v1":"827dda98a8aed2b80f755cc262a2ad1a203f6e5912f60352100fee0ad2d59b98"}},{"ruleId":"D1","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.SbomAdvice (cyclomatic 30): SupplyChainProvenanceAnalyzer.SbomAdvice has cyclomatic complexity 30 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":3794}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0d52eed8820f13f33908ae193a6a5ce7f152985d2425ad240a1b3827e02f99a"}},{"ruleId":"D1","level":"warning","message":{"text":"go_precision_adjudicate.adjudicate (cyclomatic 30): go_precision_adjudicate.adjudicate has cyclomatic complexity 30 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/multilang/go_precision_adjudicate.py"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a27c43d2c4b5fa540f8e356be6519053247e320e1fb2f50773a4edada36bc15"}},{"ruleId":"D1","level":"warning","message":{"text":"programme-status.heldout_report (cyclomatic 30): programme-status.heldout_report has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/programme-status.py"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"c95e83f9155343b87ef25ed0a9f08faf84d381a561d23cf7e7e8dd6d8f54564b"}},{"ruleId":"D1","level":"warning","message":{"text":"FileExtractor.classLike (cyclomatic 30): FileExtractor.classLike has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/php-frontend/main.php"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"0015ad4bdb76cdf9322b647d22acfc41d24de3ba0db6d1d9128ce70b13c0a925"}},{"ruleId":"D1","level":"warning","message":{"text":"FrontendBundlerConfigRefs.HandleFile (cyclomatic 29): FrontendBundlerConfigRefs.HandleFile has cyclomatic complexity 29 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/FrontendBundlerConfigRefs.cs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a7242bc78f86dc5cda1adffd2dfc7c2183e87937ba1fe3c81abfd67cfb930e4"}},{"ruleId":"D1","level":"warning","message":{"text":"AccessibilityAnalyzer.PageStructureElement (cyclomatic 29): AccessibilityAnalyzer.PageStructureElement has cyclomatic complexity 29 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 9 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs"},"region":{"startLine":3254}}}],"partialFingerprints":{"codehealthFindingId/v1":"e23ede24b6560257903a9cf5212247518e22ba8b749eb34168096441b55bb1a3"}},{"ruleId":"D1","level":"warning","message":{"text":"AccessibilityAnalyzer.CountIndentationTemplateTags (cyclomatic 29): AccessibilityAnalyzer.CountIndentationTemplateTags 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":"engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.TemplateLanguageBlindness.cs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"575f774280cea89cc3806daeba1ee2f773d99710bc2c140dc650ec9397ad42a6"}},{"ruleId":"D1","level":"warning","message":{"text":"DomainModelAnalyzer.RepositoryPerAggregateRoot (cyclomatic 29): DomainModelAnalyzer.RepositoryPerAggregateRoot has cyclomatic complexity 29 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 6 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":"engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs"},"region":{"startLine":1577}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3e82ee66f6e19a44834ea3e89aad16fc06f96d37ba96c27c8b4d1c5259cd106"}},{"ruleId":"D1","level":"warning","message":{"text":"GoDomainConventions.IsNeutralAggregate (cyclomatic 29): GoDomainConventions.IsNeutralAggregate has cyclomatic complexity 29 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 7 belong to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/GoDomainConventions.cs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1a271b34902cbf1832cce0abe6c1d41adc57726ed4116b4787f3746e62a4556"}},{"ruleId":"D1","level":"warning","message":{"text":"JsInteropContractAnalyzer.AnalyzeAsync (cyclomatic 29): JsInteropContractAnalyzer.AnalyzeAsync 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":"engine/src/CodeHealth.Core/ModelAware/JsInteropContractAnalyzer.cs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"db4da7c9ea0552e8e6bdc33d630e2c19e68d13732c624052b8ed478951893158"}},{"ruleId":"D1","level":"warning","message":{"text":"SemverRange.Admits (cyclomatic 29): SemverRange.Admits has cyclomatic complexity 29 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/NpmLockGraph.cs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"126bddc53c364ad532121036b5769db74c81d02b5992c7f09e6915f6f9eaff6c"}},{"ruleId":"D1","level":"warning","message":{"text":"SecretNoiseFilter.IsChecksumLiteralElementBinding (cyclomatic 29): SecretNoiseFilter.IsChecksumLiteralElementBinding has cyclomatic complexity 29 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/SecretNoiseFilter.cs"},"region":{"startLine":1133}}}],"partialFingerprints":{"codehealthFindingId/v1":"e33863911e35a2155b27c9c095340acf75c55c3e24cf65b45860156f13e9fdfa"}},{"ruleId":"D1","level":"warning","message":{"text":"KnowledgeDecayModel.Build (cyclomatic 29): KnowledgeDecayModel.Build 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":"engine/src/CodeHealth.Dimensions.GitMining/KnowledgeDecayModel.cs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a33b70adc61ee959c1ab6d45b49e5ae914094fba78934753105ed3aec71151c"}},{"ruleId":"D1","level":"warning","message":{"text":"compare.main (cyclomatic 29): compare.main 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":"tools/multilang/compare.py"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b5b337b1d22fd1deafc841a5da42c645abc879fe512f56a1c54b87c753ac7f8"}},{"ruleId":"D1","level":"warning","message":{"text":"arm-state.main (cyclomatic 29): arm-state.main 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":"tools/train/arm-state.py"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"d603fa7aa8009a96272e30ae957476cbf02c0ae6cb08ebe00d45cc7564e05727"}},{"ruleId":"D1","level":"warning","message":{"text":"gold-draw.cmd_draw (cyclomatic 29): gold-draw.cmd_draw 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":"tools/train/gold-draw.py"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad948fdea1eacb4a11ff4ec3dbaef45bbebf25335154e1210673a930039dfb67"}},{"ruleId":"D1","level":"warning","message":{"text":"rehearse_verification.main (cyclomatic 29): rehearse_verification.main has cyclomatic complexity 29 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/rehearse_verification.py"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"50173e2dba818ce09e04d30d484964eab43bb5b5582af6d1bb8ad7d69f53b0e7"}},{"ruleId":"D1","level":"warning","message":{"text":"body.tokenizeBody (cyclomatic 29): body.tokenizeBody 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":"engine/sidecars/php-frontend/body.php"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"791aec0a4ba684a283af08a41f6b142fe7e207bca9fc97eb1b7c7a3d49c846c4"}},{"ruleId":"D1","level":"warning","message":{"text":"ControlFlowComplexity.CognitiveShape (cyclomatic 28): ControlFlowComplexity.CognitiveShape has cyclomatic complexity 28 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 3 belong to 3 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Complexity/ControlFlowComplexity.cs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"5909f93ff6341af009c0d5b9ced9bda932466217b19733616e5c96c7b9190adc"}},{"ruleId":"D1","level":"warning","message":{"text":"ComplianceSecurityAnalyzer.ScanCredentialExposure (cyclomatic 28): ComplianceSecurityAnalyzer.ScanCredentialExposure has cyclomatic complexity 28 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs"},"region":{"startLine":1436}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd9bca2811017bd2fd87d234b65621b99c768dd76b7c3a1b1e194b9968b23b09"}},{"ruleId":"D1","level":"warning","message":{"text":"PnpmLockfileReader.ReadDirectProduction (cyclomatic 28): PnpmLockfileReader.ReadDirectProduction has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Dependencies/PnpmLockfileReader.cs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"62b384c809badf19c86484403d6b52d6afe5815838a01c862767d0446fbac29c"}},{"ruleId":"D1","level":"warning","message":{"text":"RoslynDeadCodeDetector.DetectAsync (cyclomatic 28): RoslynDeadCodeDetector.DetectAsync has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ExplicitDebt/RoslynDeadCodeDetector.cs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb4bc94cc189be2944d75cf4507376a056f6c28bf3548ce9c9bf62f6635da25a"}},{"ruleId":"D1","level":"warning","message":{"text":"EntryPointCatalog.DetectFrameworkConventions (cyclomatic 28): EntryPointCatalog.DetectFrameworkConventions has cyclomatic complexity 28 (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":"engine/src/CodeHealth.Core/Frontend/EntryPointCatalog.cs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"50c9963e4cc6d635e72526bd2bfab28e687a742f2f295bc5c0c0d50bcdfa90c0"}},{"ruleId":"D1","level":"warning","message":{"text":"FrontendTestReachability.PackageNameReached (cyclomatic 28): FrontendTestReachability.PackageNameReached has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/FrontendTestReachability.cs"},"region":{"startLine":966}}}],"partialFingerprints":{"codehealthFindingId/v1":"648d9faf2dfcb856c81b4545aec5b80d32b67bcc6fbae8519aa267367c11d599"}},{"ruleId":"D1","level":"warning","message":{"text":"DomainConventions.IsValueObject (cyclomatic 28): DomainConventions.IsValueObject has cyclomatic complexity 28 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, 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":"engine/src/CodeHealth.Core/ModelAware/DomainConventions.cs"},"region":{"startLine":1177}}}],"partialFingerprints":{"codehealthFindingId/v1":"09c495c89735deea50ec011e1edfe959abf5390b3ab7fa01b4e472a7d02f5d1d"}},{"ruleId":"D1","level":"warning","message":{"text":"EventSourcingAnalyzer.PiiInEventStore (cyclomatic 28): EventSourcingAnalyzer.PiiInEventStore has cyclomatic complexity 28 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 3 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/EventSourcingAnalyzer.cs"},"region":{"startLine":1128}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9e72078d4969779a90c6ad6a6137e825343df142bc19833dea4b93c5487d055"}},{"ruleId":"D1","level":"warning","message":{"text":"CommittedCoverageReader.ParseSimpleCovJson (cyclomatic 28): CommittedCoverageReader.ParseSimpleCovJson has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Testing/CommittedCoverageReader.cs"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2b2611bdc0746fe6e6e1b4d522ecd1476a09d2571bc5ebf189882b03c2468a2"}},{"ruleId":"D1","level":"warning","message":{"text":"ChangeSetBuilder.IsTestFile (cyclomatic 28): ChangeSetBuilder.IsTestFile has cyclomatic complexity 28 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Reporting/Changelog/Fusion/ChangeSetBuilder.cs"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5ba577aadb19efd4b4cfb6a9eee21791e3583ac64a198e43c328bf49e278202"}},{"ruleId":"D1","level":"warning","message":{"text":"DuplicationAnalyzer.DuplicationRemediationCore (cyclomatic 28): DuplicationAnalyzer.DuplicationRemediationCore has cyclomatic complexity 28 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 6 belong to 5 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":"engine/src/CodeHealth.Dimensions.CodeQuality/CodeShape/DuplicationAnalyzer.cs"},"region":{"startLine":1546}}}],"partialFingerprints":{"codehealthFindingId/v1":"e25abb7eb9327de06aaed9662a5d7df5ecdccf1137e78608d053e19fb3a9eb9b"}},{"ruleId":"D1","level":"warning","message":{"text":"SolutionShapeAnalyzer.BuildFindings (cyclomatic 28): SolutionShapeAnalyzer.BuildFindings has cyclomatic complexity 28 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, 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":"engine/src/CodeHealth.Dimensions.CodeQuality/SolutionShape/SolutionShapeAnalyzer.cs"},"region":{"startLine":823}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e3ab81cec4795ce89d34fe6c794050d7190db832e8f7146aefd92d63f3fca1f"}},{"ruleId":"D1","level":"warning","message":{"text":"SemgrepShapeFilter.IsUnreachableClaim (cyclomatic 28): SemgrepShapeFilter.IsUnreachableClaim has cyclomatic complexity 28 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/SemgrepShapeFilter.cs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c4e6d8f16a41d4a8ed459695c9b985eb77c840473d4369a9552dced35cd5d5d"}},{"ruleId":"D1","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.MovingCargoGitDependencies (cyclomatic 28): SupplyChainProvenanceAnalyzer.MovingCargoGitDependencies has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":1470}}}],"partialFingerprints":{"codehealthFindingId/v1":"f277c7e1915d6d2c49a8cf2fcf64dbbfd6e81ba48013f224c98b39a1a4fabbff"}},{"ruleId":"D1","level":"warning","message":{"text":"LineLexer.CodeOnly (cyclomatic 27): LineLexer.CodeOnly has cyclomatic complexity 27 (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":"engine/src/CodeHealth.Core/CodeShape/RustInlineTestRegions.cs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"878db04ae2a3734612201d144c7d39292bf8d0d197ccee6c56b47cb4b8ed6c3a"}},{"ruleId":"D1","level":"warning","message":{"text":"JsDuplicationDetector.BuildImportMask (cyclomatic 27): JsDuplicationDetector.BuildImportMask has cyclomatic complexity 27 (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":"engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs"},"region":{"startLine":6932}}}],"partialFingerprints":{"codehealthFindingId/v1":"d713072d3ad97195d4d3dd67933755a574d57d76e6e33c86cfaae002ada12f64"}},{"ruleId":"D1","level":"warning","message":{"text":"JsScopeBindings.BindPattern (cyclomatic 27): JsScopeBindings.BindPattern has cyclomatic complexity 27 (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":"engine/src/CodeHealth.Core/Frontend/JsScopeBindings.cs"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5e09c5d2760999e365e9c1c62573088cfd70ffe51c24e195a88445f93e1d652"}},{"ruleId":"D1","level":"warning","message":{"text":"SupplyChainHygieneAnalyzer.Detect (cyclomatic 27): SupplyChainHygieneAnalyzer.Detect has cyclomatic complexity 27 (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":"engine/src/CodeHealth.Core/ModelAware/SupplyChainHygieneAnalyzer.cs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d9c9c2b75eea7e534a5434a9669a6cf1e8fee73590d0fc32b28664c4d8e060f"}},{"ruleId":"D1","level":"warning","message":{"text":"CommitIdentityGraph.Build (cyclomatic 27): CommitIdentityGraph.Build has cyclomatic complexity 27 (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":"engine/src/CodeHealth.Toolchain/Git/CommitIdentityGraph.cs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"939395afcac0fa96a6403ccb4d516befaecd4735540f4b8fff572bf46479b13e"}},{"ruleId":"D1","level":"warning","message":{"text":"ChangelogNarrator.DescribeAsync (cyclomatic 27): ChangelogNarrator.DescribeAsync has cyclomatic complexity 27 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Reporting/Changelog/ChangelogNarrator.cs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"593864ac3341020f2ccc3a0b70778f34ca785f674d662d45441485417489ff4b"}},{"ruleId":"D1","level":"warning","message":{"text":"DuplicationAnalyzer.ExtractionCaveat (cyclomatic 27): DuplicationAnalyzer.ExtractionCaveat has cyclomatic complexity 27 (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":"engine/src/CodeHealth.Dimensions.CodeQuality/CodeShape/DuplicationAnalyzer.cs"},"region":{"startLine":3533}}}],"partialFingerprints":{"codehealthFindingId/v1":"42400712017fcbcd8a3db898dd8df37dc6884c620c19f0ffab47d0c301d41d70"}},{"ruleId":"D1","level":"warning","message":{"text":"CloneSpanShape.Scrub (cyclomatic 27): CloneSpanShape.Scrub has cyclomatic complexity 27 (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":"engine/src/CodeHealth.Dimensions.CodeQuality/CodeShape/DuplicationAnalyzer.cs"},"region":{"startLine":4604}}}],"partialFingerprints":{"codehealthFindingId/v1":"c90b1510bb449bcf72cf5a813f4f98375a2d2357d761ac81810f8d7c9e2052e5"}},{"ruleId":"D1","level":"warning","message":{"text":"ShellExecRecheck.RubyCallArguments (cyclomatic 27): ShellExecRecheck.RubyCallArguments has cyclomatic complexity 27 (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":"engine/src/CodeHealth.Dimensions.Security/Scanners/ShellExecRecheck.cs"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"94fe1436893ab39268a0459c697bbf39de9707b6946be4d603b5501ee29a03c4"}},{"ruleId":"D1","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.JobsScopedBelowTheirCheckout (cyclomatic 27): SupplyChainProvenanceAnalyzer.JobsScopedBelowTheirCheckout has cyclomatic complexity 27 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":8161}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c9d54961bf1ef31f3fc0bac698db27d8ba004b72a72c10ec364e4e1d3acfbcc"}},{"ruleId":"D1","level":"warning","message":{"text":"baseline.main (cyclomatic 27): baseline.main has cyclomatic complexity 27 (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":"tools/multilang/baseline.py"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7350bc50c7f8269246465407ee9a23bb1f4837776ecd747fa2526f85bab0c4c"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 27): (anonymous) has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 3 of the 27 points are its own statements and the rest belongs to 7 function items inside it that branch (dsmInit::(anonymous), dsmInit::highlight, dsmInit, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Kennel.Ui/wwwroot/kennel-ui.js"},"region":{"startLine":2073}}}],"partialFingerprints":{"codehealthFindingId/v1":"353d52dab48f8cf466dd43b748ae144cadf6fb49fea86724109db17199b9947b"}},{"ruleId":"D1","level":"warning","message":{"text":"Lcom4Calculator.Analyze (cyclomatic 26): Lcom4Calculator.Analyze has cyclomatic complexity 26 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Cohesion/Lcom4Calculator.cs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2cebbad52dcdc06077075f9065616d4d94a2f09bf8a2ee4526c49ac7d6d61e7"}},{"ruleId":"D1","level":"warning","message":{"text":"FrontendConfigResolution.ParseTsConfigRaw (cyclomatic 26): FrontendConfigResolution.ParseTsConfigRaw 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":"engine/src/CodeHealth.Core/Frontend/FrontendConfigResolution.cs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"234dff633f8232deefb6abff0d3f0a22665778ca7d89246231980344b1c930a3"}},{"ruleId":"D1","level":"warning","message":{"text":"MinifiedJsHeuristics.StripStringsAndComments (cyclomatic 26): MinifiedJsHeuristics.StripStringsAndComments 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":"engine/src/CodeHealth.Core/Frontend/MinifiedJsHeuristics.cs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"883ec87d00bcb8144db7e3abd55fb4d2baebd92f93d0172cb093a9d8363212e4"}},{"ruleId":"D1","level":"warning","message":{"text":"IndentedMarkupProducer.Read (cyclomatic 26): IndentedMarkupProducer.Read 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":"engine/src/CodeHealth.Core/Markup/IndentedMarkupProducer.cs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1cd1b6cd858661e9d402690ace54bb9967622021cbc3e3a0163541302fb0703"}},{"ruleId":"D1","level":"warning","message":{"text":"MarkupTaintPass.IsTainted (cyclomatic 26): MarkupTaintPass.IsTainted has cyclomatic complexity 26 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/MarkupTaintPass.cs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"922fe7d6e0d3de439d90e8a435cbc175ceb5fc642d0152abf4934ab6475d6fd7"}},{"ruleId":"D1","level":"warning","message":{"text":"RunLimitations.BuildFailures (cyclomatic 26): RunLimitations.BuildFailures 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":"engine/src/CodeHealth.Reporting/Limitations/RunLimitations.cs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ab22d31a0c968a46bcd54d1caff43d2e1c535a3e1f004ecd8e65037700ed500"}},{"ruleId":"D1","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.JobsGrantingWriteBeyondGatedSteps (cyclomatic 26): SupplyChainProvenanceAnalyzer.JobsGrantingWriteBeyondGatedSteps has cyclomatic complexity 26 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 3 belong to 3 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":7630}}}],"partialFingerprints":{"codehealthFindingId/v1":"031c16f6ab25964393a80f181d924b137d0d4699a23aa0a6d313f61e33856835"}},{"ruleId":"D1","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.ActionArgvCommandLines (cyclomatic 26): SupplyChainProvenanceAnalyzer.ActionArgvCommandLines 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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":9606}}}],"partialFingerprints":{"codehealthFindingId/v1":"4beebb659da82096f6a9b6c68d360403b00186c043c1cb90c6cc192e7f68e709"}},{"ruleId":"D1","level":"warning","message":{"text":"CodebaseDetail.razor \u203A OnParametersSetAsync (cyclomatic 26): CodebaseDetail.razor \u203A OnParametersSetAsync has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Kennel.Assay.Core/DecisionReports/Ui/CodebaseDetail.razor"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"0410952065a8bb7e39baf89c177c151b5b640b42149035bdfbaa8dc3d4ceb650"}},{"ruleId":"D1","level":"warning","message":{"text":"BranchWalker._stmt (cyclomatic 26): BranchWalker._stmt has cyclomatic complexity 26 (threshold 15). 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":"engine/sidecars/python-frontend/bodyfacts.py"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"1243732e092422021eccd32befd06ce155c9aba006fc0dda167c1c8ee08be6c4"}},{"ruleId":"D1","level":"warning","message":{"text":"corpus_gitlab.discover (cyclomatic 26): corpus_gitlab.discover 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":"tools/multilang/corpus_gitlab.py"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b0e61f2fb9a1868f7a6360053273ad5465bbfea7867dace7c7300bb659c6b34"}},{"ruleId":"D1","level":"warning","message":{"text":"judge-viability-by-dimension.main (cyclomatic 26): judge-viability-by-dimension.main 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":"tools/train/judge-viability-by-dimension.py"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1258727822efa439042fb08a90c253c252654e5545b1d7ce816697e8b626503"}},{"ruleId":"D1","level":"warning","message":{"text":"BranchWalker.node (cyclomatic 26): BranchWalker.node 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":"engine/sidecars/php-frontend/body.php"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"d111c61841d62ff5fb5e45fa8b65129a377f29e1dbfad2a47b0966eae831964e"}},{"ruleId":"D1","level":"warning","message":{"text":"ComplianceSecurityAnalyzer.ResolveConstantInt (cyclomatic 25): ComplianceSecurityAnalyzer.ResolveConstantInt has cyclomatic complexity 25 (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":"engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs"},"region":{"startLine":3137}}}],"partialFingerprints":{"codehealthFindingId/v1":"07ffb359cbc2b1f1486426f84bc1cf5b01b38cb38cc0cd74e02c3b3995a1d544"}},{"ruleId":"D1","level":"warning","message":{"text":"ComplianceSecurityAnalyzer.C1 (cyclomatic 25): ComplianceSecurityAnalyzer.C1 has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs"},"region":{"startLine":5054}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5af977228b6a82d868eb000f4a55df89f896f862c558b27d2aae6d5db0d8b48"}},{"ruleId":"D1","level":"warning","message":{"text":"MixManifestHygiene.Read (cyclomatic 25): MixManifestHygiene.Read has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Dependencies/MixManifestHygiene.cs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"83ba11866ccaeba33d968fc4536e451dcc44e612202c4be38ddd7eb42024bb0a"}},{"ruleId":"D1","level":"warning","message":{"text":"RoslynExplicitDebtCollector.CollectObsoleteAsync (cyclomatic 25): RoslynExplicitDebtCollector.CollectObsoleteAsync has cyclomatic complexity 25 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ExplicitDebt/RoslynExplicitDebtCollector.cs"},"region":{"startLine":4381}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbc93d2f6c20a11278e588540418775a0ea15ee6b3b3e362dc11bfb8830fed42"}},{"ruleId":"D1","level":"warning","message":{"text":"FrontendEmittedTemplateRefs.ResolveEmittedTemplateFamilyAgainst (cyclomatic 25): FrontendEmittedTemplateRefs.ResolveEmittedTemplateFamilyAgainst has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/FrontendEmittedTemplateRefs.cs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"fedeb4a87a5e22a1574b3d1b9529dc08fa4502755d56a97f966b995c42f2b7eb"}},{"ruleId":"D1","level":"warning","message":{"text":"FrontendManifestEntryPoints.CollectMiniProgramEntryPaths (cyclomatic 25): FrontendManifestEntryPoints.CollectMiniProgramEntryPaths has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/FrontendManifestEntryPoints.cs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"6801dbdeea42b46a916cc5d4035cde55c53bc0912cded8843c919aad0f26ffd1"}},{"ruleId":"D1","level":"warning","message":{"text":"FrontendModuleGraph.CircularGroups (cyclomatic 25): FrontendModuleGraph.CircularGroups has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/FrontendModuleGraph.cs"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d6e48208ee9b8c0cc969bd29ad0c067fd9f550301637ee8deccf536bd34e7b7"}},{"ruleId":"D1","level":"warning","message":{"text":"FrontendWorkspaceLoader.ReadSourceMapProvenance (cyclomatic 25): FrontendWorkspaceLoader.ReadSourceMapProvenance has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/FrontendWorkspaceLoader.BuildOutput.cs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ca6d63aecf59a890015a9d6ccfb20b57a41bda7880237032058321f292f8082"}},{"ruleId":"D1","level":"warning","message":{"text":"JsComplexity.FindBracelessBodyEnd (cyclomatic 25): JsComplexity.FindBracelessBodyEnd has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/JsComplexity.cs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8dc75911c051216e81181cd6e52c6201ec6d3be0d0e21765c091138393f17d2"}},{"ruleId":"D1","level":"warning","message":{"text":"JsFunctionScanner.ScanExpressionBodyEnd (cyclomatic 25): JsFunctionScanner.ScanExpressionBodyEnd has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: JsFunctionScanner.ClassifyOpenBrace (cyclomatic 30) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/JsFunctionScanner.cs"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ab5db906fc01e12cadcf55b616bf6e80dbeb1bb6338f6022bda7e13249bb18e"}},{"ruleId":"D1","level":"warning","message":{"text":"Scanner.ScanNumber (cyclomatic 25): Scanner.ScanNumber has cyclomatic complexity 25 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/JsLexer.cs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e03027b5c21513ef42e60d1516d29eab00024db789b08721aa7d68c85442edc"}},{"ruleId":"D1","level":"warning","message":{"text":"ModuleResolver.ModuleResolver.ctor (cyclomatic 25): ModuleResolver.ModuleResolver.ctor has cyclomatic complexity 25 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 6 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":"engine/src/CodeHealth.Core/Frontend/ModuleResolver.cs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1bfe9accf4785fc434e081a09380b80ce38da2ed1f848e18cd61551b6342f09"}},{"ruleId":"D1","level":"warning","message":{"text":"ArchitectureStyleDetector.DetectAsync (cyclomatic 25): ArchitectureStyleDetector.DetectAsync has cyclomatic complexity 25 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/ArchitectureStyleDetector.cs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc28ec4c55c68c8cf0015afd207812ed5e5f128e2ca0c2e1528fad4317f6568c"}},{"ruleId":"D1","level":"warning","message":{"text":"EventSourcingAnalyzer.PiiInEventStore (cyclomatic 25): EventSourcingAnalyzer.PiiInEventStore has cyclomatic complexity 25 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/EventSourcingAnalyzer.cs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"40baac1641c508eb894eea31b22328406ba66eea895352a528d0feb20fcb3250"}},{"ruleId":"D1","level":"warning","message":{"text":"CommittedCoverageReader.EnumerateCandidates (cyclomatic 25): CommittedCoverageReader.EnumerateCandidates has cyclomatic complexity 25 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Testing/CommittedCoverageReader.cs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"6624f7f552d5577d2a292f8b068eb04bf499f641e3cc800fa68b1227e0f3dba3"}},{"ruleId":"D1","level":"warning","message":{"text":"JsTestCensus.Strip (cyclomatic 25): JsTestCensus.Strip has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Testing/JsTestCensus.cs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"37215b16f27491cb838892c69f9a7c723599eb7837096400ad5d0c59c663c5cf"}},{"ruleId":"D1","level":"warning","message":{"text":"ComposeServiceSurface.ServicesIn (cyclomatic 25): ComposeServiceSurface.ServicesIn has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/ComposeServiceSurface.cs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"682e9148805c60ce1c3c742c0531d5e3e1ccdfd90839954790620770bcfe86d0"}},{"ruleId":"D1","level":"warning","message":{"text":"GoModuleContextRechecks.AssertedMapKeyIsLocalCompositeLiteral (cyclomatic 25): GoModuleContextRechecks.AssertedMapKeyIsLocalCompositeLiteral has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/GoModuleContextRechecks.cs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba484c7fb882ae4ae4836745478698bf9fffc6ba94eb87549b90a8dfb8ef9216"}},{"ruleId":"D1","level":"warning","message":{"text":"ScanParsers.SiblingAdvisoryFloors (cyclomatic 25): ScanParsers.SiblingAdvisoryFloors has cyclomatic complexity 25 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 4 belong to 4 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/ScanParsers.cs"},"region":{"startLine":1197}}}],"partialFingerprints":{"codehealthFindingId/v1":"017632a436705421bd5d0a6cdfe36ab9d163caa838e4895da8b488663ccae5af"}},{"ruleId":"D1","level":"warning","message":{"text":"ScanParsers.OsvFindings (cyclomatic 25): ScanParsers.OsvFindings has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/ScanParsers.cs"},"region":{"startLine":1417}}}],"partialFingerprints":{"codehealthFindingId/v1":"c276122b195421d27bc5b053fc6123aad9864908f7529d6242ec1ed535a7a911"}},{"ruleId":"D1","level":"warning","message":{"text":"FileModel.IndexMethods (cyclomatic 25): FileModel.IndexMethods has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/SqlBuilderCompositionWalk.cs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"c424272587ceed529a6755413f3743e2a85d98ca8dd392bfcd60805ff8de2eb4"}},{"ruleId":"D1","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.TokenAuthedNpmPublishes (cyclomatic 25): SupplyChainProvenanceAnalyzer.TokenAuthedNpmPublishes has cyclomatic complexity 25 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 6 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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.NpmRegistryAuth.cs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb2a63d23735a357fead6d1b415fdb7104948a6f99aff443ecc79c4d422dca7f"}},{"ruleId":"D1","level":"warning","message":{"text":"BodyEmit.forBody (cyclomatic 25): BodyEmit.forBody has cyclomatic complexity 25 (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":"engine/sidecars/scala-frontend/src/main/scala/dev/canine/codehealth/scala/BodyEmit.scala"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"040708bbae01e0e0683c5f065b647253265909670a825d07b8f0247f27457be6"}},{"ruleId":"D1","level":"warning","message":{"text":"status.main (cyclomatic 25): status.main has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/llm-bakeoff/status.py"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf38d972bb274cb98d772a85215f7ff55d9e918a5f5b0f67b301bc744a928e6a"}},{"ruleId":"D1","level":"warning","message":{"text":"draw.main (cyclomatic 25): draw.main has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/rescan/draw.py"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6f65a667033473c803da8bec2a3ce33dacd4442be0a8f6dc56b38318fc5a05a"}},{"ruleId":"D1","level":"warning","message":{"text":"ts-helpers.branchesOf (cyclomatic 25): ts-helpers.branchesOf has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 10 of the 25 points are its own statements and the rest belongs to 7 function literals inside it that branch (lines 369, 349, 386, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/tsjs-frontend/ts-helpers.mjs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"60d74cc19113328ae2b389445c56712f30e6ce869da8f1e91643642e95c77afb"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 25): (anonymous) has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 3 of the 25 points are its own statements and the rest belongs to 17 function items inside it that branch (wire::render, wire, wire::render::(anonymous), \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Kennel.Ui/wwwroot/kennel-ui.js"},"region":{"startLine":1810}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cd380434da470a5e91adae08406fc200065aee81641edc9d2142e40748107d7"}},{"ruleId":"D1","level":"warning","message":{"text":"IndirectionAnalyzer.AnalyzeAsync (cyclomatic 24): IndirectionAnalyzer.AnalyzeAsync 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":"engine/src/CodeHealth.Core/Architecture/IndirectionAnalyzer.cs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"90e343eecdfc20024972f4f62a7bd821c261f4df1c416244f327761ca5f408cb"}},{"ruleId":"D1","level":"warning","message":{"text":"PolyglotConditionScanner.BlankNonCode (cyclomatic 24): PolyglotConditionScanner.BlankNonCode 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":"engine/src/CodeHealth.Core/CodeShape/PolyglotConditionScanner.cs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"cefb25a4fc92de98f8037e59570cc055441931a093b656e0ecd555a17a945ed6"}},{"ruleId":"D1","level":"warning","message":{"text":"Lcom4Calculator.ComputeAsync (cyclomatic 24): Lcom4Calculator.ComputeAsync 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":"engine/src/CodeHealth.Core/Cohesion/Lcom4Calculator.cs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"73c77ad2683b734cc450f36ca6d2668f76c056378d74e48f5fa61f011c9684b0"}},{"ruleId":"D1","level":"warning","message":{"text":"BundlerManifestHygiene.Read (cyclomatic 24): BundlerManifestHygiene.Read 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":"engine/src/CodeHealth.Core/Dependencies/BundlerManifestHygiene.cs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"610c23cc0e22b86eaee3968d2934b3c235cce38e9074b4ef9985f5fc87da14c7"}},{"ruleId":"D1","level":"warning","message":{"text":"NpmManifestHygiene.FloatingReason (cyclomatic 24): NpmManifestHygiene.FloatingReason has cyclomatic complexity 24 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Dependencies/NpmManifestHygiene.cs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbfac032848a37a4e86e2fe833a651ad33df9e239aed119b6f215b9003cad24a"}},{"ruleId":"D1","level":"warning","message":{"text":"FrontendAnalyzer.Score (cyclomatic 24): FrontendAnalyzer.Score has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Discovery/FrontendAnalyzer.cs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d55ab03eb7caa97b297732e7ddd76e67f567367c86cdd6f9ca137a6ccf1bf55"}},{"ruleId":"D1","level":"warning","message":{"text":"FrontendDependencyHygiene.IsDependencyUsed (cyclomatic 24): FrontendDependencyHygiene.IsDependencyUsed has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/FrontendDependencyHygiene.cs"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"a601d4d6e1e5abfebc883af564fdc8bb436307c633d1382526fb3453c837a88f"}},{"ruleId":"D1","level":"warning","message":{"text":"JsDuplicationDetector.Detect (cyclomatic 24): JsDuplicationDetector.Detect 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":"engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs"},"region":{"startLine":2405}}}],"partialFingerprints":{"codehealthFindingId/v1":"865221a15736c39817ea89a58445350f893049832caa156430f6ddbea0673281"}},{"ruleId":"D1","level":"warning","message":{"text":"JsDuplicationDetector.MarkCommonJsWiring (cyclomatic 24): JsDuplicationDetector.MarkCommonJsWiring 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":"engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs"},"region":{"startLine":7093}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff01f7bcbcee0dd2b2d51bf5ec38d85468bfde0d163ce6106c5bd76f78c94746"}},{"ruleId":"D1","level":"warning","message":{"text":"JsRedundantReDefault.IsRedundantAt (cyclomatic 24): JsRedundantReDefault.IsRedundantAt 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":"engine/src/CodeHealth.Core/Frontend/JsRedundantReDefault.cs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2ed5e69123bc7098ada4a13876de938b1c09dc6a97bbc8fb70e3621ed08b4fa"}},{"ruleId":"D1","level":"warning","message":{"text":"ModuleSyntaxScanner.CollectCommentTypeImports (cyclomatic 24): ModuleSyntaxScanner.CollectCommentTypeImports has cyclomatic complexity 24 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/ModuleSyntaxScanner.cs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"a07eef2a32a5b0a2ffbb6cb5cdd2fbb971554598842a2986b4c36a11ed01cb62"}},{"ruleId":"D1","level":"warning","message":{"text":"EventDrivenAnalyzer.EventCommandShape (cyclomatic 24): EventDrivenAnalyzer.EventCommandShape has cyclomatic complexity 24 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs"},"region":{"startLine":1583}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf9180d41339580dc1336f85a3f0b1c5924d700586111fbe89a84a98a5f18f09"}},{"ruleId":"D1","level":"warning","message":{"text":"MarkupTaintPass.CollectHoles (cyclomatic 24): MarkupTaintPass.CollectHoles 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":"engine/src/CodeHealth.Core/ModelAware/MarkupTaintPass.cs"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"16168e906bd7b05300a6316708a23e180508267ecd50f12c31ca064157a3a240"}},{"ruleId":"D1","level":"warning","message":{"text":"ScalaDomainConventions.Dm6InfraLeak (cyclomatic 24): ScalaDomainConventions.Dm6InfraLeak 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":"engine/src/CodeHealth.Core/ModelAware/ScalaDomainConventions.cs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"07c88d42b72c0611499cab986918537464a8ce31e95c400888f3c19eb8b275a2"}},{"ruleId":"D1","level":"warning","message":{"text":"SupplyChainHygieneAnalyzer.BuildCard (cyclomatic 24): SupplyChainHygieneAnalyzer.BuildCard 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":"engine/src/CodeHealth.Core/ModelAware/SupplyChainHygieneAnalyzer.cs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec561222ded716691dca22489653c0edec25c8272f5ccd69415b8374a3ac7e02"}},{"ruleId":"D1","level":"warning","message":{"text":"CiWorkflowReader.IsPipelinePath (cyclomatic 24): CiWorkflowReader.IsPipelinePath has cyclomatic complexity 24 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Readiness/CiWorkflowReader.cs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3ac5c9f262d8bf82c31e5b227906aff0c28bade862e6159fadb2e8c04dfebed"}},{"ruleId":"D1","level":"warning","message":{"text":"ProductionReadinessAnalyzer.CiGateHonesty (cyclomatic 24): ProductionReadinessAnalyzer.CiGateHonesty has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: ProductionReadinessAnalyzer.HasDedicatedSastSignal (cyclomatic 48) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4a51ad0d63888d6b2ab01d5225ec4934633e8b50574123976745bae16ed2af2"}},{"ruleId":"D1","level":"warning","message":{"text":"DiskSourceFiles.WeighUnreadLanguagesAsync (cyclomatic 24): DiskSourceFiles.WeighUnreadLanguagesAsync 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. This is NOT this file\u0027s highest cyclomatic complexity: DiskSourceFiles.IsNeverProductionSourceFile (cyclomatic 26) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Scoring/DiskSourceFiles.cs"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"077b50540156b62addabc0daca401ddd92f239b7f44c019214e94ef1b8bff59f"}},{"ruleId":"D1","level":"warning","message":{"text":"CommittedCoverageReader.ParseJsonCoverage (cyclomatic 24): CommittedCoverageReader.ParseJsonCoverage has cyclomatic complexity 24 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Testing/CommittedCoverageReader.cs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6a40098bf1cc42ea88b0e4338df3b9f9398ab0528cd9049688f81b0a754cd26"}},{"ruleId":"D1","level":"warning","message":{"text":"GitDiffShapes.ParseAsync (cyclomatic 24): GitDiffShapes.ParseAsync 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":"engine/src/CodeHealth.Toolchain/Git/GitDiffShapes.cs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a2d57f8cb34b17951f2f9006bb4c3e60fdaab382827bf6f8e8e70afd67cc9bf"}},{"ruleId":"D1","level":"warning","message":{"text":"MutableGitCloneScan.Offence (cyclomatic 24): MutableGitCloneScan.Offence 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/MutableGitCloneScan.cs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8d2a54758ea5039f6a8b2a9a9e25a4a6119b6457905624c6f7797f889078d05"}},{"ruleId":"D1","level":"warning","message":{"text":"RubyArgumentMutatedScan.ParametersOf (cyclomatic 24): RubyArgumentMutatedScan.ParametersOf 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/RubyArgumentMutatedScan.cs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec5b7ea54c34e9156442e8c5a43ccc17d405c79956a79b34071a0a2828a03373"}},{"ruleId":"D1","level":"warning","message":{"text":"UnverifiedRemoteInstallerScan.ExtractedAndExecuted (cyclomatic 24): UnverifiedRemoteInstallerScan.ExtractedAndExecuted has cyclomatic complexity 24 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/UnverifiedRemoteInstallerScan.cs"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c9ebffefda8cf9aaa37b667d61d1a051b4a9a5a375acbbbedd88c5584d873ae"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkflowInputGateRecheck.ExpressionYieldsOnlyShellSafeText (cyclomatic 24): WorkflowInputGateRecheck.ExpressionYieldsOnlyShellSafeText 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/WorkflowInputGateRecheck.cs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f02f974eba95a04ccda02bfebcfb30c56e0e6552f3c8cc86445f4f951e3f990"}},{"ruleId":"D1","level":"warning","message":{"text":"StaticAnalysisAnalyzer.RunAsync (cyclomatic 24): StaticAnalysisAnalyzer.RunAsync has cyclomatic complexity 24 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 9 belong to 6 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":"engine/src/CodeHealth.Dimensions.Security/StaticAnalysisAnalyzer.cs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"5182ab6b63802fc006a3baf08aebf529e8abaa00d4f1d908c604cea71727e37a"}},{"ruleId":"D1","level":"warning","message":{"text":"RepoFindings.razor \u203A get (cyclomatic 24): RepoFindings.razor \u203A get has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Kennel.Watchdog.Core/Agents/Ui/RepoFindings.razor"},"region":{"startLine":1077}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8c00d6034681eb6c58eedb589410ed2b4bf074928ada2bbaf89eecd1f22912d"}},{"ruleId":"D1","level":"warning","message":{"text":"FSharpProvider.CreateMany (cyclomatic 24): FSharpProvider.CreateMany has cyclomatic complexity 24 (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":"engine/src/CodeHealth.CodeModel.FSharp/FSharpProvider.fs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"13029334063fef04eb483276f9ef15ebe0a01c9dfd3a9adb80973662272c156a"}},{"ruleId":"D1","level":"warning","message":{"text":"gold-draw.cmd_coverage (cyclomatic 24): gold-draw.cmd_coverage 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":"tools/train/gold-draw.py"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"c985ef5c5e64e22208d61dd62fecfad57a5fd51a438bf883082efea02d2e4c5c"}},{"ruleId":"D1","level":"warning","message":{"text":"judge-calibration.cmd_extract (cyclomatic 24): judge-calibration.cmd_extract 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":"tools/train/judge-calibration.py"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"62689a1b39d9d2b5459ed19adf1a942a9f35d0943eaab47ea502e780a33d0d78"}},{"ruleId":"D1","level":"warning","message":{"text":"report_detection_delta.validate (cyclomatic 24): report_detection_delta.validate 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":"tools/train/report_detection_delta.py"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"3425fa8adbf8799f43534d4f6f7a73c4d992bcdaf010a26e0d38142f997a456d"}},{"ruleId":"D1","level":"warning","message":{"text":"branchWalker.stmtOpaque (cyclomatic 24): branchWalker.stmtOpaque has cyclomatic complexity 24 (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":"engine/sidecars/go/bodybranch.go"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"a816c3935a92ea48a542a3aa8c08d25ea01f5b136fa09be13bdf50471895d4e2"}},{"ruleId":"D1","level":"warning","message":{"text":"Extractor.collectMember (cyclomatic 24): Extractor.collectMember 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":"engine/sidecars/swift-frontend/Sources/codehealth-swift-sidecar/Extractor.swift"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3de58447fb5f7759f8d927adcfec2aebe57baa8423ebe830dd1911464ce170f"}},{"ruleId":"D1","level":"warning","message":{"text":"Model::emit_type (cyclomatic 24): Model::emit_type 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":"engine/sidecars/rust-frontend/src/main.rs"},"region":{"startLine":1296}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5f0a9d955728585e0888fecda7bd2b8c3f69277e27ebb74ea50400f5ed7f782"}},{"ruleId":"D1","level":"warning","message":{"text":"typeEmitters (cyclomatic 24): typeEmitters has cyclomatic complexity 24 (threshold 15). Most of this is not in the body itself: 1 of the 24 points is its own statement and the rest belongs to 7 function items inside it that branch (heritageOf, classOrmOf, visitClass, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/tsjs-frontend/extract-file.mjs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"56c50acd15738e0df02e3fb24abd93e2906facf67f8941e340627393b8c3463d"}},{"ruleId":"D1","level":"warning","message":{"text":"MemberPairRollup.Aggregate (cyclomatic 23): MemberPairRollup.Aggregate has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/CodeShape/MemberPairRollup.cs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"211b1a3504b55b2e12db8a3696740a0b8e8b5dba97190d4c028ec0b2a74f42a7"}},{"ruleId":"D1","level":"warning","message":{"text":"QuotedTextMask.Mask (cyclomatic 23): QuotedTextMask.Mask has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/CodeShape/QuotedTextMask.cs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"c43552db405d70caf90ede956a6618c5e8ae8cffb50affc81a463194c6328f87"}},{"ruleId":"D1","level":"warning","message":{"text":"RoslynDuplicationDetector.AppendCopiedFileClones (cyclomatic 23): RoslynDuplicationDetector.AppendCopiedFileClones has cyclomatic complexity 23 (threshold 15). Of this number, 21 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":"engine/src/CodeHealth.Core/CodeShape/RoslynDuplicationDetector.cs"},"region":{"startLine":1324}}}],"partialFingerprints":{"codehealthFindingId/v1":"46fc7f887fa989bccd7ace87d07c769579f443334ae697135089d3a3be5a2226"}},{"ruleId":"D1","level":"warning","message":{"text":"Subsumption.Implies (cyclomatic 23): Subsumption.Implies has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/CodeShape/Subsumption.cs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"163eb8901538c8aaeb3bd3a2415cf59be815bc907ca95fb67a315782755e10d6"}},{"ruleId":"D1","level":"warning","message":{"text":"ComplianceSecurityAnalyzer.ResolveDeclaredTypeName (cyclomatic 23): ComplianceSecurityAnalyzer.ResolveDeclaredTypeName has cyclomatic complexity 23 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 5 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":"engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs"},"region":{"startLine":1964}}}],"partialFingerprints":{"codehealthFindingId/v1":"5169338edcf3a779d05def911bc113fab7d44d82bdec8db82e6ec6eb63fe5587"}},{"ruleId":"D1","level":"warning","message":{"text":"ComplianceSecurityAnalyzer.ScanStaticEncryptionIv (cyclomatic 23): ComplianceSecurityAnalyzer.ScanStaticEncryptionIv has cyclomatic complexity 23 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs"},"region":{"startLine":2181}}}],"partialFingerprints":{"codehealthFindingId/v1":"f31f495c97371e7c3a853ba8d6b55607a7487e66c5bb31e02470a32076109402"}},{"ruleId":"D1","level":"warning","message":{"text":"DartDeadLibraryField.IsFieldDeclaration (cyclomatic 23): DartDeadLibraryField.IsFieldDeclaration has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Dart/DartDeadLibraryField.cs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"062b55b8ff8a4b7bf25d20167742c25deef0697a7f93d81adb73c20ce497ee52"}},{"ruleId":"D1","level":"warning","message":{"text":"RoslynExplicitDebtCollector.CollectInvertedNullGuards (cyclomatic 23): RoslynExplicitDebtCollector.CollectInvertedNullGuards has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ExplicitDebt/RoslynExplicitDebtCollector.cs"},"region":{"startLine":868}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0737696dfb5f141bc1eb74ec8cebbb91910441f0f0b479d4f1efb06e642bd11"}},{"ruleId":"D1","level":"warning","message":{"text":"FrontendBoundaries.CollectThirdPartyBuildOutputImports (cyclomatic 23): FrontendBoundaries.CollectThirdPartyBuildOutputImports has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/FrontendBoundaries.cs"},"region":{"startLine":1786}}}],"partialFingerprints":{"codehealthFindingId/v1":"79a87ed6dc738c16012313d3f525c0b164cec4d08275cc68b1ae63ea744e7966"}},{"ruleId":"D1","level":"warning","message":{"text":"FrontendEmittedTemplateRefs.CollectGeneratedModuleEmitters (cyclomatic 23): FrontendEmittedTemplateRefs.CollectGeneratedModuleEmitters has cyclomatic complexity 23 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/FrontendEmittedTemplateRefs.cs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"f32d559d34d7fbba235986d57c244e2f34f1784c52ada8167800bcbb4d3acf14"}},{"ruleId":"D1","level":"warning","message":{"text":"FrontendTestAndDocRefs.AddImportMapKeys (cyclomatic 23): FrontendTestAndDocRefs.AddImportMapKeys has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/FrontendTestAndDocRefs.cs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"eea8d6a548aa146d22734f081ecaf2c5cdf2e242508386d70512f360b9aaba94"}},{"ruleId":"D1","level":"warning","message":{"text":"JsDuplicationDetector.TryHashWindow (cyclomatic 23): JsDuplicationDetector.TryHashWindow has cyclomatic complexity 23 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs"},"region":{"startLine":2861}}}],"partialFingerprints":{"codehealthFindingId/v1":"41fe46161583096336e78fb74241c94aeeedeb939010813d097183a024111b81"}},{"ruleId":"D1","level":"warning","message":{"text":"JsFunctionScanner.IsClassHeaderClose (cyclomatic 23): JsFunctionScanner.IsClassHeaderClose has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: JsFunctionScanner.ClassifyOpenBrace (cyclomatic 30) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/JsFunctionScanner.cs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"025f4a6a84df16ad9ecb57adea9ed5d7ad8127c11c590cd5ef89fd68eb1d53f5"}},{"ruleId":"D1","level":"warning","message":{"text":"Scanner.ScanOnce (cyclomatic 23): Scanner.ScanOnce has cyclomatic complexity 23 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/JsLexer.cs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1c19f2acd4411bac93d90ba36166854c355e2b18141a508ca4f32590c831196"}},{"ruleId":"D1","level":"warning","message":{"text":"JsScopeBindings.BindDeclarators (cyclomatic 23): JsScopeBindings.BindDeclarators has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/JsScopeBindings.cs"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"1392d25d0b9edca32daaa2c9ded612a7c334198247c536574598a2c82d81a567"}},{"ruleId":"D1","level":"warning","message":{"text":"CoherenceSmellAnalyzer.Implies (cyclomatic 23): CoherenceSmellAnalyzer.Implies has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/CoherenceSmellAnalyzer.cs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"6571373346cbf39c64e8c39dd706b8e6861f79b84cf44cb3b498f01e713e6b0e"}},{"ruleId":"D1","level":"warning","message":{"text":"DataShapeSmellAnalyzer.AnalyzeAsync (cyclomatic 23): DataShapeSmellAnalyzer.AnalyzeAsync has cyclomatic complexity 23 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/DataShapeSmellAnalyzer.cs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"6016d24465a46d586c6c35193576dc37eca2b939b4bf69192381d02539253180"}},{"ruleId":"D1","level":"warning","message":{"text":"DomainModelAnalyzer.StronglyTypedIds (cyclomatic 23): DomainModelAnalyzer.StronglyTypedIds has cyclomatic complexity 23 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 8 belong to 2 function literals inside it that branch. To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs"},"region":{"startLine":2156}}}],"partialFingerprints":{"codehealthFindingId/v1":"7566955ab7c0af2ee0f2e35300f494e7b62d6564b8f89d269cdd574f09d180ed"}},{"ruleId":"D1","level":"warning","message":{"text":"DomainComplexityClassifier.Classify (cyclomatic 23): DomainComplexityClassifier.Classify has cyclomatic complexity 23 (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":"engine/src/CodeHealth.Core/Scoring/DomainComplexity.cs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"238f5f48f93683aeaf8f8a8bc3110d6b833777f7b933e3d52b0a06923ad40b95"}},{"ruleId":"D1","level":"warning","message":{"text":"CommittedCoverageReader.MergeXmlPerFile (cyclomatic 23): CommittedCoverageReader.MergeXmlPerFile has cyclomatic complexity 23 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, 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":"engine/src/CodeHealth.Core/Testing/CommittedCoverageReader.cs"},"region":{"startLine":957}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd20927ca83501621a3ef7e3bb63567f8d5c33386f991c0941f3d2d6992699c9"}},{"ruleId":"D1","level":"warning","message":{"text":"CommittedCoverageReader.MergeIstanbulJsonPerFile (cyclomatic 23): CommittedCoverageReader.MergeIstanbulJsonPerFile has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Testing/CommittedCoverageReader.cs"},"region":{"startLine":1179}}}],"partialFingerprints":{"codehealthFindingId/v1":"d62b55fbd2c48d0b46fde3833ebbf0ed1ebf97d826bfca16eff82a7da8a34b8d"}},{"ruleId":"D1","level":"warning","message":{"text":"DotnetTestReliabilityCollector.CollectAsync (cyclomatic 23): DotnetTestReliabilityCollector.CollectAsync has cyclomatic complexity 23 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, 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":"engine/src/CodeHealth.Core/Testing/DotnetTestReliabilityCollector.cs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c25ebfe331a20b30a0039d54b23b9697e01d3c9ef9b2e6b525d5f87c8de8bc7"}},{"ruleId":"D1","level":"warning","message":{"text":"NodeTestSuiteProbe.ChooseRunner (cyclomatic 23): NodeTestSuiteProbe.ChooseRunner has cyclomatic complexity 23 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: 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":"engine/src/CodeHealth.Core/Testing/NodeTestSuiteProbe.cs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b0197436853d245beab63012ae72d279bf2b80657e1a3682332e874de1d93d3"}},{"ruleId":"D1","level":"warning","message":{"text":"RoslynTestQualityCollector.CollectAsync (cyclomatic 23): RoslynTestQualityCollector.CollectAsync has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Testing/RoslynTestQualityCollector.cs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a50855ec4ec957fd5b1b062aec54503aa74a7b5ebb9b9fbed236a1f8ce22d22"}},{"ruleId":"D1","level":"warning","message":{"text":"ReportViewModelFactory.BuildArchGraphCore (cyclomatic 23): ReportViewModelFactory.BuildArchGraphCore has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Reporting/Templates/ReportViewModelFactory.cs"},"region":{"startLine":2506}}}],"partialFingerprints":{"codehealthFindingId/v1":"845ce9e52f17521ee30887a89a85f4db2305864cd2919da318f57a3b892ae957"}},{"ruleId":"D1","level":"warning","message":{"text":"DuplicationAnalyzer.DivergentTypeBindingCaveat (cyclomatic 23): DuplicationAnalyzer.DivergentTypeBindingCaveat has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.CodeQuality/CodeShape/DuplicationAnalyzer.cs"},"region":{"startLine":1800}}}],"partialFingerprints":{"codehealthFindingId/v1":"4423f309fb8c11f45c57ae25220d9a6e72c91a36d0b90b06ec1145c9d8e59ea4"}},{"ruleId":"D1","level":"warning","message":{"text":"ConfigCredentialBindingScan.FindingsInFile (cyclomatic 23): ConfigCredentialBindingScan.FindingsInFile has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/ConfigCredentialBindingScan.cs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"78be6a6558d8553b9c7b4cd93dbf972afa7214fc449010e60741184ad3444b1f"}},{"ruleId":"D1","level":"warning","message":{"text":"CSharpTokenizer.ReadStringLiteral (cyclomatic 23): CSharpTokenizer.ReadStringLiteral has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/SqlBuilderCompositionWalk.cs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5f968e3ba846b73b0f5f93224b7c2f451d3d74936e0c12c5cadc1824542b41f"}},{"ruleId":"D1","level":"warning","message":{"text":"XmlBuildOnlyRecheck.XmlUseIsBuildOnly (cyclomatic 23): XmlBuildOnlyRecheck.XmlUseIsBuildOnly has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/XmlBuildOnlyRecheck.cs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"80bf239de3a340c112a8c7b3e5df04e407a7d5f52e6d38af8ee971f93846b2bc"}},{"ruleId":"D1","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.ReleaseAssetUploadJobsText (cyclomatic 23): SupplyChainProvenanceAnalyzer.ReleaseAssetUploadJobsText has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":5516}}}],"partialFingerprints":{"codehealthFindingId/v1":"df6c82f03a93c2e693cd06fe9d156aaff919b464a10886752f74a78086a62ffd"}},{"ruleId":"D1","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.PushTriggerFilters (cyclomatic 23): SupplyChainProvenanceAnalyzer.PushTriggerFilters has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":7233}}}],"partialFingerprints":{"codehealthFindingId/v1":"f61f58b073fcea3b2d1ad1ddfa20eed32aa3082b6433ca36ebf8e2648971bfc2"}},{"ruleId":"D1","level":"warning","message":{"text":"ChangeCouplingAnalyzer.RustVariantsOf (cyclomatic 23): ChangeCouplingAnalyzer.RustVariantsOf has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.GitMining/ChangeCouplingAnalyzer.cs"},"region":{"startLine":4142}}}],"partialFingerprints":{"codehealthFindingId/v1":"680178ea0bfe412a2b64335135ddae63fa68f7ee96e23b16633a1f4d2c67fa05"}},{"ruleId":"D1","level":"warning","message":{"text":"KnowledgeDecayModel.LastSubstantiveAuthorStillActive (cyclomatic 23): KnowledgeDecayModel.LastSubstantiveAuthorStillActive has cyclomatic complexity 23 (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":"engine/src/CodeHealth.Dimensions.GitMining/KnowledgeDecayModel.cs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba0a8897cde8c27d99b00f80afb69d59056174933e67d74ad8dc892835ca9888"}},{"ruleId":"D1","level":"warning","message":{"text":"verify-documentation-paths.main (cyclomatic 23): verify-documentation-paths.main has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deploy/verify-documentation-paths.py"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"366c6303ae335f833395a9a3275d0fb69c992fb77fb127b73160881ae1f96337"}},{"ruleId":"D1","level":"warning","message":{"text":"build_gitlab_manifest.main (cyclomatic 23): build_gitlab_manifest.main has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/multilang/build_gitlab_manifest.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a4b3747773ddc807a756d3a54a0377677aadca86a049e402ede0e7c77405dbc"}},{"ruleId":"D1","level":"warning","message":{"text":"backlog-drop-unreachable.main (cyclomatic 23): backlog-drop-unreachable.main has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/ops/backlog-drop-unreachable.py"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a379259bc6144ed65ff83f2a30d41d1962b3b86b2c12f030d427187ba5aeed9"}},{"ruleId":"D1","level":"warning","message":{"text":"bench.main (cyclomatic 23): bench.main has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/qwen-eval/bench.py"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5296b6e902f2bd0a4a70de868551ed39083e78c81893933a3e8c475156a499f"}},{"ruleId":"D1","level":"warning","message":{"text":"prove-gap-channel-separation.main (cyclomatic 23): prove-gap-channel-separation.main has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/prove-gap-channel-separation.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"e57ba4f981d2bb5157ca838fe85621a824682347c189929a2c38a8c4514fe6d3"}},{"ruleId":"D1","level":"warning","message":{"text":"report_round.build_rows (cyclomatic 23): report_round.build_rows has cyclomatic complexity 23 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/report_round.py"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e14f49e06d56ea3244aef048e89a09bd24839e2fe65f897078114344151e38f"}},{"ruleId":"D1","level":"warning","message":{"text":"scope-evidence.value_provenance_evidence (cyclomatic 23): scope-evidence.value_provenance_evidence has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/scope-evidence.py"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"5916bb3921fc2c775c024b0f9b219d185de987538b956fe98cc3e4d1380d20be"}},{"ruleId":"D1","level":"warning","message":{"text":"sidecarlib.arm_status (cyclomatic 23): sidecarlib.arm_status has cyclomatic complexity 23 (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":"tools/train/sidecarlib.py"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bc921619433f443570e1b75a1b6e14682fafc710e5bce4fb005854372398ede"}},{"ruleId":"D1","level":"warning","message":{"text":"Model::resolve (cyclomatic 23): Model::resolve has cyclomatic complexity 23 (threshold 15). 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":"engine/sidecars/rust-frontend/src/main.rs"},"region":{"startLine":1095}}}],"partialFingerprints":{"codehealthFindingId/v1":"57e73e435a552b686b1ae90c419cac19464d6a11e806d62e420049be6d0f766c"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::lcApply (cyclomatic 23): (anonymous)::lcApply has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Kennel.Ui/wwwroot/kennel-ui.js"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4b271eb572168248320ab2864a8c03bf03f395278fe5855da97f7170c74cde1"}},{"ruleId":"D1","level":"warning","message":{"text":"SourceClassifier.CountCatalogueLines (cyclomatic 22): SourceClassifier.CountCatalogueLines 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":"engine/src/CodeHealth.Core/Classification/SourceClassifier.cs"},"region":{"startLine":1336}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2b090fc4ba0666d9005d4b4ddd18d3a7d179f8ee432ef35ede4ef3bd5978c54"}},{"ruleId":"D1","level":"warning","message":{"text":"ComplianceSecurityAnalyzer.KeyMaterialArgument (cyclomatic 22): ComplianceSecurityAnalyzer.KeyMaterialArgument has cyclomatic complexity 22 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs"},"region":{"startLine":3231}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d8049b16a55ba201eaad8b5cb9d3b374c5a40526c57161430522d1bbbfb441c"}},{"ruleId":"D1","level":"warning","message":{"text":"SwiftPackageHygiene.Read (cyclomatic 22): SwiftPackageHygiene.Read 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":"engine/src/CodeHealth.Core/Dependencies/SwiftPackageHygiene.cs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3ad7dfaf5b6effd4b6f47a245d6b9d03dae490e292b1eff3e43253ad5c5256d"}},{"ruleId":"D1","level":"warning","message":{"text":"FrontendEmittedTemplateRefs.CollectBundleEntries (cyclomatic 22): FrontendEmittedTemplateRefs.CollectBundleEntries 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":"engine/src/CodeHealth.Core/Frontend/FrontendEmittedTemplateRefs.cs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"04fd490714a047eb4804e76e01f930701ed41faa32b4f59eb7a326c26a53c7fb"}},{"ruleId":"D1","level":"warning","message":{"text":"FrontendEmittedTemplateRefs.ResolveEmittedTemplateDirectory (cyclomatic 22): FrontendEmittedTemplateRefs.ResolveEmittedTemplateDirectory 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":"engine/src/CodeHealth.Core/Frontend/FrontendEmittedTemplateRefs.cs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8bf6358be9a5ca9e9221f2f0789664e2517d794a7b6e656bef5aa02c9b9f863"}},{"ruleId":"D1","level":"warning","message":{"text":"FrontendTestReachability.IsBehaviourFreeDataModule (cyclomatic 22): FrontendTestReachability.IsBehaviourFreeDataModule has cyclomatic complexity 22 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/FrontendTestReachability.cs"},"region":{"startLine":1320}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad092e474bcdd20032435ec2de1bb37aae640f345284fe8a73c05504d64b28a7"}},{"ruleId":"D1","level":"warning","message":{"text":"JsComplexity.ComputeCognitive (cyclomatic 22): JsComplexity.ComputeCognitive 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":"engine/src/CodeHealth.Core/Frontend/JsComplexity.cs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"338f1a9df0bc793830b34e35d9c189b1ffcb9d88fd147af4e2a0b202a1c50ee4"}},{"ruleId":"D1","level":"warning","message":{"text":"JsDuplicationDetector.DetectEditedCopies (cyclomatic 22): JsDuplicationDetector.DetectEditedCopies 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":"engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs"},"region":{"startLine":4902}}}],"partialFingerprints":{"codehealthFindingId/v1":"271e17dbc4f35d9b114f97c376c9068e50404fba2f768c230decc18d6f9e2733"}},{"ruleId":"D1","level":"warning","message":{"text":"JsFunctionScanner.SkipTypeParameters (cyclomatic 22): JsFunctionScanner.SkipTypeParameters 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. This is NOT this file\u0027s highest cyclomatic complexity: JsFunctionScanner.ClassifyOpenBrace (cyclomatic 30) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/JsFunctionScanner.cs"},"region":{"startLine":949}}}],"partialFingerprints":{"codehealthFindingId/v1":"53b0e2382c89f8b555d6f5b4d0370830289ee54a4145ecb633bf63c8a641188b"}},{"ruleId":"D1","level":"warning","message":{"text":"Scanner.SkipTrivia (cyclomatic 22): Scanner.SkipTrivia 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":"engine/src/CodeHealth.Core/Frontend/JsLexer.cs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"edfa66ec9c1b8435db141264f4694a2de6d90cd6548c957075a6891354872f76"}},{"ruleId":"D1","level":"warning","message":{"text":"ModuleSyntaxScanner.ScanCommentTypeImports (cyclomatic 22): ModuleSyntaxScanner.ScanCommentTypeImports 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":"engine/src/CodeHealth.Core/Frontend/ModuleSyntaxScanner.cs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"e73d0f5c76c2d8a612d0eb4e6a494d43f37a56a35e7fbfc617bc79b162a6166d"}},{"ruleId":"D1","level":"warning","message":{"text":"ModuleSyntaxScanner.DestructuredAwaitSymbols (cyclomatic 22): ModuleSyntaxScanner.DestructuredAwaitSymbols 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":"engine/src/CodeHealth.Core/Frontend/ModuleSyntaxScanner.cs"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f8ae9bda7edfe88c3cde72568edc6eb7c252b93bd1d731cdfd127ccabaceba6"}},{"ruleId":"D1","level":"warning","message":{"text":"DomainModelAnalyzer.AnalyzeAsync (cyclomatic 22): DomainModelAnalyzer.AnalyzeAsync 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":"engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"215db3b4c0474e1a230c2b7d181943801cf4c1ccc9ed5127893838be118e7750"}},{"ruleId":"D1","level":"warning","message":{"text":"DomainModelAnalyzer.IntegrationEventCoupling (cyclomatic 22): DomainModelAnalyzer.IntegrationEventCoupling has cyclomatic complexity 22 (threshold 15). Of this number, 18 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":"engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs"},"region":{"startLine":2266}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb0e641564ec379de815f8a769417b29156537783481a4add386b17ef64b0479"}},{"ruleId":"D1","level":"warning","message":{"text":"DomainModelAnalyzer.AddGoDomainInfraLeaks (cyclomatic 22): DomainModelAnalyzer.AddGoDomainInfraLeaks has cyclomatic complexity 22 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs"},"region":{"startLine":4758}}}],"partialFingerprints":{"codehealthFindingId/v1":"c226699892cdb88f1f71bae9662b0af5aabc835cce499310ea5ce6242cc0034f"}},{"ruleId":"D1","level":"warning","message":{"text":"LogicDefectAnalyzer.InspectDroppedDisposalDuty (cyclomatic 22): LogicDefectAnalyzer.InspectDroppedDisposalDuty has cyclomatic complexity 22 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 10 belong to 7 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/LogicDefectAnalyzer.cs"},"region":{"startLine":1644}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfe79265c27c9bbaf97162d79446756576a5f70688fb66a81d599a0dbb47f1e9"}},{"ruleId":"D1","level":"warning","message":{"text":"PerformanceAnalyzer.CollectAsync (cyclomatic 22): PerformanceAnalyzer.CollectAsync 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":"engine/src/CodeHealth.Core/ModelAware/PerformanceAnalyzer.cs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"f19386ac619c2b7284c9d211af4bc9c67ffedfc323ac42f3fea7558cafc73a3b"}},{"ruleId":"D1","level":"warning","message":{"text":"DiskTestScanner.UnreadableTestSources (cyclomatic 22): DiskTestScanner.UnreadableTestSources 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":"engine/src/CodeHealth.Core/Testing/DiskTestScanner.cs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"d744aefef8889d9b30a19f686e8e99c0f5be859efc24d3b2e6e931eceb6c9da4"}},{"ruleId":"D1","level":"warning","message":{"text":"ChangelogNarrator.SemanticDedupeAsync (cyclomatic 22): ChangelogNarrator.SemanticDedupeAsync 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":"engine/src/CodeHealth.Reporting/Changelog/ChangelogNarrator.cs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"d41dbdc6a445232d37aca84a99bca7a730a1ef467168eed0b94017f6b17afd8a"}},{"ruleId":"D1","level":"warning","message":{"text":"RuleRecommendationEngine.ForMeta (cyclomatic 22): RuleRecommendationEngine.ForMeta 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":"engine/src/CodeHealth.Reporting/Recommendations/RuleRecommendationEngine.cs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc709af11941a8502989bc07e5884e6d859b97a6539e0c9951f0425f874a8dab"}},{"ruleId":"D1","level":"warning","message":{"text":"InternalApiConsistencyAnalyzer.RunAsync (cyclomatic 22): InternalApiConsistencyAnalyzer.RunAsync has cyclomatic complexity 22 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, 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":"engine/src/CodeHealth.Dimensions.Architecture/InternalApiConsistencyAnalyzer.cs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd1605859c904e767f8a50be1bbcbaeb275a1cb5a6376bf3ad9b13c576f6eac0"}},{"ruleId":"D1","level":"warning","message":{"text":"DuplicationAnalyzer.RunAsync (cyclomatic 22): DuplicationAnalyzer.RunAsync has cyclomatic complexity 22 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, 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":"engine/src/CodeHealth.Dimensions.CodeQuality/CodeShape/DuplicationAnalyzer.cs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"c903a7ae6e6fb3c29b29cc82bfee37144f1b009c73f145b5e9fa11702d702a9e"}},{"ruleId":"D1","level":"warning","message":{"text":"SecretsHistoryAnalyzer.GateRenamedIntoTestTreeFindingsAsync (cyclomatic 22): SecretsHistoryAnalyzer.GateRenamedIntoTestTreeFindingsAsync 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":"engine/src/CodeHealth.Dimensions.Security/SecretsHistoryAnalyzer.cs"},"region":{"startLine":2127}}}],"partialFingerprints":{"codehealthFindingId/v1":"84490f9337bd9d08071fd1dcbf9d6fd82d38d5fdcc0deac88b5876ff429916d2"}},{"ruleId":"D1","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.PrTriggeredWorkflowsGrantingWrite (cyclomatic 22): SupplyChainProvenanceAnalyzer.PrTriggeredWorkflowsGrantingWrite has cyclomatic complexity 22 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":7795}}}],"partialFingerprints":{"codehealthFindingId/v1":"e560fdad63792a4df8084630a8bcbb7fe0ac71ad95b4274295d764a47d3ed55a"}},{"ruleId":"D1","level":"warning","message":{"text":"JvmProvider.Build (cyclomatic 22): JvmProvider.Build has cyclomatic complexity 22 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, 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":"engine/src/CodeHealth.CodeModel.Jvm/JvmProvider.cs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebca6b5dcafc0105e8e02b9880469004cb86593800c9da66a1e98af1e6a75b59"}},{"ruleId":"D1","level":"warning","message":{"text":"Emitter.emitType (cyclomatic 22): Emitter.emitType has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/scala-frontend/src/main/scala/dev/canine/codehealth/scala/Emitter.scala"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0346608cd24a33786654dc820c9e6c7ee61fa5168a20d760895ecb0618b75fe"}},{"ruleId":"D1","level":"warning","message":{"text":"build_dimension_noise.main (cyclomatic 22): build_dimension_noise.main 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":"tools/depthnoise/build_dimension_noise.py"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e88f8e472deeb28d72909fc95cbb6e81b6efbf50863abe531adf8515baf4762"}},{"ruleId":"D1","level":"warning","message":{"text":"bakeoff.score_run (cyclomatic 22): bakeoff.score_run 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":"tools/llm-bakeoff/bakeoff.py"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"fac636f5a57bcbdc93306ec7e7298ec2f02f6792a0b3180df752d836df62b7aa"}},{"ruleId":"D1","level":"warning","message":{"text":"bench.run_agent (cyclomatic 22): bench.run_agent 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":"tools/qwen-eval/bench.py"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e557a76b19a4555a3d3f7a8afe8fca552c3100d3d6c37ab480fc650e8677395"}},{"ruleId":"D1","level":"warning","message":{"text":"analyse.main (cyclomatic 22): analyse.main has cyclomatic complexity 22 (threshold 15). 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":"tools/rescan/analyse.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"1094b0349111e45147686866cb635343461d8368df270ed2d943f4e4fa101b7b"}},{"ruleId":"D1","level":"warning","message":{"text":"BranchWalker.walk (cyclomatic 22): BranchWalker.walk has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/swift-frontend/Sources/codehealth-swift-sidecar/Body.swift"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"af2850a42eb0ebc7effe70b684ee70b4b745abcc4b8e0ad5596802d49eb7c523"}},{"ruleId":"D1","level":"warning","message":{"text":"ChainedFamilyRollup.Append (cyclomatic 21): ChainedFamilyRollup.Append has cyclomatic complexity 21 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/CodeShape/ChainedFamilyRollup.cs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"49491f72b57b60e1862ea73d364e504facd6b2b44140cf291f8f3ee96a557728"}},{"ruleId":"D1","level":"warning","message":{"text":"QuotedTextMask.MaskStringLiteral (cyclomatic 21): QuotedTextMask.MaskStringLiteral 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":"engine/src/CodeHealth.Core/CodeShape/QuotedTextMask.cs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"f356ad330e1e29ebdf817449a4be4cba640bcd9e367af74d7a1ce86de50125ac"}},{"ruleId":"D1","level":"warning","message":{"text":"RoslynDuplicationDetector.AppendMultiplicitySites (cyclomatic 21): RoslynDuplicationDetector.AppendMultiplicitySites 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":"engine/src/CodeHealth.Core/CodeShape/RoslynDuplicationDetector.cs"},"region":{"startLine":1744}}}],"partialFingerprints":{"codehealthFindingId/v1":"16c59fab8f3a5d8fab8c7f5618679994f9cb34907437fc72bb6ec8fb59816378"}},{"ruleId":"D1","level":"warning","message":{"text":"CyclomaticComplexityCalculator.ComputeAsync (cyclomatic 21): CyclomaticComplexityCalculator.ComputeAsync 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":"engine/src/CodeHealth.Core/Complexity/CyclomaticComplexityCalculator.cs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"d61edb01ee0fada4df84f89d252b87b991f9916b936e693b7090f9a1cc815f5c"}},{"ruleId":"D1","level":"warning","message":{"text":"BundlerManifestHygiene.ParseDeclarations (cyclomatic 21): BundlerManifestHygiene.ParseDeclarations 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":"engine/src/CodeHealth.Core/Dependencies/BundlerManifestHygiene.cs"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1365d2e8501a55077f6956c92ef36db76b4df8621c904fe0ee2d771eab075d1"}},{"ruleId":"D1","level":"warning","message":{"text":"EggMiddlewareNameRefs.StripComments (cyclomatic 21): EggMiddlewareNameRefs.StripComments has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/EggMiddlewareNameRefs.cs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"953a0dbed3edd0c7ae02e357964fac9286d866acf4c1ee8b7296f07b7f1b5901"}},{"ruleId":"D1","level":"warning","message":{"text":"EntryPointCatalog.DetectTooling (cyclomatic 21): EntryPointCatalog.DetectTooling has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/EntryPointCatalog.cs"},"region":{"startLine":984}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ce3b488b08d72a2a9c39d4290867eafecbbd54607e640f3b32147bc090824f9"}},{"ruleId":"D1","level":"warning","message":{"text":"FrontendScriptCommandRefs.CollectToolCommandTokens (cyclomatic 21): FrontendScriptCommandRefs.CollectToolCommandTokens has cyclomatic complexity 21 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/FrontendScriptCommandRefs.cs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c34bc555e3ee5d2433b53392620c61c1701876eb74231f132e933e31d68c90f"}},{"ruleId":"D1","level":"warning","message":{"text":"JsConstantOnlyField.IsExported (cyclomatic 21): JsConstantOnlyField.IsExported 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":"engine/src/CodeHealth.Core/Frontend/JsConstantOnlyField.cs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec050f6732c58d17dc3c1e1ec50fb4600f01656e7e1004888ca1f5b69d0ceffc"}},{"ruleId":"D1","level":"warning","message":{"text":"JsDuplicationDetector.MergeNearCloneExtents (cyclomatic 21): JsDuplicationDetector.MergeNearCloneExtents has cyclomatic complexity 21 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs"},"region":{"startLine":4099}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a7518df009edd652b04380742d0f6d1e6d158c82866e48730ce863acbc0fa3c"}},{"ruleId":"D1","level":"warning","message":{"text":"JsDuplicationDetector.IsTypeMemberList (cyclomatic 21): JsDuplicationDetector.IsTypeMemberList has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs"},"region":{"startLine":7640}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ff3b78214eea72d41a3f5ecf55143d4811ab07d03caffff11b0ddbb6f4c7d2c"}},{"ruleId":"D1","level":"warning","message":{"text":"JsFunctionScanner.NameBeforeTypeAnnotation (cyclomatic 21): JsFunctionScanner.NameBeforeTypeAnnotation 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. This is NOT this file\u0027s highest cyclomatic complexity: JsFunctionScanner.ClassifyOpenBrace (cyclomatic 30) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/JsFunctionScanner.cs"},"region":{"startLine":1109}}}],"partialFingerprints":{"codehealthFindingId/v1":"e64dd86124466ea3861448b2b2749fb9874893c6e9ccd8f71ed9914a6680db71"}},{"ruleId":"D1","level":"warning","message":{"text":"ModuleResolver.Resolve (cyclomatic 21): ModuleResolver.Resolve 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":"engine/src/CodeHealth.Core/Frontend/ModuleResolver.cs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"390daecfbad66a47360bb902d94eae44508e1665933685e7c092038e029e113a"}},{"ruleId":"D1","level":"warning","message":{"text":"IndentedMarkupProducer.ReadValue (cyclomatic 21): IndentedMarkupProducer.ReadValue 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":"engine/src/CodeHealth.Core/Markup/IndentedMarkupProducer.cs"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"09e8e120ffc4ab1562d09e007538d332a8ea97150c6651d8e38530dd8aa6f1a0"}},{"ruleId":"D1","level":"warning","message":{"text":"DomainConventions.IsDomainEvent (cyclomatic 21): DomainConventions.IsDomainEvent 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":"engine/src/CodeHealth.Core/ModelAware/DomainConventions.cs"},"region":{"startLine":1040}}}],"partialFingerprints":{"codehealthFindingId/v1":"50ac26dd23f8a417a00b333f43d6ca121962f5f93a5922c0951c8884f7a327b0"}},{"ruleId":"D1","level":"warning","message":{"text":"EventDrivenAnalyzer.SyncInHandler (cyclomatic 21): EventDrivenAnalyzer.SyncInHandler 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":"engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs"},"region":{"startLine":1285}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9cb5ac335676afc1cf1db7ee3dd9f8cc293e050676ed4876c82a835dadd25e8"}},{"ruleId":"D1","level":"warning","message":{"text":"IncompletenessAnalyzer.IsTrivialValue (cyclomatic 21): IncompletenessAnalyzer.IsTrivialValue has cyclomatic complexity 21 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/IncompletenessAnalyzer.cs"},"region":{"startLine":3149}}}],"partialFingerprints":{"codehealthFindingId/v1":"68d83604242890ccdd9a5447a77aa1d8102fd5524b113f8c4d62841295f7ccf9"}},{"ruleId":"D1","level":"warning","message":{"text":"LogicDefectAnalyzer.EmptinessClaim (cyclomatic 21): LogicDefectAnalyzer.EmptinessClaim has cyclomatic complexity 21 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/LogicDefectAnalyzer.cs"},"region":{"startLine":4437}}}],"partialFingerprints":{"codehealthFindingId/v1":"db792b84106494ef2ec2cb30938ea9280f603250553c82113b8f3b2a0d28c496"}},{"ruleId":"D1","level":"warning","message":{"text":"OperabilityExtrasAnalyzer.LibraryPublicApiAsync (cyclomatic 21): OperabilityExtrasAnalyzer.LibraryPublicApiAsync 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":"engine/src/CodeHealth.Core/ModelAware/OperabilityExtrasAnalyzer.cs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a26db5f1de5d0d8e591356425416c969de62beac6c584c66c596afc3622be67"}},{"ruleId":"D1","level":"warning","message":{"text":"CiGateDetection.SoftFailedAt (cyclomatic 21): CiGateDetection.SoftFailedAt 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":"engine/src/CodeHealth.Core/Scoring/CiGateDetection.cs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"abf281c95cf3c9c2ef9b44ce8a8aff584616bfc69aa4d6ce541f883334eb48d7"}},{"ruleId":"D1","level":"warning","message":{"text":"CommittedCoverageReader.ParseXml (cyclomatic 21): CommittedCoverageReader.ParseXml 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":"engine/src/CodeHealth.Core/Testing/CommittedCoverageReader.cs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"604a8962c3b90b44abf6afaf41591258c47bda883ce92327c85eec709ff1e681"}},{"ruleId":"D1","level":"warning","message":{"text":"CommittedCoverageReader.MergeSimpleCovJsonPerFile (cyclomatic 21): CommittedCoverageReader.MergeSimpleCovJsonPerFile 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":"engine/src/CodeHealth.Core/Testing/CommittedCoverageReader.cs"},"region":{"startLine":1299}}}],"partialFingerprints":{"codehealthFindingId/v1":"21b6a6672425901e531a213e82b4a2d289e62567dc76e2da938348307d653ac9"}},{"ruleId":"D1","level":"warning","message":{"text":"ArchGraphSvg.Render (cyclomatic 21): ArchGraphSvg.Render has cyclomatic complexity 21 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, 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":"engine/src/CodeHealth.Reporting/Svg/ArchGraphSvg.cs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"1837e733f8b48f8f5198be349d6441868e5b812e7ce17a0c43c8a958739f1649"}},{"ruleId":"D1","level":"warning","message":{"text":"DeclaredDependencies.FromManifests (cyclomatic 21): DeclaredDependencies.FromManifests 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/DeclaredDependencies.cs"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d977424a273d6a268ebdff9a812ccfbff1bcd262583d6471d255a6ea8fb9341"}},{"ruleId":"D1","level":"warning","message":{"text":"DeclaredDependencies.Classify (cyclomatic 21): DeclaredDependencies.Classify has cyclomatic complexity 21 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/DeclaredDependencies.cs"},"region":{"startLine":1314}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa6ad41ace15327c51e16adfe1f2093aeddd102e9aa4da63416432fcff1da22b"}},{"ruleId":"D1","level":"warning","message":{"text":"JsSiblingScopeReadScan.ParameterListSpans (cyclomatic 21): JsSiblingScopeReadScan.ParameterListSpans 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/JsSiblingScopeReadScan.cs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4eac220df1d5c6b8a33ad2600d084ecfd9b82e1f657ce89b185d8cda5ba49d4"}},{"ruleId":"D1","level":"warning","message":{"text":"OsvScannerIgnores.Parse (cyclomatic 21): OsvScannerIgnores.Parse 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/OsvScannerIgnores.cs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"e39602812b1796a6821697cb862d077e0bcb6becfdda0d2c54735f9c857b5e5c"}},{"ruleId":"D1","level":"warning","message":{"text":"FileModel.SpanCoversTheRawAppend (cyclomatic 21): FileModel.SpanCoversTheRawAppend has cyclomatic complexity 21 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/SqlBuilderCompositionWalk.cs"},"region":{"startLine":1352}}}],"partialFingerprints":{"codehealthFindingId/v1":"32c4cd60b2a9d4575ab159464c1d9e6e01ecb89434e2b7e4f4a1eb34b7115ec6"}},{"ruleId":"D1","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.MovingPythonGitDependencies (cyclomatic 21): SupplyChainProvenanceAnalyzer.MovingPythonGitDependencies 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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":1820}}}],"partialFingerprints":{"codehealthFindingId/v1":"b577e495d20b89d7bd5cd327311b671eefd392b027113defa44af50c978d726c"}},{"ruleId":"D1","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.NpmWorkspacePatterns (cyclomatic 21): SupplyChainProvenanceAnalyzer.NpmWorkspacePatterns 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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":4107}}}],"partialFingerprints":{"codehealthFindingId/v1":"577970a25ff2958190f6866d444e13eb63a6f3d353bfdecead05e75fd9cb83df"}},{"ruleId":"D1","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.UninvokedRegistryPublishPath (cyclomatic 21): SupplyChainProvenanceAnalyzer.UninvokedRegistryPublishPath has cyclomatic complexity 21 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.PublishTrigger.cs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"df1e447d39a09643b52e6fba20219689f2c4f5cda1886577515e29d06544492f"}},{"ruleId":"D1","level":"warning","message":{"text":"ChangeCouplingAnalyzer.JsTsImportsSibling (cyclomatic 21): ChangeCouplingAnalyzer.JsTsImportsSibling has cyclomatic complexity 21 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.GitMining/ChangeCouplingAnalyzer.cs"},"region":{"startLine":5147}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0ae971f599ecbe5740477efc046f55b458e920b0f27c4ac41153c46ca4d0185"}},{"ruleId":"D1","level":"warning","message":{"text":"FSharpBody.walk (cyclomatic 21): FSharpBody.walk has cyclomatic complexity 21 (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":"engine/src/CodeHealth.CodeModel.FSharp/Body.fs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"82110500f440de9ee853be74cdcca61d814e0856c1c212035c9942205f602729"}},{"ruleId":"D1","level":"warning","message":{"text":"FSharpBody.flatTokens (cyclomatic 21): FSharpBody.flatTokens 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":"engine/src/CodeHealth.CodeModel.FSharp/Body.fs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"27828e5653e9168ba0d7413bc54d42750b97a61d9abe004c502423d85a16c47f"}},{"ruleId":"D1","level":"warning","message":{"text":"ModelBuilder.WrapEntity (cyclomatic 21): ModelBuilder.WrapEntity 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":"engine/src/CodeHealth.CodeModel.FSharp/Builder.fs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"74203d725be48a912713df719272388fffeb482a4c3b56222cba3641616245fe"}},{"ruleId":"D1","level":"warning","message":{"text":"Branches.walk (cyclomatic 21): Branches.walk has cyclomatic complexity 21 (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":"engine/sidecars/java-spoon/src/main/java/dev/canine/codehealth/java/Branches.java"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"37996f2da301784c54758933da77ba2175d92e56fabed42e7045a268d0d010af"}},{"ruleId":"D1","level":"warning","message":{"text":"Main.main (cyclomatic 21): Main.main has cyclomatic complexity 21 (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":"engine/sidecars/java-spoon/src/main/java/dev/canine/codehealth/java/Main.java"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4707954eea649dbba6ef85d792bf3e150d337464d845af700f675b0881d0026"}},{"ruleId":"D1","level":"warning","message":{"text":"quality.main (cyclomatic 21): quality.main 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":"tools/llm-bakeoff/quality.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"191615258839133ba135c7e2dc43fbfd49b5777e4175c58d305b775df6a6b653"}},{"ruleId":"D1","level":"warning","message":{"text":"lint_hardcode.main (cyclomatic 21): lint_hardcode.main 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":"tools/multilang/lint_hardcode.py"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"66b76983190cc067ed8158e4963a484f0d3552016970a00eecd2f5a19fb14d67"}},{"ruleId":"D1","level":"warning","message":{"text":"scan.run_contained (cyclomatic 21): scan.run_contained 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":"tools/multilang/scan.py"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb232fe281117e70306135dab599e9b038eac3c7e811edd969749724d6d9287b"}},{"ruleId":"D1","level":"warning","message":{"text":"gold-record.main (cyclomatic 21): gold-record.main 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":"tools/train/gold-record.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"763c50cafcfe18a996d2b153a4c7ed4bb6abd9658e7591141784e8e91b5cef04"}},{"ruleId":"D1","level":"warning","message":{"text":"judge-with-tools.run_tool (cyclomatic 21): judge-with-tools.run_tool 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":"tools/train/judge-with-tools.py"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cdf00efc4cb9e3eaf8e7a48eb42879da687078793c779a946cd8bfeb5e23b10"}},{"ruleId":"D1","level":"warning","message":{"text":"report_round.measure_dimensions (cyclomatic 21): report_round.measure_dimensions 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":"tools/train/report_round.py"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d1a15b48b081bad298a601f8677fe76776f272fd8ff08e82685dc14bd234bc4"}},{"ruleId":"D1","level":"warning","message":{"text":"main.scanBodyText (cyclomatic 21): main.scanBodyText 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":"engine/sidecars/go/bodylines.go"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a7c2ebf2c029af05a0f9d9828c4aba1dfda34be8f0cf48151c7af5cc79ac680"}},{"ruleId":"D1","level":"warning","message":{"text":"codehealth_rust_sidecar::var_prefixes (cyclomatic 21): codehealth_rust_sidecar::var_prefixes 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":"engine/sidecars/rust-frontend/src/main.rs"},"region":{"startLine":2765}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4467e2dafaa9e7dd3ba30caea0ee4e9e7c58cdf945fd4a8d41862a6a1c8c542"}},{"ruleId":"D1","level":"warning","message":{"text":"codehealth_rust_sidecar::substitute_template (cyclomatic 21): codehealth_rust_sidecar::substitute_template 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":"engine/sidecars/rust-frontend/src/main.rs"},"region":{"startLine":2951}}}],"partialFingerprints":{"codehealthFindingId/v1":"d69f12c0e41784ea8bf5af4fb012883b702efa68b95dc05b11db055783dd10e4"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 21): (anonymous) has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 3 of the 21 points are its own statements and the rest belongs to 6 function items inside it that branch (apply, initScansFilter, wire, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Kennel.Ui/wwwroot/kennel-ui.js"},"region":{"startLine":1701}}}],"partialFingerprints":{"codehealthFindingId/v1":"26cd5f08ad5b38d003a304c1ba0c06b6d30541b8fc6abefe00ae7eb49e244c94"}},{"ruleId":"D1","level":"warning","message":{"text":"SourceClassifier.IsDemoPrefixedSampleProject (cyclomatic 20): SourceClassifier.IsDemoPrefixedSampleProject 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":"engine/src/CodeHealth.Core/Classification/SourceClassifier.cs"},"region":{"startLine":3023}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb2d059060732361a4b8ab884ebb7ecd672523a8981f09008e38da4ede9c0b79"}},{"ruleId":"D1","level":"warning","message":{"text":"SourceClassifier.PackageJsonVerdict (cyclomatic 20): SourceClassifier.PackageJsonVerdict has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Classification/SourceClassifier.cs"},"region":{"startLine":3473}}}],"partialFingerprints":{"codehealthFindingId/v1":"db42e3ce7c212500cbb297087ee4886d3c146b211bc374b47d91af65d1486440"}},{"ruleId":"D1","level":"warning","message":{"text":"LineBasedGodClassDetector.MeasureLeg (cyclomatic 20): LineBasedGodClassDetector.MeasureLeg has cyclomatic complexity 20 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/CodeShape/LineBasedGodClassDetector.cs"},"region":{"startLine":1362}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef8ef5e8db1bf532d519b82db3e80965b0079961d3de91b48b0bbd5c73edd56e"}},{"ruleId":"D1","level":"warning","message":{"text":"VbGodClassScanner.ScanAsync (cyclomatic 20): VbGodClassScanner.ScanAsync 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":"engine/src/CodeHealth.Core/CodeShape/VbGodClassScanner.cs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"56e42805e5a6fef0d4d41ccbe7e3593d667c1d522f2999777be5b1a1c17a7907"}},{"ruleId":"D1","level":"warning","message":{"text":"Lcom4Calculator.AnalyzeVb (cyclomatic 20): Lcom4Calculator.AnalyzeVb 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":"engine/src/CodeHealth.Core/Cohesion/Lcom4Calculator.cs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"b49f488e0d6973eac92cdfe3903e0483567d3c9cd32f01f1aa8edeb09a07e8b5"}},{"ruleId":"D1","level":"warning","message":{"text":"ComplianceSecurityAnalyzer.ScanUnauthenticatedCipherMode (cyclomatic 20): ComplianceSecurityAnalyzer.ScanUnauthenticatedCipherMode has cyclomatic complexity 20 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, 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":"engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs"},"region":{"startLine":2418}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8d35f390a37668f1cd792c4f12373ff7bd12e8bc0bfda5a8cbe0e839d4d7ac3"}},{"ruleId":"D1","level":"warning","message":{"text":"FrontendMetaDimensions.ImportBoundariesFix (cyclomatic 20): FrontendMetaDimensions.ImportBoundariesFix has cyclomatic complexity 20 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. 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":"engine/src/CodeHealth.Core/Discovery/FrontendMetaDimensions.cs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff0a51f36579fef4cc6e23c573ceeb1461675f891080484d2484a84db4d8d24a"}},{"ruleId":"D1","level":"warning","message":{"text":"RoslynExplicitDebtCollector.ReadSeverityAssignments (cyclomatic 20): RoslynExplicitDebtCollector.ReadSeverityAssignments 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":"engine/src/CodeHealth.Core/ExplicitDebt/RoslynExplicitDebtCollector.cs"},"region":{"startLine":6279}}}],"partialFingerprints":{"codehealthFindingId/v1":"aff6b933cd570c4c3af8bcaccf3ddc1e4cbe38f98c8fc7f68e3d1cc04b9604d9"}},{"ruleId":"D1","level":"warning","message":{"text":"AmbientDeclarationFile.IsAmbientDeclarationFile (cyclomatic 20): AmbientDeclarationFile.IsAmbientDeclarationFile 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":"engine/src/CodeHealth.Core/Frontend/AmbientDeclarationFile.cs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"22211b6f0c5f627db691ce39b3f468dd62d35f47d7eba7104246536357c32fa3"}},{"ruleId":"D1","level":"warning","message":{"text":"FrontendBoundaries.CollectTestTreeCrossPackageViolations (cyclomatic 20): FrontendBoundaries.CollectTestTreeCrossPackageViolations 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":"engine/src/CodeHealth.Core/Frontend/FrontendBoundaries.cs"},"region":{"startLine":1401}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d502715b03bc104ee267a6f6d488e1b0607a95b16b2bf300fde09b4727bcda4"}},{"ruleId":"D1","level":"warning","message":{"text":"FrontendTestReachability.DirectoryBarrelReached (cyclomatic 20): FrontendTestReachability.DirectoryBarrelReached 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":"engine/src/CodeHealth.Core/Frontend/FrontendTestReachability.cs"},"region":{"startLine":2132}}}],"partialFingerprints":{"codehealthFindingId/v1":"93153a4fbbafe907a8eb17dea580066618346b9672805255dd1473e020ac2b8f"}},{"ruleId":"D1","level":"warning","message":{"text":"JsDuplicationDetector.BuildDeclarationHeads (cyclomatic 20): JsDuplicationDetector.BuildDeclarationHeads has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs"},"region":{"startLine":6368}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5dbaf3f90dd6aa3d34dcf23917784d70dd4584e974d8ce7d1b0bfa1f9190402"}},{"ruleId":"D1","level":"warning","message":{"text":"ModuleSyntaxScanner.TryCommonJsExport (cyclomatic 20): ModuleSyntaxScanner.TryCommonJsExport has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/ModuleSyntaxScanner.cs"},"region":{"startLine":1094}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f7767bc91364221d1bace9cb1dbb59198be17a2a74525d42139194c38f1b33c"}},{"ruleId":"D1","level":"warning","message":{"text":"AccessibilityAnalyzer.ConditionalToggleStateUnexposed (cyclomatic 20): AccessibilityAnalyzer.ConditionalToggleStateUnexposed 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":"engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs"},"region":{"startLine":4302}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f76fd6ffdc1b0f1c5f83c25422ce78ea3b51cb069a0afabce67fd105b74245e"}},{"ruleId":"D1","level":"warning","message":{"text":"AggregateTransactionAnalyzer.Analyze (cyclomatic 20): AggregateTransactionAnalyzer.Analyze has cyclomatic complexity 20 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, 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":"engine/src/CodeHealth.Core/ModelAware/AggregateTransactionAnalyzer.cs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e588b480a83cc1ba679fb47550c3724983bd87ae2df0b555a7ce05b36ff014f"}},{"ruleId":"D1","level":"warning","message":{"text":"ArchitectureModelAnalyzer.StatefulSingletons (cyclomatic 20): ArchitectureModelAnalyzer.StatefulSingletons has cyclomatic complexity 20 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 7 belong to 5 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":"engine/src/CodeHealth.Core/ModelAware/ArchitectureModelAnalyzer.cs"},"region":{"startLine":852}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb59652afa9190d085dc2ec63ebefd4c288a9c1f066a1a5f63d49939c1c166b2"}},{"ruleId":"D1","level":"warning","message":{"text":"CsprojReferenceGraph.ClassifyLayer (cyclomatic 20): CsprojReferenceGraph.ClassifyLayer has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/CsprojReferenceGraph.cs"},"region":{"startLine":813}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6e8f0800411d4a6df470de4da481a35f4eec5b26e4113e03e3d6302448e439d"}},{"ruleId":"D1","level":"warning","message":{"text":"LogicDefectAnalyzer.InspectContradictedHandoff (cyclomatic 20): LogicDefectAnalyzer.InspectContradictedHandoff has cyclomatic complexity 20 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/LogicDefectAnalyzer.cs"},"region":{"startLine":2603}}}],"partialFingerprints":{"codehealthFindingId/v1":"f55bb17b324a0217b82349bd099bf4a3abd057d74924983ccaa2f36db69bd2cb"}},{"ruleId":"D1","level":"warning","message":{"text":"MarkupTaintPass.CollectEdges (cyclomatic 20): MarkupTaintPass.CollectEdges 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":"engine/src/CodeHealth.Core/ModelAware/MarkupTaintPass.cs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"0346a865747112bdbae41ca830149905cc8bd2531b3203c2227b522828d913ef"}},{"ruleId":"D1","level":"warning","message":{"text":"RepoProfiler.DetectDdd (cyclomatic 20): RepoProfiler.DetectDdd has cyclomatic complexity 20 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/RepoProfiler.cs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"c788281871afdabcd8889042b1056ca4ed0473d771955022a6ef7f67932d2fcc"}},{"ruleId":"D1","level":"warning","message":{"text":"RubyDomainConventions.IsStructuralAggregate (cyclomatic 20): RubyDomainConventions.IsStructuralAggregate has cyclomatic complexity 20 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 4 belong to 3 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/RubyDomainConventions.cs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7785ad15220d45c34fd16b305866121cc0438e88962131b4ecf0fc9741525ff"}},{"ruleId":"D1","level":"warning","message":{"text":"SupplyChainHygieneAnalyzer.Analyze (cyclomatic 20): SupplyChainHygieneAnalyzer.Analyze has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/SupplyChainHygieneAnalyzer.cs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dc0613c2758d04797f704b8ed78c3a0c5a4fbb179f74ad4f977f1bc2c1068a0"}},{"ruleId":"D1","level":"warning","message":{"text":"ProductionReadinessAnalyzer.HasDataVolumeMount (cyclomatic 20): ProductionReadinessAnalyzer.HasDataVolumeMount has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: ProductionReadinessAnalyzer.HasDedicatedSastSignal (cyclomatic 48) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs"},"region":{"startLine":2334}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9a53bf4c8298cc96767a8159961996bb0b5553e8971edfb69eac9273fa98fdd"}},{"ruleId":"D1","level":"warning","message":{"text":"ProductionReadinessAnalyzer.HasOrchestratedPublishTarget (cyclomatic 20): ProductionReadinessAnalyzer.HasOrchestratedPublishTarget has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 8 of the 20 points are its own statements and the rest belongs to one function literal inside it that branches (line 7061). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest. This is NOT this file\u0027s highest cyclomatic complexity: ProductionReadinessAnalyzer.HasDedicatedSastSignal (cyclomatic 48) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs"},"region":{"startLine":7036}}}],"partialFingerprints":{"codehealthFindingId/v1":"31925a6531c7af43835a1656edd717a813455e5aa118d13ebdd3a01870877db9"}},{"ruleId":"D1","level":"warning","message":{"text":"VacuousFormatGate.CommandPositions (cyclomatic 20): VacuousFormatGate.CommandPositions 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":"engine/src/CodeHealth.Core/Readiness/VacuousFormatGate.cs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"38546671c667268fa27bbefbd7af5c27c862e271bb20383a1b239b3c88b7f1a1"}},{"ruleId":"D1","level":"warning","message":{"text":"DiskSourceFiles.Enumerate (cyclomatic 20): DiskSourceFiles.Enumerate has cyclomatic complexity 20 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This is NOT this file\u0027s highest cyclomatic complexity: DiskSourceFiles.IsNeverProductionSourceFile (cyclomatic 26) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Scoring/DiskSourceFiles.cs"},"region":{"startLine":1026}}}],"partialFingerprints":{"codehealthFindingId/v1":"fddbb6dcca1106316d411bc77b508e3fb5163ec130e17c48eaaf8c0ddecb2cfc"}},{"ruleId":"D1","level":"warning","message":{"text":"RoslynTestQualityCollector.PublicHost (cyclomatic 20): RoslynTestQualityCollector.PublicHost has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Testing/RoslynTestQualityCollector.cs"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ff5a3ad9d364968dd4e30f71ceabec733b03a987a9b936548ec278278ace0fb"}},{"ruleId":"D1","level":"warning","message":{"text":"RoslynTestQualityCollector.DetectSwallowedFailure (cyclomatic 20): RoslynTestQualityCollector.DetectSwallowedFailure 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":"engine/src/CodeHealth.Core/Testing/RoslynTestQualityCollector.cs"},"region":{"startLine":2035}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cf981631e52ffa8f8bdc52d16f027d84a1fd772de6939e9c88cded57c5a2b87"}},{"ruleId":"D1","level":"warning","message":{"text":"ReportViewModelFactory.OwaspCategory (cyclomatic 20): ReportViewModelFactory.OwaspCategory has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Reporting/Templates/ReportViewModelFactory.cs"},"region":{"startLine":2810}}}],"partialFingerprints":{"codehealthFindingId/v1":"36d88a08675566759608d79a52f778d2b3e5d8f851aa33bc0e534bc3de7aceac"}},{"ruleId":"D1","level":"warning","message":{"text":"CloneSpanShape.Skeleton (cyclomatic 20): CloneSpanShape.Skeleton 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":"engine/src/CodeHealth.Dimensions.CodeQuality/CodeShape/DuplicationAnalyzer.cs"},"region":{"startLine":4506}}}],"partialFingerprints":{"codehealthFindingId/v1":"f656545bda28ccfedb6189cc8e6eff1da6cd77877611983d1f330a39c2638da4"}},{"ruleId":"D1","level":"warning","message":{"text":"GodClassAnalyzer.AbsorbModuleRowsIntoFileRows (cyclomatic 20): GodClassAnalyzer.AbsorbModuleRowsIntoFileRows 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":"engine/src/CodeHealth.Dimensions.CodeQuality/CodeShape/GodClassAnalyzer.cs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"4124c1791cf13f79fe60ab28c8cd8a55e73ec51be95bfb886591b21b2703227f"}},{"ruleId":"D1","level":"warning","message":{"text":"DeclaredDependencies.FixSatisfiesOpenPythonRequirement (cyclomatic 20): DeclaredDependencies.FixSatisfiesOpenPythonRequirement 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/DeclaredDependencies.cs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"820fd588d3bffc7c2f5974a9c9e6fad73d026bf51e11eb051b1c15254ef665b8"}},{"ruleId":"D1","level":"warning","message":{"text":"DockerfileShapeRuleFilter.Filter (cyclomatic 20): DockerfileShapeRuleFilter.Filter 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/DockerfileShapeRuleFilter.cs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"040e7c8d9fbe20a26388d7d47dbb38a5fffff50f38a01783aaf08b156b58c2e6"}},{"ruleId":"D1","level":"warning","message":{"text":"ScanParsers.OsvNuGetFixVersions (cyclomatic 20): ScanParsers.OsvNuGetFixVersions 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/ScanParsers.cs"},"region":{"startLine":1607}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4035512dd396a2080b205b6a0b22ab7e8858634249dc7adda527ac690aa9ce1"}},{"ruleId":"D1","level":"warning","message":{"text":"UnverifiedRemoteInstallerScan.FindingsInStage (cyclomatic 20): UnverifiedRemoteInstallerScan.FindingsInStage 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/UnverifiedRemoteInstallerScan.cs"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"0440f283a7ea58cf7d2d9262df3cf91268fb57fac7728074d4932affba40f2cd"}},{"ruleId":"D1","level":"warning","message":{"text":"UnverifiedRemoteInstallerScan.OutputPath (cyclomatic 20): UnverifiedRemoteInstallerScan.OutputPath 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/UnverifiedRemoteInstallerScan.cs"},"region":{"startLine":1228}}}],"partialFingerprints":{"codehealthFindingId/v1":"4897bd04945af693ff7976abda10bbf635784c0aedf2d1a204395c27320c64a8"}},{"ruleId":"D1","level":"warning","message":{"text":"UnverifiedTrustAnchorScan.FetchLine (cyclomatic 20): UnverifiedTrustAnchorScan.FetchLine 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/UnverifiedTrustAnchorScan.cs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c3d63c7ca5f9d91dd5e2d9aba4e15fe80f4698a7c4381e8aa1ed32d1d43ed51"}},{"ruleId":"D1","level":"warning","message":{"text":"RepoFindings.razor \u203A OnInitializedAsync (cyclomatic 20): RepoFindings.razor \u203A OnInitializedAsync has cyclomatic complexity 20 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Kennel.Watchdog.Core/Agents/Ui/RepoFindings.razor"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"43e231986bd8fafdcdfd32fc2ce2e4a4b1474b12657216e3e12213ba173df7bc"}},{"ruleId":"D1","level":"warning","message":{"text":"FSharpProvider.CollectUntypedBodies (cyclomatic 20): FSharpProvider.CollectUntypedBodies has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.CodeModel.FSharp/FSharpProvider.fs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee07b541cbd3c235fa718b9b4052cb628702c228d256ff7c5f9edc0a87fa7fa0"}},{"ruleId":"D1","level":"warning","message":{"text":"Tokenizer.blankLiterals (cyclomatic 20): Tokenizer.blankLiterals 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":"engine/sidecars/kotlin-frontend/src/main/kotlin/dev/canine/codehealth/kotlin/Tokenizer.kt"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"20999a93b20433eb4b178732424c49183df441e3337fddc2054325657660b86e"}},{"ruleId":"D1","level":"warning","message":{"text":"Tokenizer.blankLiterals (cyclomatic 20): Tokenizer.blankLiterals 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":"engine/sidecars/scala-frontend/src/main/scala/dev/canine/codehealth/scala/Tokenizer.scala"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"102b4b6f8fa862ac98592e69888317e18977a5eebdca8131059e479b9d2aa9d1"}},{"ruleId":"D1","level":"warning","message":{"text":"arch_corpus.main (cyclomatic 20): arch_corpus.main 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":"tools/multilang/arch_corpus.py"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb23afc4b2d9addf369665d2dc991343932422e8fd6225cbcc81bb7ed5fd4303"}},{"ruleId":"D1","level":"warning","message":{"text":"audit-rubrics.main (cyclomatic 20): audit-rubrics.main 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":"tools/train/audit-rubrics.py"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb9cc1f10ff633f5b730e8d706a161f908160a06eb669e3519c18a998b8c41ac"}},{"ruleId":"D1","level":"warning","message":{"text":"holdout-draw.main (cyclomatic 20): holdout-draw.main 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":"tools/train/holdout-draw.py"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ea573d41aed85696c31ae70cb9850acc620b75aacaa700eae2b05f68e67adb0"}},{"ruleId":"D1","level":"warning","message":{"text":"main.Scan (cyclomatic 20): main.Scan has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 9 of the 20 points are its own statements and the rest belongs to one function literal inside it that branches (line 50). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/go/scan.go"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8c901ad99bd7b7379b19249c363e29b1109934291c38fa0d55f03858f0644a9"}},{"ruleId":"D1","level":"warning","message":{"text":"IndirectionAnalyzer.AnalyzeAsync (cyclomatic 19): IndirectionAnalyzer.AnalyzeAsync has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Architecture/IndirectionAnalyzer.cs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0a962a596ee9aadfa970202355f19c3817cfbd9ac64a68dcdc2f0abff518a4c"}},{"ruleId":"D1","level":"warning","message":{"text":"LineBasedGodClassDetector.GoStructGrainScan (cyclomatic 19): LineBasedGodClassDetector.GoStructGrainScan has cyclomatic complexity 19 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. To reduce it, 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":"engine/src/CodeHealth.Core/CodeShape/LineBasedGodClassDetector.cs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"57b108a4e719d0b93eb48d48af2f731395cb51f13b780d023aca158e2576e511"}},{"ruleId":"D1","level":"warning","message":{"text":"NeutralFileLengthScanner.LiteralFreeSkeleton (cyclomatic 19): NeutralFileLengthScanner.LiteralFreeSkeleton has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/CodeShape/NeutralFileLengthScanner.cs"},"region":{"startLine":1075}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8fbea8dae1e42ed7a7a246cfa84b58b3d6bc5c8027cb943640172eb777f7200"}},{"ruleId":"D1","level":"warning","message":{"text":"ComplianceSecurityAnalyzer.ScanOptInGates (cyclomatic 19): ComplianceSecurityAnalyzer.ScanOptInGates has cyclomatic complexity 19 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, 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":"engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs"},"region":{"startLine":3858}}}],"partialFingerprints":{"codehealthFindingId/v1":"53c836f55943c76a1746272aac9733a25237abb4e7239462ef6151c91e3803ef"}},{"ruleId":"D1","level":"warning","message":{"text":"UnityLockfileReader.ReadRegistryDirect (cyclomatic 19): UnityLockfileReader.ReadRegistryDirect has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Dependencies/UnityLockfileReader.cs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7aee5753c86e979ed8d98bd28d7d8b58d270e06b32d6625e070e1d976a45e3e"}},{"ruleId":"D1","level":"warning","message":{"text":"RoslynExplicitDebtCollector.CollectWriteOnlyPrivateFields (cyclomatic 19): RoslynExplicitDebtCollector.CollectWriteOnlyPrivateFields has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ExplicitDebt/RoslynExplicitDebtCollector.cs"},"region":{"startLine":1310}}}],"partialFingerprints":{"codehealthFindingId/v1":"03eb4d39be35bc43cf5acf56730232f67cafe4501a262271a3ee83717447f905"}},{"ruleId":"D1","level":"warning","message":{"text":"UpstreamAttribution.HeaderBanner (cyclomatic 19): UpstreamAttribution.HeaderBanner has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/FileQuality/UpstreamAttribution.cs"},"region":{"startLine":1803}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e32f88f7331cf2c36c7c301a49b239235d81d5c99e1484818aa44fbb8d4609b"}},{"ruleId":"D1","level":"warning","message":{"text":"DirectoryForkDetector.Analyze (cyclomatic 19): DirectoryForkDetector.Analyze has cyclomatic complexity 19 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, 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":"engine/src/CodeHealth.Core/Frontend/DirectoryForkDetector.cs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae262c057bada9a70844b68ff89d356225d0bd530f2b8e8461ce363694eec104"}},{"ruleId":"D1","level":"warning","message":{"text":"FrontendBundlerConfigRefs.CollectJsonBuildManifestEntries (cyclomatic 19): FrontendBundlerConfigRefs.CollectJsonBuildManifestEntries has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/FrontendBundlerConfigRefs.cs"},"region":{"startLine":1161}}}],"partialFingerprints":{"codehealthFindingId/v1":"782f47600916eeb59f76f786139476557a80fb55ef976e84db1e1c8437ce3f73"}},{"ruleId":"D1","level":"warning","message":{"text":"FrontendDependencyHygiene.DeclaredEntryTargetsAllAbsent (cyclomatic 19): FrontendDependencyHygiene.DeclaredEntryTargetsAllAbsent has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/FrontendDependencyHygiene.cs"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"236b4bd63bcd11afe3a73d74db9ba9b79c9bd93c29e121c3afa465c1fcb08d8b"}},{"ruleId":"D1","level":"warning","message":{"text":"FrontendMarkupRefs.ExtractSrcAttribute (cyclomatic 19): FrontendMarkupRefs.ExtractSrcAttribute has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/FrontendMarkupRefs.cs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"854dd16401f8159102b3988cfaf0992bf9aba6f25582c412c4f394bf131f601f"}},{"ruleId":"D1","level":"warning","message":{"text":"FrontendTestAndDocRefs.CollectTestIncludeGlobs (cyclomatic 19): FrontendTestAndDocRefs.CollectTestIncludeGlobs has cyclomatic complexity 19 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, 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":"engine/src/CodeHealth.Core/Frontend/FrontendTestAndDocRefs.cs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"d620ef547d2b4cabc4f21135a89f09a22835d2e2680fc4b718ffcfc6c17910eb"}},{"ruleId":"D1","level":"warning","message":{"text":"FrontendTestReachability.EggBootReached (cyclomatic 19): FrontendTestReachability.EggBootReached has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/FrontendTestReachability.cs"},"region":{"startLine":2033}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d4835f8c022c2f449fbdb6e7fdc49169015f01c89ae912d80ac4d9f18a55c0a"}},{"ruleId":"D1","level":"warning","message":{"text":"JsFunctionScanner.FindBodyOpen (cyclomatic 19): JsFunctionScanner.FindBodyOpen has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: JsFunctionScanner.ClassifyOpenBrace (cyclomatic 30) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/JsFunctionScanner.cs"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"39ef51b06b4034a674df9f095555142743f2a3a2a57fccc18a90b4815c9505ad"}},{"ruleId":"D1","level":"warning","message":{"text":"TaggedTemplateMarkupProducer.Read (cyclomatic 19): TaggedTemplateMarkupProducer.Read has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Markup/TaggedTemplateMarkupProducer.cs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ed173e9c16a00167900e8e9ceeefc839a666527b9f20ff7f71c88900baa1513"}},{"ruleId":"D1","level":"warning","message":{"text":"TemplateLanguageMarkupProducer.EndOfBladeDirective (cyclomatic 19): TemplateLanguageMarkupProducer.EndOfBladeDirective has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Markup/TemplateLanguageMarkupProducer.cs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffe7fdfa718ef85725ebae57edbc12a073802dc2cf651a59eefc35414736d0ac"}},{"ruleId":"D1","level":"warning","message":{"text":"MaturityAnalyzer.TermFoundInRepo (cyclomatic 19): MaturityAnalyzer.TermFoundInRepo has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Maturity/MaturityAnalyzer.cs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"efee312b27934891fb5d265fc5b4f2b48ee72d21da8e08aa8453afbd7b929828"}},{"ruleId":"D1","level":"warning","message":{"text":"AccessibilityAnalyzer.PureQueryHelperNames (cyclomatic 19): AccessibilityAnalyzer.PureQueryHelperNames has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"774cdb18c1cdec9f4aa52132dc62a6795fe050f884d4a936ee379c79f4680d2d"}},{"ruleId":"D1","level":"warning","message":{"text":"AccessibilityAnalyzer.AppAssignsDocumentTitleAtRuntime (cyclomatic 19): AccessibilityAnalyzer.AppAssignsDocumentTitleAtRuntime has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs"},"region":{"startLine":7888}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7d0e29a47f1b75a56cf1c31facfd8b6b6d7295f65cdb6b5c34c27389fa93d61"}},{"ruleId":"D1","level":"warning","message":{"text":"DataShapeSmellAnalyzer.InspectSilentDefault (cyclomatic 19): DataShapeSmellAnalyzer.InspectSilentDefault has cyclomatic complexity 19 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 3 belong to 3 function literals inside it that branch. To reduce it, 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":"engine/src/CodeHealth.Core/ModelAware/DataShapeSmellAnalyzer.cs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"92ac6f89bb6e422f0edb984fb7a018410c709e81c5578873222ae8899e15c00c"}},{"ruleId":"D1","level":"warning","message":{"text":"DomainModelAnalyzer.DomainReferencesInfrastructure (cyclomatic 19): DomainModelAnalyzer.DomainReferencesInfrastructure has cyclomatic complexity 19 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs"},"region":{"startLine":4592}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd5a6a3af87e31515a0e0578e6f473a12231212d921bc4f2ea4191ac3ed50226"}},{"ruleId":"D1","level":"warning","message":{"text":"ErlangDomainConventions.DualWrites (cyclomatic 19): ErlangDomainConventions.DualWrites has cyclomatic complexity 19 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: ErlangDomainConventions.Ed1Gated (cyclomatic 20) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/ErlangDomainConventions.cs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"9418e469de1dc5ba0420069fc9391ad1f8e2a0d8a7c12a0ef4b1a69cf242d816"}},{"ruleId":"D1","level":"warning","message":{"text":"EventDrivenAnalyzer.EventCommandShape (cyclomatic 19): EventDrivenAnalyzer.EventCommandShape has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs"},"region":{"startLine":927}}}],"partialFingerprints":{"codehealthFindingId/v1":"d58462ac0e7c6a876e4cab76e0b8c66400f80c248046bc27b036d4a27f5e2907"}},{"ruleId":"D1","level":"warning","message":{"text":"JavaDomainConventions.IsStructuralAggregate (cyclomatic 19): JavaDomainConventions.IsStructuralAggregate has cyclomatic complexity 19 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. To reduce it, 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":"engine/src/CodeHealth.Core/ModelAware/JavaDomainConventions.cs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"217281e5180b1ded7c4f5b6511ca6e9ce8805d3a33721843f2d837e5d0b48b6f"}},{"ruleId":"D1","level":"warning","message":{"text":"ModelAwareLlmJudge.ResolveId (cyclomatic 19): ModelAwareLlmJudge.ResolveId has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/ModelAwareLlmJudge.cs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ebe199b0fb0a5e7b5f829f4106838a856607bf6d8bd31dfe575fbf63071ec8f"}},{"ruleId":"D1","level":"warning","message":{"text":"RubyDomainConventions.IsRubyDomainCommand (cyclomatic 19): RubyDomainConventions.IsRubyDomainCommand has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/RubyDomainConventions.cs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"f73ff63563047ac45549346d65c975ed73274907172a8b319671d7b9bf7b3c65"}},{"ruleId":"D1","level":"warning","message":{"text":"ComposePsParser.ParseWebTargets (cyclomatic 19): ComposePsParser.ParseWebTargets has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/RuntimeBoot/ComposePsParser.cs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"c49e4672fa96f638bb3f60eff9115992f8b914ade4f706c05c16124264ea87a8"}},{"ruleId":"D1","level":"warning","message":{"text":"ScalaDomainConventions.AnemicEntities (cyclomatic 19): ScalaDomainConventions.AnemicEntities has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/ScalaDomainConventions.cs"},"region":{"startLine":856}}}],"partialFingerprints":{"codehealthFindingId/v1":"81b0bba7f58ca7a44da12006ca56700bf219e568c4f0caf1f67ffce5ec8679a8"}},{"ruleId":"D1","level":"warning","message":{"text":"DartAnalyzerExclusions.Inspect (cyclomatic 19): DartAnalyzerExclusions.Inspect has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Readiness/DartAnalyzerExclusions.cs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"c98e3f9488bdaef2ce36f890519408559c0de5129945d42c1290b83739737a38"}},{"ruleId":"D1","level":"warning","message":{"text":"ProductionReadinessAnalyzer.HasPublishVerbInPipelineNamedScript (cyclomatic 19): ProductionReadinessAnalyzer.HasPublishVerbInPipelineNamedScript has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This is NOT this file\u0027s highest cyclomatic complexity: ProductionReadinessAnalyzer.HasDedicatedSastSignal (cyclomatic 48) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs"},"region":{"startLine":7115}}}],"partialFingerprints":{"codehealthFindingId/v1":"de5b39c4c957b1a36df3ecce731dedc8ae5fbc07bf53b6a857ec17f767442993"}},{"ruleId":"D1","level":"warning","message":{"text":"CodebaseValuator.Compute (cyclomatic 19): CodebaseValuator.Compute has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Scoring/CodebaseValuation.cs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"de5ef70e71f0b6d8720d16946766f3cfd06d8d31be6c4e3dd0d3d727081c92a0"}},{"ruleId":"D1","level":"warning","message":{"text":"DiskTestScanner.VbaTestSourceExtensions (cyclomatic 19): DiskTestScanner.VbaTestSourceExtensions has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Testing/DiskTestScanner.cs"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"c18e38796232192ad49c0cf6c949a95dde0a35bf521e4aed547458ec714986e3"}},{"ruleId":"D1","level":"warning","message":{"text":"JsTestQualityCensus.Collect (cyclomatic 19): JsTestQualityCensus.Collect has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Testing/JsTestQualityCensus.cs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"570ad9f2a5b3ad120adb430ec1623213a04f08625a396e9b88017fa0f5637956"}},{"ruleId":"D1","level":"warning","message":{"text":"NodeTestReliabilityCollector.ParseJestShaped (cyclomatic 19): NodeTestReliabilityCollector.ParseJestShaped has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Testing/NodeTestReliabilityCollector.cs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"10500a2ed2432ed8ed538d7ba3a693b5f91120b19b747a8177f40efc8cb0f29a"}},{"ruleId":"D1","level":"warning","message":{"text":"DsmSvg.Render (cyclomatic 19): DsmSvg.Render has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Reporting/Svg/DsmSvg.cs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"765edc1ebdd1be4266db3eed2a2f70df409960efdf7d1299e702193e9c0fa2f3"}},{"ruleId":"D1","level":"warning","message":{"text":"ReportViewModelFactory.BuildDimensionCards (cyclomatic 19): ReportViewModelFactory.BuildDimensionCards has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 1 of the 19 points is its own statement and the rest belongs to one function literal inside it that branches (line 1556). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Reporting/Templates/ReportViewModelFactory.cs"},"region":{"startLine":1555}}}],"partialFingerprints":{"codehealthFindingId/v1":"61f7a5e62ffbd256c01c875b91396c9c3e4e4ac5387a023f38d8cb4c0fdfe740"}},{"ruleId":"D1","level":"warning","message":{"text":"DuplicationAnalyzer.ForkFamilies (cyclomatic 19): DuplicationAnalyzer.ForkFamilies has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.CodeQuality/CodeShape/DuplicationAnalyzer.cs"},"region":{"startLine":1065}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b134108e35615983b7a21a2e46a8ebb18e4ed17c4d54ab2f898f8274da7d81b"}},{"ruleId":"D1","level":"warning","message":{"text":"DuplicationAnalyzer.GuardAsymmetryCaveat (cyclomatic 19): DuplicationAnalyzer.GuardAsymmetryCaveat has cyclomatic complexity 19 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, 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":"engine/src/CodeHealth.Dimensions.CodeQuality/CodeShape/DuplicationAnalyzer.cs"},"region":{"startLine":2847}}}],"partialFingerprints":{"codehealthFindingId/v1":"058234990450f2b529c87796ea9a26ce1c2e832b7c8f246c94a3720a9bee1b35"}},{"ruleId":"D1","level":"warning","message":{"text":"DuplicationAnalyzer.DeclarationValidatesParameter (cyclomatic 19): DuplicationAnalyzer.DeclarationValidatesParameter 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":"engine/src/CodeHealth.Dimensions.CodeQuality/CodeShape/DuplicationAnalyzer.cs"},"region":{"startLine":3309}}}],"partialFingerprints":{"codehealthFindingId/v1":"05d30babd7274c03711cf2314b71d08ad6b7a1926f99f88c81c5faa4e0081053"}},{"ruleId":"D1","level":"warning","message":{"text":"ComplexityScoring.BuildResult (cyclomatic 19): ComplexityScoring.BuildResult has cyclomatic complexity 19 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 7 belong to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: ComplexityScoring.RemediationFor (cyclomatic 26) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.CodeQuality/Complexity/ComplexityScoring.cs"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"3989c27dd7b44346d92cae0f638b3e74eec5c286ef8bdc434555fec4210866b7"}},{"ruleId":"D1","level":"warning","message":{"text":"ComposeMutableServiceImageScan.Services (cyclomatic 19): ComposeMutableServiceImageScan.Services has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/ComposeMutableServiceImageScan.cs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc96a1ebb1f6bfbef98a2186c5c25b9a6cfa48242efa54fee1aa3ac7f75bbef4"}},{"ruleId":"D1","level":"warning","message":{"text":"ConfigCredentialBindingScan.LooksLikeCommittedCredential (cyclomatic 19): ConfigCredentialBindingScan.LooksLikeCommittedCredential 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/ConfigCredentialBindingScan.cs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"934bbf0daad678f6a3e06a319d87513853c1084a17835db66775d6fc475c89fe"}},{"ruleId":"D1","level":"warning","message":{"text":"DockerfileShapeRuleFilter.EveryRegistryBaseIsTagged (cyclomatic 19): DockerfileShapeRuleFilter.EveryRegistryBaseIsTagged has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/DockerfileShapeRuleFilter.cs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed5801a35e51ac893268449e6fa23dca48d2bbeb8e8d370061bf5b431bed7a42"}},{"ruleId":"D1","level":"warning","message":{"text":"DockerfileShapeRuleFilter.DropsPrivilegeAtStart (cyclomatic 19): DockerfileShapeRuleFilter.DropsPrivilegeAtStart has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/DockerfileShapeRuleFilter.cs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c452e4f1f82b61f9daf426d2d0c8bcc7a3ca3d2912acccadd13985c0db60f91"}},{"ruleId":"D1","level":"warning","message":{"text":"NamelessWorkloadNormalisedScan.Normalise (cyclomatic 19): NamelessWorkloadNormalisedScan.Normalise has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/NamelessWorkloadNormalisedScan.cs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"8818c5bb55bef6f70a6e8e90461ded396911ff286ac150a4ba28148a24cd1139"}},{"ruleId":"D1","level":"warning","message":{"text":"ScanParsers.GoAffectedImports (cyclomatic 19): ScanParsers.GoAffectedImports has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/ScanParsers.cs"},"region":{"startLine":3269}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6f70c44c94e3837e59bc3b923c9d22c13549af0c1271c4a9fe09cfe4f1c23c9"}},{"ruleId":"D1","level":"warning","message":{"text":"SocketAndUpgradeRecheck.NotGorillaUpgradeCall (cyclomatic 19): SocketAndUpgradeRecheck.NotGorillaUpgradeCall has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/SocketAndUpgradeRecheck.cs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc4745136b80db7c2c31868803168684bf8980ee0968ebc13fca3087f5b7ca12"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkflowInputGateRecheck.AdmitsOnlyShellSafeText (cyclomatic 19): WorkflowInputGateRecheck.AdmitsOnlyShellSafeText has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/WorkflowInputGateRecheck.cs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"379e12b552f23a67b83a5b009f5a21055e91bf0dc4b69a16a57b0dca56251096"}},{"ruleId":"D1","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.FunctionKeepsPositionalInProcess (cyclomatic 19): SupplyChainProvenanceAnalyzer.FunctionKeepsPositionalInProcess has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":9719}}}],"partialFingerprints":{"codehealthFindingId/v1":"08cd4250955107e77379e2466c18e878185ed1730ec78b59927fac7ee5afc052"}},{"ruleId":"D1","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.UninvokedGoReleaserManifest (cyclomatic 19): SupplyChainProvenanceAnalyzer.UninvokedGoReleaserManifest 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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.ReleaseTrigger.cs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"69b316c00b33f6878d6a00db24b33674e694b6d9081fcb82e3dec34cfcb1a31c"}},{"ruleId":"D1","level":"warning","message":{"text":"ModelBuilder.WireTypes (cyclomatic 19): ModelBuilder.WireTypes has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.CodeModel.Jvm/Builder.cs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0dedc834a6983019496c132e190e2fe92e87a17178b1b1dabe291441a8961de"}},{"ruleId":"D1","level":"warning","message":{"text":"Branches.walk (cyclomatic 19): Branches.walk 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":"engine/sidecars/kotlin-frontend/src/main/kotlin/dev/canine/codehealth/kotlin/Branches.kt"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"36676972aa0f3859690dc9a1272c7d47350a5a22101bcd46a7a39506e97059ec"}},{"ruleId":"D1","level":"warning","message":{"text":"Handler._proxy (cyclomatic 19): Handler._proxy has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/qwen-poc/effort-proxy.py"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"45dc3892b110fb03e2b928f900744af2a615122d3c9193348f9216c733979710"}},{"ruleId":"D1","level":"warning","message":{"text":"adjudication.audit_rounds (cyclomatic 19): adjudication.audit_rounds has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/adjudication.py"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bd3e8c763640eb37335a327549027b90e700b846b1d545e1b5a8ae450f7bc22"}},{"ruleId":"D1","level":"warning","message":{"text":"fallback-judge.cmd_run (cyclomatic 19): fallback-judge.cmd_run has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/fallback-judge.py"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"5db3f72c471a91988a20f3f1d0116046c07e5e353cc8c0dd703955931600e801"}},{"ruleId":"D1","level":"warning","message":{"text":"fallback-judge.shape_check (cyclomatic 19): fallback-judge.shape_check 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":"tools/train/fallback-judge.py"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"b32a44f8c6cbb2c20b3eadd1e7d0cf6dabe2ffc49effc6dde1becf042329e645"}},{"ruleId":"D1","level":"warning","message":{"text":"report_detection_delta.main (cyclomatic 19): report_detection_delta.main 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":"tools/train/report_detection_delta.py"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"3904869bd9dfce7fa471a81eb75303390d2cf024429f3d6eff6c7b700a441e6f"}},{"ruleId":"D1","level":"warning","message":{"text":"BranchWalker.scanExpr (cyclomatic 19): BranchWalker.scanExpr has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/php-frontend/body.php"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"7da627447d9cbcc7b8a1556547cf868577e2f374c46bc4fa50d193f9bbcb2b25"}},{"ruleId":"D1","level":"warning","message":{"text":"codehealth_rust_sidecar::select_arms (cyclomatic 19): codehealth_rust_sidecar::select_arms has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/rust-frontend/src/main.rs"},"region":{"startLine":4385}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf83d00270605d8a1997160e2103c83a10632b3d118dd14294e26118bd1826b4"}},{"ruleId":"D1","level":"warning","message":{"text":"VbBranchExtractor.Walk (cyclomatic 18): VbBranchExtractor.Walk has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/CodeModel/Roslyn/VbBranchExtractor.cs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"33d711f118a9b92aa508307937a4b391ee82f00b3e397228bfbbd5b37999cd81"}},{"ruleId":"D1","level":"warning","message":{"text":"ChainedFamilyRollup.Cluster (cyclomatic 18): ChainedFamilyRollup.Cluster 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":"engine/src/CodeHealth.Core/CodeShape/ChainedFamilyRollup.cs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"2707ecc648db42b355bfe2d1a2d00f3dc1b71d7e0dbcce12a9ec8d3aa2741667"}},{"ruleId":"D1","level":"warning","message":{"text":"NeutralMethodLengthScanner.ReadSignature (cyclomatic 18): NeutralMethodLengthScanner.ReadSignature has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/CodeShape/NeutralMethodLengthScanner.cs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"44613f88241ca27a0b9f1cb3e051fe0daf00c3b68554b9aaad30ef98224af0ed"}},{"ruleId":"D1","level":"warning","message":{"text":"ControlFlowComplexity.CognitiveDriverSummary (cyclomatic 18): ControlFlowComplexity.CognitiveDriverSummary has cyclomatic complexity 18 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Complexity/ControlFlowComplexity.cs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"e24b0546ef830efb89a0d33212939200d80288ce038f8126c89308524844ceea"}},{"ruleId":"D1","level":"warning","message":{"text":"ComplianceSecurityAnalyzer.ScanWrongDirectionTransform (cyclomatic 18): ComplianceSecurityAnalyzer.ScanWrongDirectionTransform has cyclomatic complexity 18 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs"},"region":{"startLine":2533}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fff2c97ebda697a8f43e61c8283be6390ebd7cb513611f029a95ea568e567d8"}},{"ruleId":"D1","level":"warning","message":{"text":"ComplianceSecurityAnalyzer.PersonalDataCategory (cyclomatic 18): ComplianceSecurityAnalyzer.PersonalDataCategory has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs"},"region":{"startLine":4220}}}],"partialFingerprints":{"codehealthFindingId/v1":"17116ad33094c3620abc9bc948cdd2a1e03ab8b25d4f24e8fcb1b4af86ca09f2"}},{"ruleId":"D1","level":"warning","message":{"text":"ComplianceSecurityAnalyzer.C3 (cyclomatic 18): ComplianceSecurityAnalyzer.C3 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":"engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs"},"region":{"startLine":5270}}}],"partialFingerprints":{"codehealthFindingId/v1":"d897fe26e4328a1522f941eb4bfac73dd1acf81356955298266389ab6d756aed"}},{"ruleId":"D1","level":"warning","message":{"text":"UnityRegistryClient.Parse (cyclomatic 18): UnityRegistryClient.Parse 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":"engine/src/CodeHealth.Core/Dependencies/UnityRegistryClient.cs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0e94312fb10ef72d4af1a24b0a66338be0de5d2e3439861389361d1fc0ced51"}},{"ruleId":"D1","level":"warning","message":{"text":"VbaSourcePresence.IsVbaTree (cyclomatic 18): VbaSourcePresence.IsVbaTree 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":"engine/src/CodeHealth.Core/Discovery/VbaSourcePresence.cs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"768f556449a10604db6a995e372d8c8f92389bfc2c1cb5b16f27df2dd35a8ca8"}},{"ruleId":"D1","level":"warning","message":{"text":"YamlDisabledConfigScanner.TryConvict (cyclomatic 18): YamlDisabledConfigScanner.TryConvict 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":"engine/src/CodeHealth.Core/ExplicitDebt/YamlDisabledConfigScanner.cs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"d06fef1a08a3ed2d6cc7f4218cdb530b2c9643f222ae8eb14aff17f7236974ff"}},{"ruleId":"D1","level":"warning","message":{"text":"GeneratedRegionScan.Analyse (cyclomatic 18): GeneratedRegionScan.Analyse 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":"engine/src/CodeHealth.Core/FileQuality/GeneratedRegionScan.cs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"73c41e29523a0f377be2e80c93aa0183535968815ef090f89afc3cfd6f4b3508"}},{"ruleId":"D1","level":"warning","message":{"text":"EntryPointCatalog.AddResolvedThroughAlias (cyclomatic 18): EntryPointCatalog.AddResolvedThroughAlias 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":"engine/src/CodeHealth.Core/Frontend/EntryPointCatalog.cs"},"region":{"startLine":2072}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a9d16cb88aa774bf4585ebdf03fb682f1bcbb37be92d3eff0fd76daf964432a"}},{"ruleId":"D1","level":"warning","message":{"text":"FrontendBundlerConfigRefs.CollectBundlerAliases (cyclomatic 18): FrontendBundlerConfigRefs.CollectBundlerAliases 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":"engine/src/CodeHealth.Core/Frontend/FrontendBundlerConfigRefs.cs"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"311bffffe0b442986224e55dbeadc165662a962f6f63f5359630b0f62a6c926d"}},{"ruleId":"D1","level":"warning","message":{"text":"FrontendDeadCode.GitignoreGlobMatches (cyclomatic 18): FrontendDeadCode.GitignoreGlobMatches 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":"engine/src/CodeHealth.Core/Frontend/FrontendDeadCode.cs"},"region":{"startLine":837}}}],"partialFingerprints":{"codehealthFindingId/v1":"73e75bbcb81a15c9bc89be8ce18b5bc08f46c449890b1afb388c39999e52d6ec"}},{"ruleId":"D1","level":"warning","message":{"text":"FrontendScriptCommandRefs.CollectLockfileBinNames (cyclomatic 18): FrontendScriptCommandRefs.CollectLockfileBinNames 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":"engine/src/CodeHealth.Core/Frontend/FrontendScriptCommandRefs.cs"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"769aa3327c6a799efcd3fa2833a23ae58cc29c85a17760c80e0adb87b6b3954a"}},{"ruleId":"D1","level":"warning","message":{"text":"FrontendTestReachability.IsReExportBarrel (cyclomatic 18): FrontendTestReachability.IsReExportBarrel 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":"engine/src/CodeHealth.Core/Frontend/FrontendTestReachability.cs"},"region":{"startLine":1399}}}],"partialFingerprints":{"codehealthFindingId/v1":"454186b0a16e7fe04b4827f2b5aa1351a6ac981b1a6e34b51a89084d1167ff33"}},{"ruleId":"D1","level":"warning","message":{"text":"FrontendWorkspaceWalk.Walk (cyclomatic 18): FrontendWorkspaceWalk.Walk 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":"engine/src/CodeHealth.Core/Frontend/FrontendWorkspaceWalk.cs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"00360a4c139742bc7178c7a1801e39ef51853bb980d11cabb4100e5b14d77a47"}},{"ruleId":"D1","level":"warning","message":{"text":"JsDuplicationDetector.TryCollapsePeriodicRun (cyclomatic 18): JsDuplicationDetector.TryCollapsePeriodicRun has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs"},"region":{"startLine":4661}}}],"partialFingerprints":{"codehealthFindingId/v1":"60ff7dc01f735071dfed56a1166b3cb8eb80a70af46cbbd9c4300ab255427c21"}},{"ruleId":"D1","level":"warning","message":{"text":"JsRedundantReDefault.FallbackOf (cyclomatic 18): JsRedundantReDefault.FallbackOf 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":"engine/src/CodeHealth.Core/Frontend/JsRedundantReDefault.cs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a580f7ee38ab1a627afd5ad7009f67e1b3b5bcf85a19faad027f180b1b3e8e8"}},{"ruleId":"D1","level":"warning","message":{"text":"MinifiedJsHeuristics.LooksMinified (cyclomatic 18): MinifiedJsHeuristics.LooksMinified 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":"engine/src/CodeHealth.Core/Frontend/MinifiedJsHeuristics.cs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea13ea1ec3997ebc88365fd705f6660bcb635832ae3ed205dbc9702cb5ddc3a5"}},{"ruleId":"D1","level":"warning","message":{"text":"ModuleResolver.ResolveWorkspacePackage (cyclomatic 18): ModuleResolver.ResolveWorkspacePackage 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":"engine/src/CodeHealth.Core/Frontend/ModuleResolver.cs"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf927b04b93ef0ca0ea74a1511b3c1a858f83a4a9c988479a7a0b60710fa84a0"}},{"ruleId":"D1","level":"warning","message":{"text":"ModuleResolver.TryResolveExports (cyclomatic 18): ModuleResolver.TryResolveExports 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":"engine/src/CodeHealth.Core/Frontend/ModuleResolver.cs"},"region":{"startLine":1016}}}],"partialFingerprints":{"codehealthFindingId/v1":"69c1d6b9df17bb7e09536b7079578963da8407f0ad379967c1e56e510424845a"}},{"ruleId":"D1","level":"warning","message":{"text":"NonProductionTreeReadmission.ImportedTrees (cyclomatic 18): NonProductionTreeReadmission.ImportedTrees 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":"engine/src/CodeHealth.Core/Frontend/NonProductionTreeReadmission.cs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c12cadc1075315945fcb9d1afe995a82f7defb3aa883ba9a802eae6eb04f02a"}},{"ruleId":"D1","level":"warning","message":{"text":"MarkupParser.EnumerateMarkupFiles (cyclomatic 18): MarkupParser.EnumerateMarkupFiles has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Markup/MarkupParser.cs"},"region":{"startLine":1455}}}],"partialFingerprints":{"codehealthFindingId/v1":"31152e4c513e906fa1f2d684b3000f8cd7f68aa64fde6bf744587018dbd60d56"}},{"ruleId":"D1","level":"warning","message":{"text":"AccessibilityAnalyzer.EnumerateScriptFiles (cyclomatic 18): AccessibilityAnalyzer.EnumerateScriptFiles has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs"},"region":{"startLine":6212}}}],"partialFingerprints":{"codehealthFindingId/v1":"58953be89b649686587198603b0daf200ea28456d3f1c38c9d03d77c572d0d50"}},{"ruleId":"D1","level":"warning","message":{"text":"AccessibilityAnalyzer.CountUnreadTemplateMarkup (cyclomatic 18): AccessibilityAnalyzer.CountUnreadTemplateMarkup 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":"engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.TaggedTemplateBlindness.cs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdeff3cc03b2dbac6fd6039098d99eb10077ab82076341cc63e3dfbb9d0e39d4"}},{"ruleId":"D1","level":"warning","message":{"text":"AllowlistGate.Prove (cyclomatic 18): AllowlistGate.Prove has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: AllowlistGate.Classify (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/AllowlistGate.cs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a809d31b79d8c274ffc5ec830eddedf2b77260b8814b23e07dd364c9b0666a3"}},{"ruleId":"D1","level":"warning","message":{"text":"AllowlistGate.Match (cyclomatic 18): AllowlistGate.Match 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. This is NOT this file\u0027s highest cyclomatic complexity: AllowlistGate.Classify (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/AllowlistGate.cs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"539b5195270e71efb9eb2bc37bd992f397d393c5742bdf77ca66b666e08ba814"}},{"ruleId":"D1","level":"warning","message":{"text":"ArchitectureModelAnalyzer.InterfaceSegregation (cyclomatic 18): ArchitectureModelAnalyzer.InterfaceSegregation has cyclomatic complexity 18 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, 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":"engine/src/CodeHealth.Core/ModelAware/ArchitectureModelAnalyzer.cs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"128db600884a33acc41d4e402a6217b16bc453bce65b4d534e26d1c0605bf494"}},{"ruleId":"D1","level":"warning","message":{"text":"CsprojReferenceGraph.Build (cyclomatic 18): CsprojReferenceGraph.Build 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":"engine/src/CodeHealth.Core/ModelAware/CsprojReferenceGraph.cs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"b63366033cf670fefcd24030b96101ef1f56113a678da377537f103d7b7fe56b"}},{"ruleId":"D1","level":"warning","message":{"text":"CsprojReferenceGraph.ImportedMsBuildTexts (cyclomatic 18): CsprojReferenceGraph.ImportedMsBuildTexts has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/CsprojReferenceGraph.cs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"999f6805fb3effe8888b72c642882819811d1f5dea1007ac91361dffc8974107"}},{"ruleId":"D1","level":"warning","message":{"text":"DomainConventions.IsEventHandler (cyclomatic 18): DomainConventions.IsEventHandler has cyclomatic complexity 18 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/DomainConventions.cs"},"region":{"startLine":1547}}}],"partialFingerprints":{"codehealthFindingId/v1":"d82d510a89e4a1fed27c817878e49b6850b248a68c0e0a51aabbdd70e6a98cb4"}},{"ruleId":"D1","level":"warning","message":{"text":"DomainModelAnalyzer.PrimitiveDataClumps (cyclomatic 18): DomainModelAnalyzer.PrimitiveDataClumps has cyclomatic complexity 18 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 3 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs"},"region":{"startLine":5228}}}],"partialFingerprints":{"codehealthFindingId/v1":"5235714a181582ac0d287fa8ac600216a4b548d1033a32d6984bd96d286c36a5"}},{"ruleId":"D1","level":"warning","message":{"text":"GoDomainConventions.IsValueObject (cyclomatic 18): GoDomainConventions.IsValueObject has cyclomatic complexity 18 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 5 belong to 3 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/GoDomainConventions.cs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"68cf5d275edf0d80dca2d7c557f7e38a84757b5675ffe876988dcfccadda086d"}},{"ruleId":"D1","level":"warning","message":{"text":"GoDomainConventions.MutatesOwnState (cyclomatic 18): GoDomainConventions.MutatesOwnState has cyclomatic complexity 18 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, 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":"engine/src/CodeHealth.Core/ModelAware/GoDomainConventions.cs"},"region":{"startLine":2358}}}],"partialFingerprints":{"codehealthFindingId/v1":"645105735f4857859b97086d2050c887403074786244bb6a19c752cd015915ed"}},{"ruleId":"D1","level":"warning","message":{"text":"IncompletenessAnalyzer.ReturnsInterfaceDeclaredNullSentinel (cyclomatic 18): IncompletenessAnalyzer.ReturnsInterfaceDeclaredNullSentinel 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":"engine/src/CodeHealth.Core/ModelAware/IncompletenessAnalyzer.cs"},"region":{"startLine":2315}}}],"partialFingerprints":{"codehealthFindingId/v1":"eba1f6755b9d3a52f0d45213461139b9e338cb6aef054375639b7036ae3b5aee"}},{"ruleId":"D1","level":"warning","message":{"text":"IncompletenessAnalyzer.RedundantReturnGuardRuns (cyclomatic 18): IncompletenessAnalyzer.RedundantReturnGuardRuns has cyclomatic complexity 18 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, 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":"engine/src/CodeHealth.Core/ModelAware/IncompletenessAnalyzer.cs"},"region":{"startLine":4011}}}],"partialFingerprints":{"codehealthFindingId/v1":"c51d7a81019776fe50b665f6325c7aa9e21cb30c55adb4249c22b05f49a09a61"}},{"ruleId":"D1","level":"warning","message":{"text":"IncompletenessAnalyzer.StatementsBothBranchesOpenWith (cyclomatic 18): IncompletenessAnalyzer.StatementsBothBranchesOpenWith has cyclomatic complexity 18 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/IncompletenessAnalyzer.cs"},"region":{"startLine":4264}}}],"partialFingerprints":{"codehealthFindingId/v1":"624bad773264490f11384f129dc95be7f8bb814653b155d11cc690f7340dd05f"}},{"ruleId":"D1","level":"warning","message":{"text":"InvocationMatching.FirstMatch (cyclomatic 18): InvocationMatching.FirstMatch has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/InvocationMatching.cs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"826760fc0cb2858197c11f6f75ffe41f8e2581796ed4a76e5ae46c9cfa6204d0"}},{"ruleId":"D1","level":"warning","message":{"text":"MutationIdempotencyAnalyzer.GatherRoslynAsync (cyclomatic 18): MutationIdempotencyAnalyzer.GatherRoslynAsync has cyclomatic complexity 18 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (MutationIdempotencyAnalyzer.GatherNeutralAsync) 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":"engine/src/CodeHealth.Core/ModelAware/MutationIdempotencyAnalyzer.cs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"63bf01c4e41f9413ebd256013145b10c45ba4e66947eb2e977f14a411bfb77b2"}},{"ruleId":"D1","level":"warning","message":{"text":"MutationIdempotencyAnalyzer.GatherNeutralAsync (cyclomatic 18): MutationIdempotencyAnalyzer.GatherNeutralAsync has cyclomatic complexity 18 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (MutationIdempotencyAnalyzer.GatherRoslynAsync) 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":"engine/src/CodeHealth.Core/ModelAware/MutationIdempotencyAnalyzer.cs"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"e73daf0271e83a683ff2e02c5438f78fc7e9f3d9d535c3858d3020f1b0740590"}},{"ruleId":"D1","level":"warning","message":{"text":"PythonDomainConventions.IsStructuralAggregate (cyclomatic 18): PythonDomainConventions.IsStructuralAggregate has cyclomatic complexity 18 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 5 belong to 2 function literals inside it that branch. To reduce it, 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":"engine/src/CodeHealth.Core/ModelAware/PythonDomainConventions.cs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"5584f0f8095e34681d7ed36ba10b9799661ff498cdf0693ce52f985f64dcb079"}},{"ruleId":"D1","level":"warning","message":{"text":"DeterminismGuard.Evaluate (cyclomatic 18): DeterminismGuard.Evaluate 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":"engine/src/CodeHealth.Core/ModelAware/RuntimeAccessibility/DeterminismGuard.cs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"910e2bfeb6ef75f9f7c9bfae4695be5dabfecac82f1e4f97430cbc718c2a61ae"}},{"ruleId":"D1","level":"warning","message":{"text":"StringContractSmellAnalyzer.Collect (cyclomatic 18): StringContractSmellAnalyzer.Collect 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":"engine/src/CodeHealth.Core/ModelAware/StringContractSmellAnalyzer.cs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"35b3d744b4457ee5f9e99d7a7f220c6f813a146449b5a02eef879a5efab8c606"}},{"ruleId":"D1","level":"warning","message":{"text":"ProductionReadinessAnalyzer.HasKubernetesPersistentVolumeClaim (cyclomatic 18): ProductionReadinessAnalyzer.HasKubernetesPersistentVolumeClaim has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This is NOT this file\u0027s highest cyclomatic complexity: ProductionReadinessAnalyzer.HasDedicatedSastSignal (cyclomatic 48) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs"},"region":{"startLine":2505}}}],"partialFingerprints":{"codehealthFindingId/v1":"dde0a0ac0173aa12fe52efe2e808a5e4585fa0ea137a0d832c59815c3deea326"}},{"ruleId":"D1","level":"warning","message":{"text":"CommittedCoverageReader.ParseGoCoverProfile (cyclomatic 18): CommittedCoverageReader.ParseGoCoverProfile 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":"engine/src/CodeHealth.Core/Testing/CommittedCoverageReader.cs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a776a20692aa479c32809dff5094eb2d405b47c1a1ea86bddd9f49ad7af72d9"}},{"ruleId":"D1","level":"warning","message":{"text":"RoslynTestQualityCollector.BodyAssertsViaHarness (cyclomatic 18): RoslynTestQualityCollector.BodyAssertsViaHarness has cyclomatic complexity 18 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 8 belong to 2 function literals inside it that branch. To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Testing/RoslynTestQualityCollector.cs"},"region":{"startLine":1622}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bffd8546dc30a45fb395497d150607275ff484f9b268ca9d25e85d5f89037a2"}},{"ruleId":"D1","level":"warning","message":{"text":"SelfDeclaredUnreliableTests.TestNameAt (cyclomatic 18): SelfDeclaredUnreliableTests.TestNameAt 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":"engine/src/CodeHealth.Core/Testing/SelfDeclaredUnreliableTests.cs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5e1014ab490df656c9a9820ed775116ab132a8c70dbfaaccefd8ab41ecb9e7e"}},{"ruleId":"D1","level":"warning","message":{"text":"ChurnCommitIdentity.CountedChanges (cyclomatic 18): ChurnCommitIdentity.CountedChanges 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":"engine/src/CodeHealth.Toolchain/Git/ChurnCommitIdentity.cs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f1b1333817c6d8d8524e91bd32b110dffc014bbf6f5510cf8196e314645c530"}},{"ruleId":"D1","level":"warning","message":{"text":"ProcessToolRunner.RunAsync (cyclomatic 18): ProcessToolRunner.RunAsync has cyclomatic complexity 18 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 5 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":"engine/src/CodeHealth.Toolchain/Tools/ProcessToolRunner.cs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ba5179b84954e036e0d88ec67f7d984e9bd712344eab0069a7ad45ccf26ebb8"}},{"ruleId":"D1","level":"warning","message":{"text":"ReportViewModelFactory.BuildNewSinceLast (cyclomatic 18): ReportViewModelFactory.BuildNewSinceLast has cyclomatic complexity 18 (threshold 15). 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":"engine/src/CodeHealth.Reporting/Templates/ReportViewModelFactory.cs"},"region":{"startLine":1352}}}],"partialFingerprints":{"codehealthFindingId/v1":"03b5f3d8f2aebbc22aafd4cb7d4509d952a5d57f7d3e37b4fd32cf8ce557c156"}},{"ruleId":"D1","level":"warning","message":{"text":"NavigabilityAnalyzer.RunAsync (cyclomatic 18): NavigabilityAnalyzer.RunAsync has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Architecture/NavigabilityAnalyzer.cs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"539e629aa8aba8a81abce510cafe22fd4a3333385bb16eec37fda2c5aeb728d9"}},{"ruleId":"D1","level":"warning","message":{"text":"DeclaredDependencies.RangeAdmits (cyclomatic 18): DeclaredDependencies.RangeAdmits 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/DeclaredDependencies.cs"},"region":{"startLine":1438}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6ef6e38a874b57ba76547f28e03ed20518d2042bda30ab4804cd2d66b4ac21c"}},{"ruleId":"D1","level":"warning","message":{"text":"JsSiblingScopeReadScan.FindingsIn (cyclomatic 18): JsSiblingScopeReadScan.FindingsIn 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/JsSiblingScopeReadScan.cs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"981db6f602cf36986124c092b86740953a59108164cc7e3c2021c80645587d85"}},{"ruleId":"D1","level":"warning","message":{"text":"NpmLockGraph.DeclaredEntryAbove (cyclomatic 18): NpmLockGraph.DeclaredEntryAbove 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/NpmLockGraph.cs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"e683b8b38dc9e9f1294608bdec3ac687a8464eeb4b462e9eb47535b0564f184d"}},{"ruleId":"D1","level":"warning","message":{"text":"ScanParsers.LockResolvedMajors (cyclomatic 18): ScanParsers.LockResolvedMajors has cyclomatic complexity 18 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/ScanParsers.cs"},"region":{"startLine":2812}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8e7da38df60e71267931d51dc9a6a099a103925bb831c2ff4bb6da298edc2ef"}},{"ruleId":"D1","level":"warning","message":{"text":"SecretNoiseFilter.IsEnumeratedDocExampleBinding (cyclomatic 18): SecretNoiseFilter.IsEnumeratedDocExampleBinding 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/SecretNoiseFilter.cs"},"region":{"startLine":2647}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d495decd4fd93c84325756bfb2c6347bbb4cc168d49739fed62c43b8fa51436"}},{"ruleId":"D1","level":"warning","message":{"text":"SpringSecurityActuatorRecheck.ConfiguresSecurity (cyclomatic 18): SpringSecurityActuatorRecheck.ConfiguresSecurity 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/SpringSecurityActuatorRecheck.cs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"85fc533b1bf76e0e8e2523ab0c601573ddcd1e2b57d2d934717858a519e18c87"}},{"ruleId":"D1","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.ScriptBlocks (cyclomatic 18): SupplyChainProvenanceAnalyzer.ScriptBlocks 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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":9471}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b6bc775dca6722acad2e43ad55a6fdcd341a57df79185b7755c6eee6fcb32b1"}},{"ruleId":"D1","level":"warning","message":{"text":"ChangeCouplingAnalyzer.IsVersionStampFile (cyclomatic 18): ChangeCouplingAnalyzer.IsVersionStampFile has cyclomatic complexity 18 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.GitMining/ChangeCouplingAnalyzer.cs"},"region":{"startLine":2679}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fa69526e732c9b707d641fe412d1121a714afefee56f270bc68d8d8af7d39cc"}},{"ruleId":"D1","level":"warning","message":{"text":"DecisionReportsList.razor \u203A LoadGalleryAsync (cyclomatic 18): DecisionReportsList.razor \u203A LoadGalleryAsync has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Kennel.Assay.Core/DecisionReports/Ui/DecisionReportsList.razor"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f8a8f5f14c5f3e90af4f0819d41e2525367d50c0845014e68283c9a26ac76ce"}},{"ruleId":"D1","level":"warning","message":{"text":"Emitter.bufferBody (cyclomatic 18): Emitter.bufferBody has cyclomatic complexity 18 (threshold 15). 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":"engine/sidecars/java-spoon/src/main/java/dev/canine/codehealth/java/Emitter.java"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d868200f9a2e99682681ff45237147d9ba2cccb686f406ecfa3420144871644"}},{"ruleId":"D1","level":"warning","message":{"text":"check.main (cyclomatic 18): check.main has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/java-spoon/selftest/check.py"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd6d514d83644ddb584b99df3522649c40f7ab5fefc8d1662e56a414c0671785"}},{"ruleId":"D1","level":"warning","message":{"text":"build_dimension_noise.load_language (cyclomatic 18): build_dimension_noise.load_language 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":"tools/depthnoise/build_dimension_noise.py"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"15f70627fa2f71c75c2b2d5958b61a4075f600763d0662ee49cbf760dcb103bd"}},{"ruleId":"D1","level":"warning","message":{"text":"render_depth_noise.render (cyclomatic 18): render_depth_noise.render 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":"tools/depthnoise/render_depth_noise.py"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7940f547ad15c6118a40972db6abd93c3e03dc6b910d430523bfc46f25037e2"}},{"ruleId":"D1","level":"warning","message":{"text":"render_dimension_noise.render (cyclomatic 18): render_dimension_noise.render 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":"tools/depthnoise/render_dimension_noise.py"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"d472d43cfa3829530a814d0ede6989b3f389fcf076f40e505e13269a94526ebd"}},{"ruleId":"D1","level":"warning","message":{"text":"dod_gate.main (cyclomatic 18): dod_gate.main 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":"tools/multilang/dod_gate.py"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"110e01ac2098653857aa62d7d239802a932d3bc588e0dd5d2cac9e3c88a55dcd"}},{"ruleId":"D1","level":"warning","message":{"text":"scan.warn_image_stale (cyclomatic 18): scan.warn_image_stale 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":"tools/multilang/scan.py"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"d156a9c3cd2c5f1b008fd39d3548e5aafaf1da8b7b8c5ecad406386ee3ad3f55"}},{"ruleId":"D1","level":"warning","message":{"text":"diff.compare (cyclomatic 18): diff.compare 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":"tools/rescan/diff.py"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f4f8939c8997837c2d1ef967a61e717dd5e4123651b46354dcd7c3ef5dc7ddd"}},{"ruleId":"D1","level":"warning","message":{"text":"programme-status.stale_window_report (cyclomatic 18): programme-status.stale_window_report 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":"tools/train/programme-status.py"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5817a0895d25865be6ee96070f132127fe96c9f131aafb5cb19aec5def8bf0a"}},{"ruleId":"D1","level":"warning","message":{"text":"programme-status.divergent_gold_report (cyclomatic 18): programme-status.divergent_gold_report 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":"tools/train/programme-status.py"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0f6101778d5960c0691ca0b7f5de94b11dc6c72635d795a81600dda2936afde"}},{"ruleId":"D1","level":"warning","message":{"text":"report_verification.main (cyclomatic 18): report_verification.main has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/report_verification.py"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"b636e79380dee00b02f846753f73c5cec711137194dd1d886b848269c3401e2d"}},{"ruleId":"D1","level":"warning","message":{"text":"main.dataLiteralMaskOver (cyclomatic 18): main.dataLiteralMaskOver has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 5 of the 18 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 337, 322). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/go/bodylines.go"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"80aa48bdcc961f62e8fa146661d1245e4cf8f9e16168ae1fa4730bd2304cb8dd"}},{"ruleId":"D1","level":"warning","message":{"text":"extractor.collectInterfaceAssertions (cyclomatic 18): extractor.collectInterfaceAssertions 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":"engine/sidecars/go/implements.go"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"b719096aab6037bb838363df3bb358dea4c9bc2d18415b5dae5ca9a209c91824"}},{"ruleId":"D1","level":"warning","message":{"text":"main (cyclomatic 18): main has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 7 of the 18 points are its own statements and the rest belongs to 11 function items inside it that branch (card, (anonymous), (anonymous), \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/localdev/ui/capture.mjs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ce7e75c8026cebeed226c55d0bc5e12c32aa2b36034e4f19ccc9baaa72d7dc4"}},{"ruleId":"D1","level":"warning","message":{"text":"ApiSurfaceExtractor.ScanControllerMethods (cyclomatic 17): ApiSurfaceExtractor.ScanControllerMethods 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":"engine/src/CodeHealth.Core/ApiSurface/ApiSurfaceExtractor.cs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ab42873dcb203792af2ab67e3883096adf70f1780607700fd034ee6e2c7a33d"}},{"ruleId":"D1","level":"warning","message":{"text":"RoslynMethodBody.StripCommentsAndStrings (cyclomatic 17): RoslynMethodBody.StripCommentsAndStrings has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/CodeModel/Roslyn/RoslynMethodBody.cs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab73a0a08151a928be2a0a9759fc8588b4280d8d7fd0fee741feb3691846dafb"}},{"ruleId":"D1","level":"warning","message":{"text":"LineBasedGodClassDetector.ContractRepeatedMemberSurplus (cyclomatic 17): LineBasedGodClassDetector.ContractRepeatedMemberSurplus 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":"engine/src/CodeHealth.Core/CodeShape/LineBasedGodClassDetector.cs"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"f22d3a1e18a5cdec82f5d2f2b653f439a39cb76d6d94b096284ee144b76a58ae"}},{"ruleId":"D1","level":"warning","message":{"text":"NeutralFileLengthScanner.RustImplSubject (cyclomatic 17): NeutralFileLengthScanner.RustImplSubject has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/CodeShape/NeutralFileLengthScanner.cs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"91bd20af0fc11ca8a2503d95f2cb5b6843e8a89712f7f7fc4e705a2373211fe8"}},{"ruleId":"D1","level":"warning","message":{"text":"RazorCodeVirtualizer.FindMatchingBrace (cyclomatic 17): RazorCodeVirtualizer.FindMatchingBrace 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":"engine/src/CodeHealth.Core/CodeShape/RazorCodeVirtualizer.cs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"92b86205fc620029fe480efed9f2514a78b9e35ea00592ed888c5b2904ed19d9"}},{"ruleId":"D1","level":"warning","message":{"text":"RazorCodeVirtualizer.SkipString (cyclomatic 17): RazorCodeVirtualizer.SkipString 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":"engine/src/CodeHealth.Core/CodeShape/RazorCodeVirtualizer.cs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"57335d482ae728c5a53555fb138fd08279bf3a80f0b8d5d63e43c42429fb3e54"}},{"ruleId":"D1","level":"warning","message":{"text":"RoslynDuplicationDetector.AppendRenameClones (cyclomatic 17): RoslynDuplicationDetector.AppendRenameClones has cyclomatic complexity 17 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 5 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":"engine/src/CodeHealth.Core/CodeShape/RoslynDuplicationDetector.cs"},"region":{"startLine":2573}}}],"partialFingerprints":{"codehealthFindingId/v1":"c94bfd9031a883f61289b54a64b8bc76cc64e67cf7d20f118b594f28c4127e73"}},{"ruleId":"D1","level":"warning","message":{"text":"RoslynDuplicationDetector.IsSelfContainedTestSupportModule (cyclomatic 17): RoslynDuplicationDetector.IsSelfContainedTestSupportModule 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":"engine/src/CodeHealth.Core/CodeShape/RoslynDuplicationDetector.cs"},"region":{"startLine":3021}}}],"partialFingerprints":{"codehealthFindingId/v1":"10c4db817f0db512a74a34777be8a1776c0c0584f835e9410e5e684bf9d51e85"}},{"ruleId":"D1","level":"warning","message":{"text":"FileSystemDocumentationCollector.CollectAsync (cyclomatic 17): FileSystemDocumentationCollector.CollectAsync 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":"engine/src/CodeHealth.Core/Docs/FileSystemDocumentationCollector.cs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc587da7f2bb5be07e920eac4b119fcce905d05f21f3fb0e72f0af44945a5eea"}},{"ruleId":"D1","level":"warning","message":{"text":"RoslynDeadCodeDetector.IsReflectivelyRegistered (cyclomatic 17): RoslynDeadCodeDetector.IsReflectivelyRegistered 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":"engine/src/CodeHealth.Core/ExplicitDebt/RoslynDeadCodeDetector.cs"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"a87efdbeef9ced962ed85ba67f8e59b3f6f3a3a7e2852adbf8b814a0cc7b9c54"}},{"ruleId":"D1","level":"warning","message":{"text":"RoslynExplicitDebtCollector.IsTagShaped (cyclomatic 17): RoslynExplicitDebtCollector.IsTagShaped has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ExplicitDebt/RoslynExplicitDebtCollector.cs"},"region":{"startLine":1852}}}],"partialFingerprints":{"codehealthFindingId/v1":"2927ca2b1578318f74990c8ae1a94821643b6b63ea3f50d4d2b8f193788a8c68"}},{"ruleId":"D1","level":"warning","message":{"text":"RoslynExplicitDebtCollector.IllustrationBlockLines (cyclomatic 17): RoslynExplicitDebtCollector.IllustrationBlockLines has cyclomatic complexity 17 (threshold 15). 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":"engine/src/CodeHealth.Core/ExplicitDebt/RoslynExplicitDebtCollector.cs"},"region":{"startLine":2844}}}],"partialFingerprints":{"codehealthFindingId/v1":"9577a9a5f3cb306c99c0207767beb2650b1c45f2227f9c4ee80524035c2d2b89"}},{"ruleId":"D1","level":"warning","message":{"text":"FrontendBoundaries.IsNonProductionImporter (cyclomatic 17): FrontendBoundaries.IsNonProductionImporter 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":"engine/src/CodeHealth.Core/Frontend/FrontendBoundaries.cs"},"region":{"startLine":2103}}}],"partialFingerprints":{"codehealthFindingId/v1":"c989badc067de6307e6690da16312f2eb0cd84c0ca8b862c488b14ad00c99dc0"}},{"ruleId":"D1","level":"warning","message":{"text":"FrontendDeadCode.FindUnregisteredContributions (cyclomatic 17): FrontendDeadCode.FindUnregisteredContributions 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":"engine/src/CodeHealth.Core/Frontend/FrontendDeadCode.cs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf1658fceb96eab5946157fbf74c1f4cbbd165681135389334054042cb1b7035"}},{"ruleId":"D1","level":"warning","message":{"text":"FrontendEngineDimensions.SiblingFamilyFindings (cyclomatic 17): FrontendEngineDimensions.SiblingFamilyFindings has cyclomatic complexity 17 (threshold 15). Of this number, 9 points are the body\u0027s own statements and 8 belong to 3 function literals inside it that branch. To reduce it, 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":"engine/src/CodeHealth.Core/Frontend/FrontendEngineDimensions.cs"},"region":{"startLine":1357}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e6ff9b978f1c0ca4313d9e0ae3ffdb8cb58730cc3c69af86211d95c373299a9"}},{"ruleId":"D1","level":"warning","message":{"text":"FrontendManifestEntryPoints.CollectRegistryManifestFiles (cyclomatic 17): FrontendManifestEntryPoints.CollectRegistryManifestFiles 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":"engine/src/CodeHealth.Core/Frontend/FrontendManifestEntryPoints.cs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca0dcb486419680ca6659270cadbe4be86d1223a93d1e42b43ddf2ca4936f2c7"}},{"ruleId":"D1","level":"warning","message":{"text":"FrontendScriptCommandRefs.CollectPnpmLockPeerContracts (cyclomatic 17): FrontendScriptCommandRefs.CollectPnpmLockPeerContracts 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":"engine/src/CodeHealth.Core/Frontend/FrontendScriptCommandRefs.cs"},"region":{"startLine":961}}}],"partialFingerprints":{"codehealthFindingId/v1":"30e8a384b331bf536ffb07f302d58fb4a432ce7b554bae7a171411c2aba00563"}},{"ruleId":"D1","level":"warning","message":{"text":"FrontendTestReachability.ForeignBrowserSuiteReached (cyclomatic 17): FrontendTestReachability.ForeignBrowserSuiteReached has cyclomatic complexity 17 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/FrontendTestReachability.cs"},"region":{"startLine":1945}}}],"partialFingerprints":{"codehealthFindingId/v1":"5532644f438af4373819bfe881445f0ab644015b9c736d5977b53dad6a9edac3"}},{"ruleId":"D1","level":"warning","message":{"text":"JsDuplicationDetector.RecogniseDeclarationRun (cyclomatic 17): JsDuplicationDetector.RecogniseDeclarationRun 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":"engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs"},"region":{"startLine":1841}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9128073ea3d2244b55e792e0db8534e6b5f81ba4f4e18aab021dec74a487739"}},{"ruleId":"D1","level":"warning","message":{"text":"JsDuplicationDetector.MatchWholesale (cyclomatic 17): JsDuplicationDetector.MatchWholesale 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":"engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs"},"region":{"startLine":5297}}}],"partialFingerprints":{"codehealthFindingId/v1":"94e92911821242eae1b5222cabf735008cf35c6c2a4072559c0c03f345e6f1cd"}},{"ruleId":"D1","level":"warning","message":{"text":"Scanner.TryScanJsxTypeArguments (cyclomatic 17): Scanner.TryScanJsxTypeArguments 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":"engine/src/CodeHealth.Core/Frontend/JsLexer.Jsx.cs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1a12b9c2452633b060fb9ef21ca4e481f187cb3e30c5c398af73a4fbfa0a884"}},{"ruleId":"D1","level":"warning","message":{"text":"ModuleSyntaxScanner.SkipReturnTypeAnnotation (cyclomatic 17): ModuleSyntaxScanner.SkipReturnTypeAnnotation 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":"engine/src/CodeHealth.Core/Frontend/ModuleSyntaxScanner.cs"},"region":{"startLine":1568}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4600e8c9d034bfdedc620cbb5e0bb37c4365c3f1d36b10bab4b40182d9552a1"}},{"ruleId":"D1","level":"warning","message":{"text":"MaturityAnalyzer.HasPerPackageSrcLayout (cyclomatic 17): MaturityAnalyzer.HasPerPackageSrcLayout 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":"engine/src/CodeHealth.Core/Maturity/MaturityAnalyzer.cs"},"region":{"startLine":3109}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a66af7c644caccb93fc94bf6b0ed63705002f2fac0635d60a698e209105c30c"}},{"ruleId":"D1","level":"warning","message":{"text":"AmbientInputAnalyzer.Analyze (cyclomatic 17): AmbientInputAnalyzer.Analyze has cyclomatic complexity 17 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 6 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":"engine/src/CodeHealth.Core/ModelAware/AmbientInputAnalyzer.cs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"b72e3ebfb30942b04fb02c93f83c272586e6f038923cfc5da570f4ee3df6916f"}},{"ruleId":"D1","level":"warning","message":{"text":"AmbientInputAnalyzer.Analyze (cyclomatic 17): AmbientInputAnalyzer.Analyze has cyclomatic complexity 17 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 7 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":"engine/src/CodeHealth.Core/ModelAware/AmbientInputAnalyzer.cs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"faae559a2be2084c2d4005bdb1bc057ba3e79156d0324a57609420091875289d"}},{"ruleId":"D1","level":"warning","message":{"text":"ArchitectureModelAnalyzer.TryReadRegistration (cyclomatic 17): ArchitectureModelAnalyzer.TryReadRegistration 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":"engine/src/CodeHealth.Core/ModelAware/ArchitectureModelAnalyzer.cs"},"region":{"startLine":1888}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bd4ee597c033f5c9ae7ff59a18a95112727e9993b9f348d058612ca81379219"}},{"ruleId":"D1","level":"warning","message":{"text":"DomainModelAnalyzer.PrimitiveDataClumps (cyclomatic 17): DomainModelAnalyzer.PrimitiveDataClumps has cyclomatic complexity 17 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"9981517cca7675e88baa7d00afb104f7844fe0f0cfbd101d5c676d3d57689498"}},{"ruleId":"D1","level":"warning","message":{"text":"EventDrivenAnalyzer.MessageTypesHandledBy (cyclomatic 17): EventDrivenAnalyzer.MessageTypesHandledBy has cyclomatic complexity 17 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"70e38e785256b8b7bb8b63a1dab5899928eb5de1ca3213da2b38af6aa0ae0a9a"}},{"ruleId":"D1","level":"warning","message":{"text":"EventSourcingAnalyzer.ImmutableEvents (cyclomatic 17): EventSourcingAnalyzer.ImmutableEvents has cyclomatic complexity 17 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 3 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/EventSourcingAnalyzer.cs"},"region":{"startLine":1007}}}],"partialFingerprints":{"codehealthFindingId/v1":"e65b58bab6b3d88e240d4daaef3e502db2ba9a2d158d943c5da85fc1e7e60b01"}},{"ruleId":"D1","level":"warning","message":{"text":"GoDomainConventions.FoldMethods (cyclomatic 17): GoDomainConventions.FoldMethods has cyclomatic complexity 17 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, 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":"engine/src/CodeHealth.Core/ModelAware/GoDomainConventions.cs"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"670d6f982e22bdcf7ec0b5e78a1484098fe2e745a528da98c02732ada8230246"}},{"ruleId":"D1","level":"warning","message":{"text":"GoDomainConventions.GoHttpReadHandlerLeak (cyclomatic 17): GoDomainConventions.GoHttpReadHandlerLeak has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/GoDomainConventions.cs"},"region":{"startLine":1185}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c6b33f26586d1e4e3f52c92f2ac3b5440fe79c303b88b52d4c33a53361f97a7"}},{"ruleId":"D1","level":"warning","message":{"text":"GoDomainConventions.CrossContextReferenceIdFields (cyclomatic 17): GoDomainConventions.CrossContextReferenceIdFields 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":"engine/src/CodeHealth.Core/ModelAware/GoDomainConventions.cs"},"region":{"startLine":3015}}}],"partialFingerprints":{"codehealthFindingId/v1":"009599af93fdb71fc6c082648b145bad1a445869dd28000f17a45f5a663c0627"}},{"ruleId":"D1","level":"warning","message":{"text":"IncompletenessAnalyzer.DebugOnlyBoundChecks (cyclomatic 17): IncompletenessAnalyzer.DebugOnlyBoundChecks 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":"engine/src/CodeHealth.Core/ModelAware/IncompletenessAnalyzer.cs"},"region":{"startLine":1292}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b97b7b5b519688e23ca7dd3a43e813b0421930feb4c8954f1eb01476e493d8d"}},{"ruleId":"D1","level":"warning","message":{"text":"IncompletenessAnalyzer.ApplyOneHopReachabilityAsync (cyclomatic 17): IncompletenessAnalyzer.ApplyOneHopReachabilityAsync 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":"engine/src/CodeHealth.Core/ModelAware/IncompletenessAnalyzer.cs"},"region":{"startLine":4645}}}],"partialFingerprints":{"codehealthFindingId/v1":"055c9721c2401aa2f58da02ca7dc9b531ef7d01bea43f1c75101a86091420627"}},{"ruleId":"D1","level":"warning","message":{"text":"InvocationMatching.StripCommentsAndStrings (cyclomatic 17): InvocationMatching.StripCommentsAndStrings has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/InvocationMatching.cs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"908754582ff86e9932f5f88347e394aaf33862ecc6c35305e35f75749b4d18eb"}},{"ruleId":"D1","level":"warning","message":{"text":"MarkupTaintPass.CollectAsync (cyclomatic 17): MarkupTaintPass.CollectAsync 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":"engine/src/CodeHealth.Core/ModelAware/MarkupTaintPass.cs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d5dd3963316942f057763c9b927ef4e25a8371d3cb7ac79fcdcab078bc94591"}},{"ruleId":"D1","level":"warning","message":{"text":"PhpDomainConventions.IsStructuralAggregate (cyclomatic 17): PhpDomainConventions.IsStructuralAggregate 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, 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":"engine/src/CodeHealth.Core/ModelAware/PhpDomainConventions.cs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bda1716602eb34535bb2c28e4837d24d3b1b13089b99101d9494a0342e5090f"}},{"ruleId":"D1","level":"warning","message":{"text":"RepoProfiler.DetectEventDriven (cyclomatic 17): RepoProfiler.DetectEventDriven has cyclomatic complexity 17 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/RepoProfiler.cs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"747a7cc13c22f46ddb91192701058915727da13c3f14175cb40e1a6b10159047"}},{"ruleId":"D1","level":"warning","message":{"text":"RustDomainConventions.RawPrimitiveIds (cyclomatic 17): RustDomainConventions.RawPrimitiveIds has cyclomatic complexity 17 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 6 belong to 3 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/RustDomainConventions.cs"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f27bfa883063200789c7e0ee5bcce3dc8432ad7bf0ea442e0884de968a49f92"}},{"ruleId":"D1","level":"warning","message":{"text":"RustDomainConventions.RustDualWrites (cyclomatic 17): RustDomainConventions.RustDualWrites has cyclomatic complexity 17 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 5 belong to 5 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":"engine/src/CodeHealth.Core/ModelAware/RustDomainConventions.cs"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b905e080356c0cbe22a0ac067c934b337da1cbf4d84033b60a8134fe1df3148"}},{"ruleId":"D1","level":"warning","message":{"text":"CiWorkflowReader.TopLevelTriggers (cyclomatic 17): CiWorkflowReader.TopLevelTriggers 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":"engine/src/CodeHealth.Core/Readiness/CiWorkflowReader.cs"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"27aa5616e61e2dd2ef1cfc6257eb8dd943847aad55652ce4bcb5c6b920bee961"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeSecretScanner.IsExcludedPath (cyclomatic 17): NativeSecretScanner.IsExcludedPath has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Security/NativeSecretScanner.cs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"736cc6a6693647730d0ed87703921f49ae29728768043e228d8c605229e4ec35"}},{"ruleId":"D1","level":"warning","message":{"text":"CommittedCoverageReader.MergeLcovPerFile (cyclomatic 17): CommittedCoverageReader.MergeLcovPerFile 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":"engine/src/CodeHealth.Core/Testing/CommittedCoverageReader.cs"},"region":{"startLine":1042}}}],"partialFingerprints":{"codehealthFindingId/v1":"26a9776e698f8ebdee1523dc0e276f5e2391f15ae537d56e262da616f8b21858"}},{"ruleId":"D1","level":"warning","message":{"text":"CommittedCoverageReader.MergeGoCoverProfilePerFile (cyclomatic 17): CommittedCoverageReader.MergeGoCoverProfilePerFile 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":"engine/src/CodeHealth.Core/Testing/CommittedCoverageReader.cs"},"region":{"startLine":1111}}}],"partialFingerprints":{"codehealthFindingId/v1":"41933d94b89896bb8d2fc0132933caec13c905667cc015ea81515b5c2fb53b9c"}},{"ruleId":"D1","level":"warning","message":{"text":"DiskTestScanner.VbaContainerTestSourceExtensions (cyclomatic 17): DiskTestScanner.VbaContainerTestSourceExtensions 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":"engine/src/CodeHealth.Core/Testing/DiskTestScanner.cs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"82ca197574e3c32ef904ad9d9cdc1ee7acb0e3293de55566c76092f15779fdbe"}},{"ruleId":"D1","level":"warning","message":{"text":"DiskTestScanner.JsTestFiles (cyclomatic 17): DiskTestScanner.JsTestFiles has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Testing/DiskTestScanner.cs"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea3d4064bb123d26483c84dee95a7cb55c780d2b8c21285d66f28df74266c1b5"}},{"ruleId":"D1","level":"warning","message":{"text":"JsTestQualityCensus.DeclarationBody (cyclomatic 17): JsTestQualityCensus.DeclarationBody 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":"engine/src/CodeHealth.Core/Testing/JsTestQualityCensus.cs"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd451e645a9cf72be10943ae1d916becc392e329d25415d9b40f5cdd20dc6ea7"}},{"ruleId":"D1","level":"warning","message":{"text":"PythonTestCensus.BlankString (cyclomatic 17): PythonTestCensus.BlankString 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":"engine/src/CodeHealth.Core/Testing/PythonTestCensus.cs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"980f61c26964cb28a70b7db34f6c59f7eb4d6a28ceb9d293baf21b4e40c283aa"}},{"ruleId":"D1","level":"warning","message":{"text":"SelfDeclaredUnreliableTests.Find (cyclomatic 17): SelfDeclaredUnreliableTests.Find has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Testing/SelfDeclaredUnreliableTests.cs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"af670e3201e37bcfc6065f4e124108014e2f593ca771f9f3076b2925d45e455a"}},{"ruleId":"D1","level":"warning","message":{"text":"ChangeSetBuilder.MergeCommitSubsetShadows (cyclomatic 17): ChangeSetBuilder.MergeCommitSubsetShadows 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":"engine/src/CodeHealth.Reporting/Changelog/Fusion/ChangeSetBuilder.cs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"dad874ea1c846c6269818e45d2b83c7ec34018626c43dfab4db6f74a9f032f6b"}},{"ruleId":"D1","level":"warning","message":{"text":"OsvDependencyVulnerabilityArm.CollectAsync (cyclomatic 17): OsvDependencyVulnerabilityArm.CollectAsync has cyclomatic complexity 17 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 6 belong to 2 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/OsvScannerAnalyzer.cs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"c08a640550d4ed4b5e252317c98fdae4f61a07d9541ddcf698907558df741676"}},{"ruleId":"D1","level":"warning","message":{"text":"DeclaredDependencies.ParsePyProject (cyclomatic 17): DeclaredDependencies.ParsePyProject 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/DeclaredDependencies.cs"},"region":{"startLine":1933}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ffbbcd150518466ca280addeec353deb007993a8e191ad6b30c3ca54e6ae5af"}},{"ruleId":"D1","level":"warning","message":{"text":"DockerfileShapeRuleFilter.EveryPackageStepMountsTheCache (cyclomatic 17): DockerfileShapeRuleFilter.EveryPackageStepMountsTheCache 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/DockerfileShapeRuleFilter.cs"},"region":{"startLine":1172}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3b577722bae3b1d9cd5b604ff18ad0ef56d0e05e08973f7c86e2c28fb3aac11"}},{"ruleId":"D1","level":"warning","message":{"text":"UnverifiedTrustAnchorScan.OffendingFetch (cyclomatic 17): UnverifiedTrustAnchorScan.OffendingFetch 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/UnverifiedTrustAnchorScan.cs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ef1613e1ca0d850b443285a6e57c9acd9ac27c6946bdcfb9fe9626e0752d8da"}},{"ruleId":"D1","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.JobSteps (cyclomatic 17): SupplyChainProvenanceAnalyzer.JobSteps 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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":2140}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcea56906b41724358e1a2460532191c31160e1cbc029bd57eaa966a1e964b2c"}},{"ruleId":"D1","level":"warning","message":{"text":"ChangeCouplingAnalyzer.NamesRepoSubtypeOf (cyclomatic 17): ChangeCouplingAnalyzer.NamesRepoSubtypeOf 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":"engine/src/CodeHealth.Dimensions.GitMining/ChangeCouplingAnalyzer.cs"},"region":{"startLine":4243}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f2b58d6c404043a04d4ed7545b4c25f20d3a9dfb355c544d00e09f9631169ab"}},{"ruleId":"D1","level":"warning","message":{"text":"TestReliabilityAnalyzer.PolyglotUnmeasured (cyclomatic 17): TestReliabilityAnalyzer.PolyglotUnmeasured has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Testing/TestReliabilityAnalyzer.cs"},"region":{"startLine":868}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff6a08525c93f253a4944f326fa3c3b09a0ff25b39707ab79582947de499ffcf"}},{"ruleId":"D1","level":"warning","message":{"text":"FSharpBody.buildLiterals (cyclomatic 17): FSharpBody.buildLiterals 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":"engine/src/CodeHealth.CodeModel.FSharp/Body.fs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e88b592e32e5e12d3c01fe0f807fc0893efa044d1e03ae40b7f7948243e6c83"}},{"ruleId":"D1","level":"warning","message":{"text":"verified_history.append_verified_history (cyclomatic 17): verified_history.append_verified_history 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":"tools/depthnoise/verified_history.py"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e2b16f06a6e8979d92d98d3306c98a43bad37b85d057b23c92c279c78eea3d2"}},{"ruleId":"D1","level":"warning","message":{"text":"census.audit (cyclomatic 17): census.audit has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/rescan/census.py"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"6292dc4b3c2e8f192def7b2e9df38752d6ad1b02989e4b0aee51388633da7aa6"}},{"ruleId":"D1","level":"warning","message":{"text":"judge_assignment.render_markdown (cyclomatic 17): judge_assignment.render_markdown 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":"tools/train/judge_assignment.py"},"region":{"startLine":1626}}}],"partialFingerprints":{"codehealthFindingId/v1":"d29a6c4057a260e4525d1cdb927b3da5890033aa8814b1de2f438f098d37efb0"}},{"ruleId":"D1","level":"warning","message":{"text":"report_round.self_check (cyclomatic 17): report_round.self_check has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/report_round.py"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d197df4bc393e3d7a551f052c4c116ee6c81cbbbb6f7c44532590321800e5df"}},{"ruleId":"D1","level":"warning","message":{"text":"run-arms.main (cyclomatic 17): run-arms.main 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":"tools/train/run-arms.py"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac050cfc2674431ed80614ffe2aedd8989d9ac9b05a46d460e2c79168881e941"}},{"ruleId":"D1","level":"warning","message":{"text":"sample-by-kind.main (cyclomatic 17): sample-by-kind.main has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/sample-by-kind.py"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f9a0eede719d6117299106d7eeeea7bd3c84c23e4c4314c49a94d25452d0bad"}},{"ruleId":"D1","level":"warning","message":{"text":"SymbolCollector.enterNode (cyclomatic 17): SymbolCollector.enterNode 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":"engine/sidecars/php-frontend/main.php"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"1726e8b45766d3782acddddad9236664e3a756c9e95cd04e394b61dc82d743aa"}},{"ruleId":"D1","level":"warning","message":{"text":"bodyResolver.recoverCatchOf (cyclomatic 17): bodyResolver.recoverCatchOf has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 3 of the 17 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 472, 502). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/go/bodyshapes.go"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"781ab12382e13833f9f06dab190f34e4a10cd481b0bd1f8f4dba248ab81556ef"}},{"ruleId":"D1","level":"warning","message":{"text":"extractor.extractPackage (cyclomatic 17): extractor.extractPackage 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":"engine/sidecars/go/extract.go"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"388484ada6c51a39fcc0f36d41ca7dab891a15ef6283ef8becb1937a2d1bb90c"}},{"ruleId":"D1","level":"warning","message":{"text":"extractor.assertedTypeFqn (cyclomatic 17): extractor.assertedTypeFqn 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":"engine/sidecars/go/implements.go"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"69e4dae24046bd62d32e334e0a75d5b614ad9138bbb228a908d8f00f448a9745"}},{"ruleId":"D1","level":"warning","message":{"text":"codehealth_rust_sidecar::main (cyclomatic 17): codehealth_rust_sidecar::main has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/rust-frontend/src/main.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef3b1effd0635b0ccb416bc7a8c5b8801457addaa53ca2d09a69426d96981a13"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::(anonymous)::describe (cyclomatic 17): (anonymous)::(anonymous)::describe has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Kennel.Ui/wwwroot/kennel-ui.js"},"region":{"startLine":974}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2220d5134656e2b8c88c79a6cb9c3552e73b3a32b9a1b3a0d42f37d188ca7a5"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::renderDelta (cyclomatic 17): (anonymous)::renderDelta has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Kennel.Ui/wwwroot/kennel-ui.js"},"region":{"startLine":1535}}}],"partialFingerprints":{"codehealthFindingId/v1":"625d2cf27c79708b69ce5daa95228f786d4869a0c4e337db2a73089a3871e22c"}},{"ruleId":"D1","level":"warning","message":{"text":"BoundaryCouplingDetector.ScanRoslynAsync (cyclomatic 16): BoundaryCouplingDetector.ScanRoslynAsync 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":"engine/src/CodeHealth.Core/Architecture/BoundaryCouplingDetector.cs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"83209a6950729b29d9312a296bf57f8f679317792f68cdbefb27f0988217fdf4"}},{"ruleId":"D1","level":"warning","message":{"text":"SliceLocalityDetector.Collaborators (cyclomatic 16): SliceLocalityDetector.Collaborators 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":"engine/src/CodeHealth.Core/Architecture/SliceLocalityDetector.cs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fcdade10c7a18b3fcd54ed84b6f4d101ca3cca67e512a44fa32f672bbdcce8d"}},{"ruleId":"D1","level":"warning","message":{"text":"SourceClassifier.IsTestDirectorySegment (cyclomatic 16): SourceClassifier.IsTestDirectorySegment 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":"engine/src/CodeHealth.Core/Classification/SourceClassifier.cs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"bce83c4f66151dfebf9d74091beb2800f81cdf4663a6674adc6d9f6ade4f6d09"}},{"ruleId":"D1","level":"warning","message":{"text":"LineBasedGodClassDetector.DisjointFieldClusters (cyclomatic 16): LineBasedGodClassDetector.DisjointFieldClusters 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":"engine/src/CodeHealth.Core/CodeShape/LineBasedGodClassDetector.cs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"c94802d3df054cf5556aa01c2cda9ba519aaa330314996cfa18a71f12f054fe7"}},{"ruleId":"D1","level":"warning","message":{"text":"NeutralFileLengthScanner.SkipNumber (cyclomatic 16): NeutralFileLengthScanner.SkipNumber has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/CodeShape/NeutralFileLengthScanner.cs"},"region":{"startLine":1246}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d3dc47c40151b49daf59080d675d29abdcf85ca8d21e05c5d25895990276081"}},{"ruleId":"D1","level":"warning","message":{"text":"NeutralMethodLengthScanner.DeclaredMethodsByFile (cyclomatic 16): NeutralMethodLengthScanner.DeclaredMethodsByFile 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":"engine/src/CodeHealth.Core/CodeShape/NeutralMethodLengthScanner.cs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4c9d1bbdd77a679628b9cb7f7f4df027d6ae2fdff7f1b756da1d2191dbe1c07"}},{"ruleId":"D1","level":"warning","message":{"text":"LineLexer.CharLiteralEnd (cyclomatic 16): LineLexer.CharLiteralEnd 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":"engine/src/CodeHealth.Core/CodeShape/RustInlineTestRegions.cs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb7b74eff6271b9f6d19f1b917837f5a3000aecb0dbc00734d5badcebb14cc91"}},{"ruleId":"D1","level":"warning","message":{"text":"ControlFlowComplexity.DominantShape (cyclomatic 16): ControlFlowComplexity.DominantShape has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Complexity/ControlFlowComplexity.cs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cc96dae7e9e0258421d3062f591e28fad53e4f47ae863e43dabd3e43b974d5d"}},{"ruleId":"D1","level":"warning","message":{"text":"ComplianceSecurityAnalyzer.DetectSerializedSecretLogging (cyclomatic 16): ComplianceSecurityAnalyzer.DetectSerializedSecretLogging has cyclomatic complexity 16 (threshold 15). 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":"engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs"},"region":{"startLine":1610}}}],"partialFingerprints":{"codehealthFindingId/v1":"6633d123ac36e0c13db1c992c61cdc2caa4f66b0f7a4bdf2b618f04d49a1e558"}},{"ruleId":"D1","level":"warning","message":{"text":"HostedHttpSurfaceScan.RoleOf (cyclomatic 16): HostedHttpSurfaceScan.RoleOf 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":"engine/src/CodeHealth.Core/Compliance/HostedHttpSurfaceScan.cs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"07c265c77e70374ba9bc3a2555922e8cb4360e447e2f7bb26f91e9b721b1a244"}},{"ruleId":"D1","level":"warning","message":{"text":"SwiftPackageHygiene.StripComments (cyclomatic 16): SwiftPackageHygiene.StripComments 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":"engine/src/CodeHealth.Core/Dependencies/SwiftPackageHygiene.cs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"95d600e95ab385b36301ebca57381d57022c2aa6264e167102c8b4a8448a0699"}},{"ruleId":"D1","level":"warning","message":{"text":"FrontendMetaDimensions.Build (cyclomatic 16): FrontendMetaDimensions.Build has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 2 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 312). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest. This is NOT this file\u0027s highest cyclomatic complexity: FrontendMetaDimensions.TestReachabilityFix (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Discovery/FrontendMetaDimensions.cs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9efbf789bfd0b9d885770deff4f1b0f86be8025d4e07a4f5457666b7252ff55"}},{"ruleId":"D1","level":"warning","message":{"text":"RoslynExplicitDebtCollector.CollectPragmaDisables (cyclomatic 16): RoslynExplicitDebtCollector.CollectPragmaDisables 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. This is NOT this file\u0027s highest cyclomatic complexity: RoslynExplicitDebtCollector.ExclusionScope (cyclomatic 17) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ExplicitDebt/RoslynExplicitDebtCollector.cs"},"region":{"startLine":3974}}}],"partialFingerprints":{"codehealthFindingId/v1":"b412e87c0cb56b4e9f11536fec42ec207eef0eabba893a176f0d93fd10458296"}},{"ruleId":"D1","level":"warning","message":{"text":"ObsoleteSuppressionScopes.Build (cyclomatic 16): ObsoleteSuppressionScopes.Build 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. This is NOT this file\u0027s highest cyclomatic complexity: RoslynExplicitDebtCollector.ExclusionScope (cyclomatic 17) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ExplicitDebt/RoslynExplicitDebtCollector.cs"},"region":{"startLine":5720}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fd73390f3ef1a4587f16ba2cfa46990119dc7f1e2ed920b10ba21383cd373f9"}},{"ruleId":"D1","level":"warning","message":{"text":"FrontendBundlerConfigRefs.CollectFrameworkCliEntries (cyclomatic 16): FrontendBundlerConfigRefs.CollectFrameworkCliEntries 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":"engine/src/CodeHealth.Core/Frontend/FrontendBundlerConfigRefs.cs"},"region":{"startLine":1281}}}],"partialFingerprints":{"codehealthFindingId/v1":"de20f05930a6f90c34b1b6a959f6c4b9b38a25ef21552a5806d913e94f04abc1"}},{"ruleId":"D1","level":"warning","message":{"text":"FrontendComplexity.Analyze (cyclomatic 16): FrontendComplexity.Analyze 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":"engine/src/CodeHealth.Core/Frontend/FrontendComplexity.cs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"92dcd4883d97e2ecd60c10851f3bd2c3c2b1f5e9713388a37a5801fcf785d2fe"}},{"ruleId":"D1","level":"warning","message":{"text":"FrontendDeadCode.GitignorePatternMayCover (cyclomatic 16): FrontendDeadCode.GitignorePatternMayCover 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":"engine/src/CodeHealth.Core/Frontend/FrontendDeadCode.cs"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"55a74b2a13cf6db269782be97651ac2f4707835a685ec76f88d0efec611f2196"}},{"ruleId":"D1","level":"warning","message":{"text":"FrontendEmittedTemplateRefs.AddEmittedTemplateTreeRefs (cyclomatic 16): FrontendEmittedTemplateRefs.AddEmittedTemplateTreeRefs 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":"engine/src/CodeHealth.Core/Frontend/FrontendEmittedTemplateRefs.cs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3cf8dc7161e717d8c2168000c614911d951ca09dc8f13454148494e7774e11d"}},{"ruleId":"D1","level":"warning","message":{"text":"FrontendManifestEntryPoints.AddMiniProgramComponents (cyclomatic 16): FrontendManifestEntryPoints.AddMiniProgramComponents 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":"engine/src/CodeHealth.Core/Frontend/FrontendManifestEntryPoints.cs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5e7eddb1f041b3099901e00d8032456d6d3f13b74540c8a76641a129d172be5"}},{"ruleId":"D1","level":"warning","message":{"text":"FrontendManifestEntryPoints.CollectWebExtensionScriptRefs (cyclomatic 16): FrontendManifestEntryPoints.CollectWebExtensionScriptRefs 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":"engine/src/CodeHealth.Core/Frontend/FrontendManifestEntryPoints.cs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"c329fc87967f4d9941d681551594c9a8a31cfc3967ffc19d4dbdeb8a1063374c"}},{"ruleId":"D1","level":"warning","message":{"text":"FrontendToolAndRuntimeRefs.CollectToolConfigModuleRefs (cyclomatic 16): FrontendToolAndRuntimeRefs.CollectToolConfigModuleRefs 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":"engine/src/CodeHealth.Core/Frontend/FrontendToolAndRuntimeRefs.cs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"3852c3a130c6735271cb5a92fa6c416ce311e04bb29e2bbb345c20ca2f11bb29"}},{"ruleId":"D1","level":"warning","message":{"text":"JsComplexity.ComputeCyclomatic (cyclomatic 16): JsComplexity.ComputeCyclomatic 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":"engine/src/CodeHealth.Core/Frontend/JsComplexity.cs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae77db51cbd8f46387b5048ba7c7f227aa324cb9dfc21a275d5fa4a1dfb81354"}},{"ruleId":"D1","level":"warning","message":{"text":"JsDuplicationDetector.IsSpecialisationDelegationRun (cyclomatic 16): JsDuplicationDetector.IsSpecialisationDelegationRun 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":"engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs"},"region":{"startLine":3702}}}],"partialFingerprints":{"codehealthFindingId/v1":"97112e27f00d1983ff104d5ab7c44ad968ac3852f1a054601076cfe51c8badbd"}},{"ruleId":"D1","level":"warning","message":{"text":"JsDuplicationDetector.TrimWiringExtents (cyclomatic 16): JsDuplicationDetector.TrimWiringExtents 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":"engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs"},"region":{"startLine":3932}}}],"partialFingerprints":{"codehealthFindingId/v1":"f50ba9de4e75c9a002d314f80358efce8aa5184564a84d52517a7330e21e6aeb"}},{"ruleId":"D1","level":"warning","message":{"text":"JsDuplicationDetector.IsDestructuringListing (cyclomatic 16): JsDuplicationDetector.IsDestructuringListing has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs"},"region":{"startLine":7345}}}],"partialFingerprints":{"codehealthFindingId/v1":"eac04f0d71d81f98fe18d477b97e674ba7e2fe32a23020700e699dfce334af28"}},{"ruleId":"D1","level":"warning","message":{"text":"Scanner.DecodeUnicodeEscape (cyclomatic 16): Scanner.DecodeUnicodeEscape 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":"engine/src/CodeHealth.Core/Frontend/JsLexer.cs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"a43e6ae3ac317abb60355e54667b495feceaac87e24e3f5e088bd7cce3c5ecbf"}},{"ruleId":"D1","level":"warning","message":{"text":"ModuleResolver.ConditionAlternatives (cyclomatic 16): ModuleResolver.ConditionAlternatives 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":"engine/src/CodeHealth.Core/Frontend/ModuleResolver.cs"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"e08296070e0e82031c56c22534f2c98c9e0baf9adc493329cb9dc9a681a1826a"}},{"ruleId":"D1","level":"warning","message":{"text":"ModuleSyntaxScanner.ScanExportClause (cyclomatic 16): ModuleSyntaxScanner.ScanExportClause 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":"engine/src/CodeHealth.Core/Frontend/ModuleSyntaxScanner.cs"},"region":{"startLine":868}}}],"partialFingerprints":{"codehealthFindingId/v1":"550c9f1e7126b7bc59145183c47a9e80885770b0bdc05d39757eedfb464e8baf"}},{"ruleId":"D1","level":"warning","message":{"text":"PlatformSubstitutionTable.From (cyclomatic 16): PlatformSubstitutionTable.From has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/PlatformSubstitutionTable.cs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6d239483f57241574b3c254c4c0adb8cfa3cd91c651f5c81858ccfc9a076757"}},{"ruleId":"D1","level":"warning","message":{"text":"GitRefStore.Resolve (cyclomatic 16): GitRefStore.Resolve has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Git/GitRefStore.cs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea73a7ee24dee18b0f5f6167a45e0feec940fbcdb28e742728a2fcc12d34c7b6"}},{"ruleId":"D1","level":"warning","message":{"text":"MarkupParser.BlankUnquotedExpressionAttributeValues (cyclomatic 16): MarkupParser.BlankUnquotedExpressionAttributeValues 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":"engine/src/CodeHealth.Core/Markup/MarkupParser.cs"},"region":{"startLine":986}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c085a01c7a7f9fef01be6732983a37bf966cb89c419d84fcf29b62850ed3285"}},{"ruleId":"D1","level":"warning","message":{"text":"MaturityAnalyzer.PubPackageLayoutSeparation (cyclomatic 16): MaturityAnalyzer.PubPackageLayoutSeparation has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Maturity/MaturityAnalyzer.cs"},"region":{"startLine":2544}}}],"partialFingerprints":{"codehealthFindingId/v1":"2688cac29fb0677667730fc51c0f2e7595b3e4ddb2959d7165398202b5f777cd"}},{"ruleId":"D1","level":"warning","message":{"text":"AccessibilityAnalyzer.VisualAndMotion (cyclomatic 16): AccessibilityAnalyzer.VisualAndMotion 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":"engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs"},"region":{"startLine":4496}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9183ce64f2cc738339353ea173ba3107fece75a96c7458d012a24d6eb28b54a"}},{"ruleId":"D1","level":"warning","message":{"text":"AccessibilityAnalyzer.IsHeadingOnlyScriptHost (cyclomatic 16): AccessibilityAnalyzer.IsHeadingOnlyScriptHost 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":"engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs"},"region":{"startLine":7980}}}],"partialFingerprints":{"codehealthFindingId/v1":"c064f9d718607bc3939c188032fa57a075c5116ed7606f1ce8f139739f4d4927"}},{"ruleId":"D1","level":"warning","message":{"text":"AllowlistGate.Evaluate (cyclomatic 16): AllowlistGate.Evaluate 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. This is NOT this file\u0027s highest cyclomatic complexity: AllowlistGate.Classify (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/AllowlistGate.cs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"a34b717364e17d1ae17b32ad2fcb98485d2bf4c7839b34b5d40843d16d0a09b9"}},{"ruleId":"D1","level":"warning","message":{"text":"CoherenceSmellAnalyzer.ScanSubsumedOperands (cyclomatic 16): CoherenceSmellAnalyzer.ScanSubsumedOperands 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. This is NOT this file\u0027s highest cyclomatic complexity: CoherenceSmellAnalyzer.Parse (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/CoherenceSmellAnalyzer.cs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"3471f24e87915864a6bf654ede0b22b828f72506c6942ded4afa3d02c672410f"}},{"ruleId":"D1","level":"warning","message":{"text":"CsprojReferenceGraph.HasTestFrameworkSignal (cyclomatic 16): CsprojReferenceGraph.HasTestFrameworkSignal has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/CsprojReferenceGraph.cs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d9c3e290c938a9e65b6612a1330e15a056c3b4a5a5f11efe16dcfad7ffa9947"}},{"ruleId":"D1","level":"warning","message":{"text":"EventSourcingAnalyzer.References (cyclomatic 16): EventSourcingAnalyzer.References has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/EventSourcingAnalyzer.cs"},"region":{"startLine":1280}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff64005df5f3ffb216c1bc497fac16f8295b2c796cf4ea9f2d1d56f0c63841ca"}},{"ruleId":"D1","level":"warning","message":{"text":"HeadingLabelQualityAnalyzer.AnalyzeAsync (cyclomatic 16): HeadingLabelQualityAnalyzer.AnalyzeAsync 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":"engine/src/CodeHealth.Core/ModelAware/HeadingLabelQualityAnalyzer.cs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"9befd88230b09a31d0e05ad9a08591e67a58a940ca8fb72b3a4abec3d8e36b2f"}},{"ruleId":"D1","level":"warning","message":{"text":"IncompletenessAnalyzer.ComparisonsDecidedByNaN (cyclomatic 16): IncompletenessAnalyzer.ComparisonsDecidedByNaN 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":"engine/src/CodeHealth.Core/ModelAware/IncompletenessAnalyzer.cs"},"region":{"startLine":4176}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c9e5d54e1945fa47f0938cf0beb27b1c20966b31664fb8dc20253cd0a43139b"}},{"ruleId":"D1","level":"warning","message":{"text":"SymbolHelpers.IsStronglyTypedId (cyclomatic 16): SymbolHelpers.IsStronglyTypedId 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":"engine/src/CodeHealth.Core/ModelAware/SymbolHelpers.cs"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2cfc7267531af35b31208435b75887c93dacd1d21f6153ef354881cfaed3ba9"}},{"ruleId":"D1","level":"warning","message":{"text":"PipelineVersionOutputScan.StepContext (cyclomatic 16): PipelineVersionOutputScan.StepContext 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":"engine/src/CodeHealth.Core/Readiness/PipelineVersionOutputScan.cs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"b958024a6fcc120f72ee23326b81189a15968a6a07276fdebdc6a7c707167e7d"}},{"ruleId":"D1","level":"warning","message":{"text":"ProductionReadinessAnalyzer.HasProductionContainerImage (cyclomatic 16): ProductionReadinessAnalyzer.HasProductionContainerImage has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: ProductionReadinessAnalyzer.HasDedicatedSastSignal (cyclomatic 48) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs"},"region":{"startLine":6307}}}],"partialFingerprints":{"codehealthFindingId/v1":"419f35a1e813d9204b9b5a7385c515f2b5886eb3e7232b6a51ae3a09fd23e9a7"}},{"ruleId":"D1","level":"warning","message":{"text":"CodebaseSize.CountTestLocFromCsprojPathsAsync (cyclomatic 16): CodebaseSize.CountTestLocFromCsprojPathsAsync has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Scoring/CodebaseSize.cs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"a253aacc99f9ad5f42ba923bd4441f8b44f5ddbe2ec75d49e79f574c57f61d38"}},{"ruleId":"D1","level":"warning","message":{"text":"CredentialScannerAllowlist.ParsePathPatterns (cyclomatic 16): CredentialScannerAllowlist.ParsePathPatterns 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":"engine/src/CodeHealth.Core/Security/CredentialScannerAllowlist.cs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1175479460043fc1cd5649a74b9fafe8b5f1c77b49732af175d6bc05f6d29b1"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeSecretScanner.IsSigningKeyValue (cyclomatic 16): NativeSecretScanner.IsSigningKeyValue has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, 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":"engine/src/CodeHealth.Core/Security/NativeSecretScanner.cs"},"region":{"startLine":1383}}}],"partialFingerprints":{"codehealthFindingId/v1":"46e0067c85396f2581c540958982cd885834497e07f9783d8bfa5c82950bfa8d"}},{"ruleId":"D1","level":"warning","message":{"text":"DiskTestScanner.DeclaresJsTestRunner (cyclomatic 16): DiskTestScanner.DeclaresJsTestRunner 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":"engine/src/CodeHealth.Core/Testing/DiskTestScanner.cs"},"region":{"startLine":1031}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bbaf70416ba32a054cda9679c691974c89f563030f13db086bb31a1eb3b1748"}},{"ruleId":"D1","level":"warning","message":{"text":"DiskTestScanner.HasPesterTestSuite (cyclomatic 16): DiskTestScanner.HasPesterTestSuite has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Testing/DiskTestScanner.cs"},"region":{"startLine":1192}}}],"partialFingerprints":{"codehealthFindingId/v1":"f01eb9ddf55d91c9299d1850b96dab1f912a14904bdca2ea1710f1fc7946751d"}},{"ruleId":"D1","level":"warning","message":{"text":"NodeBrowserProvision.ExpectedRevisions (cyclomatic 16): NodeBrowserProvision.ExpectedRevisions has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Testing/NodeBrowserProvision.cs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"bca12ac83ed318095adc3bb3f9172b9b4820c1d40b679425c4ce1a975c9cd7de"}},{"ruleId":"D1","level":"warning","message":{"text":"PythonTestCensus.Strip (cyclomatic 16): PythonTestCensus.Strip has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Testing/PythonTestCensus.cs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef767daa0585831522e83ddf3c35621826c8e84f86318c7f497e6de77d001152"}},{"ruleId":"D1","level":"warning","message":{"text":"RoslynTestQualityCollector.IsFetchArgument (cyclomatic 16): RoslynTestQualityCollector.IsFetchArgument 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":"engine/src/CodeHealth.Core/Testing/RoslynTestQualityCollector.cs"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"1569c5a677d517da41ae4d0f5cba4a32be0274d47d51b5def26491a8ff56ee0e"}},{"ruleId":"D1","level":"warning","message":{"text":"TestProjectClassifier.FileTier (cyclomatic 16): TestProjectClassifier.FileTier has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Testing/TestProjectClassifier.cs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bf1a1f78f7497ec671b63a01ade359e62f5843b62c0a0035fde45035d787c84"}},{"ruleId":"D1","level":"warning","message":{"text":"DegradedDiagnosticsReport.Render (cyclomatic 16): DegradedDiagnosticsReport.Render 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":"engine/src/CodeHealth.Cli/Diagnostics/DegradedDiagnosticsReport.cs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3ddd1d320da0663d0c28c040c4a533bdae65a33c298783ca9002688a9264b3b"}},{"ruleId":"D1","level":"warning","message":{"text":"DegradedDiagnosticsReport.AppendSolutionAndProjectFiles (cyclomatic 16): DegradedDiagnosticsReport.AppendSolutionAndProjectFiles has cyclomatic complexity 16 (threshold 15). Of this number, 9 points are the body\u0027s own statements and 7 belong to one function literal inside it that branches. To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Cli/Diagnostics/DegradedDiagnosticsReport.cs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"03a0c3fc3681c07a196a01241b45e867788c5cbde2bc591e06243b32237d7c96"}},{"ruleId":"D1","level":"warning","message":{"text":"ChangelogNarrator.DescribeEntryAsync (cyclomatic 16): ChangelogNarrator.DescribeEntryAsync has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Reporting/Changelog/ChangelogNarrator.cs"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a4c4725d04998fb51694e2832e41c39bea72d0a6c5740b013a2d68861f59a0b"}},{"ruleId":"D1","level":"warning","message":{"text":"EngineeringReportRenderer.RenderMarkdown (cyclomatic 16): EngineeringReportRenderer.RenderMarkdown has cyclomatic complexity 16 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 3 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Reporting/Engineering/EngineeringReportRenderer.cs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"a08d017b8450ecb534247a6521cd42ecfab60dc4e3a723b5408a0bd1a808a34d"}},{"ruleId":"D1","level":"warning","message":{"text":"RuleRecommendationEngine.IsAnalysisGap (cyclomatic 16): RuleRecommendationEngine.IsAnalysisGap has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Reporting/Recommendations/RuleRecommendationEngine.cs"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d81db743e92316f2124c2e5e16b58ec98433859ba6a374c5b3f2fb792bdf381"}},{"ruleId":"D1","level":"warning","message":{"text":"ArchitecturalIntegrityAnalyzer.RunAsync (cyclomatic 16): ArchitecturalIntegrityAnalyzer.RunAsync has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, 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":"engine/src/CodeHealth.Dimensions.Architecture/ArchitecturalIntegrityAnalyzer.cs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"a901023514bd4fd06af64f2d8c64b8b7a76cc58e85e70f4f60f9245ea5855e6b"}},{"ruleId":"D1","level":"warning","message":{"text":"DuplicationAnalyzer.IndexShardParents (cyclomatic 16): DuplicationAnalyzer.IndexShardParents has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.CodeQuality/CodeShape/DuplicationAnalyzer.cs"},"region":{"startLine":1266}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d9ee64fa07d0f317fcfa53c783d2337ad365c6536af8d8b788e92c4db9c172c"}},{"ruleId":"D1","level":"warning","message":{"text":"CloneSpanShape.DataRunTokens (cyclomatic 16): CloneSpanShape.DataRunTokens has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.CodeQuality/CodeShape/DuplicationAnalyzer.cs"},"region":{"startLine":3912}}}],"partialFingerprints":{"codehealthFindingId/v1":"a48619fce58e27ae81ff7c95a3f0c5bc2b67ce3868f00f9612cf5d712194b3ae"}},{"ruleId":"D1","level":"warning","message":{"text":"ComposeHostNamespaceScan.FindingsIn (cyclomatic 16): ComposeHostNamespaceScan.FindingsIn 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/ComposeHostNamespaceScan.cs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"c37f8aace6895bcadb0f24f5ed9268b90ffc9080fbb34215e07508183c7b0a84"}},{"ruleId":"D1","level":"warning","message":{"text":"DeclaredDependencies.FromRepository (cyclomatic 16): DeclaredDependencies.FromRepository has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/DeclaredDependencies.cs"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef362cd5cfc46c4b7b60834c31ec7f9ba3905be7adcf59fe138bd570519aa9a3"}},{"ruleId":"D1","level":"warning","message":{"text":"GenericDecodeAdviceRecheck.GenericValueDecodeInto (cyclomatic 16): GenericDecodeAdviceRecheck.GenericValueDecodeInto 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/GenericDecodeAdviceRecheck.cs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eb2a158a2b97e7d4aafd2e5e4b7e466075db0c3f991125ad6c27f9735d0e704"}},{"ruleId":"D1","level":"warning","message":{"text":"GoModuleContextRechecks.GoInstallResolvesThroughEnclosingModule (cyclomatic 16): GoModuleContextRechecks.GoInstallResolvesThroughEnclosingModule has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/GoModuleContextRechecks.cs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"0321d1f69de8c05a9a0389e95c5575bc59852989f603f955cfda712ef10790fc"}},{"ruleId":"D1","level":"warning","message":{"text":"NpmLockGraph.NpmLockGraph.ctor (cyclomatic 16): NpmLockGraph.NpmLockGraph.ctor 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/NpmLockGraph.cs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b79b4ebafbc323c9d22af19a0ee516854bd6370d1ba33caebfe1a47c43a38b5"}},{"ruleId":"D1","level":"warning","message":{"text":"PathCombineProvenanceRecheck.ExtractCombineArgs (cyclomatic 16): PathCombineProvenanceRecheck.ExtractCombineArgs 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/PathCombineProvenanceRecheck.cs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f44164ad598ec5244da1f68da7535ee2944ef4a3dae23d9b4bfd0a5c4276e7a"}},{"ruleId":"D1","level":"warning","message":{"text":"PowerShellFetchExecScriptRecheck.TextLines (cyclomatic 16): PowerShellFetchExecScriptRecheck.TextLines 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/PowerShellFetchExecScriptRecheck.cs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1bdd934a0bef886489b978b085a009e07e1badc7eba84c8bca4e9e326c29de8"}},{"ruleId":"D1","level":"warning","message":{"text":"PrimaryConstructorShadow.SkipTypeName (cyclomatic 16): PrimaryConstructorShadow.SkipTypeName 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/PrimaryConstructorShadow.cs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e58b66445e5498ad4f52ab975c776b9df4478428062e2c157d2558d6619a47a"}},{"ruleId":"D1","level":"warning","message":{"text":"SecretNoiseFilter.IsDocumentedExampleKeyContext (cyclomatic 16): SecretNoiseFilter.IsDocumentedExampleKeyContext has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: SecretNoiseFilter.IsContentDigestManifestValue (cyclomatic 18) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/SecretNoiseFilter.cs"},"region":{"startLine":2514}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a531f5f3da6ae3432c6756b9456fd3e966c20d2c0bf4420169c9078f6f97b14"}},{"ruleId":"D1","level":"warning","message":{"text":"SemgrepShapeFilter.TopLevelArguments (cyclomatic 16): SemgrepShapeFilter.TopLevelArguments 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/SemgrepShapeFilter.cs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c243778082cd8d087fdb98f29d614a51fa2578f6e5dec966ca485d8fab6f89c"}},{"ruleId":"D1","level":"warning","message":{"text":"FileModel.RegionNeutralises (cyclomatic 16): FileModel.RegionNeutralises 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/SqlBuilderCompositionWalk.cs"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dd2521435779089c416caceb227d6ffaf1bdcecc9f1fcff19dd1821df6a07d8"}},{"ruleId":"D1","level":"warning","message":{"text":"UnpinnedToolchainInstallScan.NodeOffence (cyclomatic 16): UnpinnedToolchainInstallScan.NodeOffence 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/UnpinnedToolchainInstallScan.cs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae0a43eff487dbb78136ed67f56bf841e2f2aba4020bd626c3ffe91c7f8d8572"}},{"ruleId":"D1","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.UnverifiedBinaryIngests (cyclomatic 16): SupplyChainProvenanceAnalyzer.UnverifiedBinaryIngests 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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":1116}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e3e23508db979505a753d46ad91842e5ed00cbef3910cc6a2f8e77426483eef"}},{"ruleId":"D1","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.SoftFailedGatesBeforePublish (cyclomatic 16): SupplyChainProvenanceAnalyzer.SoftFailedGatesBeforePublish 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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":2213}}}],"partialFingerprints":{"codehealthFindingId/v1":"da0e32bcbcdf1367bdf6c22938b2ec56a186874178cf3cae6b24e08c3653b223"}},{"ruleId":"D1","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.ScanBuildManifests (cyclomatic 16): SupplyChainProvenanceAnalyzer.ScanBuildManifests 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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":5920}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5893658156c65dcb0e53ee9704143466b86237c8e3329a224ecaf3998cab91d"}},{"ruleId":"D1","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.ScopesEveryJob (cyclomatic 16): SupplyChainProvenanceAnalyzer.ScopesEveryJob 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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":6179}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef499c8240a286d1be42f3afaa5fbcdbed3086794ba6feeb9a3ee122fc20c0f3"}},{"ruleId":"D1","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.RequiredStatusContexts (cyclomatic 16): SupplyChainProvenanceAnalyzer.RequiredStatusContexts 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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":10655}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eb61e4a241811c89e24950b44229a384b1b42518ad1dbd1bd93838bc0a09a07"}},{"ruleId":"D1","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.DeclaredPackagingScripts (cyclomatic 16): SupplyChainProvenanceAnalyzer.DeclaredPackagingScripts has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.PackagingReach.cs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eafde1a19a219cc2fd7a95056955498db15c13029301a3a24317721561288f7"}},{"ruleId":"D1","level":"warning","message":{"text":"GitMiningSourceFiles.IsConstantEnumerationText (cyclomatic 16): GitMiningSourceFiles.IsConstantEnumerationText 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. This is NOT this file\u0027s highest cyclomatic complexity: GitMiningSourceFiles.Eligible (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.GitMining/GitMiningSourceFiles.cs"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"364195048d29ec37b8fab1f5fe8afb13d6c1d9a8cfcd0839018a84eacb85158b"}},{"ruleId":"D1","level":"warning","message":{"text":"CoverageAnalyzer.PolyglotUnmeasured (cyclomatic 16): CoverageAnalyzer.PolyglotUnmeasured has cyclomatic complexity 16 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 3 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Testing/CoverageAnalyzer.cs"},"region":{"startLine":1267}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5ffa1b9b0c20c9d1ddc068040561a58d5712457e031e81b9f6a080d26b97983"}},{"ruleId":"D1","level":"warning","message":{"text":"LlmAdrConformanceChecker.CheckAsync (cyclomatic 16): LlmAdrConformanceChecker.CheckAsync has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 5 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 37). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Docs/Llm/LlmAdrConformanceChecker.cs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"1039052f95694eafb4cb3c4f45a5dc30fc8eefc9fd68f0c872f75ef64803ff85"}},{"ruleId":"D1","level":"warning","message":{"text":"FSharpBody.gather (cyclomatic 16): FSharpBody.gather 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":"engine/src/CodeHealth.CodeModel.FSharp/Body.fs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"e553115d4ec60298a45a5759458e6061ddd240cfdecd0a6a88330a1fb3280117"}},{"ruleId":"D1","level":"warning","message":{"text":"Tokenizer.decodeEscapes (cyclomatic 16): Tokenizer.decodeEscapes 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":"engine/sidecars/kotlin-frontend/src/main/kotlin/dev/canine/codehealth/kotlin/Tokenizer.kt"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d1e3a2f1c1e337a4700807b7e4ab3f14489da8e7714423a9de63bbc17468560"}},{"ruleId":"D1","level":"warning","message":{"text":"Branches.walk (cyclomatic 16): Branches.walk 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":"engine/sidecars/scala-frontend/src/main/scala/dev/canine/codehealth/scala/Branches.scala"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c05de4be8f48a80e0fe17335de680063544e286ced4d247c54b9538fbfbf850"}},{"ruleId":"D1","level":"warning","message":{"text":"build_onboard_manifest.main (cyclomatic 16): build_onboard_manifest.main 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":"tools/multilang/build_onboard_manifest.py"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab760a3449f081e932284174886aba79a79b772e377cc7109725e5f7cb85bae8"}},{"ruleId":"D1","level":"warning","message":{"text":"adjudication.main (cyclomatic 16): adjudication.main 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":"tools/train/adjudication.py"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"28f7f4f4da5c89258522e00760fe09f2a4d9a16f095fd3216a5b28c11dd22c83"}},{"ruleId":"D1","level":"warning","message":{"text":"judge-calibration.ask (cyclomatic 16): judge-calibration.ask 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":"tools/train/judge-calibration.py"},"region":{"startLine":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"9026cfd6af57c6c3f907e8fb796c15c1f80880ff6510280d60396f65571710b5"}},{"ruleId":"D1","level":"warning","message":{"text":"judge-k3-report.render_markdown (cyclomatic 16): judge-k3-report.render_markdown 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":"tools/train/judge-k3-report.py"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f0b866641f85a55146e2bc6d71deb5adb293fd70a6a7afcf1d376783c5ea74d"}},{"ruleId":"D1","level":"warning","message":{"text":"judge-routing.selection (cyclomatic 16): judge-routing.selection 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":"tools/train/judge-routing.py"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3ce15ac3af0919d91a160140475a758ba00f2fc2dd9a2351c6b3566d969acd6"}},{"ruleId":"D1","level":"warning","message":{"text":"rate_audit.main (cyclomatic 16): rate_audit.main 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":"tools/train/rate_audit.py"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"87d0ec374fb1439b6b134c61896d06f898f5ebeaae6552d96be8c9c5a3c6c05c"}},{"ruleId":"D1","level":"warning","message":{"text":"report_round.fingerprint_rows (cyclomatic 16): report_round.fingerprint_rows has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/report_round.py"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6f0acd6c5114d57954bf63218a17543a700307367ae44e49e49c5bb62a31624"}},{"ruleId":"D1","level":"warning","message":{"text":"seed-backlog.main (cyclomatic 16): seed-backlog.main has cyclomatic complexity 16 (threshold 15). 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":"tools/train/seed-backlog.py"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9bbfe471d4edec0f2f312d08d0d70eb2c8998b3925740827837437836401231"}},{"ruleId":"D1","level":"warning","message":{"text":"select_todo.main (cyclomatic 16): select_todo.main 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":"tools/train/select_todo.py"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cf2d2d248b95ec0d321bda901e4be1e67ab6113a693b1ebfb49c87351617122"}},{"ruleId":"D1","level":"warning","message":{"text":"main.invocationGroups (cyclomatic 16): main.invocationGroups has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 7 of the 16 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 191, 175). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/go/bodylines.go"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f64a9ebe48550884b19fc5c6eb1348d956bde3f57f86af0f40f0e333deb291f"}},{"ruleId":"D1","level":"warning","message":{"text":"extractor.refForType (cyclomatic 16): extractor.refForType 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 taking that case\u0027s concrete type, so the dispatch reads one line per case. These arms are selected by TYPE rather than by value, so there is no key a lookup table could be built on; where you own the matched types, giving them one shared interface method and calling that is the form a table would have taken, and where you do not, keep the cases \u2014 they stay explicit and reviewable. This is NOT this file\u0027s highest cyclomatic complexity: main.astRef (cyclomatic 17) 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":"engine/sidecars/go/typerefs.go"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"1285388de4c1967b1ccfb222cc64fd4207c91de7a149390c09694275dd61a51a"}},{"ruleId":"D1","level":"warning","message":{"text":"observe-proxy.main (cyclomatic 16): observe-proxy.main has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 4 of the 16 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 53, 56, 61, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/docker/analyzer/render/observe-proxy.mjs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"95f765d74c655561bd8525a87ea46a5dabd964528fc18e01c92ea38e4d9411d4"}},{"ruleId":"D1","level":"warning","message":{"text":"main.main (cyclomatic 16): main.main has cyclomatic complexity 16 (threshold 15). Of this number, 8 points are the body\u0027s own statements and 8 belong to 3 function literals inside it that branch. To reduce it, 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":"engine/sidecars/tsjs-frontend/main.mjs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"913af18419ee14f03105f9a29fbc053c0095e378fa0d9ecd47e2f7ba24bd4033"}},{"ruleId":"D2","level":"warning","message":{"text":"DependencyHygieneAnalyzer.RunAsync (cognitive 666): DependencyHygieneAnalyzer.RunAsync has cognitive complexity 666 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Dependencies/DependencyHygieneAnalyzer.cs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba9b4c0d686d37d31721a905062718935f3265df91cd29b08de071b394094c3c"}},{"ruleId":"D2","level":"warning","message":{"text":"dimension-routing.main (cognitive 366): dimension-routing.main has cognitive complexity 366 (threshold 15). Drivers by points: if/else 96 (241 pts), loops 24 (49 pts), ternaries 13 (38 pts), boolean chains 35, error handling 1 (3 pts) (nesting depth added 197). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/dimension-routing.py"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0d7f07bc2466d1eeade1ea58f5a303117db5460abebb4ae8db38eb587b6aefd"}},{"ruleId":"D2","level":"warning","message":{"text":"AnalyzeCommand.ExecuteCoreAsync (cognitive 259): AnalyzeCommand.ExecuteCoreAsync has cognitive complexity 259 (threshold 15). Of this number, 257 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Cli/Commands/AnalyzeCommand.cs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c20a34ab148e26b2b6830a2920a8187fc33b0b60a6b2c0e3feb88f1995699db"}},{"ruleId":"D2","level":"warning","message":{"text":"MaturityAnalyzer.FolderStructure (cognitive 231): MaturityAnalyzer.FolderStructure has cognitive complexity 231 (threshold 15). Of this number, 229 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Maturity/MaturityAnalyzer.cs"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"debca58b772755a1e43c8f912d831990181b97fe5ef31605781019d820bb9425"}},{"ruleId":"D2","level":"warning","message":{"text":"RoslynDuplicationDetector.ScanAsync (cognitive 215): RoslynDuplicationDetector.ScanAsync has cognitive complexity 215 (threshold 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":"engine/src/CodeHealth.Core/CodeShape/RoslynDuplicationDetector.cs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"d012d94054457d74125dcf441ae29be3af2d6eb783bec7f020e75d6ac6cba6a9"}},{"ruleId":"D2","level":"warning","message":{"text":"JsDuplicationDetector.BuildDeclarationEntryMask (cognitive 188): JsDuplicationDetector.BuildDeclarationEntryMask has cognitive complexity 188 (threshold 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":"engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs"},"region":{"startLine":860}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e82f9ea550cb07b01937b6261c03c1fd128d7bc70490189db5f255e768808f5"}},{"ruleId":"D2","level":"warning","message":{"text":"judge-routing.main (cognitive 179): judge-routing.main has cognitive complexity 179 (threshold 15). Drivers by points: if/else 52 (89 pts), ternaries 25 (54 pts), boolean chains 24, loops 8 (12 pts) (nesting depth added 70). To reduce it, split the body into named stages: move each independent 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":"tools/train/judge-routing.py"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbabd942603549f7c3f51eb8ec36eddc21eccb4671a170c6a43109e5272cda68"}},{"ruleId":"D2","level":"warning","message":{"text":"programme-status.main (cognitive 174): programme-status.main has cognitive complexity 174 (threshold 15). Drivers by points: if/else 47 (95 pts), loops 13 (29 pts), ternaries 12 (27 pts), boolean chains 20, error handling 1 (3 pts) (nesting depth added 81). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/programme-status.py"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"f531abba8e0236abf49a8bca7b066a94261daeb887dec439bfba6fc8340cd193"}},{"ruleId":"D2","level":"warning","message":{"text":"SecretsHistoryAnalyzer.GateCorpusAndDocumentedExampleFindings (cognitive 172): SecretsHistoryAnalyzer.GateCorpusAndDocumentedExampleFindings has cognitive complexity 172 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/SecretsHistoryAnalyzer.cs"},"region":{"startLine":897}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cfdd873b5166d1ddb0a05370e853f5393c0cb0a4f20e43be62a03f99e208bc9"}},{"ruleId":"D2","level":"warning","message":{"text":"CSharpCorrectnessAnalyzer.AnalyzeAsync (cognitive 161): CSharpCorrectnessAnalyzer.AnalyzeAsync has cognitive complexity 161 (threshold 15). Of this number, 157 points are the body\u0027s own statements and 4 belong to 3 function literals inside it that branch. To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/CSharpCorrectnessAnalyzer.cs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"22ab213d775169cb0b3c013d5ec5ba705a787673e1368b9c239a567937ff3957"}},{"ruleId":"D2","level":"warning","message":{"text":"CoverageAnalyzer.RunAsync (cognitive 146): CoverageAnalyzer.RunAsync has cognitive complexity 146 (threshold 15). Of this number, 140 points are the body\u0027s own statements and 6 belong to 3 function literals inside it that branch. To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Testing/CoverageAnalyzer.cs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"099fc556ea6fad511bbd08247a7ca713a7b9ba07cf03b1349d8f2086ed1519e3"}},{"ruleId":"D2","level":"warning","message":{"text":"AccessibilityAnalyzer.AssessEnforcement (cognitive 145): AccessibilityAnalyzer.AssessEnforcement has cognitive complexity 145 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs"},"region":{"startLine":6348}}}],"partialFingerprints":{"codehealthFindingId/v1":"adbc28792cf2294cac1fd6a634052518069c94189a6fab870f0cfa5a7d67b55a"}},{"ruleId":"D2","level":"warning","message":{"text":"agg_holdout5.main (cognitive 143): agg_holdout5.main has cognitive complexity 143 (threshold 15). Drivers by points: if/else 30 (78 pts), loops 23 (46 pts), ternaries 5 (12 pts), boolean chains 7 (nesting depth added 78). To reduce it, split the body into named stages: move each independent 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":"tools/multilang/agg_holdout5.py"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"63443200c378711e918475267bdcceceb1f094a71d03dfe6b35849eb26561c8f"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendBundlerConfigRefs.CollectBundlerEntries (cognitive 137): FrontendBundlerConfigRefs.CollectBundlerEntries has cognitive complexity 137 (threshold 15). Of this number, 136 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":"engine/src/CodeHealth.Core/Frontend/FrontendBundlerConfigRefs.cs"},"region":{"startLine":848}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e71646a491c0e24e93a39a82cd0e92231d29d220aa30a49d5a0c98037fc17b4"}},{"ruleId":"D2","level":"warning","message":{"text":"IncompletenessAnalyzer.AnalyzeAsync (cognitive 134): IncompletenessAnalyzer.AnalyzeAsync has cognitive complexity 134 (threshold 15). Of this number, 133 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/IncompletenessAnalyzer.cs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"07ee060de59fa1fc678f23e1f67baad086efcaa1d524f3d078bb571c4eba34e9"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendPathLiteralRefs.CollectPathLiteralRefs (cognitive 132): FrontendPathLiteralRefs.CollectPathLiteralRefs has cognitive complexity 132 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendPathLiteralRefs.cs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fe21a0ab5654dbbb5ed312db51e014a354de817cbc182c1173d6aa68454877b"}},{"ruleId":"D2","level":"warning","message":{"text":"agg_combined.main (cognitive 132): agg_combined.main has cognitive complexity 132 (threshold 15). Drivers by points: if/else 23 (68 pts), loops 24 (50 pts), boolean chains 7, ternaries 5 (7 pts) (nesting depth added 73). To reduce it, split the body into named stages: move each independent 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":"tools/multilang/agg_combined.py"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a94ab77ec8066a049569cd03d7bfa404b87e8739e3b803c852f96cbb50e9ed"}},{"ruleId":"D2","level":"warning","message":{"text":"agg_combined4.main (cognitive 132): agg_combined4.main has cognitive complexity 132 (threshold 15). Drivers by points: if/else 18 (64 pts), loops 22 (55 pts), ternaries 3 (8 pts), boolean chains 5 (nesting depth added 84). To reduce it, split the body into named stages: move each independent 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":"tools/multilang/agg_combined4.py"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cba09dfb8958f3096859437bbc0f3411ab9257c0d71ecb4d8e27c9193948fd3"}},{"ruleId":"D2","level":"warning","message":{"text":"agg_combined5.main (cognitive 132): agg_combined5.main has cognitive complexity 132 (threshold 15). Drivers by points: if/else 18 (64 pts), loops 22 (55 pts), ternaries 3 (8 pts), boolean chains 5 (nesting depth added 84). To reduce it, split the body into named stages: move each independent 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":"tools/multilang/agg_combined5.py"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"b48e4b4e19025c9adec9c9e7fd818eb58e69c43110354e7ebc2ffbbac8fcf188"}},{"ruleId":"D2","level":"warning","message":{"text":"agg_combined6.main (cognitive 132): agg_combined6.main has cognitive complexity 132 (threshold 15). Drivers by points: if/else 18 (64 pts), loops 22 (55 pts), ternaries 3 (8 pts), boolean chains 5 (nesting depth added 84). To reduce it, split the body into named stages: move each independent 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":"tools/multilang/agg_combined6.py"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"f43f0570d8edd96418a4c86dd1eca92aa0b94fad833082023ae632624cf4a037"}},{"ruleId":"D2","level":"warning","message":{"text":"dimension-coverage.main (cognitive 127): dimension-coverage.main has cognitive complexity 127 (threshold 15). Drivers by points: ternaries 16 (53 pts), if/else 29 (43 pts), loops 12 (23 pts), boolean chains 8 (nesting depth added 62). To reduce it, split the body into named stages: move each independent 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":"tools/multilang/dimension-coverage.py"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"373d933c5527ba498b9009cf3a7f157c814a06e229b2e75253fb708f0b12ce1c"}},{"ruleId":"D2","level":"warning","message":{"text":"agg_holdout4.main (cognitive 126): agg_holdout4.main has cognitive complexity 126 (threshold 15). Drivers by points: if/else 26 (69 pts), loops 22 (46 pts), ternaries 3 (6 pts), boolean chains 5 (nesting depth added 70). To reduce it, split the body into named stages: move each independent 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":"tools/multilang/agg_holdout4.py"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"94ca89a79a5a3dd886e31c7f5b7014b44fbba91af665604ab6955e4ddd356bae"}},{"ruleId":"D2","level":"warning","message":{"text":"judge-k3-report.main (cognitive 122): judge-k3-report.main has cognitive complexity 122 (threshold 15). Drivers by points: if/else 37 (70 pts), boolean chains 19, ternaries 8 (16 pts), loops 10 (15 pts), error handling 1 (2 pts) (nesting depth added 47). To reduce it, split the body into named stages: move each independent 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":"tools/train/judge-k3-report.py"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"5446b2d16bd59b541e919599e365029d298d3519f5bb60043ce1c178e9301243"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceClassifier.EcosystemMarkerVerdict (cognitive 120): SourceClassifier.EcosystemMarkerVerdict has cognitive complexity 120 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Classification/SourceClassifier.cs"},"region":{"startLine":3231}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a5aded64ce76e107bf45c30d83f92eefa5ab6cb2d20116b4ac90aa882f656c0"}},{"ruleId":"D2","level":"warning","message":{"text":"AttributeConsumptionScanner.CollectAsync (cognitive 114): AttributeConsumptionScanner.CollectAsync has cognitive complexity 114 (threshold 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":"engine/src/CodeHealth.Core/ExplicitDebt/AttributeConsumptionScanner.cs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"2781662648645b5e3f3769f9fff8ed6a262ddaa38721c79ac5379717627cfea8"}},{"ruleId":"D2","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.RunAsync (cognitive 112): SupplyChainProvenanceAnalyzer.RunAsync has cognitive complexity 112 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":2625}}}],"partialFingerprints":{"codehealthFindingId/v1":"c84eed554ed64b597fd26dcbceb09eb48883b6834989a04c8c9ac47a4ba7d8a1"}},{"ruleId":"D2","level":"warning","message":{"text":"judge_verification.main (cognitive 109): judge_verification.main has cognitive complexity 109 (threshold 15). Drivers by points: if/else 34 (56 pts), boolean chains 28, ternaries 7 (13 pts), loops 7 (12 pts) (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/judge_verification.py"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8eee0e0a39091752e3c49a32ac5784408aac953af3e1f44217a12f0e4fb43f1"}},{"ruleId":"D2","level":"warning","message":{"text":"ChangeCouplingAnalyzer.ImportedModulesOf (cognitive 105): ChangeCouplingAnalyzer.ImportedModulesOf has cognitive complexity 105 (threshold 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":"engine/src/CodeHealth.Dimensions.GitMining/ChangeCouplingAnalyzer.cs"},"region":{"startLine":4851}}}],"partialFingerprints":{"codehealthFindingId/v1":"7374069ae5e13d22d0e5b9ebf430f1f569be3a63a15ffde0399ee32dd72a2256"}},{"ruleId":"D2","level":"warning","message":{"text":"agg_combined3.main (cognitive 105): agg_combined3.main has cognitive complexity 105 (threshold 15). Drivers by points: if/else 16 (51 pts), loops 20 (43 pts), ternaries 4 (6 pts), boolean chains 5 (nesting depth added 60). To reduce it, split the body into named stages: move each independent 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":"tools/multilang/agg_combined3.py"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b40e4b06a68b60ad261e9c8aa1088a5656d09edd081131af4068068f0e9e3b1"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendTestReachability.Analyze (cognitive 104): FrontendTestReachability.Analyze has cognitive complexity 104 (threshold 15). Of this number, 102 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/FrontendTestReachability.cs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d081c32d4b0513357415bcd38005fddc36c6cf094b5e8e7b81387231fa9c3f"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendModuleGraph.Build (cognitive 103): FrontendModuleGraph.Build has cognitive complexity 103 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendModuleGraph.cs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5f96a616ce07d1df4ea1b0572a8a9d7fd00bd8680fcb1ac2f8520564175fc38"}},{"ruleId":"D2","level":"warning","message":{"text":"ComplianceSecurityAnalyzer.S1 (cognitive 102): ComplianceSecurityAnalyzer.S1 has cognitive complexity 102 (threshold 15). 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":"engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs"},"region":{"startLine":5493}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8fc9455ffc9d1b7833dccebf335486e9842881a7645bd32fb2b7333bfad1a20"}},{"ruleId":"D2","level":"warning","message":{"text":"EventDrivenAnalyzer.OutboxDualWrite (cognitive 100): EventDrivenAnalyzer.OutboxDualWrite has cognitive complexity 100 (threshold 15). Of this number, 93 points are the body\u0027s own statements and 7 belong to 4 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs"},"region":{"startLine":1680}}}],"partialFingerprints":{"codehealthFindingId/v1":"b28e323ed937c7f04b232599c414693281a794f772985431f70dc64c66a1b4fd"}},{"ruleId":"D2","level":"warning","message":{"text":"ChangeCouplingAnalyzer.BuildCoupledPairs (cognitive 100): ChangeCouplingAnalyzer.BuildCoupledPairs has cognitive complexity 100 (threshold 15). Of this number, 99 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":"engine/src/CodeHealth.Dimensions.GitMining/ChangeCouplingAnalyzer.cs"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"84299a68a7273d07c637a477f45492b26a9bf408e9dc9fef3eec2671cb834eca"}},{"ruleId":"D2","level":"warning","message":{"text":"Tokenizer.tokenize (cognitive 98): Tokenizer.tokenize has cognitive complexity 98 (threshold 15). Drivers by points: if/else 25 (56 pts), loops 8 (24 pts), boolean chains 18 (nesting depth added 47). To reduce it, split the body into named stages: move each independent 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":"engine/sidecars/scala-frontend/src/main/scala/dev/canine/codehealth/scala/Tokenizer.scala"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"5010f2524593a276444d4875103a03e5acefb037cac6d0966b6a3cde38235c7d"}},{"ruleId":"D2","level":"warning","message":{"text":"RustTestCensus.Strip (cognitive 97): RustTestCensus.Strip has cognitive complexity 97 (threshold 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":"engine/src/CodeHealth.Core/Testing/RustTestCensus.cs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"f824ce8df242c372489b3fa73db2cb3059d4072f3a13881c29eed98cc7936c01"}},{"ruleId":"D2","level":"warning","message":{"text":"MemberFamilyRollup.Collapse (cognitive 96): MemberFamilyRollup.Collapse has cognitive complexity 96 (threshold 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":"engine/src/CodeHealth.Core/CodeShape/MemberFamilyRollup.cs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"dca2c481c968567cfb4d3f0cdf3f807aec52a1ee4cf6c0840b98cc7b8f030ae2"}},{"ruleId":"D2","level":"warning","message":{"text":"UpstreamAttribution.ForRepo (cognitive 96): UpstreamAttribution.ForRepo has cognitive complexity 96 (threshold 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":"engine/src/CodeHealth.Core/FileQuality/UpstreamAttribution.cs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"3450446d4d79c71a518ad61027e71f56f5405a05110d16c0c11e195979b26f44"}},{"ruleId":"D2","level":"warning","message":{"text":"fallback-judge.cmd_score (cognitive 96): fallback-judge.cmd_score has cognitive complexity 96 (threshold 15). Drivers by points: if/else 28 (64 pts), ternaries 7 (14 pts), loops 9 (13 pts), boolean chains 5 (nesting depth added 47). To reduce it, split the body into named stages: move each independent 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":"tools/train/fallback-judge.py"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"16ec24a6157b48e76ba4ef4f7264dac30f35ac660f0dd0dc27dc1871ccc722fe"}},{"ruleId":"D2","level":"warning","message":{"text":"EntryPointCatalog.DetectApplication (cognitive 95): EntryPointCatalog.DetectApplication has cognitive complexity 95 (threshold 15). 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":"engine/src/CodeHealth.Core/Frontend/EntryPointCatalog.cs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"e523b540b146f18594f086757e152438ce1543ab5e495a718ced9d7a31934f23"}},{"ruleId":"D2","level":"warning","message":{"text":"Tokenizer.tokenize (cognitive 94): Tokenizer.tokenize has cognitive complexity 94 (threshold 15). Drivers by points: if/else 18 (54 pts), loops 8 (24 pts), boolean chains 16 (nesting depth added 52). To reduce it, split the body into named stages: move each independent 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":"engine/sidecars/kotlin-frontend/src/main/kotlin/dev/canine/codehealth/kotlin/Tokenizer.kt"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"7284ca8025a73abc49370a1ff80fc2d742ec802217e1fd045a23f38c044df52f"}},{"ruleId":"D2","level":"warning","message":{"text":"agg_holdout6.main (cognitive 94): agg_holdout6.main has cognitive complexity 94 (threshold 15). Drivers by points: if/else 25 (48 pts), loops 16 (24 pts), ternaries 10 (16 pts), boolean chains 6 (nesting depth added 37). To reduce it, split the body into named stages: move each independent 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":"tools/multilang/agg_holdout6.py"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"781535f2987e5c70c0f5dc6bc3c80b5eb2fcdcfdadb94967d5e71db87d21274e"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeTestReliabilityCollector.CollectAsync (cognitive 92): NodeTestReliabilityCollector.CollectAsync has cognitive complexity 92 (threshold 15). Of this number, 88 points are the body\u0027s own statements and 4 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":"engine/src/CodeHealth.Core/Testing/NodeTestReliabilityCollector.cs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"f43daf4ecee4c2db388a6ae3b7fbe2f197421642530ac26c10be166161783bc1"}},{"ruleId":"D2","level":"warning","message":{"text":"HotspotAnalyzer.RunAsync (cognitive 92): HotspotAnalyzer.RunAsync has cognitive complexity 92 (threshold 15). Of this number, 86 points are the body\u0027s own statements and 6 belong to 6 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":"engine/src/CodeHealth.Dimensions.GitMining/HotspotAnalyzer.cs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1103281e28d8d88aada31103a303b6b9468adb5bf2307a5c6500ccb180c0240"}},{"ruleId":"D2","level":"warning","message":{"text":"DimensionOrchestrator.UnclampedTimeoutFor (cognitive 91): DimensionOrchestrator.UnclampedTimeoutFor has cognitive complexity 91 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Orchestration/DimensionOrchestrator.cs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"543662a69154125361f6a15382b7643f6ccf380a939762df804877ba1b93c495"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendEngine.ModelGeneratedModules (cognitive 90): FrontendEngine.ModelGeneratedModules has cognitive complexity 90 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendEngine.cs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"775c2e24d640baecbe3cc9b883631920617a53080f944848561e57814c0c1a77"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleSyntaxScanner.Scan (cognitive 90): ModuleSyntaxScanner.Scan has cognitive complexity 90 (threshold 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":"engine/src/CodeHealth.Core/Frontend/ModuleSyntaxScanner.cs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"887d25196848b311bc26cd0628ec87875f35980ecd2592778c4d4e1e901dcfc0"}},{"ruleId":"D2","level":"warning","message":{"text":"Tokenizer.tokenize (cognitive 89): Tokenizer.tokenize has cognitive complexity 89 (threshold 15). Drivers by points: if/else 16 (42 pts), loops 8 (24 pts), boolean chains 17, ternaries 2 (6 pts) (nesting depth added 46). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/java-spoon/src/main/java/dev/canine/codehealth/java/Tokenizer.java"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"09f11bc11cac85dbfed16b0ad731de29a67e3925aeace1d6fe3d48f47fb4d0a7"}},{"ruleId":"D2","level":"warning","message":{"text":"model-sweep.main (cognitive 89): model-sweep.main has cognitive complexity 89 (threshold 15). Drivers by points: if/else 22 (51 pts), loops 9 (18 pts), boolean chains 10, error handling 3 (6 pts), ternaries 3 (4 pts) (nesting depth added 42). To reduce it, split the body into named stages: move each independent 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":"tools/train/model-sweep.py"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"a45caab3adf5d162ce74f968f952da3b309e4c211a7a6bf2cea3f472a9db3037"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendDeadCode.FindUnusedExports (cognitive 88): FrontendDeadCode.FindUnusedExports has cognitive complexity 88 (threshold 15). Of this number, 86 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/FrontendDeadCode.cs"},"region":{"startLine":1254}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c6ed5d594bd4abca91b6fe5d7d58e3abff1d30f5da7cb43ba75dc228b0ebba8"}},{"ruleId":"D2","level":"warning","message":{"text":"ChangeCouplingAnalyzer.FactsFor (cognitive 88): ChangeCouplingAnalyzer.FactsFor has cognitive complexity 88 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.GitMining/ChangeCouplingAnalyzer.cs"},"region":{"startLine":4453}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2c7cfe92995552455beabd2005efd88d126bf7da44a31acfcad18c472a137f0"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendDeadCode.CountStandaloneReferences (cognitive 83): FrontendDeadCode.CountStandaloneReferences has cognitive complexity 83 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendDeadCode.cs"},"region":{"startLine":1736}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e1a89d275ec2b9613f87e87489e8006d3412125914d8c95a41c81999093d17c"}},{"ruleId":"D2","level":"warning","message":{"text":"MaturityAnalyzer.DeclaredWorkspaceMembers (cognitive 83): MaturityAnalyzer.DeclaredWorkspaceMembers has cognitive complexity 83 (threshold 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":"engine/src/CodeHealth.Core/Maturity/MaturityAnalyzer.cs"},"region":{"startLine":1475}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a46306e468bc3a3aacb2114f6bf3474da094a709ce5ce7612ad95dbf14991d4"}},{"ruleId":"D2","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.WorkflowGrantsWiderThanJobsUse (cognitive 80): SupplyChainProvenanceAnalyzer.WorkflowGrantsWiderThanJobsUse has cognitive complexity 80 (threshold 15). Of this number, 78 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":7913}}}],"partialFingerprints":{"codehealthFindingId/v1":"9accfec4efad6d431b2f1315821cc3ca8c757dcd1da8e3d0e610a0122391cdd4"}},{"ruleId":"D2","level":"warning","message":{"text":"DartDeadLibraryField.StripNonCode (cognitive 78): DartDeadLibraryField.StripNonCode has cognitive complexity 78 (threshold 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":"engine/src/CodeHealth.Core/Dart/DartDeadLibraryField.cs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"329c21a1a53bd0bcb886e0a9e71f8493b1201a3c866612c5610b5c4e8857a13e"}},{"ruleId":"D2","level":"warning","message":{"text":"JsDuplicationDetector.TryMergeNearCloneSegment (cognitive 78): JsDuplicationDetector.TryMergeNearCloneSegment has cognitive complexity 78 (threshold 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":"engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs"},"region":{"startLine":4204}}}],"partialFingerprints":{"codehealthFindingId/v1":"242135e1c9a4d062974e2561ea57cd5ebb5eb78a031f0b586e750e783f10ca64"}},{"ruleId":"D2","level":"warning","message":{"text":"RustInlineTestModule.BlankLiteralsAndComments (cognitive 77): RustInlineTestModule.BlankLiteralsAndComments has cognitive complexity 77 (threshold 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":"engine/src/CodeHealth.Core/Classification/RustInlineTestModule.cs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"62b0df64d03d425b0cbe8a29208c6d5b0ebb2e2ee14757e4ab8d3b62dff279f0"}},{"ruleId":"D2","level":"warning","message":{"text":"codehealth_rust_sidecar::substitute_template (cognitive 77): codehealth_rust_sidecar::substitute_template has cognitive complexity 77 (threshold 15). Drivers by points: if/else 10 (44 pts), loops 4 (18 pts), match/switch 4 (14 pts), boolean chains 1 (nesting depth added 58). To reduce it, split the body into named stages: move each independent 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":"engine/sidecars/rust-frontend/src/main.rs"},"region":{"startLine":2951}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea8400786ea8d3a38f47a0743d50649a464735d7808b67362b03a5f11d1afc83"}},{"ruleId":"D2","level":"warning","message":{"text":"ProductionReadinessAnalyzer.ObservabilityAsync (cognitive 76): ProductionReadinessAnalyzer.ObservabilityAsync has cognitive complexity 76 (threshold 15). Of this number, 74 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs"},"region":{"startLine":4266}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e07bfc9b038a0378921ded9d05bcaf6b04cc11c0c01c4f81b0bdc0bc877aec8"}},{"ruleId":"D2","level":"warning","message":{"text":"TestQualityAnalyzer.RunAsync (cognitive 75): TestQualityAnalyzer.RunAsync has cognitive complexity 75 (threshold 15). Of this number, 69 points are the body\u0027s own statements and 6 belong to 6 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":"engine/src/CodeHealth.Dimensions.Testing/TestQualityAnalyzer.cs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"35b15cf89d149fa7e5e7a659cdfeee1a4bf9fe2838f09e78ae9c81007662399f"}},{"ruleId":"D2","level":"warning","message":{"text":"bakeoff.run_model (cognitive 75): bakeoff.run_model has cognitive complexity 75 (threshold 15). Drivers by points: if/else 14 (37 pts), ternaries 8 (18 pts), boolean chains 11, loops 4 (9 pts) (nesting depth added 38). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/llm-bakeoff/bakeoff.py"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d92d823fe86904a158f6b697178d61c03ac4390f39c7d7544b5ee21c37af8a5"}},{"ruleId":"D2","level":"warning","message":{"text":"tokenizeBody (cognitive 75): tokenizeBody has cognitive complexity 75 (threshold 15). Drivers by points: if/else 29 (41 pts), boolean chains 19, loops 12 (13 pts), ternaries 2 (nesting depth added 13). Most of this is not in the body itself: 8 of the 75 points are its own statements and the rest belongs to 17 function items inside it that branch (scanPercentBody, stringLiteral, blockComment, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/ruby-frontend/tokenize.mjs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"bab14dea62239a05ffd325764dcb6eaab4e9ecd490eb85961985d998e9cb662a"}},{"ruleId":"D2","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.JobsScopedBelowTheirCheckout (cognitive 74): SupplyChainProvenanceAnalyzer.JobsScopedBelowTheirCheckout has cognitive complexity 74 (threshold 15). Of this number, 72 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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":8161}}}],"partialFingerprints":{"codehealthFindingId/v1":"3448c3a5e087b9476735736825af19b41531b30985c4ba0a5abe4545d85482b7"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceClassifier.ScanStringState (cognitive 73): SourceClassifier.ScanStringState has cognitive complexity 73 (threshold 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":"engine/src/CodeHealth.Core/Classification/SourceClassifier.cs"},"region":{"startLine":1489}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1d61e0bc82fc515effc4ca8174e595551c938a12de38a1da755ea28457804ab"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendBoundaries.CollectCrossPackageViolations (cognitive 73): FrontendBoundaries.CollectCrossPackageViolations has cognitive complexity 73 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendBoundaries.cs"},"region":{"startLine":1055}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a703b367024e86c4dc486ecf70ca59405fbfe495e9881b2aea9120df726567c"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeSecretScanner.ScanLines (cognitive 73): NativeSecretScanner.ScanLines has cognitive complexity 73 (threshold 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":"engine/src/CodeHealth.Core/Security/NativeSecretScanner.cs"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"035aefbb432a3bb9adcf8a0becf561ecfa331fccfc6590bf8343b2dcf3537e66"}},{"ruleId":"D2","level":"warning","message":{"text":"IndirectionAnalyzer.AnalyzeAsync (cognitive 72): IndirectionAnalyzer.AnalyzeAsync has cognitive complexity 72 (threshold 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":"engine/src/CodeHealth.Core/Architecture/IndirectionAnalyzer.cs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c10345371d7e166a2c565ded1ce8a3007aa9ce118fad0a4af79d2996809b3ee"}},{"ruleId":"D2","level":"warning","message":{"text":"FSharpSyntaxModel.build (cognitive 71): FSharpSyntaxModel.build has cognitive complexity 71 (threshold 15). Drivers by points: if/else 18 (30 pts), match/switch 11 (21 pts), loops 7 (11 pts), boolean chains 5, error handling 3 (4 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":"engine/src/CodeHealth.CodeModel.FSharp/SyntaxModel.fs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ac2e10efec76cbdd57feb65dce671f9c0a2cd3665ef9342e796a1ee32daa5f5"}},{"ruleId":"D2","level":"warning","message":{"text":"KnowledgeConcentrationAnalyzer.RunAsync (cognitive 70): KnowledgeConcentrationAnalyzer.RunAsync has cognitive complexity 70 (threshold 15). Of this number, 67 points are the body\u0027s own statements and 3 belong to 3 function literals inside it that branch. To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.GitMining/KnowledgeConcentrationAnalyzer.cs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"436ea7e3dbc0a94e4194cdb2144fb09f7fcfbe335723c17d1851f8b1e328bc00"}},{"ruleId":"D2","level":"warning","message":{"text":"TestReliabilityAnalyzer.RunAsync (cognitive 70): TestReliabilityAnalyzer.RunAsync has cognitive complexity 70 (threshold 15). Of this number, 69 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":"engine/src/CodeHealth.Dimensions.Testing/TestReliabilityAnalyzer.cs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"e464a39ce898d0d630f42d09fe4127ab8bb3f8655c47f13488a0761ff8ad43b8"}},{"ruleId":"D2","level":"warning","message":{"text":"JsDuplicationDetector.DetectWholesaleFileCopies (cognitive 68): JsDuplicationDetector.DetectWholesaleFileCopies has cognitive complexity 68 (threshold 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":"engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs"},"region":{"startLine":5081}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7149cc9b1de41f658be6fd0c0d1cda4139622bfe13135e841512f62f3f5d2ae"}},{"ruleId":"D2","level":"warning","message":{"text":"JsDuplicationDetector.BestEditedCopy (cognitive 68): JsDuplicationDetector.BestEditedCopy has cognitive complexity 68 (threshold 15). Of this number, 67 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":"engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs"},"region":{"startLine":5457}}}],"partialFingerprints":{"codehealthFindingId/v1":"699efe2775e83590337c11acd0a810abb6172d57604502bd4d654f6b7092e8d5"}},{"ruleId":"D2","level":"warning","message":{"text":"CouplingAnalyzer.RunAsync (cognitive 68): CouplingAnalyzer.RunAsync has cognitive complexity 68 (threshold 15). Of this number, 60 points are the body\u0027s own statements and 8 belong to 7 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Architecture/CouplingAnalyzer.cs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1bf5e5b464ef36201c28ad126bebf7929103960cb38672d7c241872dc8a0155"}},{"ruleId":"D2","level":"warning","message":{"text":"LineBasedGodClassDetector.DetectAsync (cognitive 67): LineBasedGodClassDetector.DetectAsync has cognitive complexity 67 (threshold 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":"engine/src/CodeHealth.Core/CodeShape/LineBasedGodClassDetector.cs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"55439ca531e4dd4bede46cd72e4b330b0183d6e1b4accce0faaa45f962cafee4"}},{"ruleId":"D2","level":"warning","message":{"text":"agg_go.main (cognitive 67): agg_go.main has cognitive complexity 67 (threshold 15). Drivers by points: if/else 14 (36 pts), loops 11 (23 pts), ternaries 4 (6 pts), boolean chains 2 (nesting depth added 36). To reduce it, split the body into named stages: move each independent 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":"tools/multilang/agg_go.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"48df068005ccad5cee3e8d20bb0fc2d05b336b0383c32f3830c3797232a3da2c"}},{"ruleId":"D2","level":"warning","message":{"text":"report_round.main (cognitive 65): report_round.main has cognitive complexity 65 (threshold 15). Drivers by points: if/else 23 (27 pts), boolean chains 24, ternaries 9 (10 pts), loops 4 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/report_round.py"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"df759f79c05f85df9ffd57bf84716d44f8e7f2ad10a6654a7be48873b191b830"}},{"ruleId":"D2","level":"warning","message":{"text":"ExplicitDebtAnalyzer.RunAsync (cognitive 64): ExplicitDebtAnalyzer.RunAsync has cognitive complexity 64 (threshold 15). Of this number, 45 points are the body\u0027s own statements and 19 belong to 17 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":"engine/src/CodeHealth.Dimensions.ExplicitDebt/ExplicitDebtAnalyzer.cs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"1703b9c235960ace63e79211d02cf8bbe54b4cbc5fe2fae56593ce9d8be95919"}},{"ruleId":"D2","level":"warning","message":{"text":"RoslynTestQualityCollector.AnalyzeRoot (cognitive 63): RoslynTestQualityCollector.AnalyzeRoot has cognitive complexity 63 (threshold 15). Of this number, 62 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent 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":"engine/src/CodeHealth.Core/Testing/RoslynTestQualityCollector.cs"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ed626982790ff90db689cf671060b0ae85568b92595b615f561f6499ae70783"}},{"ruleId":"D2","level":"warning","message":{"text":"KnowledgeDecayModel.Build (cognitive 63): KnowledgeDecayModel.Build has cognitive complexity 63 (threshold 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":"engine/src/CodeHealth.Dimensions.GitMining/KnowledgeDecayModel.cs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c2615e777d5fbce2b5f1b110f61d4f81186ea2fbb7a2c9f19e6c7f0b509fb89"}},{"ruleId":"D2","level":"warning","message":{"text":"KnowledgeFreshnessAnalyzer.RunAsync (cognitive 63): KnowledgeFreshnessAnalyzer.RunAsync has cognitive complexity 63 (threshold 15). Of this number, 62 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent 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":"engine/src/CodeHealth.Dimensions.GitMining/KnowledgeFreshnessAnalyzer.cs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc2bd8329c402cec7abd1c3fc91faf22500d3f9d7a8c45161e566af7ec05282a"}},{"ruleId":"D2","level":"warning","message":{"text":"check.main (cognitive 63): check.main has cognitive complexity 63 (threshold 15). Drivers by points: if/else 26 (28 pts), boolean chains 26, loops 4 (5 pts), ternaries 3 (4 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/kotlin-frontend/selftest/check.py"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"681d030ec42df548e7807f8dd7ad6e6564d14e1fec7b961ff748c2e6d7ee70f4"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendTestSuiteMasking.CollectFromBenchmarkTree (cognitive 62): FrontendTestSuiteMasking.CollectFromBenchmarkTree has cognitive complexity 62 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendTestSuiteMasking.cs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d4821f8eb95814c4fab746f30db384df576d4e13b5c26497d03414fb2ed3530"}},{"ruleId":"D2","level":"warning","message":{"text":"JsDuplicationDetector.BuildTopLevelBindingMask (cognitive 62): JsDuplicationDetector.BuildTopLevelBindingMask has cognitive complexity 62 (threshold 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":"engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8f21fe846250275a2c4ee806f794ed18109c9beee6b30b59b013ceaa17005a5"}},{"ruleId":"D2","level":"warning","message":{"text":"MinifiedJsHeuristics.StripStringsAndComments (cognitive 62): MinifiedJsHeuristics.StripStringsAndComments has cognitive complexity 62 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/MinifiedJsHeuristics.cs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"844e9fc2713324442466f65e9736fdae059c553d7784428318d49ef83312d4b9"}},{"ruleId":"D2","level":"warning","message":{"text":"ProductionReadinessAnalyzer.SecurityAndPerf (cognitive 62): ProductionReadinessAnalyzer.SecurityAndPerf has cognitive complexity 62 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs"},"region":{"startLine":4675}}}],"partialFingerprints":{"codehealthFindingId/v1":"b62b7a50d7158597232b01240a0d1d67c9ffce8ed4b733b4445a9a6c4e0e76f1"}},{"ruleId":"D2","level":"warning","message":{"text":"VacuousFormatGate.CommandPositions (cognitive 62): VacuousFormatGate.CommandPositions has cognitive complexity 62 (threshold 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":"engine/src/CodeHealth.Core/Readiness/VacuousFormatGate.cs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"08520f0ea7a59b58388239f2f713a009e55b170a6f7a782cba2c61827bb1e3a2"}},{"ruleId":"D2","level":"warning","message":{"text":"JsScopeBindings.Build (cognitive 61): JsScopeBindings.Build has cognitive complexity 61 (threshold 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":"engine/src/CodeHealth.Core/Frontend/JsScopeBindings.cs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ee544df8fa3ed8554183cbaef55e88f9d1cba5aa0bfb8c9191ed2a4579f953e"}},{"ruleId":"D2","level":"warning","message":{"text":"DomainModelAnalyzer.AnemicDomainModel (cognitive 61): DomainModelAnalyzer.AnemicDomainModel has cognitive complexity 61 (threshold 15). Of this number, 49 points are the body\u0027s own statements and 12 belong to 12 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":"engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs"},"region":{"startLine":2379}}}],"partialFingerprints":{"codehealthFindingId/v1":"21fa69b504fde048c58d4d07cf110bdc8d0a67eee1571c23719a3038f7e62dc8"}},{"ruleId":"D2","level":"warning","message":{"text":"CSharpTokenizer.TokenizeLine (cognitive 61): CSharpTokenizer.TokenizeLine has cognitive complexity 61 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/SqlBuilderCompositionWalk.cs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"31576cff192da4be703a5beab84c292d4cade74f40930019669a4aa438f1f09f"}},{"ruleId":"D2","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.MovingCargoGitDependencies (cognitive 61): SupplyChainProvenanceAnalyzer.MovingCargoGitDependencies has cognitive complexity 61 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":1470}}}],"partialFingerprints":{"codehealthFindingId/v1":"62852a1d4b17e17a11f2520efaff5a6f64df7da2163eb1ccea25abe08674720b"}},{"ruleId":"D2","level":"warning","message":{"text":"render.render (cognitive 61): render.render has cognitive complexity 61 (threshold 15). Drivers by points: if/else 13 (28 pts), loops 6 (16 pts), ternaries 3 (10 pts), boolean chains 7 (nesting depth added 32). To reduce it, split the body into named stages: move each independent 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":"docs/marketing/whitepapers/render.py"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"20db0b3c151aee9512eef5a1fd8c84f6d164d701d398c79430814f108907e5e7"}},{"ruleId":"D2","level":"warning","message":{"text":"judge-calibration.cmd_judge (cognitive 61): judge-calibration.cmd_judge has cognitive complexity 61 (threshold 15). Drivers by points: if/else 16 (32 pts), boolean chains 18, ternaries 3 (5 pts), error handling 2 (3 pts), loops 2 (3 pts) (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":"tools/train/judge-calibration.py"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"19016ba0e788f331c4fdf7d943e52c81a0048ec8181ad39e3f324e908877b77b"}},{"ruleId":"D2","level":"warning","message":{"text":"AccessibilityAnalyzer.Analyze (cognitive 60): AccessibilityAnalyzer.Analyze has cognitive complexity 60 (threshold 15). Of this number, 58 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":"engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0159e6ab1caad8db057e0725ce7d702c374c7112a3d05102418ec898ef2fbe1"}},{"ruleId":"D2","level":"warning","message":{"text":"AccessibilityAnalyzer.FormsAndLabels (cognitive 60): AccessibilityAnalyzer.FormsAndLabels has cognitive complexity 60 (threshold 15). Of this number, 58 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs"},"region":{"startLine":2246}}}],"partialFingerprints":{"codehealthFindingId/v1":"e95b1f4e9c16044391ea8c094f2a2125f1aae91e7d42501f9b9c5b227eb8f8e7"}},{"ruleId":"D2","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.WorkflowSteps (cognitive 60): SupplyChainProvenanceAnalyzer.WorkflowSteps has cognitive complexity 60 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":6850}}}],"partialFingerprints":{"codehealthFindingId/v1":"1370d1bf462b8a9a0a90a8c5e8349575adebaa8d4801c6ccc302102adefc271b"}},{"ruleId":"D2","level":"warning","message":{"text":"FSharpProvider.CreateMany (cognitive 60): FSharpProvider.CreateMany has cognitive complexity 60 (threshold 15). Drivers by points: if/else 10 (26 pts), loops 5 (15 pts), match/switch 5 (14 pts), error handling 1 (4 pts), boolean chains 1 (nesting depth added 38). 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":"engine/src/CodeHealth.CodeModel.FSharp/FSharpProvider.fs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b557a805d472cba570abb04c2efe2e55224cfe849495384934290123eb1be5c"}},{"ruleId":"D2","level":"warning","message":{"text":"programme-status.heldout_report (cognitive 60): programme-status.heldout_report has cognitive complexity 60 (threshold 15). Drivers by points: if/else 15 (34 pts), ternaries 5 (17 pts), boolean chains 7, loops 2 (nesting depth added 31). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/programme-status.py"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"12df07ec47183fa4d67e86332baa9338205927bc1c14634f6e484d2e6093d353"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendEmittedTemplateRefs.CollectBundleEntries (cognitive 59): FrontendEmittedTemplateRefs.CollectBundleEntries has cognitive complexity 59 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendEmittedTemplateRefs.cs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0bf15c7b456dce7d4a88c5328f7fafdf4a488e1fbec686c20912dc9a2bb2cea"}},{"ruleId":"D2","level":"warning","message":{"text":"EventDrivenAnalyzer.OutboxDualWrite (cognitive 59): EventDrivenAnalyzer.OutboxDualWrite has cognitive complexity 59 (threshold 15). Of this number, 52 points are the body\u0027s own statements and 7 belong to 4 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"b29322f5589624d382ccba32323c0d0131c732647a3d08bf681c701cbc5820bf"}},{"ruleId":"D2","level":"warning","message":{"text":"ProductionReadinessAnalyzer.DisasterRecovery (cognitive 59): ProductionReadinessAnalyzer.DisasterRecovery has cognitive complexity 59 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs"},"region":{"startLine":1889}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c40beaaeaa4e4d548923281408fce6699400a610928bf8232fd6ad883c496e2"}},{"ruleId":"D2","level":"warning","message":{"text":"DotnetTestReliabilityCollector.CollectAsync (cognitive 59): DotnetTestReliabilityCollector.CollectAsync has cognitive complexity 59 (threshold 15). Of this number, 58 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":"engine/src/CodeHealth.Core/Testing/DotnetTestReliabilityCollector.cs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"d206880d3a764253500b6719328c0ff3f6c146722cb205aa8926923257dc7ab6"}},{"ruleId":"D2","level":"warning","message":{"text":"GoTestCensus.Strip (cognitive 59): GoTestCensus.Strip has cognitive complexity 59 (threshold 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":"engine/src/CodeHealth.Core/Testing/GoTestCensus.cs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"87b175a97d228b7bb8dd1ad345a25578ee156f2ef84d20590261093c7d1fb40b"}},{"ruleId":"D2","level":"warning","message":{"text":"ScanParsers.OsvFindings (cognitive 59): ScanParsers.OsvFindings has cognitive complexity 59 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/ScanParsers.cs"},"region":{"startLine":1417}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2c7cad903154c91b5b629c538c4cfbca8af43ee9ce12a348e2b7101283cdd11"}},{"ruleId":"D2","level":"warning","message":{"text":"Tokenizer.blankLiterals (cognitive 59): Tokenizer.blankLiterals has cognitive complexity 59 (threshold 15). Drivers by points: if/else 14 (36 pts), loops 5 (17 pts), boolean chains 6 (nesting depth added 34). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/scala-frontend/src/main/scala/dev/canine/codehealth/scala/Tokenizer.scala"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6a1a2505e02e156a5ba77fa5d2de0ae4e4577c7758b228c22595dac4937d062"}},{"ruleId":"D2","level":"warning","message":{"text":"ReportViewModelFactory.Build (cognitive 58): ReportViewModelFactory.Build has cognitive complexity 58 (threshold 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":"engine/src/CodeHealth.Reporting/Templates/ReportViewModelFactory.cs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a234331325b7853ab2bb24c1014986296b131d282c4ff0b31cbc489ad87aef2"}},{"ruleId":"D2","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.JobsGrantingWriteBeyondGatedSteps (cognitive 58): SupplyChainProvenanceAnalyzer.JobsGrantingWriteBeyondGatedSteps has cognitive complexity 58 (threshold 15). Of this number, 55 points are the body\u0027s own statements and 3 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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":7630}}}],"partialFingerprints":{"codehealthFindingId/v1":"eed4553c9bd6ad0f57df85652971fc0f2c1fe934cf4ccb233bf52e393a629a5c"}},{"ruleId":"D2","level":"warning","message":{"text":"TestDistributionAnalyzer.RunAsync (cognitive 58): TestDistributionAnalyzer.RunAsync has cognitive complexity 58 (threshold 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":"engine/src/CodeHealth.Dimensions.Testing/TestDistributionAnalyzer.cs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7389692b2856acce3fad5df0e69c4d206f3f41976dda48c909b8d7c3a1868d5"}},{"ruleId":"D2","level":"warning","message":{"text":"baseline.main (cognitive 58): baseline.main has cognitive complexity 58 (threshold 15). Drivers by points: if/else 21 (41 pts), loops 4 (11 pts), ternaries 3 (5 pts), boolean chains 1 (nesting depth added 29). To reduce it, split the body into named stages: move each independent 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":"tools/multilang/baseline.py"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"add1d0d1dece7604d599ea9d6c5e00a8c1534de22e748215dbcec998a41ead98"}},{"ruleId":"D2","level":"warning","message":{"text":"prove-gap-channel-separation.main (cognitive 58): prove-gap-channel-separation.main has cognitive complexity 58 (threshold 15). Drivers by points: if/else 11 (33 pts), loops 8 (22 pts), boolean chains 3 (nesting depth added 36). To reduce it, split the body into named stages: move each independent 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":"tools/train/prove-gap-channel-separation.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa56d7fa1b4e61dbbe412a8e6e14a999394616db9cb345c00e6591e4aea9c7ac"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendModuleGraph.CircularGroups (cognitive 57): FrontendModuleGraph.CircularGroups has cognitive complexity 57 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendModuleGraph.cs"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"b42093b62744a2a210fa5f5a9f3eff262b4d16c6ac953a92b74a6d54ac6a2c0d"}},{"ruleId":"D2","level":"warning","message":{"text":"AppKindDetector.DetectAsync (cognitive 57): AppKindDetector.DetectAsync has cognitive complexity 57 (threshold 15). Of this number, 55 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":"engine/src/CodeHealth.Core/ModelAware/AppKindDetector.cs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"750ba258fd14bd4393d4db62a7259f4d09fd544d15235a306e0d32527ca3ba7c"}},{"ruleId":"D2","level":"warning","message":{"text":"EventDrivenAnalyzer.AnalyzeAsync (cognitive 57): EventDrivenAnalyzer.AnalyzeAsync has cognitive complexity 57 (threshold 15). Of this number, 55 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":"engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"01305bb55883c836aa36530bbe05375df815b2e01f45953b1575df67b9bd420c"}},{"ruleId":"D2","level":"warning","message":{"text":"arm-state.main (cognitive 57): arm-state.main has cognitive complexity 57 (threshold 15). Drivers by points: if/else 9 (21 pts), ternaries 7 (19 pts), boolean chains 7, loops 4 (7 pts), error handling 1 (3 pts) (nesting depth added 29). To reduce it, split the body into named stages: move each independent 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":"tools/train/arm-state.py"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"71abbe31d74ae87f53cf55694fe5ec9c11618020a8155386bb65944a76e4da8c"}},{"ruleId":"D2","level":"warning","message":{"text":"CyclomaticComplexityCalculator.ComputeAsync (cognitive 56): CyclomaticComplexityCalculator.ComputeAsync has cognitive complexity 56 (threshold 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":"engine/src/CodeHealth.Core/Complexity/CyclomaticComplexityCalculator.cs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"8effb11b62829cc9507e18fbe1d3ace76591a5f9adfeee262f49b0f6e929623c"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendDependencyHygiene.CollectUnlisted (cognitive 56): FrontendDependencyHygiene.CollectUnlisted has cognitive complexity 56 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendDependencyHygiene.cs"},"region":{"startLine":2010}}}],"partialFingerprints":{"codehealthFindingId/v1":"29efd76ed51a09cf480f70d048001db9347f9b487da828046101c7b0aca95549"}},{"ruleId":"D2","level":"warning","message":{"text":"IndentedMarkupProducer.ParseAttributes (cognitive 56): IndentedMarkupProducer.ParseAttributes has cognitive complexity 56 (threshold 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":"engine/src/CodeHealth.Core/Markup/IndentedMarkupProducer.cs"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9ba89360e294dcc1f6ec3a8477282f61f72dab577215924dd3a835e33461234"}},{"ruleId":"D2","level":"warning","message":{"text":"GdprPersonalDataAnalyzer.AnalyzeAsync (cognitive 56): GdprPersonalDataAnalyzer.AnalyzeAsync has cognitive complexity 56 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/GdprPersonalDataAnalyzer.cs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bb4575dd568e4c18171fe24992ca45049949cb6ac66909d8505279f2a0b6d85"}},{"ruleId":"D2","level":"warning","message":{"text":"SolutionShapeAnalyzer.RunAsync (cognitive 56): SolutionShapeAnalyzer.RunAsync has cognitive complexity 56 (threshold 15). Of this number, 55 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.CodeQuality/SolutionShape/SolutionShapeAnalyzer.cs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"89485b5c7b450a66418b90b251760e3f5c7a9bee3245a2c74b8c34e634c1ecc1"}},{"ruleId":"D2","level":"warning","message":{"text":"ScanParsers.SiblingAdvisoryFloors (cognitive 56): ScanParsers.SiblingAdvisoryFloors has cognitive complexity 56 (threshold 15). Of this number, 50 points are the body\u0027s own statements and 6 belong to 4 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/ScanParsers.cs"},"region":{"startLine":1197}}}],"partialFingerprints":{"codehealthFindingId/v1":"df94d80d46d08d5cc4223370984bd21a8743a24b5e4bfe552d3cc78212fb95ae"}},{"ruleId":"D2","level":"warning","message":{"text":"check.main (cognitive 56): check.main has cognitive complexity 56 (threshold 15). Drivers by points: if/else 24 (25 pts), boolean chains 17, ternaries 8 (9 pts), error handling 3, loops 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"engine/sidecars/python-frontend/selftest/check.py"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf155c8d548e69b608d2b980138e77936afb446f4765dc38c812331e80916ffd"}},{"ruleId":"D2","level":"warning","message":{"text":"RoslynExplicitDebtCollector.CollectWriteOnlyPrivateFields (cognitive 55): RoslynExplicitDebtCollector.CollectWriteOnlyPrivateFields has cognitive complexity 55 (threshold 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":"engine/src/CodeHealth.Core/ExplicitDebt/RoslynExplicitDebtCollector.cs"},"region":{"startLine":1310}}}],"partialFingerprints":{"codehealthFindingId/v1":"9328b98bc1dcae50a92fadb5535bbd338549ee7bcad0d9727a951b936056e789"}},{"ruleId":"D2","level":"warning","message":{"text":"RoslynTestQualityCollector.CollectAsync (cognitive 55): RoslynTestQualityCollector.CollectAsync has cognitive complexity 55 (threshold 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":"engine/src/CodeHealth.Core/Testing/RoslynTestQualityCollector.cs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbfffc945330d6dff721bbb617f2aa601bca29fc891715f588d314bd7685b123"}},{"ruleId":"D2","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.ActionArgvCommandLines (cognitive 55): SupplyChainProvenanceAnalyzer.ActionArgvCommandLines has cognitive complexity 55 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":9606}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd98fef311778b43f3f494487d0f24f6472deea02b00ffa11541f9131df45dda"}},{"ruleId":"D2","level":"warning","message":{"text":"gold-draw.cmd_verify (cognitive 55): gold-draw.cmd_verify has cognitive complexity 55 (threshold 15). Drivers by points: if/else 15 (33 pts), boolean chains 10, loops 3 (6 pts), ternaries 4 (6 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/gold-draw.py"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"8087771bc8efb6b062381e238db1a6a9798c22965e5d74151ab684971a5cd802"}},{"ruleId":"D2","level":"warning","message":{"text":"ComplianceSecurityAnalyzer.ScanSyntax (cognitive 54): ComplianceSecurityAnalyzer.ScanSyntax has cognitive complexity 54 (threshold 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":"engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs"},"region":{"startLine":1164}}}],"partialFingerprints":{"codehealthFindingId/v1":"572b78b765c2bbe6ace8fc855bac20e5d2de37bc0ce0c92f86630827a50361bc"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendAnalyzer.Analyze (cognitive 54): FrontendAnalyzer.Analyze has cognitive complexity 54 (threshold 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":"engine/src/CodeHealth.Core/Discovery/FrontendAnalyzer.cs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"837cc1f64a891bbc82687c9fa3afc3d32bbcce57e91b48e3a2f173f820238aa5"}},{"ruleId":"D2","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.UnverifiedBinaryIngests (cognitive 54): SupplyChainProvenanceAnalyzer.UnverifiedBinaryIngests has cognitive complexity 54 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":1116}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9ce8d0b1dc9b156f9b5dcbb8657fba8b59b7c59797db8d29d50f06d980b2836"}},{"ruleId":"D2","level":"warning","message":{"text":"agg_scala_dm6.main (cognitive 54): agg_scala_dm6.main has cognitive complexity 54 (threshold 15). Drivers by points: if/else 12 (28 pts), boolean chains 9, ternaries 5 (9 pts), loops 5 (8 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/multilang/agg_scala_dm6.py"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2a8170a411acf64fd4b63ff9a155d7c87feb09c90437754beb81101bbfdbd4a"}},{"ruleId":"D2","level":"warning","message":{"text":"judge-viability-by-dimension.main (cognitive 54): judge-viability-by-dimension.main has cognitive complexity 54 (threshold 15). Drivers by points: if/else 11 (31 pts), loops 9 (12 pts), ternaries 4 (9 pts), boolean chains 2 (nesting depth added 28). To reduce it, split the body into named stages: move each independent 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":"tools/train/judge-viability-by-dimension.py"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"23a1f8bed4564b53a79c87e23e0bdd63c0a12b01fabb4bbd79dc3739955c4d60"}},{"ruleId":"D2","level":"warning","message":{"text":"branchWalker.stmt (cognitive 54): branchWalker.stmt has cognitive complexity 54 (threshold 15). Drivers by points: if/else 13 (32 pts), loops 7 (18 pts), boolean chains 3, match/switch 1 (nesting depth added 30). 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":"engine/sidecars/go/bodybranch.go"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"16e351d161ab201712731adee98e73f363910dab3e4eb30dad55a941adcbdbb4"}},{"ruleId":"D2","level":"warning","message":{"text":"ChainedCorrespondence.Aggregate (cognitive 53): ChainedCorrespondence.Aggregate has cognitive complexity 53 (threshold 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":"engine/src/CodeHealth.Core/CodeShape/ChainedCorrespondence.cs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"6365fa1997ef4e78bbff75c1ae2d7aeea834b4caf585a845353f9543cf7f5dac"}},{"ruleId":"D2","level":"warning","message":{"text":"JsDuplicationDetector.Detect (cognitive 53): JsDuplicationDetector.Detect has cognitive complexity 53 (threshold 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":"engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs"},"region":{"startLine":2405}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dfb7def04f9833f0ec4f37f7f70ed72fa76851b5f5e602a643a1e2957798452"}},{"ruleId":"D2","level":"warning","message":{"text":"JsDuplicationDetector.ExtendRunsThroughSupersetRelations (cognitive 53): JsDuplicationDetector.ExtendRunsThroughSupersetRelations has cognitive complexity 53 (threshold 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":"engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs"},"region":{"startLine":5923}}}],"partialFingerprints":{"codehealthFindingId/v1":"970ddc889d6a81150c15cfe04dc74d89eb9d1af06696051cbfeffe514c9aba9c"}},{"ruleId":"D2","level":"warning","message":{"text":"IncompletenessAnalyzer.Classify (cognitive 53): IncompletenessAnalyzer.Classify has cognitive complexity 53 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/IncompletenessAnalyzer.cs"},"region":{"startLine":989}}}],"partialFingerprints":{"codehealthFindingId/v1":"0562f24fa0d7ca7616d66f384cb82d61e3b9ce43b85742741aa70b8489c796ba"}},{"ruleId":"D2","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.WorkflowTokenHygiene (cognitive 53): SupplyChainProvenanceAnalyzer.WorkflowTokenHygiene has cognitive complexity 53 (threshold 15). Of this number, 47 points are the body\u0027s own statements and 6 belong to 8 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":8699}}}],"partialFingerprints":{"codehealthFindingId/v1":"49ca91c937fe7a68082d1edfbd89af14a15635331f64baab6da5be4137cfd532"}},{"ruleId":"D2","level":"warning","message":{"text":"check.main (cognitive 53): check.main has cognitive complexity 53 (threshold 15). Drivers by points: boolean chains 51, if/else 1, ternaries 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/ruby-frontend/selftest/check.mjs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6ddb24ebabcfe06b1577a889853f18ece17f99ab0572215cec1c3cce4528d2d"}},{"ruleId":"D2","level":"warning","message":{"text":"CSharpSourceScanner.Tokenize (cognitive 52): CSharpSourceScanner.Tokenize has cognitive complexity 52 (threshold 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":"engine/src/CodeHealth.Core/ApiSurface/CSharpSourceScanner.cs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0617f797cb5a27f3b2a60f8ba43374547f89150da609c2b0ce47285c4dd2e95"}},{"ruleId":"D2","level":"warning","message":{"text":"Tokenizer.blankLiterals (cognitive 52): Tokenizer.blankLiterals has cognitive complexity 52 (threshold 15). Drivers by points: if/else 9 (33 pts), loops 4 (13 pts), boolean chains 6 (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/kotlin-frontend/src/main/kotlin/dev/canine/codehealth/kotlin/Tokenizer.kt"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd73d08fd9a52c70dc0e7f8984069f954368334d042aa2e9ccee0fd8b17258e0"}},{"ruleId":"D2","level":"warning","message":{"text":"BranchWalker._stmt (cognitive 52): BranchWalker._stmt has cognitive complexity 52 (threshold 15). Drivers by points: loops 14 (34 pts), if/else 11 (17 pts), boolean chains 1 (nesting depth added 26). 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":"engine/sidecars/python-frontend/bodyfacts.py"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e8a56a9776bbef9ae4deb214e8bf58777af7b5d167c1283f66d1626e630f275"}},{"ruleId":"D2","level":"warning","message":{"text":"ArchitectureMapBuilder.BuildAsync (cognitive 51): ArchitectureMapBuilder.BuildAsync has cognitive complexity 51 (threshold 15). Of this number, 50 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":"engine/src/CodeHealth.Core/Architecture/ArchitectureMapBuilder.cs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"723bfca78c5a6e25233c4835573ad31647a358afe659d03b441ae5d2454eb3d9"}},{"ruleId":"D2","level":"warning","message":{"text":"IndirectionAnalyzer.AnalyzeAsync (cognitive 51): IndirectionAnalyzer.AnalyzeAsync has cognitive complexity 51 (threshold 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":"engine/src/CodeHealth.Core/Architecture/IndirectionAnalyzer.cs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee697bfbe3e9645101d2ec2253985f065a7c6bdd58e5823e91ae23bc63e72ace"}},{"ruleId":"D2","level":"warning","message":{"text":"ComplianceSecurityAnalyzer.AnalyzeAsync (cognitive 51): ComplianceSecurityAnalyzer.AnalyzeAsync has cognitive complexity 51 (threshold 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":"engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0f353d6dd4e4189faf5ff133b68a655dee9cb1eed8eabe9635dd6b8e57d2a43"}},{"ruleId":"D2","level":"warning","message":{"text":"PnpmLockfileReader.ReadDirectProduction (cognitive 51): PnpmLockfileReader.ReadDirectProduction has cognitive complexity 51 (threshold 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":"engine/src/CodeHealth.Core/Dependencies/PnpmLockfileReader.cs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"19c7673e18ee6c6c303f84ac70f0effeae3cb4499da241a8564a1e21d19e1f4f"}},{"ruleId":"D2","level":"warning","message":{"text":"ArchitectureModelAnalyzer.SliceCohesion (cognitive 51): ArchitectureModelAnalyzer.SliceCohesion has cognitive complexity 51 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/ArchitectureModelAnalyzer.cs"},"region":{"startLine":2008}}}],"partialFingerprints":{"codehealthFindingId/v1":"69a3dbbc1167410cc81c7105924a2a9d4f64fa1e311c7041ae00e1cef3fa163d"}},{"ruleId":"D2","level":"warning","message":{"text":"DomainModelAnalyzer.IntegrationEventCoupling (cognitive 51): DomainModelAnalyzer.IntegrationEventCoupling has cognitive complexity 51 (threshold 15). Of this number, 48 points are the body\u0027s own statements and 3 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":"engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs"},"region":{"startLine":2266}}}],"partialFingerprints":{"codehealthFindingId/v1":"b885c5a62b15b85f7517bd8e3bdf4adcfe562314e01e513ddf57b062c808b4d4"}},{"ruleId":"D2","level":"warning","message":{"text":"JsInteropContractAnalyzer.AnalyzeAsync (cognitive 51): JsInteropContractAnalyzer.AnalyzeAsync has cognitive complexity 51 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/JsInteropContractAnalyzer.cs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ccdcdd208427bf110ebd68c5c6d17c1e4b1bdb7957fb860ed500a1b410a393b"}},{"ruleId":"D2","level":"warning","message":{"text":"ChurnCommitIdentity.CountedChanges (cognitive 51): ChurnCommitIdentity.CountedChanges has cognitive complexity 51 (threshold 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":"engine/src/CodeHealth.Toolchain/Git/ChurnCommitIdentity.cs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d56f8e1417aec92f37e0948f5d5b32a24c13740fbbc085e7138a7a43193a201"}},{"ruleId":"D2","level":"warning","message":{"text":"DuplicationAnalyzer.GuardRegionOf (cognitive 51): DuplicationAnalyzer.GuardRegionOf has cognitive complexity 51 (threshold 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":"engine/src/CodeHealth.Dimensions.CodeQuality/CodeShape/DuplicationAnalyzer.cs"},"region":{"startLine":2994}}}],"partialFingerprints":{"codehealthFindingId/v1":"6550e5fdaac820286b75adb316788b3b7a804f9e05b27c1a6fafb108d9c6bd8f"}},{"ruleId":"D2","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.PrTriggeredWorkflowsGrantingWrite (cognitive 51): SupplyChainProvenanceAnalyzer.PrTriggeredWorkflowsGrantingWrite has cognitive complexity 51 (threshold 15). Of this number, 49 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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":7795}}}],"partialFingerprints":{"codehealthFindingId/v1":"226474606a230e3d44772e080af978e769eed36ab76c6a1698923e8f779d755a"}},{"ruleId":"D2","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.AdvisoryMonitoringFor (cognitive 51): SupplyChainProvenanceAnalyzer.AdvisoryMonitoringFor has cognitive complexity 51 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":10185}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe6beebb85e3599e78851f133ac9cc77e5367ec363aa41271e69bb16ea47a751"}},{"ruleId":"D2","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.TokenAuthedNpmPublishes (cognitive 51): SupplyChainProvenanceAnalyzer.TokenAuthedNpmPublishes has cognitive complexity 51 (threshold 15). Of this number, 49 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.NpmRegistryAuth.cs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c0ceb2f1fcab07dd2c41fb196ccc387a44848094d599ce72a71fb2949709779"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleSyntaxScanner.ScanExportDeclaration (cognitive 50): ModuleSyntaxScanner.ScanExportDeclaration has cognitive complexity 50 (threshold 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":"engine/src/CodeHealth.Core/Frontend/ModuleSyntaxScanner.cs"},"region":{"startLine":956}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffe95f5b82d5ce5ec23f14a0b890de1701ac010c4ebc24cc12cf6d708d1ca92d"}},{"ruleId":"D2","level":"warning","message":{"text":"MaturityAnalyzer.ArchitectureDocs (cognitive 50): MaturityAnalyzer.ArchitectureDocs has cognitive complexity 50 (threshold 15). Of this number, 43 points are the body\u0027s own statements and 7 belong to 2 function literals inside it that branch. To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Maturity/MaturityAnalyzer.cs"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"382668a60a0ce4ea2e0b0e91f17209107129ebbb088820764b129e434086621c"}},{"ruleId":"D2","level":"warning","message":{"text":"AggregateTransactionAnalyzer.Analyze (cognitive 50): AggregateTransactionAnalyzer.Analyze has cognitive complexity 50 (threshold 15). Of this number, 49 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":"engine/src/CodeHealth.Core/ModelAware/AggregateTransactionAnalyzer.cs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"0215eee40d6aaadf758d7a5d97c54e5d4a44ea15cf1265f18705ec36e4e73250"}},{"ruleId":"D2","level":"warning","message":{"text":"FileModel.IndexMethods (cognitive 50): FileModel.IndexMethods has cognitive complexity 50 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/SqlBuilderCompositionWalk.cs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"a85dce5889566e7e97e70deed989529f1c13d4fbd319a73383dc500305d75a88"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleSyntaxScanner.ScanImportStatement (cognitive 49): ModuleSyntaxScanner.ScanImportStatement has cognitive complexity 49 (threshold 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":"engine/src/CodeHealth.Core/Frontend/ModuleSyntaxScanner.cs"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a974e83058d63c1374ea88d19bd94417554c63ccadae0219f0d11ecd4820024"}},{"ruleId":"D2","level":"warning","message":{"text":"OperabilityExtrasAnalyzer.AnalyzeAsync (cognitive 49): OperabilityExtrasAnalyzer.AnalyzeAsync has cognitive complexity 49 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/OperabilityExtrasAnalyzer.cs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"549e40741b5be2421b98d3780f1a7581e0c138b0c5efe73b1eddf1c162ee247a"}},{"ruleId":"D2","level":"warning","message":{"text":"JsTestCensus.Strip (cognitive 49): JsTestCensus.Strip has cognitive complexity 49 (threshold 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":"engine/src/CodeHealth.Core/Testing/JsTestCensus.cs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"e93ff8e4222bf69ee31024846d963bb75e8b06de38bfcb443693ab725ac9bfb1"}},{"ruleId":"D2","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.RequiredStatusContexts (cognitive 49): SupplyChainProvenanceAnalyzer.RequiredStatusContexts has cognitive complexity 49 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":10655}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca845fbc47461ebddc9cf357376fd537dcf2bbfa5248f51fb81f0d8b185b98f6"}},{"ruleId":"D2","level":"warning","message":{"text":"judge_assignment.census_failures (cognitive 49): judge_assignment.census_failures has cognitive complexity 49 (threshold 15). Drivers by points: if/else 15 (33 pts), boolean chains 13, loops 2, ternaries 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/judge_assignment.py"},"region":{"startLine":1483}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a7069961ad25efbdbf54210ce34d65318fee8175683247e216f1db44ba9afba"}},{"ruleId":"D2","level":"warning","message":{"text":"NeutralFileLengthScanner.CountBraces (cognitive 48): NeutralFileLengthScanner.CountBraces has cognitive complexity 48 (threshold 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":"engine/src/CodeHealth.Core/CodeShape/NeutralFileLengthScanner.cs"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"8707a6fd694326a08a2a641ad328d44623678a664a7a9ba3cfad884c7440f47c"}},{"ruleId":"D2","level":"warning","message":{"text":"BundlerManifestHygiene.Read (cognitive 48): BundlerManifestHygiene.Read has cognitive complexity 48 (threshold 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":"engine/src/CodeHealth.Core/Dependencies/BundlerManifestHygiene.cs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"d474fde638f0a2719d72ca1d7c6b88c0ef3ac64ca6c9b66b13be5f131841c27d"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendTestReachability.DirectoryBarrelReached (cognitive 48): FrontendTestReachability.DirectoryBarrelReached has cognitive complexity 48 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendTestReachability.cs"},"region":{"startLine":2132}}}],"partialFingerprints":{"codehealthFindingId/v1":"335b52fb86fa43c63b747a24bfaeef8222d2a2d5e5766a03ef01d735c125a2ed"}},{"ruleId":"D2","level":"warning","message":{"text":"CsprojReferenceGraph.ImportedMsBuildTexts (cognitive 48): CsprojReferenceGraph.ImportedMsBuildTexts has cognitive complexity 48 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/CsprojReferenceGraph.cs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"f89afd97ef2b86f1db3c32a4cde56409a7cd01cb13f1968ed617aff525144018"}},{"ruleId":"D2","level":"warning","message":{"text":"DomainModelAnalyzer.AggregateBoundaries (cognitive 48): DomainModelAnalyzer.AggregateBoundaries has cognitive complexity 48 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs"},"region":{"startLine":1930}}}],"partialFingerprints":{"codehealthFindingId/v1":"44dd52907c4c3b382f6256361257e08f08b24e7b6d7822166bf6d400fecff31d"}},{"ruleId":"D2","level":"warning","message":{"text":"ArchGraphSvg.RenderClustered (cognitive 48): ArchGraphSvg.RenderClustered has cognitive complexity 48 (threshold 15). Of this number, 46 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":"engine/src/CodeHealth.Reporting/Svg/ArchGraphSvg.cs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5de258bb7b06925d392b588a93567f507cc4583761ac32ce954dfb54660adaa"}},{"ruleId":"D2","level":"warning","message":{"text":"NamelessWorkloadNormalisedScan.Normalise (cognitive 48): NamelessWorkloadNormalisedScan.Normalise has cognitive complexity 48 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/NamelessWorkloadNormalisedScan.cs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"16af20dfe375e20773740248a2ecafe31cfb5e2b06563842bb4aeadc1dfe19b6"}},{"ruleId":"D2","level":"warning","message":{"text":"memberEmitters (cognitive 48): memberEmitters has cognitive complexity 48 (threshold 15). Drivers by points: ternaries 16, if/else 13 (15 pts), other 8, boolean chains 7, error handling 1 (2 pts) (nesting depth added 3). Most of this is not in the body itself: 0 of the 48 points are its own statements and the rest belongs to 11 function items inside it that branch (typeRefOfNode, emitAccessor, emitMember, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/tsjs-frontend/extract-file.mjs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"733051172bf19f9a7c61a81b88a51c6949957c29446a2aa2d98cc28303d6f190"}},{"ruleId":"D2","level":"warning","message":{"text":"BundlerManifestHygiene.ParseDeclarations (cognitive 47): BundlerManifestHygiene.ParseDeclarations has cognitive complexity 47 (threshold 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":"engine/src/CodeHealth.Core/Dependencies/BundlerManifestHygiene.cs"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"af723324840701b542413f4b70927215b3995d43299bafab5ab305b741f29626"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleSyntaxScanner.ScanCommentTypeImports (cognitive 47): ModuleSyntaxScanner.ScanCommentTypeImports has cognitive complexity 47 (threshold 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":"engine/src/CodeHealth.Core/Frontend/ModuleSyntaxScanner.cs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7efae3e8197b5f175a3808a06a208ae619d8a576c7d7bffaded13b2f8bf69cf"}},{"ruleId":"D2","level":"warning","message":{"text":"MarkupTaintPass.CollectHoles (cognitive 47): MarkupTaintPass.CollectHoles has cognitive complexity 47 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/MarkupTaintPass.cs"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff0753f4d63a78adcb517b32206d3cae45529df7e0e6b9b8f8644958d725bbd6"}},{"ruleId":"D2","level":"warning","message":{"text":"RuleRecommendationEngine.ForDimension (cognitive 47): RuleRecommendationEngine.ForDimension has cognitive complexity 47 (threshold 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":"engine/src/CodeHealth.Reporting/Recommendations/RuleRecommendationEngine.cs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed0d5a8f3a1c2b87f287b7414e57fef69eabf98b35e3686e7518f6fbed5dc29a"}},{"ruleId":"D2","level":"warning","message":{"text":"DuplicationAnalyzer.DuplicationRemediationCore (cognitive 47): DuplicationAnalyzer.DuplicationRemediationCore has cognitive complexity 47 (threshold 15). Of this number, 40 points are the body\u0027s own statements and 7 belong to 5 function literals inside it that branch. To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.CodeQuality/CodeShape/DuplicationAnalyzer.cs"},"region":{"startLine":1546}}}],"partialFingerprints":{"codehealthFindingId/v1":"1256588f8a7bd962d007cd9a9bd8fb1d668885c20ed4125b6ce555d11f85d90e"}},{"ruleId":"D2","level":"warning","message":{"text":"RubyArgumentMutatedScan.ParametersOf (cognitive 47): RubyArgumentMutatedScan.ParametersOf has cognitive complexity 47 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/RubyArgumentMutatedScan.cs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"15d9d8ac33f9ac67c2545f18adf02f17a90d65ffa03fe1a77aad2d42ad5470d6"}},{"ruleId":"D2","level":"warning","message":{"text":"ControlFlowComplexity.CognitiveShape (cognitive 46): ControlFlowComplexity.CognitiveShape has cognitive complexity 46 (threshold 15). Of this number, 43 points are the body\u0027s own statements and 3 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":"engine/src/CodeHealth.Core/Complexity/ControlFlowComplexity.cs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bc1c333ad4e5a4a28e864a7da33bc7b2db7275ce62f0fa90d90d529836f2087"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendBundlerConfigRefs.CollectBundlerAliases (cognitive 46): FrontendBundlerConfigRefs.CollectBundlerAliases has cognitive complexity 46 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendBundlerConfigRefs.cs"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"3331f8d77db8a9aff2e6d16aa90de5bf7600d1f2266c792389d9e4fa6df15d40"}},{"ruleId":"D2","level":"warning","message":{"text":"DomainModelAnalyzer.MutableEntities (cognitive 46): DomainModelAnalyzer.MutableEntities has cognitive complexity 46 (threshold 15). Of this number, 44 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":"engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs"},"region":{"startLine":3324}}}],"partialFingerprints":{"codehealthFindingId/v1":"81a6d8a77a186ccec196ab1acc5fc68dece32103869b0a7da91812ed1e599d3e"}},{"ruleId":"D2","level":"warning","message":{"text":"ScanParsers.OsvNuGetFixVersions (cognitive 46): ScanParsers.OsvNuGetFixVersions has cognitive complexity 46 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/ScanParsers.cs"},"region":{"startLine":1607}}}],"partialFingerprints":{"codehealthFindingId/v1":"32493ed63a36a372cf13f1a84f129619ed5319a5201bacbc56be8a1f05bd1f70"}},{"ruleId":"D2","level":"warning","message":{"text":"scope-evidence.evidence_for (cognitive 46): scope-evidence.evidence_for has cognitive complexity 46 (threshold 15). Drivers by points: if/else 18 (26 pts), boolean chains 14, ternaries 2 (6 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":"tools/train/scope-evidence.py"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d7607eda1a15a9a5232935cc7b9eb3c7070697f56da46a585bdf1b510f230c3"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendTestReachability.PackageNameReached (cognitive 45): FrontendTestReachability.PackageNameReached has cognitive complexity 45 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendTestReachability.cs"},"region":{"startLine":966}}}],"partialFingerprints":{"codehealthFindingId/v1":"07ccf17f94eac39b6b66db2f26dd917f3de630c100e79b04618d19e0855cf6f9"}},{"ruleId":"D2","level":"warning","message":{"text":"EventSourcingAnalyzer.PiiInEventStore (cognitive 45): EventSourcingAnalyzer.PiiInEventStore has cognitive complexity 45 (threshold 15). Of this number, 43 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":"engine/src/CodeHealth.Core/ModelAware/EventSourcingAnalyzer.cs"},"region":{"startLine":1128}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7f3b333f02800b06231186d939072233c73dda0076a3324172f32de0af76c75"}},{"ruleId":"D2","level":"warning","message":{"text":"SupplyChainHygieneAnalyzer.Analyze (cognitive 45): SupplyChainHygieneAnalyzer.Analyze has cognitive complexity 45 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/SupplyChainHygieneAnalyzer.cs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"445b413b710e4669a4d85fe40c44f84f5d6ecbb6d5e5f3b305f860fde869ae83"}},{"ruleId":"D2","level":"warning","message":{"text":"ComposeServiceSurface.ServicesIn (cognitive 45): ComposeServiceSurface.ServicesIn has cognitive complexity 45 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/ComposeServiceSurface.cs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a2ec3ba33a1240f8847d7c1ec07eceed997d025f5fb2df832206de093e6bfdd"}},{"ruleId":"D2","level":"warning","message":{"text":"adjudication.audit_rounds (cognitive 45): adjudication.audit_rounds has cognitive complexity 45 (threshold 15). Drivers by points: if/else 10 (30 pts), loops 5 (9 pts), error handling 1 (3 pts), boolean chains 2, ternaries 1 (nesting depth added 26). To reduce it, split the body into named stages: move each independent 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":"tools/train/adjudication.py"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"c495881c3ec112cd696a45a140f81e43f9a8a714529d0a5e026772ef851c54ca"}},{"ruleId":"D2","level":"warning","message":{"text":"evidence-ab.main (cognitive 45): evidence-ab.main has cognitive complexity 45 (threshold 15). Drivers by points: if/else 19 (28 pts), loops 6 (9 pts), boolean chains 5, ternaries 1 (2 pts), error handling 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":"tools/train/evidence-ab.py"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"33325dded87e97156f743b30d6c05f9ad722ec755f195fafb655b7e2b9a4c71f"}},{"ruleId":"D2","level":"warning","message":{"text":"RoslynExplicitDebtCollector.CollectInvertedNullGuards (cognitive 44): RoslynExplicitDebtCollector.CollectInvertedNullGuards has cognitive complexity 44 (threshold 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":"engine/src/CodeHealth.Core/ExplicitDebt/RoslynExplicitDebtCollector.cs"},"region":{"startLine":868}}}],"partialFingerprints":{"codehealthFindingId/v1":"029b014ff1bcd9d4c8aaa4e8149d33d21fe49bc8e04eb7b5dd1cddff4cd89f7e"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendDependencyHygiene.CandidateBinNames (cognitive 44): FrontendDependencyHygiene.CandidateBinNames has cognitive complexity 44 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendDependencyHygiene.cs"},"region":{"startLine":1541}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b8205248f52c0eb0bce547b97ad5659aebb5354fe232a456610afbd10ac9ce2"}},{"ruleId":"D2","level":"warning","message":{"text":"MaturityAnalyzer.Documentation (cognitive 44): MaturityAnalyzer.Documentation has cognitive complexity 44 (threshold 15). Of this number, 42 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":"engine/src/CodeHealth.Core/Maturity/MaturityAnalyzer.cs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a38563bd1aaef9544fd0a4965cbe299f73d0267552150743bb5f249f6bffdd6"}},{"ruleId":"D2","level":"warning","message":{"text":"AccessibilityAnalyzer.KeyboardSemantics (cognitive 44): AccessibilityAnalyzer.KeyboardSemantics has cognitive complexity 44 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs"},"region":{"startLine":3353}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1c775302c383f6b975f0939b5460fe4b3bd9345a6a2fa0a5662515dc341edca"}},{"ruleId":"D2","level":"warning","message":{"text":"DomainModelAnalyzer.AnalyzeAsync (cognitive 44): DomainModelAnalyzer.AnalyzeAsync has cognitive complexity 44 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"b338b6382177aa0fbe2a9637af0400f1d9877531671973abebdb3de082d8c4d3"}},{"ruleId":"D2","level":"warning","message":{"text":"SecretsHistoryAnalyzer.CountBraceDelta (cognitive 44): SecretsHistoryAnalyzer.CountBraceDelta has cognitive complexity 44 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/SecretsHistoryAnalyzer.cs"},"region":{"startLine":1537}}}],"partialFingerprints":{"codehealthFindingId/v1":"51006c1ca6bedf6f51c3db41dde8401ee60b6fa2b301db25d7f732c9b9f1f36b"}},{"ruleId":"D2","level":"warning","message":{"text":"compare.main (cognitive 44): compare.main has cognitive complexity 44 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 11 (17 pts), boolean chains 4, ternaries 4 (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":"tools/multilang/compare.py"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"75ac2d6be52b40730122cf4d9e9c01c77f3af57eba7ff615fa012ddbe62e13cf"}},{"ruleId":"D2","level":"warning","message":{"text":"scope-evidence.value_provenance_evidence (cognitive 44): scope-evidence.value_provenance_evidence has cognitive complexity 44 (threshold 15). Drivers by points: if/else 11 (27 pts), loops 6 (12 pts), boolean chains 5 (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":"tools/train/scope-evidence.py"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4b357b6cc0f0e6c4d31de0e36fb2ba99704e7af690db442120a45e16b3dea74"}},{"ruleId":"D2","level":"warning","message":{"text":"Model::resolve (cognitive 44): Model::resolve has cognitive complexity 44 (threshold 15). Drivers by points: loops 14 (25 pts), if/else 7 (18 pts), boolean chains 1 (nesting depth added 22). 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":"engine/sidecars/rust-frontend/src/main.rs"},"region":{"startLine":1095}}}],"partialFingerprints":{"codehealthFindingId/v1":"9953693170e52747fc419f6acdfc92fe7608b23b877c603784c919a6f0ca6258"}},{"ruleId":"D2","level":"warning","message":{"text":"ts-helpers.callsOf (cognitive 44): ts-helpers.callsOf has cognitive complexity 44 (threshold 15). Drivers by points: if/else 14 (18 pts), ternaries 7 (13 pts), boolean chains 8, error handling 3 (4 pts), loops 1 (nesting depth added 11). Most of this is not in the body itself: 2 of the 44 points are its own statements and the rest belongs to 7 function literals inside it that branch (lines 539, 514, 553, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/tsjs-frontend/ts-helpers.mjs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8e7f04a7944c04b129a6345ba14b22d4f1a0999449b2ff42f8c105c31963439"}},{"ruleId":"D2","level":"warning","message":{"text":"ComplianceSecurityAnalyzer.ScanCryptoStreamModeContradiction (cognitive 43): ComplianceSecurityAnalyzer.ScanCryptoStreamModeContradiction has cognitive complexity 43 (threshold 15). Of this number, 42 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":"engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs"},"region":{"startLine":2622}}}],"partialFingerprints":{"codehealthFindingId/v1":"437f31890f5bb0851181d22aa6a537687e85f98b98544d23dea58cb7775349a5"}},{"ruleId":"D2","level":"warning","message":{"text":"MixManifestHygiene.Read (cognitive 43): MixManifestHygiene.Read has cognitive complexity 43 (threshold 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":"engine/src/CodeHealth.Core/Dependencies/MixManifestHygiene.cs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"67867a107421ac874b9e3e1a824da47b73116529f550ad53772782920cc05b97"}},{"ruleId":"D2","level":"warning","message":{"text":"JsDuplicationDetector.DetectEditedCopies (cognitive 43): JsDuplicationDetector.DetectEditedCopies has cognitive complexity 43 (threshold 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":"engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs"},"region":{"startLine":4902}}}],"partialFingerprints":{"codehealthFindingId/v1":"6112e9b29181697db4338424549e7a96452739e2203080ca492275fd4834bdc2"}},{"ruleId":"D2","level":"warning","message":{"text":"DomainConventions.ClassifyHandler (cognitive 43): DomainConventions.ClassifyHandler has cognitive complexity 43 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/DomainConventions.cs"},"region":{"startLine":1634}}}],"partialFingerprints":{"codehealthFindingId/v1":"5266c8bc30df95c8eb04745a1d31e2df24cce9ae7b6187944da8ee1cc5e6b1a8"}},{"ruleId":"D2","level":"warning","message":{"text":"ProductionReadinessAnalyzer.Cicd (cognitive 43): ProductionReadinessAnalyzer.Cicd has cognitive complexity 43 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs"},"region":{"startLine":3435}}}],"partialFingerprints":{"codehealthFindingId/v1":"11291a6cc4b2fe081f264151d59275fc90e54bbc57c5570a8cd8a7e85f74c827"}},{"ruleId":"D2","level":"warning","message":{"text":"DuplicationAnalyzer.DivergentTypeBindingCaveat (cognitive 43): DuplicationAnalyzer.DivergentTypeBindingCaveat has cognitive complexity 43 (threshold 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":"engine/src/CodeHealth.Dimensions.CodeQuality/CodeShape/DuplicationAnalyzer.cs"},"region":{"startLine":1800}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb0a46b19dd14e7e9080625afe3f73fa4f2e7d7a8bcd060e9a14ad7e3a1bc235"}},{"ruleId":"D2","level":"warning","message":{"text":"CloneSpanShape.Of (cognitive 43): CloneSpanShape.Of has cognitive complexity 43 (threshold 15). Of this number, 40 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.CodeQuality/CodeShape/DuplicationAnalyzer.cs"},"region":{"startLine":4123}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5d4690dbbdbe19825fc00b5af31e5805d3b8ac40b3d95f9820cd2e9523bbba7"}},{"ruleId":"D2","level":"warning","message":{"text":"ScanParsers.DependencyDetail (cognitive 43): ScanParsers.DependencyDetail has cognitive complexity 43 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/ScanParsers.cs"},"region":{"startLine":2102}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e0f47e2ce420aa7f9393099284c54c2b17d7766fcfd8b59e04c736e2f5603cb"}},{"ruleId":"D2","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.MovingPythonGitDependencies (cognitive 43): SupplyChainProvenanceAnalyzer.MovingPythonGitDependencies has cognitive complexity 43 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":1820}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae8bed8ea1967ef000acd9ecceb1360e20634b6085ed6ba415704deed7e2e758"}},{"ruleId":"D2","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.SoftFailedGatesBeforePublish (cognitive 43): SupplyChainProvenanceAnalyzer.SoftFailedGatesBeforePublish has cognitive complexity 43 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":2213}}}],"partialFingerprints":{"codehealthFindingId/v1":"89197891b783c30abf0aa8a93e30e8338c7ec5b55b75db1ba17e283b4cfe6794"}},{"ruleId":"D2","level":"warning","message":{"text":"ChangeCouplingAnalyzer.HasExplicitDependency (cognitive 43): ChangeCouplingAnalyzer.HasExplicitDependency has cognitive complexity 43 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.GitMining/ChangeCouplingAnalyzer.cs"},"region":{"startLine":3346}}}],"partialFingerprints":{"codehealthFindingId/v1":"078841513b88d56b772eb27dd14325171c22d0093a542d80f143cf8fa9b5c79e"}},{"ruleId":"D2","level":"warning","message":{"text":"JvmProvider.Build (cognitive 43): JvmProvider.Build has cognitive complexity 43 (threshold 15). Of this number, 42 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":"engine/src/CodeHealth.CodeModel.Jvm/JvmProvider.cs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ba1fe301784557f6587021310981864011f5e913a45fc364a41b7b8075c082e"}},{"ruleId":"D2","level":"warning","message":{"text":"Check.run (cognitive 43): Check.run has cognitive complexity 43 (threshold 15). Drivers by points: boolean chains 41, if/else 1, match/switch 1. 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":"engine/sidecars/elixir-frontend/selftest/check.exs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b11f83c3cfa5e92a339eda798833e32c057bb7cc9e543d027ab3801e2685dc3"}},{"ruleId":"D2","level":"warning","message":{"text":"Extractor.collectMember (cognitive 43): Extractor.collectMember has cognitive complexity 43 (threshold 15). Drivers by points: if/else 12 (26 pts), loops 4 (10 pts), boolean chains 7 (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":"engine/sidecars/swift-frontend/Sources/codehealth-swift-sidecar/Extractor.swift"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"494fe1d0fda150512b63f51a5c219340089219fb5e40811c4a1ed38ad607a3d2"}},{"ruleId":"D2","level":"warning","message":{"text":"collectModuleUnits (cognitive 43): collectModuleUnits has cognitive complexity 43 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 14, loops 5 (7 pts), ternaries 3, other 2 (nesting depth added 9). Most of this is not in the body itself: 13 of the 43 points are its own statements and the rest belongs to 8 function items inside it that branch (unwrapCall, carriedByLogical, insideTypeCarrier, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/tsjs-frontend/extract-file.mjs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"e73944b632cbc498f663154df07c712ff699cad551bcb3d3adf47d43e633462a"}},{"ruleId":"D2","level":"warning","message":{"text":"MemberPairRollup.Aggregate (cognitive 42): MemberPairRollup.Aggregate has cognitive complexity 42 (threshold 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":"engine/src/CodeHealth.Core/CodeShape/MemberPairRollup.cs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e86e5a75443376a6a6191cb4bbc34602c597e9e9365a9859574b7ea455909bc"}},{"ruleId":"D2","level":"warning","message":{"text":"LineLexer.CodeOnly (cognitive 42): LineLexer.CodeOnly has cognitive complexity 42 (threshold 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":"engine/src/CodeHealth.Core/CodeShape/RustInlineTestRegions.cs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"904ffd8d9c4acccf6d91d9ca79f98c4ac8b2af80e9d16fb9714c5947a61f3276"}},{"ruleId":"D2","level":"warning","message":{"text":"Lcom4Calculator.ComputeAsync (cognitive 42): Lcom4Calculator.ComputeAsync has cognitive complexity 42 (threshold 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":"engine/src/CodeHealth.Core/Cohesion/Lcom4Calculator.cs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"0439dbbc6c9ff45d144d506bad7512bf5d0246ce60a36d238ade729922bb8973"}},{"ruleId":"D2","level":"warning","message":{"text":"RoslynDeadCodeDetector.DetectAsync (cognitive 42): RoslynDeadCodeDetector.DetectAsync has cognitive complexity 42 (threshold 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":"engine/src/CodeHealth.Core/ExplicitDebt/RoslynDeadCodeDetector.cs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b4f4c0b599f7baaa77def025514d2d3a85b67f34aef669ba77e7a6d6ba60ef8"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendBundlerConfigRefs.CollectJsonBuildManifestEntries (cognitive 42): FrontendBundlerConfigRefs.CollectJsonBuildManifestEntries has cognitive complexity 42 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendBundlerConfigRefs.cs"},"region":{"startLine":1161}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5a35f448d4cd749736fcbeda84445635caba6ef57785a3dfc95f94d03d54daa"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendTestReachability.IsRegistrationDataModule (cognitive 42): FrontendTestReachability.IsRegistrationDataModule has cognitive complexity 42 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendTestReachability.cs"},"region":{"startLine":1492}}}],"partialFingerprints":{"codehealthFindingId/v1":"d674f8d6c79606344d7ab1390a87839b6f142841fcf029182c69321f2e882f49"}},{"ruleId":"D2","level":"warning","message":{"text":"JsComplexity.FindBracelessBodyEnd (cognitive 42): JsComplexity.FindBracelessBodyEnd has cognitive complexity 42 (threshold 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":"engine/src/CodeHealth.Core/Frontend/JsComplexity.cs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"c12cf123380a5c9b6322f8aa39d089e91bc17e561b00e47741c0ce63b91013d1"}},{"ruleId":"D2","level":"warning","message":{"text":"EventSourcingAnalyzer.PiiInEventStore (cognitive 42): EventSourcingAnalyzer.PiiInEventStore has cognitive complexity 42 (threshold 15). Of this number, 41 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":"engine/src/CodeHealth.Core/ModelAware/EventSourcingAnalyzer.cs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"b30182abe3a2322b9e91fa872878e6977f543ef1d5dfdfc0ea5628b7f759ad63"}},{"ruleId":"D2","level":"warning","message":{"text":"RepoProfiler.DetectDdd (cognitive 42): RepoProfiler.DetectDdd has cognitive complexity 42 (threshold 15). Of this number, 34 points are the body\u0027s own statements and 8 belong to 7 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/RepoProfiler.cs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a57ba32c80a9521d9f9bfddb58082b1c55e0a74e8840f073fa99194b3d047cd"}},{"ruleId":"D2","level":"warning","message":{"text":"CommittedCoverageReader.ParseSimpleCovJson (cognitive 42): CommittedCoverageReader.ParseSimpleCovJson has cognitive complexity 42 (threshold 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":"engine/src/CodeHealth.Core/Testing/CommittedCoverageReader.cs"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d01cfceb2682a8c8445c2d03e2ba5ded81619a42b2b0303c4a685fcd67199ed"}},{"ruleId":"D2","level":"warning","message":{"text":"GodClassAnalyzer.RunAsync (cognitive 42): GodClassAnalyzer.RunAsync has cognitive complexity 42 (threshold 15). Of this number, 37 points are the body\u0027s own statements and 5 belong to 5 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.CodeQuality/CodeShape/GodClassAnalyzer.cs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"efe891af3b5c69c920798d1fb0c704d78c1c589a51d289af4398e06318e57002"}},{"ruleId":"D2","level":"warning","message":{"text":"ChangeCouplingAnalyzer.RustVariantsOf (cognitive 42): ChangeCouplingAnalyzer.RustVariantsOf has cognitive complexity 42 (threshold 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":"engine/src/CodeHealth.Dimensions.GitMining/ChangeCouplingAnalyzer.cs"},"region":{"startLine":4142}}}],"partialFingerprints":{"codehealthFindingId/v1":"959e3f4857162684ef707f5d45ba97aab91f460ab050b6841ca8293e8a376e0e"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_gitlab.discover (cognitive 42): corpus_gitlab.discover has cognitive complexity 42 (threshold 15). Drivers by points: if/else 12 (27 pts), boolean chains 12, loops 2 (3 pts) (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":"tools/multilang/corpus_gitlab.py"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"45c3bf3fa426ecc235e1fb3a02dc82e5d2c733dbd76ce61fff3433736834486c"}},{"ruleId":"D2","level":"warning","message":{"text":"report_detection_delta.validate (cognitive 42): report_detection_delta.validate has cognitive complexity 42 (threshold 15). Drivers by points: if/else 10 (23 pts), loops 5 (8 pts), boolean chains 7, ternaries 1 (4 pts) (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":"tools/train/report_detection_delta.py"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"d84471c5fffd6dcf4637097781309768f268eda02ed1835c1c527b278ccc3d2e"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 42): (anonymous) has cognitive complexity 42 (threshold 15). Drivers by points: if/else 24 (30 pts), boolean chains 7, ternaries 3, error handling 1, loops 1 (nesting depth added 6). Most of this is not in the body itself: 3 of the 42 points are its own statements and the rest belongs to 17 function items inside it that branch (wire::load, renderMd, wire, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Kennel.Ui/wwwroot/kennel-ui.js"},"region":{"startLine":1600}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6c6a965647aa7e585fec04e35580106df72b16ad81514f19d5cb51d13102000"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceClassifier.IsTestPath (cognitive 41): SourceClassifier.IsTestPath has cognitive complexity 41 (threshold 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":"engine/src/CodeHealth.Core/Classification/SourceClassifier.cs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"80d6289f2b15c94a59f91c0a1e96dd9e9cda2523237b6c012794b1ae7218694a"}},{"ruleId":"D2","level":"warning","message":{"text":"PolyglotConditionScanner.BlankNonCode (cognitive 41): PolyglotConditionScanner.BlankNonCode has cognitive complexity 41 (threshold 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":"engine/src/CodeHealth.Core/CodeShape/PolyglotConditionScanner.cs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"3734b006d4a7fb498c780dc6329545f41b1f7d17d03052c148f4a77349625a9f"}},{"ruleId":"D2","level":"warning","message":{"text":"QuotedTextMask.MaskStringLiteral (cognitive 41): QuotedTextMask.MaskStringLiteral has cognitive complexity 41 (threshold 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":"engine/src/CodeHealth.Core/CodeShape/QuotedTextMask.cs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"32414d8401288ed18067d32a01a449cb84bac126f8a6f68f9d0bb7e3dd27102b"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendEngineDimensions.DeadCodeDimension (cognitive 41): FrontendEngineDimensions.DeadCodeDimension has cognitive complexity 41 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendEngineDimensions.cs"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd4b4ca27cd84b12134e9303bf440e64562f5c9f7dcc59d63e678cbaf17adc94"}},{"ruleId":"D2","level":"warning","message":{"text":"JsDuplicationDetector.MergeNearCloneExtents (cognitive 41): JsDuplicationDetector.MergeNearCloneExtents has cognitive complexity 41 (threshold 15). Of this number, 39 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs"},"region":{"startLine":4099}}}],"partialFingerprints":{"codehealthFindingId/v1":"10b7c2b36849867a2a9d2d3793edd7018e7ef6589fac28485de0a37fde81a2e7"}},{"ruleId":"D2","level":"warning","message":{"text":"AccessibilityAnalyzer.CountIndentationTemplateTags (cognitive 41): AccessibilityAnalyzer.CountIndentationTemplateTags has cognitive complexity 41 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.TemplateLanguageBlindness.cs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fffcd128b41279e51d482e0bcea3425ee9e8d192ae369aaff604cb4f49cada6"}},{"ruleId":"D2","level":"warning","message":{"text":"ArchitectureModelAnalyzer.SliceCohesion (cognitive 41): ArchitectureModelAnalyzer.SliceCohesion has cognitive complexity 41 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/ArchitectureModelAnalyzer.cs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee28886ae137fe12d9da7562c49b80cb699b2695d3766987ccb2caae5790bce8"}},{"ruleId":"D2","level":"warning","message":{"text":"DomainModelAnalyzer.RepositoryPerAggregateRoot (cognitive 41): DomainModelAnalyzer.RepositoryPerAggregateRoot has cognitive complexity 41 (threshold 15). Of this number, 38 points are the body\u0027s own statements and 3 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs"},"region":{"startLine":4981}}}],"partialFingerprints":{"codehealthFindingId/v1":"a79fe1ab729aaa143c2003f2fe7745ebabe69a12a95a5197e53addc2150fa790"}},{"ruleId":"D2","level":"warning","message":{"text":"ReportViewModelFactory.BuildArchGraphCore (cognitive 41): ReportViewModelFactory.BuildArchGraphCore has cognitive complexity 41 (threshold 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":"engine/src/CodeHealth.Reporting/Templates/ReportViewModelFactory.cs"},"region":{"startLine":2506}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6ed34d423871fb90db99aa2bc6e4dd98137db69cc252abfb86790378c46da6c"}},{"ruleId":"D2","level":"warning","message":{"text":"IlMetricsExtractor.Extract (cognitive 41): IlMetricsExtractor.Extract has cognitive complexity 41 (threshold 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":"engine/src/CodeHealth.Dimensions.CodeQuality/Il/IlMetricsExtractor.cs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b2269d852d4a2f1a93223e88e7417a7da311e6d7c15c36b1cad5be9b33795a8"}},{"ruleId":"D2","level":"warning","message":{"text":"DeclaredDependencies.ParsePyProject (cognitive 41): DeclaredDependencies.ParsePyProject has cognitive complexity 41 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/DeclaredDependencies.cs"},"region":{"startLine":1933}}}],"partialFingerprints":{"codehealthFindingId/v1":"00410e76730a105dab34da1dab21bf1984c18cc3eb3117b8c3a677b35df41b73"}},{"ruleId":"D2","level":"warning","message":{"text":"ShellExecRecheck.RubyCallArguments (cognitive 41): ShellExecRecheck.RubyCallArguments has cognitive complexity 41 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/ShellExecRecheck.cs"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc900ca8b30f033b073b96e83d0ffcd0707b0bd16219fdc07c4def962d27eb2e"}},{"ruleId":"D2","level":"warning","message":{"text":"ChangeCouplingAnalyzer.RunAsync (cognitive 41): ChangeCouplingAnalyzer.RunAsync has cognitive complexity 41 (threshold 15). Of this number, 32 points are the body\u0027s own statements and 9 belong to 9 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":"engine/src/CodeHealth.Dimensions.GitMining/ChangeCouplingAnalyzer.cs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"aec9ad010ed9de6025a9440468fa204b319f461b69d291f725b8ccc2878c3f9d"}},{"ruleId":"D2","level":"warning","message":{"text":"branchWalker.stmtOpaque (cognitive 41): branchWalker.stmtOpaque has cognitive complexity 41 (threshold 15). Drivers by points: if/else 8 (22 pts), loops 7 (18 pts), match/switch 1 (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":"engine/sidecars/go/bodybranch.go"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"a604e338c559c06dfcaa719e8a71400f1a642cb2a0fa74fd9c596b69a0b1d6a8"}},{"ruleId":"D2","level":"warning","message":{"text":"codehealth_rust_sidecar::select_arms (cognitive 41): codehealth_rust_sidecar::select_arms has cognitive complexity 41 (threshold 15). Drivers by points: if/else 8 (18 pts), match/switch 5 (14 pts), loops 3 (6 pts), boolean chains 3 (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":"engine/sidecars/rust-frontend/src/main.rs"},"region":{"startLine":4385}}}],"partialFingerprints":{"codehealthFindingId/v1":"22a817f99532d2f8bab937afa92a28f1ca89a4ecfc37efda9cabba76d69b8058"}},{"ruleId":"D2","level":"warning","message":{"text":"ChainedFamilyRollup.Cluster (cognitive 40): ChainedFamilyRollup.Cluster has cognitive complexity 40 (threshold 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":"engine/src/CodeHealth.Core/CodeShape/ChainedFamilyRollup.cs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"799b138177dc1172b265e86242507caebf09f2ad05bf29cf17b42a330faaadd4"}},{"ruleId":"D2","level":"warning","message":{"text":"ComplianceSecurityAnalyzer.C2 (cognitive 40): ComplianceSecurityAnalyzer.C2 has cognitive complexity 40 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs"},"region":{"startLine":5123}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8ca3e34a2a9eaa1a033febcaf0a5e1d879d454907f96ee7cfd804802ba66217"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendManifestEntryPoints.CollectRegistryManifestFiles (cognitive 40): FrontendManifestEntryPoints.CollectRegistryManifestFiles has cognitive complexity 40 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendManifestEntryPoints.cs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"21fd6c8ad238aae66ce7f36d7683166f296cbae00c339378d1c8ff7ddfc4be5a"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendTestAndDocRefs.CollectTestIncludeGlobs (cognitive 40): FrontendTestAndDocRefs.CollectTestIncludeGlobs has cognitive complexity 40 (threshold 15). Of this number, 39 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/FrontendTestAndDocRefs.cs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"24722e08735c9c639fa4d2a9e9ef07bcba15590ed57643b252f256ac6e8b0fcd"}},{"ruleId":"D2","level":"warning","message":{"text":"IndentedMarkupProducer.TryParseTag (cognitive 40): IndentedMarkupProducer.TryParseTag has cognitive complexity 40 (threshold 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":"engine/src/CodeHealth.Core/Markup/IndentedMarkupProducer.cs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"919b3530582d1792457cd39642b63331355a64637475d84666b9c06dcdbe08bf"}},{"ruleId":"D2","level":"warning","message":{"text":"MarkupParser.Build (cognitive 40): MarkupParser.Build has cognitive complexity 40 (threshold 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":"engine/src/CodeHealth.Core/Markup/MarkupParser.cs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"b266ead36941a0e047afc9342e6e1f9f393983d8d7a94479348aafe3bdc2a49b"}},{"ruleId":"D2","level":"warning","message":{"text":"AccessibilityAnalyzer.TextAlternatives (cognitive 40): AccessibilityAnalyzer.TextAlternatives has cognitive complexity 40 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs"},"region":{"startLine":959}}}],"partialFingerprints":{"codehealthFindingId/v1":"08e889c319dbf994796c275caaf35572587c004aa18154d8f87cdd7338dd42b2"}},{"ruleId":"D2","level":"warning","message":{"text":"ProductionReadinessAnalyzer.DeploymentRollback (cognitive 40): ProductionReadinessAnalyzer.DeploymentRollback has cognitive complexity 40 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs"},"region":{"startLine":993}}}],"partialFingerprints":{"codehealthFindingId/v1":"92a72cf107ad8159dbd4a2a87a584eae5e7074cd4c6df7691cb0dd21ed87af35"}},{"ruleId":"D2","level":"warning","message":{"text":"RunLimitations.BuildFailures (cognitive 40): RunLimitations.BuildFailures has cognitive complexity 40 (threshold 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":"engine/src/CodeHealth.Reporting/Limitations/RunLimitations.cs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"8689a909366cf9cd14e8cdbce5f6bf95cf4757267f928a1c87f188cb89a58295"}},{"ruleId":"D2","level":"warning","message":{"text":"CloneSpanShape.Scrub (cognitive 40): CloneSpanShape.Scrub has cognitive complexity 40 (threshold 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":"engine/src/CodeHealth.Dimensions.CodeQuality/CodeShape/DuplicationAnalyzer.cs"},"region":{"startLine":4604}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e3a9d2542c42f60930b1460547b28cd8c85b17e6f5d1ab9053019dd3a858f3e"}},{"ruleId":"D2","level":"warning","message":{"text":"lint_hardcode.main (cognitive 40): lint_hardcode.main has cognitive complexity 40 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 6 (13 pts), boolean chains 3, error handling 1 (3 pts) (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":"tools/multilang/lint_hardcode.py"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d6ce24060de3d7b0b8f89cb65903e9206288a148d5115bb5079a4987c4e30ed"}},{"ruleId":"D2","level":"warning","message":{"text":"gold-draw.cmd_coverage (cognitive 40): gold-draw.cmd_coverage has cognitive complexity 40 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 5 (7 pts), ternaries 3 (7 pts), boolean chains 5, error handling 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/gold-draw.py"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"30c452df12f4cee4db372d14b92c4dbf53dc0e234a233905ff3a45fd1481c3fd"}},{"ruleId":"D2","level":"warning","message":{"text":"gold-draw.cmd_draw (cognitive 40): gold-draw.cmd_draw has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (23 pts), loops 7 (9 pts), boolean chains 5, ternaries 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/gold-draw.py"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"f631515419adf70d8dcee50942a63dbbcdac4c3aa9b359e70865d5d4658008ca"}},{"ruleId":"D2","level":"warning","message":{"text":"run-arms.main (cognitive 40): run-arms.main has cognitive complexity 40 (threshold 15). Drivers by points: if/else 8 (20 pts), ternaries 3 (11 pts), loops 4 (8 pts), boolean chains 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent 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":"tools/train/run-arms.py"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"103de01341c4e0f9b02f38a22bbdc604153641b00b1c905f4cd77aed873e4a3b"}},{"ruleId":"D2","level":"warning","message":{"text":"codehealth_rust_sidecar::var_prefixes (cognitive 40): codehealth_rust_sidecar::var_prefixes has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (32 pts), match/switch 2 (4 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 21). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/rust-frontend/src/main.rs"},"region":{"startLine":2765}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e2eb090c7d80f9165fbe6157f26cda0c67fed7e81179a839edb813e011a6125"}},{"ruleId":"D2","level":"warning","message":{"text":"QuotedTextMask.Mask (cognitive 39): QuotedTextMask.Mask has cognitive complexity 39 (threshold 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":"engine/src/CodeHealth.Core/CodeShape/QuotedTextMask.cs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f1a07f2d8b2744d5ca2f8b2744d759dcde7344226ad22fac6df0ddfe6ee76ea"}},{"ruleId":"D2","level":"warning","message":{"text":"RoslynExplicitDebtCollector.CollectAsync (cognitive 39): RoslynExplicitDebtCollector.CollectAsync has cognitive complexity 39 (threshold 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":"engine/src/CodeHealth.Core/ExplicitDebt/RoslynExplicitDebtCollector.cs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"30a92c6009c3f9a924914c5353e441e5bd90742764ea3a54719117cc83feca56"}},{"ruleId":"D2","level":"warning","message":{"text":"EntryPointCatalog.DetectFrameworkConventions (cognitive 39): EntryPointCatalog.DetectFrameworkConventions has cognitive complexity 39 (threshold 15). 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":"engine/src/CodeHealth.Core/Frontend/EntryPointCatalog.cs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfa35489db55237b807ecb2d759cb4137399324cf012a16cecd77f890d51ac18"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendConfigResolution.ParseTsConfigRaw (cognitive 39): FrontendConfigResolution.ParseTsConfigRaw has cognitive complexity 39 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendConfigResolution.cs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b0b44fd5337dc6af0a5049719f5574abbc44442070d7b492390049a3ab29c42"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendScriptCommandRefs.CollectToolCommandTokens (cognitive 39): FrontendScriptCommandRefs.CollectToolCommandTokens has cognitive complexity 39 (threshold 15). Of this number, 38 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/FrontendScriptCommandRefs.cs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7234296f8303336c1df39f195d104da94302ed6ce719cf18411fbeb65cd73e5"}},{"ruleId":"D2","level":"warning","message":{"text":"JsDuplicationDetector.Coalesce (cognitive 39): JsDuplicationDetector.Coalesce has cognitive complexity 39 (threshold 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":"engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs"},"region":{"startLine":6748}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9473bf1ab98bf58cb9101bbdd8ca4c6421ece57323d772c941f2a6e1a1dfab0"}},{"ruleId":"D2","level":"warning","message":{"text":"JsScopeBindings.BindDeclarators (cognitive 39): JsScopeBindings.BindDeclarators has cognitive complexity 39 (threshold 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":"engine/src/CodeHealth.Core/Frontend/JsScopeBindings.cs"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e490205d7643be961532d61c229cd5dc89d90f7c1aa9161a0c0749cfdb09b94"}},{"ruleId":"D2","level":"warning","message":{"text":"IndentedMarkupProducer.Read (cognitive 39): IndentedMarkupProducer.Read has cognitive complexity 39 (threshold 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":"engine/src/CodeHealth.Core/Markup/IndentedMarkupProducer.cs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"809aaa6c4ef4efa65da7855f742251b3905cb7adf9ce798a767f8bf8b81ba94e"}},{"ruleId":"D2","level":"warning","message":{"text":"JsTestQualityCensus.Collect (cognitive 39): JsTestQualityCensus.Collect has cognitive complexity 39 (threshold 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":"engine/src/CodeHealth.Core/Testing/JsTestQualityCensus.cs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"381488266f481999d6c992ea131e472d3a88993bc2af09a94b7a9d62b5d2e812"}},{"ruleId":"D2","level":"warning","message":{"text":"FileExtractor.classLike (cognitive 39): FileExtractor.classLike has cognitive complexity 39 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 6 (13 pts), boolean chains 9, ternaries 3 (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":"engine/sidecars/php-frontend/main.php"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"7869fc83670f0c7e87606d994f4c5a25a90eb87d21cb390305ed434308ce727e"}},{"ruleId":"D2","level":"warning","message":{"text":"SwiftPackageHygiene.Read (cognitive 38): SwiftPackageHygiene.Read has cognitive complexity 38 (threshold 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":"engine/src/CodeHealth.Core/Dependencies/SwiftPackageHygiene.cs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c6221f7e891efd2a75d0f81681ba6dd009514296f7cb8b7c4c894cbdd2d5620"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendBoundaries.SliceComponents (cognitive 38): FrontendBoundaries.SliceComponents has cognitive complexity 38 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendBoundaries.cs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cf1ca96a4be1d3dccadf19be577a25a1340ce508d5b247204ca50e6a34af196"}},{"ruleId":"D2","level":"warning","message":{"text":"JsFunctionScanner.IsClassHeaderClose (cognitive 38): JsFunctionScanner.IsClassHeaderClose has cognitive complexity 38 (threshold 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":"engine/src/CodeHealth.Core/Frontend/JsFunctionScanner.cs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"48fc1272693fe9b4edb306dbec49ec97015a1e65ab64e9b652003bc0b5034122"}},{"ruleId":"D2","level":"warning","message":{"text":"NeutralScatteredDerivation.Find (cognitive 38): NeutralScatteredDerivation.Find has cognitive complexity 38 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/NeutralScatteredDerivation.cs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"b420ac454b6456fed9b7e4f5b2e2ce2bb2d5069ed12e63cc33f4b1b848551ca7"}},{"ruleId":"D2","level":"warning","message":{"text":"DeterminismGuard.Evaluate (cognitive 38): DeterminismGuard.Evaluate has cognitive complexity 38 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/RuntimeAccessibility/DeterminismGuard.cs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf775e1abed78c870988102ae9eb745e66a55011cefc8770559fd13ffcf8db8f"}},{"ruleId":"D2","level":"warning","message":{"text":"DiskSourceFiles.WeighUnreadLanguagesAsync (cognitive 38): DiskSourceFiles.WeighUnreadLanguagesAsync has cognitive complexity 38 (threshold 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":"engine/src/CodeHealth.Core/Scoring/DiskSourceFiles.cs"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d7383730c67e45fe9c598b80cffc564c70dd63c4482589fc1cf91d4acfcd5b6"}},{"ruleId":"D2","level":"warning","message":{"text":"SecretNoiseFilter.IsNoisyPath (cognitive 38): SecretNoiseFilter.IsNoisyPath has cognitive complexity 38 (threshold 15). 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/SecretNoiseFilter.cs"},"region":{"startLine":3867}}}],"partialFingerprints":{"codehealthFindingId/v1":"8101c161efad7183fa11c7133107c978213567db21df6553ed615c4fd683f59e"}},{"ruleId":"D2","level":"warning","message":{"text":"CSharpTokenizer.ReadStringLiteral (cognitive 38): CSharpTokenizer.ReadStringLiteral has cognitive complexity 38 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/SqlBuilderCompositionWalk.cs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ac329c5f2b05e8b9265d145407dffb9fc2c5b83abe754560b3749bc90cb11e0"}},{"ruleId":"D2","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.PushTriggerFilters (cognitive 38): SupplyChainProvenanceAnalyzer.PushTriggerFilters has cognitive complexity 38 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":7233}}}],"partialFingerprints":{"codehealthFindingId/v1":"35bb24ca22a14d32d66a866435ef1c6a31879e5ce0b862dfedfc45a6dbd177a1"}},{"ruleId":"D2","level":"warning","message":{"text":"judge-calibration.cmd_extract (cognitive 38): judge-calibration.cmd_extract has cognitive complexity 38 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 4 (9 pts), boolean chains 8, ternaries 2 (8 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":"tools/train/judge-calibration.py"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe8908d53a22bb5b0563594d4215ce65acd75c9e0cbe6480449e2ac311b0b49c"}},{"ruleId":"D2","level":"warning","message":{"text":"RoslynDuplicationDetector.AppendCopiedFileClones (cognitive 37): RoslynDuplicationDetector.AppendCopiedFileClones has cognitive complexity 37 (threshold 15). Of this number, 36 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":"engine/src/CodeHealth.Core/CodeShape/RoslynDuplicationDetector.cs"},"region":{"startLine":1324}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0c16da8fe0b47c454f34d819fe5bfe0397c27723138a916c4f1fa00c9d61970"}},{"ruleId":"D2","level":"warning","message":{"text":"VbGodClassScanner.ScanAsync (cognitive 37): VbGodClassScanner.ScanAsync has cognitive complexity 37 (threshold 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":"engine/src/CodeHealth.Core/CodeShape/VbGodClassScanner.cs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"4612253a262a52fc588fd10484ed9c6f338c9a63956584d8373ddada59ef3e85"}},{"ruleId":"D2","level":"warning","message":{"text":"ComplianceSecurityAnalyzer.DetectSerializedSecretLogging (cognitive 37): ComplianceSecurityAnalyzer.DetectSerializedSecretLogging has cognitive complexity 37 (threshold 15). 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":"engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs"},"region":{"startLine":1610}}}],"partialFingerprints":{"codehealthFindingId/v1":"89387b3d370aa98a68ea058c8710ae6ad6ebb7fa34403be288f7203786eca9e3"}},{"ruleId":"D2","level":"warning","message":{"text":"InactivePreprocessorReferenceScanner.CollectAsync (cognitive 37): InactivePreprocessorReferenceScanner.CollectAsync has cognitive complexity 37 (threshold 15). 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":"engine/src/CodeHealth.Core/ExplicitDebt/InactivePreprocessorReferenceScanner.cs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ed91144ab526ab9bf447a350930a89e27e844e1e621cac00ca5ecd31b8a99a8"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendBoundaries.CollectFsdViolations (cognitive 37): FrontendBoundaries.CollectFsdViolations has cognitive complexity 37 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendBoundaries.cs"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"a20cf1b058b374f1c8e4198baa4ceccffa274ab2e1148e0f61a575ad014f77cf"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendBoundaries.CollectTestTreeCrossPackageViolations (cognitive 37): FrontendBoundaries.CollectTestTreeCrossPackageViolations has cognitive complexity 37 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendBoundaries.cs"},"region":{"startLine":1401}}}],"partialFingerprints":{"codehealthFindingId/v1":"3170e978182b8ff898e4ecc2be5574163eda71f4aec46212062973f27538d55d"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendEmittedTemplateRefs.CollectGeneratedModuleEmitters (cognitive 37): FrontendEmittedTemplateRefs.CollectGeneratedModuleEmitters has cognitive complexity 37 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/FrontendEmittedTemplateRefs.cs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"19e0da1e7a2e8c496bf4ddb98709d6ad1837a2f388960aee326c20ceb26837a2"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendEngineDimensions.CloneRemediation (cognitive 37): FrontendEngineDimensions.CloneRemediation has cognitive complexity 37 (threshold 15). Of this number, 35 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/FrontendEngineDimensions.cs"},"region":{"startLine":1477}}}],"partialFingerprints":{"codehealthFindingId/v1":"cff5a12befff599466c7bddd5b37106bd75e022d6a350710f2dec5a88aa29dcd"}},{"ruleId":"D2","level":"warning","message":{"text":"JsDuplicationDetector.BuildImportMask (cognitive 37): JsDuplicationDetector.BuildImportMask has cognitive complexity 37 (threshold 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":"engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs"},"region":{"startLine":6932}}}],"partialFingerprints":{"codehealthFindingId/v1":"edc08218c05b71e6eff149b5792f21b183c22d6473ef262732ad74fae256754b"}},{"ruleId":"D2","level":"warning","message":{"text":"JsFunctionScanner.ScanMember (cognitive 37): JsFunctionScanner.ScanMember has cognitive complexity 37 (threshold 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":"engine/src/CodeHealth.Core/Frontend/JsFunctionScanner.cs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3f79ccac3b7a9aa5f5cb3c545b4211dc813d0744bf244a2b520f3f496e0cd17"}},{"ruleId":"D2","level":"warning","message":{"text":"DomainConventions.ClassifyHandler (cognitive 37): DomainConventions.ClassifyHandler has cognitive complexity 37 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/DomainConventions.cs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"edefd916b1500905f417e6f019843e8dd2f44e156258319b1c527835973a70c2"}},{"ruleId":"D2","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.NpmWorkspacePatterns (cognitive 37): SupplyChainProvenanceAnalyzer.NpmWorkspacePatterns has cognitive complexity 37 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":4107}}}],"partialFingerprints":{"codehealthFindingId/v1":"327991f750f1570a9a1b8984834c6a8490796f686c0cca5d942930e330bf921e"}},{"ruleId":"D2","level":"warning","message":{"text":"status.main (cognitive 37): status.main has cognitive complexity 37 (threshold 15). Drivers by points: if/else 15 (23 pts), loops 6 (7 pts), boolean chains 5, ternaries 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/llm-bakeoff/status.py"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa18b7e89799576bc78e48afff54a86fe9cda1388b07e8ef7712cc33d8b2ef69"}},{"ruleId":"D2","level":"warning","message":{"text":"scan.run_contained (cognitive 37): scan.run_contained has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (19 pts), ternaries 4 (14 pts), boolean chains 4 (nesting depth added 17). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/multilang/scan.py"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e554166254e8d2cac682b734ff5c208044f3fff2b8b05531a033e18dcc78dc1"}},{"ruleId":"D2","level":"warning","message":{"text":"main.Scan (cognitive 37): main.Scan has cognitive complexity 37 (threshold 15). Drivers by points: if/else 16 (32 pts), loops 4 (5 pts) (nesting depth added 17). Most of this is not in the body itself: 11 of the 37 points are its own statements and the rest belongs to one function literal inside it that branches (line 50). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/go/scan.go"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e509095132b77b3632aaca7182aaba5d5c96fa7a3fe464778ff860efe8bddd8"}},{"ruleId":"D2","level":"warning","message":{"text":"NeutralFileLengthScanner.LiteralFreeSkeleton (cognitive 36): NeutralFileLengthScanner.LiteralFreeSkeleton has cognitive complexity 36 (threshold 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":"engine/src/CodeHealth.Core/CodeShape/NeutralFileLengthScanner.cs"},"region":{"startLine":1075}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f83cda34045257c5a488063c004f7111d1215990cbd5543ba1ea08f6ed7fc54"}},{"ruleId":"D2","level":"warning","message":{"text":"CyclomaticComplexityCalculator.AddModelMethods (cognitive 36): CyclomaticComplexityCalculator.AddModelMethods has cognitive complexity 36 (threshold 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":"engine/src/CodeHealth.Core/Complexity/CyclomaticComplexityCalculator.cs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d51ae092b45e1da1e1890d2e6c6c93deee03ec27a39f084ce3649f445c66f42"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendTestReachability.ForeignBrowserSuiteReached (cognitive 36): FrontendTestReachability.ForeignBrowserSuiteReached has cognitive complexity 36 (threshold 15). Of this number, 35 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":"engine/src/CodeHealth.Core/Frontend/FrontendTestReachability.cs"},"region":{"startLine":1945}}}],"partialFingerprints":{"codehealthFindingId/v1":"c93f66ba803797a013736a4c0551718d16790ee4c92c56cd6ef14bdca208bd05"}},{"ruleId":"D2","level":"warning","message":{"text":"AccessibilityAnalyzer.PageLevelChecks (cognitive 36): AccessibilityAnalyzer.PageLevelChecks has cognitive complexity 36 (threshold 15). Of this number, 31 points are the body\u0027s own statements and 5 belong to 4 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs"},"region":{"startLine":2971}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f867e4afb6c5369debdeddcc1cde9deef5c70c5ba022bb532684eb1d3710b9d"}},{"ruleId":"D2","level":"warning","message":{"text":"CoherenceSmellAnalyzer.ScanSubsumedOperands (cognitive 36): CoherenceSmellAnalyzer.ScanSubsumedOperands has cognitive complexity 36 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/CoherenceSmellAnalyzer.cs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"1451fc72178bb5e5641073a84447ebd8c58f70601e885d722b037564f53cb8a8"}},{"ruleId":"D2","level":"warning","message":{"text":"PerformanceAnalyzer.CollectAsync (cognitive 36): PerformanceAnalyzer.CollectAsync has cognitive complexity 36 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/PerformanceAnalyzer.cs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"f13907487e5a1015e6b9c85e87818701e22c78a78f0fe8529ede46ebf5525882"}},{"ruleId":"D2","level":"warning","message":{"text":"DiskTestScanner.VbaTestSourceExtensions (cognitive 36): DiskTestScanner.VbaTestSourceExtensions has cognitive complexity 36 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Testing/DiskTestScanner.cs"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"8617621bfad33c7cf7548e05289cdaf6c9d2286bbab40383f4d41611331ba780"}},{"ruleId":"D2","level":"warning","message":{"text":"DuplicationAnalyzer.GuardAsymmetryCaveat (cognitive 36): DuplicationAnalyzer.GuardAsymmetryCaveat has cognitive complexity 36 (threshold 15). Of this number, 35 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":"engine/src/CodeHealth.Dimensions.CodeQuality/CodeShape/DuplicationAnalyzer.cs"},"region":{"startLine":2847}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec36423133b5e963d283cb5e5606cf0e13decb5da2f3035d1261c0da0e03d9d6"}},{"ruleId":"D2","level":"warning","message":{"text":"ConfigCredentialBindingScan.FindingsInFile (cognitive 36): ConfigCredentialBindingScan.FindingsInFile has cognitive complexity 36 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/ConfigCredentialBindingScan.cs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"39b28e2bb67e6b8b60d2bb9ef5aae5fa21311a4b8dfd493a6b71effb62fcd3d1"}},{"ruleId":"D2","level":"warning","message":{"text":"NpmLockGraph.NpmLockGraph.ctor (cognitive 36): NpmLockGraph.NpmLockGraph.ctor has cognitive complexity 36 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/NpmLockGraph.cs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfbc98d2538022d0736e0ec4fe8c0e7d8c678e20e69d8816b64480657f1c76ab"}},{"ruleId":"D2","level":"warning","message":{"text":"UnverifiedRemoteInstallerScan.FetchesDigestFromAnArtefactOrigin (cognitive 36): UnverifiedRemoteInstallerScan.FetchesDigestFromAnArtefactOrigin has cognitive complexity 36 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/UnverifiedRemoteInstallerScan.cs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"55e1ffaa05b51d14e1ce39020ec7bbc0f7b767abfbbedce45f528b56e72e9df7"}},{"ruleId":"D2","level":"warning","message":{"text":"ModelBuilder.WireTypes (cognitive 36): ModelBuilder.WireTypes has cognitive complexity 36 (threshold 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":"engine/src/CodeHealth.CodeModel.Jvm/Builder.cs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"088ab9536418b0500f2cad3c3ac0315bdcb54523b4ac66915239ddf156a21f87"}},{"ruleId":"D2","level":"warning","message":{"text":"ModelBuilder.WrapEntity (cognitive 36): ModelBuilder.WrapEntity has cognitive complexity 36 (threshold 15). Drivers by points: if/else 14 (20 pts), error handling 5 (10 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 12). 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":"engine/src/CodeHealth.CodeModel.FSharp/Builder.fs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e0e11e116f22646bee93d763604659eca2a2a63d4a0b587ec7fefe91d41ce34"}},{"ruleId":"D2","level":"warning","message":{"text":"verify-documentation-paths.main (cognitive 36): verify-documentation-paths.main has cognitive complexity 36 (threshold 15). Drivers by points: if/else 13 (24 pts), loops 4 (5 pts), ternaries 2 (4 pts), boolean chains 3 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deploy/verify-documentation-paths.py"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0e09eac64d4f68f9a64c853784732915b88b8ba03ce5846cb35d1ca0bf7ff45"}},{"ruleId":"D2","level":"warning","message":{"text":"rehearse_verification.main (cognitive 36): rehearse_verification.main has cognitive complexity 36 (threshold 15). Drivers by points: if/else 20 (24 pts), boolean chains 8, loops 2 (3 pts), ternaries 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"tools/train/rehearse_verification.py"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a226eec904ecf4cf7b625941bfa090cac94998d1376c586feeac058f70566b6"}},{"ruleId":"D2","level":"warning","message":{"text":"reuse-safety.main (cognitive 36): reuse-safety.main has cognitive complexity 36 (threshold 15). Drivers by points: if/else 6 (17 pts), ternaries 4 (12 pts), loops 4 (7 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":"tools/train/reuse-safety.py"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c1ed8701b6d4e409132ce6fa115b135a3f35e352c5b2759f4cb55225a9e8b00"}},{"ruleId":"D2","level":"warning","message":{"text":"extract-file.extractFile (cognitive 36): extract-file.extractFile has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12, boolean chains 11, ternaries 5 (9 pts), loops 2 (4 pts) (nesting depth added 6). Most of this is not in the body itself: 9 of the 36 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 492, 502, 447, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/tsjs-frontend/extract-file.mjs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"23e4ed74c26309a0a5915e0b931501b5c40832b18fc9da0125afd737c983690d"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::lcApply (cognitive 36): (anonymous)::lcApply has cognitive complexity 36 (threshold 15). Drivers by points: if/else 8 (15 pts), ternaries 5 (12 pts), boolean chains 9 (nesting depth added 14). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Kennel.Ui/wwwroot/kennel-ui.js"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"cff8a2fac8eb25428c11ffc88ffe0f166e8b31fe06aaa9af39610481dcd29e15"}},{"ruleId":"D2","level":"warning","message":{"text":"LineBasedGodClassDetector.ContractRepeatedMemberSurplus (cognitive 35): LineBasedGodClassDetector.ContractRepeatedMemberSurplus has cognitive complexity 35 (threshold 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":"engine/src/CodeHealth.Core/CodeShape/LineBasedGodClassDetector.cs"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"994d0d2b00662b8713bbffad07a99a71162d00838662d6ac0421cdefd4a72ea2"}},{"ruleId":"D2","level":"warning","message":{"text":"EntryPointCatalog.DetectTests (cognitive 35): EntryPointCatalog.DetectTests has cognitive complexity 35 (threshold 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":"engine/src/CodeHealth.Core/Frontend/EntryPointCatalog.cs"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"37b1331f2f7f726c2bef067b7dd3c4d1b02cd8890d30d7078ae441a55f3139f7"}},{"ruleId":"D2","level":"warning","message":{"text":"ExportUsageSolver.SeedDirectImports (cognitive 35): ExportUsageSolver.SeedDirectImports has cognitive complexity 35 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendDeadCode.cs"},"region":{"startLine":2016}}}],"partialFingerprints":{"codehealthFindingId/v1":"e705355e6d533d484b16bab530a3e29df9e283657ea02e2f28652dc122a8c5b7"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendEmittedTemplateRefs.ResolveEmittedTemplateFamilyAgainst (cognitive 35): FrontendEmittedTemplateRefs.ResolveEmittedTemplateFamilyAgainst has cognitive complexity 35 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendEmittedTemplateRefs.cs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"054b9c92e8efef8f7aa90b6dc24292782e6b59a7d6d0a5b796c626253ff77923"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendScriptCommandRefs.CollectLockfileBinNames (cognitive 35): FrontendScriptCommandRefs.CollectLockfileBinNames has cognitive complexity 35 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendScriptCommandRefs.cs"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"b14733e9a70f83df316aa2685f1f59486f45c7fe9643f81595e06756feb21f64"}},{"ruleId":"D2","level":"warning","message":{"text":"JsConstantOnlyField.IsExported (cognitive 35): JsConstantOnlyField.IsExported has cognitive complexity 35 (threshold 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":"engine/src/CodeHealth.Core/Frontend/JsConstantOnlyField.cs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dc6004ecb6592fd182287f54b659cfb4d2a8090a4e2a6dbac95cefc8b83997c"}},{"ruleId":"D2","level":"warning","message":{"text":"JsScopeBindings.FunctionBodyParams (cognitive 35): JsScopeBindings.FunctionBodyParams has cognitive complexity 35 (threshold 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":"engine/src/CodeHealth.Core/Frontend/JsScopeBindings.cs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"6137202a460f03889233cd5aa309d269791e247c3aaef6ebc6b78837dd2316ca"}},{"ruleId":"D2","level":"warning","message":{"text":"LogicDefectAnalyzer.InspectDisposalDuties (cognitive 35): LogicDefectAnalyzer.InspectDisposalDuties has cognitive complexity 35 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/LogicDefectAnalyzer.cs"},"region":{"startLine":1165}}}],"partialFingerprints":{"codehealthFindingId/v1":"baf49c442da397ce60f899933b01a30170766e846969dbd2cae0ed57cff5ac79"}},{"ruleId":"D2","level":"warning","message":{"text":"DartAnalyzerExclusions.Inspect (cognitive 35): DartAnalyzerExclusions.Inspect has cognitive complexity 35 (threshold 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":"engine/src/CodeHealth.Core/Readiness/DartAnalyzerExclusions.cs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d7d8eb73241bf952f16685c5293a3f7fbe491c6e2d4fd44664646deb3970e5a"}},{"ruleId":"D2","level":"warning","message":{"text":"ProductionReadinessAnalyzer.ReleaseHygiene (cognitive 35): ProductionReadinessAnalyzer.ReleaseHygiene has cognitive complexity 35 (threshold 15). 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":"engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs"},"region":{"startLine":2546}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bf4ebf8fc8d65a5b679996327a3c803f7750300578362cd49cc141a50169def"}},{"ruleId":"D2","level":"warning","message":{"text":"CommittedCoverageReader.MergeSimpleCovJsonPerFile (cognitive 35): CommittedCoverageReader.MergeSimpleCovJsonPerFile has cognitive complexity 35 (threshold 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":"engine/src/CodeHealth.Core/Testing/CommittedCoverageReader.cs"},"region":{"startLine":1299}}}],"partialFingerprints":{"codehealthFindingId/v1":"855c97a80e64a0eb1d9c98d46f85987c4711c55b17045d6f215a9e5b0e598347"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeTestReliabilityCollector.ParseJestShaped (cognitive 35): NodeTestReliabilityCollector.ParseJestShaped has cognitive complexity 35 (threshold 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":"engine/src/CodeHealth.Core/Testing/NodeTestReliabilityCollector.cs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5100bd704bbbb06f66b717d20d58ac328939be8b74278812ae332b5c4f95a59"}},{"ruleId":"D2","level":"warning","message":{"text":"CommitIdentityGraph.Build (cognitive 35): CommitIdentityGraph.Build has cognitive complexity 35 (threshold 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":"engine/src/CodeHealth.Toolchain/Git/CommitIdentityGraph.cs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"67f4b1158aae3406639735e6868f832aefff8db95ec50afc54cbafb1ab1b13d5"}},{"ruleId":"D2","level":"warning","message":{"text":"ChangelogNarrator.DescribeAsync (cognitive 35): ChangelogNarrator.DescribeAsync has cognitive complexity 35 (threshold 15). Of this number, 34 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":"engine/src/CodeHealth.Reporting/Changelog/ChangelogNarrator.cs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ca7940b89cdc3037b1a462c840e94a6d6578cfbdee5838576ee52633f8bc3a1"}},{"ruleId":"D2","level":"warning","message":{"text":"DuplicationAnalyzer.ExtractionCaveat (cognitive 35): DuplicationAnalyzer.ExtractionCaveat has cognitive complexity 35 (threshold 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":"engine/src/CodeHealth.Dimensions.CodeQuality/CodeShape/DuplicationAnalyzer.cs"},"region":{"startLine":3533}}}],"partialFingerprints":{"codehealthFindingId/v1":"c024d4c86e7b3bffe24f765c453af456253e33b9a6e36f4544f12d7654b3636d"}},{"ruleId":"D2","level":"warning","message":{"text":"SecretNoiseFilter.IsChecksumLiteralElementBinding (cognitive 35): SecretNoiseFilter.IsChecksumLiteralElementBinding has cognitive complexity 35 (threshold 15). Of this number, 33 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/SecretNoiseFilter.cs"},"region":{"startLine":1133}}}],"partialFingerprints":{"codehealthFindingId/v1":"352e3988b09e016865e27617f1c6abf4a6f7c2a84d9e0c67882af87c608a011b"}},{"ruleId":"D2","level":"warning","message":{"text":"UnverifiedRemoteInstallerScan.ExtractedAndExecuted (cognitive 35): UnverifiedRemoteInstallerScan.ExtractedAndExecuted has cognitive complexity 35 (threshold 15). Of this number, 34 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/UnverifiedRemoteInstallerScan.cs"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"de4348d12792aebff544c6766b1e54053407d5d3ff2228b2bc8800bb48b5aa45"}},{"ruleId":"D2","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.ReleaseAssetUploadJobsText (cognitive 35): SupplyChainProvenanceAnalyzer.ReleaseAssetUploadJobsText has cognitive complexity 35 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":5516}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a75f55a49fd46d517ee6de8462d87dfe0e8ddf8b629068e9f4c27b88e7de2c2"}},{"ruleId":"D2","level":"warning","message":{"text":"ChangeCouplingAnalyzer.BuildBasenameIndex (cognitive 35): ChangeCouplingAnalyzer.BuildBasenameIndex has cognitive complexity 35 (threshold 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":"engine/src/CodeHealth.Dimensions.GitMining/ChangeCouplingAnalyzer.cs"},"region":{"startLine":3931}}}],"partialFingerprints":{"codehealthFindingId/v1":"c44182774f663412f3a59fd8e81bc9fa54c321e893e3ef3b58b68d21e72fb7c9"}},{"ruleId":"D2","level":"warning","message":{"text":"CodebaseDetail.razor \u203A OnParametersSetAsync (cognitive 35): CodebaseDetail.razor \u203A OnParametersSetAsync has cognitive complexity 35 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Kennel.Assay.Core/DecisionReports/Ui/CodebaseDetail.razor"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfe9a1c8579dfe60ecb04c8efec3c6bb7c74394c289c6aff16d238160522e71d"}},{"ruleId":"D2","level":"warning","message":{"text":"build_dimension_noise.load_language (cognitive 35): build_dimension_noise.load_language has cognitive complexity 35 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 4 (8 pts), ternaries 3 (7 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":"tools/depthnoise/build_dimension_noise.py"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"dea14bf7d7db921331af16eaa958259743b2c47c424a3c95812ccbcf0d1892bf"}},{"ruleId":"D2","level":"warning","message":{"text":"bench.main (cognitive 35): bench.main has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14 (22 pts), error handling 2 (5 pts), boolean chains 3, loops 2 (3 pts), ternaries 1 (2 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":"tools/qwen-eval/bench.py"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"d02dcf0833b391d928e5bdf9d7a899a8be99261294a78bab84d29484f29aae62"}},{"ruleId":"D2","level":"warning","message":{"text":"BranchWalker.node (cognitive 35): BranchWalker.node has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (21 pts), loops 6 (12 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/php-frontend/body.php"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"958fd21bf23db767e8da2d571a477dae1053ae26ae7367a14e9bd10bf1d7c606"}},{"ruleId":"D2","level":"warning","message":{"text":"ComplianceSecurityAnalyzer.ScanSubstring (cognitive 34): ComplianceSecurityAnalyzer.ScanSubstring has cognitive complexity 34 (threshold 15). 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":"engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fe9708cedce165c7fdf67ca0671cd59c841561ced8ac3e031222a005fa9faed"}},{"ruleId":"D2","level":"warning","message":{"text":"ComplianceSecurityAnalyzer.ResolveDeclaredTypeName (cognitive 34): ComplianceSecurityAnalyzer.ResolveDeclaredTypeName has cognitive complexity 34 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 8 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs"},"region":{"startLine":1964}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7ae19083fde45726570e214bb0ee5c66ceafa226c91c0bf27b22cdb763d4251"}},{"ruleId":"D2","level":"warning","message":{"text":"UpstreamAttribution.DeclaredThirdPartySubtrees (cognitive 34): UpstreamAttribution.DeclaredThirdPartySubtrees has cognitive complexity 34 (threshold 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":"engine/src/CodeHealth.Core/FileQuality/UpstreamAttribution.cs"},"region":{"startLine":1059}}}],"partialFingerprints":{"codehealthFindingId/v1":"5254e29ac961fd7ccf69eea6b865f980eea65fe9e72e4c2de8df5dfc3c96bf12"}},{"ruleId":"D2","level":"warning","message":{"text":"EggMiddlewareNameRefs.StripComments (cognitive 34): EggMiddlewareNameRefs.StripComments has cognitive complexity 34 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/EggMiddlewareNameRefs.cs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"91e20359debe8405839e56ddcd2c8995cd6c023d2efccb93ea74d3cae5eb0a4d"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendBundlerConfigRefs.CollectFrameworkCliEntries (cognitive 34): FrontendBundlerConfigRefs.CollectFrameworkCliEntries has cognitive complexity 34 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendBundlerConfigRefs.cs"},"region":{"startLine":1281}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf1b5fafb32efe8bd040c5b7a27a86cb81e1313e7065585a732538dc1c63943b"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendEmittedTemplateRefs.ResolveEmittedTemplateDirectory (cognitive 34): FrontendEmittedTemplateRefs.ResolveEmittedTemplateDirectory has cognitive complexity 34 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendEmittedTemplateRefs.cs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b690b333a9f6c731e3e5e96230cb5c3da9fb6171a92612a756eb06ef716d286"}},{"ruleId":"D2","level":"warning","message":{"text":"JsScopeBindings.BindPattern (cognitive 34): JsScopeBindings.BindPattern has cognitive complexity 34 (threshold 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":"engine/src/CodeHealth.Core/Frontend/JsScopeBindings.cs"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"352660e9245cb89b467a8014370362d06af5a1dbc36596892ca3b67c7b2d0cc9"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleSyntaxScanner.CollectCommentTypeImports (cognitive 34): ModuleSyntaxScanner.CollectCommentTypeImports has cognitive complexity 34 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/ModuleSyntaxScanner.cs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"0274caebcfc58d04c24f9892b48b9a6d6ddefd17796aea1487ec96ea166cb992"}},{"ruleId":"D2","level":"warning","message":{"text":"IncompletenessAnalyzer.RedundantReturnGuardRuns (cognitive 34): IncompletenessAnalyzer.RedundantReturnGuardRuns has cognitive complexity 34 (threshold 15). Of this number, 32 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/IncompletenessAnalyzer.cs"},"region":{"startLine":4011}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c07eaa95a3b88bbed27689079468833e3be47a2252d32065076a599095b448d"}},{"ruleId":"D2","level":"warning","message":{"text":"ScatteredDecision.Find (cognitive 34): ScatteredDecision.Find has cognitive complexity 34 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/ScatteredDecision.cs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a3297a2451ad5428399d7d83753af2e18a251f655188c58535453e7a54b8e36"}},{"ruleId":"D2","level":"warning","message":{"text":"ProductionReadinessAnalyzer.HasDataVolumeMount (cognitive 34): ProductionReadinessAnalyzer.HasDataVolumeMount has cognitive complexity 34 (threshold 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":"engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs"},"region":{"startLine":2334}}}],"partialFingerprints":{"codehealthFindingId/v1":"1676b9a1248fa247fcf433d0b5364045642cf25e0312f9f946588499541bcf24"}},{"ruleId":"D2","level":"warning","message":{"text":"GitDiffShapes.ParseAsync (cognitive 34): GitDiffShapes.ParseAsync has cognitive complexity 34 (threshold 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":"engine/src/CodeHealth.Toolchain/Git/GitDiffShapes.cs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"3429e731a8b304e3abcc8691e088e72fe498e1e498c385a41ff3b619e2d365a6"}},{"ruleId":"D2","level":"warning","message":{"text":"ComposeMutableServiceImageScan.Services (cognitive 34): ComposeMutableServiceImageScan.Services has cognitive complexity 34 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/ComposeMutableServiceImageScan.cs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"93af26dc489c94f9067f0cda288735496dff974bd2403a7ac1456e1d12ee1aa9"}},{"ruleId":"D2","level":"warning","message":{"text":"DockerfileShapeRuleFilter.EveryPackageStepMountsTheCache (cognitive 34): DockerfileShapeRuleFilter.EveryPackageStepMountsTheCache has cognitive complexity 34 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/DockerfileShapeRuleFilter.cs"},"region":{"startLine":1172}}}],"partialFingerprints":{"codehealthFindingId/v1":"695657417685e37ac71c2b84d417abef87983b2257e6dcd39d6729f9c058636e"}},{"ruleId":"D2","level":"warning","message":{"text":"UnverifiedRemoteInstallerScan.OutputPath (cognitive 34): UnverifiedRemoteInstallerScan.OutputPath has cognitive complexity 34 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/UnverifiedRemoteInstallerScan.cs"},"region":{"startLine":1228}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1ab99d9412fc9e43147390c97c45c1eda5f27cdc9391deef8c795ff38de1dd2"}},{"ruleId":"D2","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.FunctionKeepsPositionalInProcess (cognitive 34): SupplyChainProvenanceAnalyzer.FunctionKeepsPositionalInProcess has cognitive complexity 34 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":9719}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6df5db5f1b0b6540ec04e9bc3902ebc19a40ccdd6820762f96b3af5273a88fc"}},{"ruleId":"D2","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.WorkflowTriggerBranches (cognitive 34): SupplyChainProvenanceAnalyzer.WorkflowTriggerBranches has cognitive complexity 34 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":10706}}}],"partialFingerprints":{"codehealthFindingId/v1":"241f5d147d150e37c3c401a4529342dc3897fe9290ef829d5d677916f29c8168"}},{"ruleId":"D2","level":"warning","message":{"text":"judge-routing.selection (cognitive 34): judge-routing.selection has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 3 (7 pts), boolean chains 2, error handling 1 (2 pts) (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":"tools/train/judge-routing.py"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"209e316ea2d4c0dc509053a8cafba0b176db70a6572ebc183933a4a937aa48d8"}},{"ruleId":"D2","level":"warning","message":{"text":"BodyFacts.node (cognitive 34): BodyFacts.node has cognitive complexity 34 (threshold 15). Drivers by points: boolean chains 17, if/else 8 (13 pts), loops 2 (4 pts) (nesting depth added 7). 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":"engine/sidecars/php-frontend/body.php"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"c72808447b1dc51c02bf3cfb846de8015eb8e3dfc1bcd4fa96308c08b0aa389f"}},{"ruleId":"D2","level":"warning","message":{"text":"body.tokenizeBody (cognitive 34): body.tokenizeBody has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 6, ternaries 1 (3 pts), match/switch 1 (2 pts), 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":"engine/sidecars/php-frontend/body.php"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"002efd6bd39dfb17f850657a17d3cc5133b75af2ec81c0423074c5214178fb08"}},{"ruleId":"D2","level":"warning","message":{"text":"RoslynDuplicationDetector.AppendMultiplicitySites (cognitive 33): RoslynDuplicationDetector.AppendMultiplicitySites has cognitive complexity 33 (threshold 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":"engine/src/CodeHealth.Core/CodeShape/RoslynDuplicationDetector.cs"},"region":{"startLine":1744}}}],"partialFingerprints":{"codehealthFindingId/v1":"032a85a935f07a3f132ae547af06fd29febd559ebbd05eccf13ac8fe002b01e3"}},{"ruleId":"D2","level":"warning","message":{"text":"RazorMarkupReferenceScanner.CollectByBaseTypeAsync (cognitive 33): RazorMarkupReferenceScanner.CollectByBaseTypeAsync has cognitive complexity 33 (threshold 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":"engine/src/CodeHealth.Core/ExplicitDebt/RazorMarkupReferenceScanner.cs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe0bf52e5777096111cd137d7aa04a303f19a4c571eed6fdb73f08bc6ab78e0c"}},{"ruleId":"D2","level":"warning","message":{"text":"RoslynExplicitDebtCollector.CollectObsoleteAsync (cognitive 33): RoslynExplicitDebtCollector.CollectObsoleteAsync has cognitive complexity 33 (threshold 15). Of this number, 32 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ExplicitDebt/RoslynExplicitDebtCollector.cs"},"region":{"startLine":4381}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a2dea9d3012205081c6b9ab11be393e34e966ee1130d60ffd98f060d7b9c1b6"}},{"ruleId":"D2","level":"warning","message":{"text":"JsComplexity.ComputeCognitive (cognitive 33): JsComplexity.ComputeCognitive has cognitive complexity 33 (threshold 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":"engine/src/CodeHealth.Core/Frontend/JsComplexity.cs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8a3d0ffc0e6dd0d35376da9770c5d3e528f8883896d5b6b600b365c749ff360"}},{"ruleId":"D2","level":"warning","message":{"text":"Scanner.SkipTrivia (cognitive 33): Scanner.SkipTrivia has cognitive complexity 33 (threshold 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":"engine/src/CodeHealth.Core/Frontend/JsLexer.cs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"187f054b86f5c53122977826318293548b4d51a7a72f4a15e77ca2b295b370f7"}},{"ruleId":"D2","level":"warning","message":{"text":"Scanner.ScanNumber (cognitive 33): Scanner.ScanNumber has cognitive complexity 33 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/JsLexer.cs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"05f7731411cece2c22ac4c7281bd1c9164447c21ff155503a3726f61d7d04c39"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleResolver.ResolveViaTsConfig (cognitive 33): ModuleResolver.ResolveViaTsConfig has cognitive complexity 33 (threshold 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":"engine/src/CodeHealth.Core/Frontend/ModuleResolver.cs"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"365b69553f01c3b2de195bfd5705d78d2a4bc95d09f4dee9bf8458e41e167c96"}},{"ruleId":"D2","level":"warning","message":{"text":"AccessibilityAnalyzer.PureQueryHelperNames (cognitive 33): AccessibilityAnalyzer.PureQueryHelperNames has cognitive complexity 33 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"53a62c18d84440fdb26241dd63086a851ec36aa95c5bfea743e52c53ad3c93f6"}},{"ruleId":"D2","level":"warning","message":{"text":"DataShapeSmellAnalyzer.AnalyzeAsync (cognitive 33): DataShapeSmellAnalyzer.AnalyzeAsync has cognitive complexity 33 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/DataShapeSmellAnalyzer.cs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb12c6eae3d8ed337c13d257e6455963915a95584c85e1b8698cf4a2135ed6bf"}},{"ruleId":"D2","level":"warning","message":{"text":"DomainModelAnalyzer.RepositoryPerAggregateRoot (cognitive 33): DomainModelAnalyzer.RepositoryPerAggregateRoot has cognitive complexity 33 (threshold 15). Of this number, 28 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":"engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs"},"region":{"startLine":1577}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce0450fde9d6edb8863add1092dba36b23da7217b3c98dbb5513f7b50f49dcfe"}},{"ruleId":"D2","level":"warning","message":{"text":"SelfDeclaredUnreliableTests.Find (cognitive 33): SelfDeclaredUnreliableTests.Find has cognitive complexity 33 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Testing/SelfDeclaredUnreliableTests.cs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"9637cab8472915c66e111be3ed11531517d04691669c4fb8542593f16c122780"}},{"ruleId":"D2","level":"warning","message":{"text":"SolutionShapeAnalyzer.BuildFindings (cognitive 33): SolutionShapeAnalyzer.BuildFindings has cognitive complexity 33 (threshold 15). Of this number, 32 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: 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":"engine/src/CodeHealth.Dimensions.CodeQuality/SolutionShape/SolutionShapeAnalyzer.cs"},"region":{"startLine":823}}}],"partialFingerprints":{"codehealthFindingId/v1":"45002aaebeb680be5e5890d5b38261046617544fdc1caecd27c743e3c089a982"}},{"ruleId":"D2","level":"warning","message":{"text":"DockerfileShapeRuleFilter.EveryRegistryBaseIsTagged (cognitive 33): DockerfileShapeRuleFilter.EveryRegistryBaseIsTagged has cognitive complexity 33 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/DockerfileShapeRuleFilter.cs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"6346b8074a36a104574d9109a6bc580587afdc36bd51cd0446efaa98fe2b2f3e"}},{"ruleId":"D2","level":"warning","message":{"text":"UnverifiedRemoteInstallerScan.FindingsInStage (cognitive 33): UnverifiedRemoteInstallerScan.FindingsInStage has cognitive complexity 33 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/UnverifiedRemoteInstallerScan.cs"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7b016c4c861cd33cd49a26dca3a5791ae6eb673b19f378bd28f8c52e20a3f46"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkflowInputGateRecheck.ExpressionYieldsOnlyShellSafeText (cognitive 33): WorkflowInputGateRecheck.ExpressionYieldsOnlyShellSafeText has cognitive complexity 33 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/WorkflowInputGateRecheck.cs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"f32115a3490b9d69fa9dae15e8a8102622f5a5e588f01c33adb2943f22a1d260"}},{"ruleId":"D2","level":"warning","message":{"text":"XmlBuildOnlyRecheck.XmlUseIsBuildOnly (cognitive 33): XmlBuildOnlyRecheck.XmlUseIsBuildOnly has cognitive complexity 33 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/XmlBuildOnlyRecheck.cs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"59a69116444462fc80b7ef21f1953bba8bff4af2ae16b4418e61aafb6f088ce8"}},{"ruleId":"D2","level":"warning","message":{"text":"check.main (cognitive 33): check.main has cognitive complexity 33 (threshold 15). Drivers by points: boolean chains 18, if/else 13 (14 pts), loops 1 (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/scala-frontend/selftest/check.py"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"060814009ca08736e03a16ff5f96e86ec3312fccd8da81a2ca59bc635a354967"}},{"ruleId":"D2","level":"warning","message":{"text":"build_dimension_noise.main (cognitive 33): build_dimension_noise.main has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 7 (12 pts), ternaries 2 (5 pts), boolean chains 4 (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":"tools/depthnoise/build_dimension_noise.py"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d3b52151031ee5690b577f18345a37a0b52c257d49de5c587f67db23f86575b"}},{"ruleId":"D2","level":"warning","message":{"text":"bench.run_agent (cognitive 33): bench.run_agent has cognitive complexity 33 (threshold 15). Drivers by points: if/else 7 (18 pts), boolean chains 8, loops 3 (4 pts), ternaries 2, error handling 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/qwen-eval/bench.py"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"faf8f59557c17969002542f8f995ec0f8403c3837e4162db48286c1e1a2d9c2a"}},{"ruleId":"D2","level":"warning","message":{"text":"draw.main (cognitive 33): draw.main has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (15 pts), loops 8 (12 pts), ternaries 2 (4 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":"tools/rescan/draw.py"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"130d2fae7b955173f7130b5624b08ad80682ba5d2042449f347241b9240d64a3"}},{"ruleId":"D2","level":"warning","message":{"text":"BranchWalker.walk (cognitive 33): BranchWalker.walk has cognitive complexity 33 (threshold 15). Drivers by points: if/else 16 (21 pts), loops 6 (12 pts) (nesting depth added 11). 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":"engine/sidecars/swift-frontend/Sources/codehealth-swift-sidecar/Body.swift"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"070e13259264781ee216b19d3bc916eac83cca8d5b4a778f18fe07c493023567"}},{"ruleId":"D2","level":"warning","message":{"text":"PolyglotConditionScanner.Scan (cognitive 32): PolyglotConditionScanner.Scan has cognitive complexity 32 (threshold 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":"engine/src/CodeHealth.Core/CodeShape/PolyglotConditionScanner.cs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a8fe7c47818f7959b5ae96b5cb6ac187f27be3575261eeda48a708f6ffbf0c3"}},{"ruleId":"D2","level":"warning","message":{"text":"Lcom4Calculator.AnalyzeVb (cognitive 32): Lcom4Calculator.AnalyzeVb has cognitive complexity 32 (threshold 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":"engine/src/CodeHealth.Core/Cohesion/Lcom4Calculator.cs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bb7d17a28a5e3187274db3590aebc4a61172c69a9e2f808030d4156177ac11c"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendWorkspaceLoader.ReadSourceMapProvenance (cognitive 32): FrontendWorkspaceLoader.ReadSourceMapProvenance has cognitive complexity 32 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendWorkspaceLoader.BuildOutput.cs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef48d4bb5d701537c53a7002677fb44c7f3c1a103bd3be4c8208b086c43af8d0"}},{"ruleId":"D2","level":"warning","message":{"text":"JsDuplicationDetector.TrimWiringExtents (cognitive 32): JsDuplicationDetector.TrimWiringExtents has cognitive complexity 32 (threshold 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":"engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs"},"region":{"startLine":3932}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e009bbb553839949e7e15aa65ee3a899c1a9835c999b94c21af3f01e23aeb8a"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleResolver.ModuleResolver.ctor (cognitive 32): ModuleResolver.ModuleResolver.ctor has cognitive complexity 32 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 6 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":"engine/src/CodeHealth.Core/Frontend/ModuleResolver.cs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"93c0790f4b0c04a042b15a132b7221cd7737670208005516ef4d589ec6f0cbd2"}},{"ruleId":"D2","level":"warning","message":{"text":"NonProductionTreeReadmission.ImportedTrees (cognitive 32): NonProductionTreeReadmission.ImportedTrees has cognitive complexity 32 (threshold 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":"engine/src/CodeHealth.Core/Frontend/NonProductionTreeReadmission.cs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"216b246dd8e177131b6331b85c4318cb3531276ba479b93c0dea32a5cce04d66"}},{"ruleId":"D2","level":"warning","message":{"text":"MarkupParser.BlankUnquotedExpressionAttributeValues (cognitive 32): MarkupParser.BlankUnquotedExpressionAttributeValues has cognitive complexity 32 (threshold 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":"engine/src/CodeHealth.Core/Markup/MarkupParser.cs"},"region":{"startLine":986}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fb770029ff30bda3dfe3b9b766d737e0efa53a2b3adcaaaf18469c0e1ed3866"}},{"ruleId":"D2","level":"warning","message":{"text":"CiWorkflowReader.TopLevelTriggers (cognitive 32): CiWorkflowReader.TopLevelTriggers has cognitive complexity 32 (threshold 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":"engine/src/CodeHealth.Core/Readiness/CiWorkflowReader.cs"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"e73397e360f46277621f948654892eeaf2a1286621a4b6d4d727ff082c3a4e44"}},{"ruleId":"D2","level":"warning","message":{"text":"CloneSpanShape.Skeleton (cognitive 32): CloneSpanShape.Skeleton has cognitive complexity 32 (threshold 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":"engine/src/CodeHealth.Dimensions.CodeQuality/CodeShape/DuplicationAnalyzer.cs"},"region":{"startLine":4506}}}],"partialFingerprints":{"codehealthFindingId/v1":"a096c26bc715ba1800a3f006e1922aeb7370ac59b289388f739577f6836ca9ac"}},{"ruleId":"D2","level":"warning","message":{"text":"DockerfileShapeRuleFilter.DropsPrivilegeAtStart (cognitive 32): DockerfileShapeRuleFilter.DropsPrivilegeAtStart has cognitive complexity 32 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/DockerfileShapeRuleFilter.cs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"95d075681dca8560f625ed985999e593228914a8e4ffe5c5c11e9466c87a469a"}},{"ruleId":"D2","level":"warning","message":{"text":"SpringSecurityActuatorRecheck.ConfiguresSecurity (cognitive 32): SpringSecurityActuatorRecheck.ConfiguresSecurity has cognitive complexity 32 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/SpringSecurityActuatorRecheck.cs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"58cdbb4df81189eec659e0e404c7cea4641c4b6450ea663d0d5f7b635817ac3b"}},{"ruleId":"D2","level":"warning","message":{"text":"ChangeCouplingAnalyzer.NamesRepoSubtypeOf (cognitive 32): ChangeCouplingAnalyzer.NamesRepoSubtypeOf has cognitive complexity 32 (threshold 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":"engine/src/CodeHealth.Dimensions.GitMining/ChangeCouplingAnalyzer.cs"},"region":{"startLine":4243}}}],"partialFingerprints":{"codehealthFindingId/v1":"e032f603c5ecaa52055141471c27f9c4e191b10743a651cac0562d36fe07b5f9"}},{"ruleId":"D2","level":"warning","message":{"text":"arch_corpus.main (cognitive 32): arch_corpus.main has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 5, loops 4 (5 pts), ternaries 2 (5 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":"tools/multilang/arch_corpus.py"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9eddb071faabfd9d72baf57438c6ea7ecd4eb022e493b6146bc2df55536bcd8"}},{"ruleId":"D2","level":"warning","message":{"text":"go_precision_adjudicate.adjudicate (cognitive 32): go_precision_adjudicate.adjudicate has cognitive complexity 32 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 14 (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":"tools/multilang/go_precision_adjudicate.py"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebff42bf16cd9387fee9224a857eec7470844619b70d3aa3f8367ad5ecfe9e44"}},{"ruleId":"D2","level":"warning","message":{"text":"fallback-judge.cmd_run (cognitive 32): fallback-judge.cmd_run has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (23 pts), loops 3 (5 pts), boolean chains 3, ternaries 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":"tools/train/fallback-judge.py"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c6f9dcde065f78f1aea955d59fa610bb6758d4c4580c406da91f9ba7cf99aeb"}},{"ruleId":"D2","level":"warning","message":{"text":"Model::emit_type (cognitive 32): Model::emit_type has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 6 (8 pts), boolean chains 5, match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/rust-frontend/src/main.rs"},"region":{"startLine":1296}}}],"partialFingerprints":{"codehealthFindingId/v1":"b296135ef54e964e7f48d59176032e9c143874650da92c27ea92925969fb9ef5"}},{"ruleId":"D2","level":"warning","message":{"text":"AspireAppHostExtractor.Extract (cognitive 31): AspireAppHostExtractor.Extract has cognitive complexity 31 (threshold 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":"engine/src/CodeHealth.Core/Architecture/Topology/Extractors/AspireAppHostExtractor.cs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"07069b60ac3796077f4a2d86ced8fbed54266ce0c08b39ecebb694e4e9a613bc"}},{"ruleId":"D2","level":"warning","message":{"text":"LineBasedGodClassDetector.MeasureLeg (cognitive 31): LineBasedGodClassDetector.MeasureLeg has cognitive complexity 31 (threshold 15). Of this number, 30 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":"engine/src/CodeHealth.Core/CodeShape/LineBasedGodClassDetector.cs"},"region":{"startLine":1362}}}],"partialFingerprints":{"codehealthFindingId/v1":"13f35b1e0752815f43061af97837867e762a47f7949c0c26ebac6f1dd06afad5"}},{"ruleId":"D2","level":"warning","message":{"text":"NpmManifestHygiene.Read (cognitive 31): NpmManifestHygiene.Read has cognitive complexity 31 (threshold 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":"engine/src/CodeHealth.Core/Dependencies/NpmManifestHygiene.cs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"41d80ada8b99424babec060fb64cb4b30062acb84835bd7a268413752b1ed53d"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendManifestEntryPoints.CollectMiniProgramEntryPaths (cognitive 31): FrontendManifestEntryPoints.CollectMiniProgramEntryPaths has cognitive complexity 31 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendManifestEntryPoints.cs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"87c2d667715b3a006dd8ab92f89acdbe08847c33a1496d612c423fb60a79d839"}},{"ruleId":"D2","level":"warning","message":{"text":"JsFunctionScanner.ScanExpressionBodyEnd (cognitive 31): JsFunctionScanner.ScanExpressionBodyEnd has cognitive complexity 31 (threshold 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":"engine/src/CodeHealth.Core/Frontend/JsFunctionScanner.cs"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"1531be6b85b615e703c582bc485f807e49c75a37c1e97e0af46910bd4fc35c6c"}},{"ruleId":"D2","level":"warning","message":{"text":"AccessibilityAnalyzer.OrphanedLabels (cognitive 31): AccessibilityAnalyzer.OrphanedLabels has cognitive complexity 31 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 3 belong to 3 function literals inside it that branch. To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs"},"region":{"startLine":2157}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a0ddf3ea8ad9fb824ae196dd68b57aa361bac4c22490ec0deae5727f23a1225"}},{"ruleId":"D2","level":"warning","message":{"text":"AccessibilityAnalyzer.EnumerateEnforcementFiles (cognitive 31): AccessibilityAnalyzer.EnumerateEnforcementFiles has cognitive complexity 31 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs"},"region":{"startLine":9915}}}],"partialFingerprints":{"codehealthFindingId/v1":"b11980ce9b5258c63b4efe9a4a421a25a445082177a283cfc8059e3bf71e80a4"}},{"ruleId":"D2","level":"warning","message":{"text":"IncompletenessAnalyzer.ConditionsAlreadyDecidedByAnEarlierGuard (cognitive 31): IncompletenessAnalyzer.ConditionsAlreadyDecidedByAnEarlierGuard has cognitive complexity 31 (threshold 15). Of this number, 29 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent 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":"engine/src/CodeHealth.Core/ModelAware/IncompletenessAnalyzer.cs"},"region":{"startLine":4349}}}],"partialFingerprints":{"codehealthFindingId/v1":"4568848f0c0b01e08d4d7330601d71fccb00347ee37f307665c9cccaabba5f74"}},{"ruleId":"D2","level":"warning","message":{"text":"MarkupTaintPass.CollectEdges (cognitive 31): MarkupTaintPass.CollectEdges has cognitive complexity 31 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/MarkupTaintPass.cs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5b69a897f7452765e90a8a4c087c299453e7ddbec9a21c81c444a2bf9ee099f"}},{"ruleId":"D2","level":"warning","message":{"text":"ComposePsParser.ParseWebTargets (cognitive 31): ComposePsParser.ParseWebTargets has cognitive complexity 31 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/RuntimeBoot/ComposePsParser.cs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1d77abdff545f0c0e52791439db83d99c1d4ca51fd896c5722c33b149285a54"}},{"ruleId":"D2","level":"warning","message":{"text":"DiskSourceFiles.Enumerate (cognitive 31): DiskSourceFiles.Enumerate has cognitive complexity 31 (threshold 15). Of this number, 30 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":"engine/src/CodeHealth.Core/Scoring/DiskSourceFiles.cs"},"region":{"startLine":1026}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf33aa90616ddf6dca26493a13c6fdc94e8f728442a6f8597466193d72ee2bdb"}},{"ruleId":"D2","level":"warning","message":{"text":"CredentialScannerAllowlist.ParsePathPatterns (cognitive 31): CredentialScannerAllowlist.ParsePathPatterns has cognitive complexity 31 (threshold 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":"engine/src/CodeHealth.Core/Security/CredentialScannerAllowlist.cs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"38e43a5b4c68f72525f78696c0f4053ba6815f997ac04b3761a7c5fe3afe2941"}},{"ruleId":"D2","level":"warning","message":{"text":"DiskTestScanner.UnreadableTestSources (cognitive 31): DiskTestScanner.UnreadableTestSources has cognitive complexity 31 (threshold 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":"engine/src/CodeHealth.Core/Testing/DiskTestScanner.cs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cd50c6fb20228bc52ebe73908dbf5afbc7ff0d59399f64ab5a26ebe64b2fdf4"}},{"ruleId":"D2","level":"warning","message":{"text":"DiskTestScanner.HasPesterTestSuite (cognitive 31): DiskTestScanner.HasPesterTestSuite has cognitive complexity 31 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Testing/DiskTestScanner.cs"},"region":{"startLine":1192}}}],"partialFingerprints":{"codehealthFindingId/v1":"84c97ecce6af61e42dc8808ce1c45c7cf05bbb7f54682a9bd47259b23da7bc92"}},{"ruleId":"D2","level":"warning","message":{"text":"RoslynTestQualityCollector.AutoApproveReachableBodies (cognitive 31): RoslynTestQualityCollector.AutoApproveReachableBodies has cognitive complexity 31 (threshold 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":"engine/src/CodeHealth.Core/Testing/RoslynTestQualityCollector.cs"},"region":{"startLine":1138}}}],"partialFingerprints":{"codehealthFindingId/v1":"acce612f551e54ad06941d4365031aa85904c684609c82a91d848f7051087a8d"}},{"ruleId":"D2","level":"warning","message":{"text":"JsSiblingScopeReadScan.IsRead (cognitive 31): JsSiblingScopeReadScan.IsRead has cognitive complexity 31 (threshold 15). 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/JsSiblingScopeReadScan.cs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"5480bb7414d5d06e501e9ec95161626e90180fc5f2e20dd928bcaa2f6ff0c74e"}},{"ruleId":"D2","level":"warning","message":{"text":"JsValueFlow.LocalBindings (cognitive 31): JsValueFlow.LocalBindings has cognitive complexity 31 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/JsValueFlow.cs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"df9b5e1544f9898f78792c6845032553b8b98ef414bdd26e44de59b61cbae106"}},{"ruleId":"D2","level":"warning","message":{"text":"MutableGitCloneScan.Offence (cognitive 31): MutableGitCloneScan.Offence has cognitive complexity 31 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/MutableGitCloneScan.cs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"df94f6b3d34f3076aa2415426009ed922b82302fe59c46252414a3565cde7487"}},{"ruleId":"D2","level":"warning","message":{"text":"ChangeCouplingAnalyzer.JsTsImportsSibling (cognitive 31): ChangeCouplingAnalyzer.JsTsImportsSibling has cognitive complexity 31 (threshold 15). Of this number, 30 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":"engine/src/CodeHealth.Dimensions.GitMining/ChangeCouplingAnalyzer.cs"},"region":{"startLine":5147}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd8c114a4253734925289aba27e1a05bf2f4aa8a7f7f0d2003a02e1dd284299b"}},{"ruleId":"D2","level":"warning","message":{"text":"coverage-report.parse (cognitive 31): coverage-report.parse has cognitive complexity 31 (threshold 15). Drivers by points: if/else 6 (20 pts), loops 5 (9 pts), boolean chains 2 (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":"tools/engine-coverage/coverage-report.py"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2e028adc6393fed6eb0626f3d977d5a348996c6115d3104811ea827cc5d624c"}},{"ruleId":"D2","level":"warning","message":{"text":"build_gitlab_manifest.main (cognitive 31): build_gitlab_manifest.main has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 7, loops 5 (6 pts), ternaries 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/multilang/build_gitlab_manifest.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"28a98322c86f94c5a86634a0f540859d84a45c8e39ab151052334f003c43b57a"}},{"ruleId":"D2","level":"warning","message":{"text":"backlog-drop-unreachable.main (cognitive 31): backlog-drop-unreachable.main has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 6, loops 4 (5 pts), error handling 1 (2 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":"tools/ops/backlog-drop-unreachable.py"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"572c823a5ec0efec6b1c7574816017c6b36c1c98ff2a6abd199b2b979087bdc7"}},{"ruleId":"D2","level":"warning","message":{"text":"extractor.extractPackage (cognitive 31): extractor.extractPackage has cognitive complexity 31 (threshold 15). Drivers by points: if/else 4 (14 pts), loops 6 (11 pts), boolean chains 3, match/switch 1 (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":"engine/sidecars/go/extract.go"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a610d2fe82e1d573aac5ef6021e72fc264b00135256034d4d233d3642b3a456"}},{"ruleId":"D2","level":"warning","message":{"text":"extractor.collectInterfaceAssertions (cognitive 31): extractor.collectInterfaceAssertions has cognitive complexity 31 (threshold 15). Drivers by points: if/else 6 (21 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":"engine/sidecars/go/implements.go"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"56ab68f37087615e2c50f3a584989b6e0573359e9c89a65c1aa5e9ada6333bf1"}},{"ruleId":"D2","level":"warning","message":{"text":"ts-helpers.branchesOf (cognitive 31): ts-helpers.branchesOf has cognitive complexity 31 (threshold 15). Drivers by points: if/else 16 (19 pts), ternaries 5 (8 pts), boolean chains 4 (nesting depth added 6). Most of this is not in the body itself: 9 of the 31 points are its own statements and the rest belongs to 7 function literals inside it that branch (lines 369, 386, 349, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/tsjs-frontend/ts-helpers.mjs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"a108d6c4a56df9adf75f0cab86fbbf9eb09a1799b4b6e554b388064d1a5e360a"}},{"ruleId":"D2","level":"warning","message":{"text":"BoundaryCouplingDetector.ScanRoslynAsync (cognitive 30): BoundaryCouplingDetector.ScanRoslynAsync has cognitive complexity 30 (threshold 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":"engine/src/CodeHealth.Core/Architecture/BoundaryCouplingDetector.cs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e75aa145729aa44995f4f243d3b20ece072f67e46f123b287d2b35886926d4e"}},{"ruleId":"D2","level":"warning","message":{"text":"SliceLocalityDetector.Collaborators (cognitive 30): SliceLocalityDetector.Collaborators has cognitive complexity 30 (threshold 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":"engine/src/CodeHealth.Core/Architecture/SliceLocalityDetector.cs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"109dc323e580bf7d307592743ec46d6d6add7b449fdfe374477cb36fb750d423"}},{"ruleId":"D2","level":"warning","message":{"text":"RazorCodeVirtualizer.FindMatchingBrace (cognitive 30): RazorCodeVirtualizer.FindMatchingBrace has cognitive complexity 30 (threshold 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":"engine/src/CodeHealth.Core/CodeShape/RazorCodeVirtualizer.cs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc8ecc9d26a96e8afcae8ba744044bda138e0ac2e25f04ade5f8d1bcf83db323"}},{"ruleId":"D2","level":"warning","message":{"text":"ComplianceSecurityAnalyzer.DetectImperativeGuards (cognitive 30): ComplianceSecurityAnalyzer.DetectImperativeGuards has cognitive complexity 30 (threshold 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":"engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs"},"region":{"startLine":4671}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c4efcff01830545d0c933281ca2dcfef876b7b08ab1088cca9cf8360d0de74e"}},{"ruleId":"D2","level":"warning","message":{"text":"DartDeadLibraryField.Declarations (cognitive 30): DartDeadLibraryField.Declarations has cognitive complexity 30 (threshold 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":"engine/src/CodeHealth.Core/Dart/DartDeadLibraryField.cs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fadbffc4bec4fe675e85baa4f15fe3901872a1ddd7c6900e2fc2db5c8c0644c"}},{"ruleId":"D2","level":"warning","message":{"text":"EntryPointCatalog.AddPublishedSubpathSiblings (cognitive 30): EntryPointCatalog.AddPublishedSubpathSiblings has cognitive complexity 30 (threshold 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":"engine/src/CodeHealth.Core/Frontend/EntryPointCatalog.cs"},"region":{"startLine":1257}}}],"partialFingerprints":{"codehealthFindingId/v1":"523c684e754fb4a525f05ab4931f7f0bc7c4b5c2ed026881cfdbf24d710bb00e"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendTestReachability.EggBootReached (cognitive 30): FrontendTestReachability.EggBootReached has cognitive complexity 30 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendTestReachability.cs"},"region":{"startLine":2033}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf08a88ea799d19df55408fafab1dc3aeaae9116ab5c5981fa3fcb4de68cf518"}},{"ruleId":"D2","level":"warning","message":{"text":"JsDuplicationDetector.MarkCommonJsWiring (cognitive 30): JsDuplicationDetector.MarkCommonJsWiring has cognitive complexity 30 (threshold 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":"engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs"},"region":{"startLine":7093}}}],"partialFingerprints":{"codehealthFindingId/v1":"808fb9bb178ad2aaf9122635cff315d0fd7842f7c46f08800929b1e3264841df"}},{"ruleId":"D2","level":"warning","message":{"text":"JsFunctionScanner.SkipTypeParameters (cognitive 30): JsFunctionScanner.SkipTypeParameters has cognitive complexity 30 (threshold 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":"engine/src/CodeHealth.Core/Frontend/JsFunctionScanner.cs"},"region":{"startLine":949}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6ff6c77da1a458224fb978564b5d2ae5e5b64ed811db5253006200fd59fcc22"}},{"ruleId":"D2","level":"warning","message":{"text":"AccessibilityAnalyzer.AriaCorrectness (cognitive 30): AccessibilityAnalyzer.AriaCorrectness has cognitive complexity 30 (threshold 15). Of this number, 28 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":"engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs"},"region":{"startLine":4055}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e8be0847cfcd46d6e69c8d4867cdccea0e397de39ffc40c38f6ad46519d0f6d"}},{"ruleId":"D2","level":"warning","message":{"text":"AccessibilityAnalyzer.CollectBuildInjectedLangPages (cognitive 30): AccessibilityAnalyzer.CollectBuildInjectedLangPages has cognitive complexity 30 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs"},"region":{"startLine":5740}}}],"partialFingerprints":{"codehealthFindingId/v1":"41f1e49d9cd5d48d223be739c277472ac3fe8a6fa293183f62d6ea6a2c1d6d2f"}},{"ruleId":"D2","level":"warning","message":{"text":"AccessibilityAnalyzer.EnumerateTemplateLanguageFiles (cognitive 30): AccessibilityAnalyzer.EnumerateTemplateLanguageFiles has cognitive complexity 30 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.TemplateLanguageBlindness.cs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d0482d400cf30d83d086dbd6bbba93f62e8aa366762e47828814a67bb9b4163"}},{"ruleId":"D2","level":"warning","message":{"text":"AmbientInputAnalyzer.Analyze (cognitive 30): AmbientInputAnalyzer.Analyze has cognitive complexity 30 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 3 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":"engine/src/CodeHealth.Core/ModelAware/AmbientInputAnalyzer.cs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"768ff990039834a9d041c90a3d76210284aaae1c6385f4aa2328e3fd40eb6e2b"}},{"ruleId":"D2","level":"warning","message":{"text":"ArchitectureModelAnalyzer.InterfaceSegregation (cognitive 30): ArchitectureModelAnalyzer.InterfaceSegregation has cognitive complexity 30 (threshold 15). Of this number, 29 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":"engine/src/CodeHealth.Core/ModelAware/ArchitectureModelAnalyzer.cs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"75378dbe892f38c0a7c5fd20332997d9bc8c408522ab1c3a330a4cafa953cf63"}},{"ruleId":"D2","level":"warning","message":{"text":"IncompletenessAnalyzer.DebugOnlyBoundChecks (cognitive 30): IncompletenessAnalyzer.DebugOnlyBoundChecks has cognitive complexity 30 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/IncompletenessAnalyzer.cs"},"region":{"startLine":1292}}}],"partialFingerprints":{"codehealthFindingId/v1":"794e5310c673f894baec331abec6422cb820ec0dec5ec9d64428c04002286447"}},{"ruleId":"D2","level":"warning","message":{"text":"IncompletenessAnalyzer.StatementsBothBranchesOpenWith (cognitive 30): IncompletenessAnalyzer.StatementsBothBranchesOpenWith has cognitive complexity 30 (threshold 15). Of this number, 29 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":"engine/src/CodeHealth.Core/ModelAware/IncompletenessAnalyzer.cs"},"region":{"startLine":4264}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fcebd30184db8f4d29e7b1d3b69562bde8ad3af0ecbaffb11e40ec7f8fae70a"}},{"ruleId":"D2","level":"warning","message":{"text":"ScalaDomainConventions.Dm6InfraLeak (cognitive 30): ScalaDomainConventions.Dm6InfraLeak has cognitive complexity 30 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/ScalaDomainConventions.cs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"66a4fcfdf1883debcaf34b44b2bbcc4916b788eaa2f23d7266a68ed8a67a0580"}},{"ruleId":"D2","level":"warning","message":{"text":"ProductionReadinessAnalyzer.HasPublishVerbInPipelineNamedScript (cognitive 30): ProductionReadinessAnalyzer.HasPublishVerbInPipelineNamedScript has cognitive complexity 30 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs"},"region":{"startLine":7115}}}],"partialFingerprints":{"codehealthFindingId/v1":"290b0449ef2b58071c4eb985b24cfc7613d3111440afb673c35d8bf2ba9889b3"}},{"ruleId":"D2","level":"warning","message":{"text":"CiGateDetection.SoftFailedAt (cognitive 30): CiGateDetection.SoftFailedAt has cognitive complexity 30 (threshold 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":"engine/src/CodeHealth.Core/Scoring/CiGateDetection.cs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"56fffba955c11845e37793b395383295a78926ecd5c69c1ef9251785da5d600f"}},{"ruleId":"D2","level":"warning","message":{"text":"DiskTestScanner.VbaContainerTestSourceExtensions (cognitive 30): DiskTestScanner.VbaContainerTestSourceExtensions has cognitive complexity 30 (threshold 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":"engine/src/CodeHealth.Core/Testing/DiskTestScanner.cs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"d514168079d88c3ed1a15b5d6098107f56726dc0f840b6a5b27bd34a54a5c3e6"}},{"ruleId":"D2","level":"warning","message":{"text":"GitLogHistoryExtractor.Parse (cognitive 30): GitLogHistoryExtractor.Parse has cognitive complexity 30 (threshold 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":"engine/src/CodeHealth.Toolchain/Git/GitLogHistoryExtractor.cs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c71f0c4f0996b21bdedaba4bc9bde6f9eed55c7a3098c9fe6f704cb4cf60b40"}},{"ruleId":"D2","level":"warning","message":{"text":"RuleRecommendationEngine.ForMeta (cognitive 30): RuleRecommendationEngine.ForMeta has cognitive complexity 30 (threshold 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":"engine/src/CodeHealth.Reporting/Recommendations/RuleRecommendationEngine.cs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"b267ca62026cf933da9c6ad269ef222dd3d61dc7e3c245f98e71cd5340d553bd"}},{"ruleId":"D2","level":"warning","message":{"text":"ExplicitDebtAnalyzer.ToFinding (cognitive 30): ExplicitDebtAnalyzer.ToFinding has cognitive complexity 30 (threshold 15). 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":"engine/src/CodeHealth.Dimensions.ExplicitDebt/ExplicitDebtAnalyzer.cs"},"region":{"startLine":1039}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dcd8c82ece6a821f23a9a70d3cdbec2f7eafd22a4bab7b904d6a4c143aacdfb"}},{"ruleId":"D2","level":"warning","message":{"text":"GoModuleContextRechecks.AssertedMapKeyIsLocalCompositeLiteral (cognitive 30): GoModuleContextRechecks.AssertedMapKeyIsLocalCompositeLiteral has cognitive complexity 30 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/GoModuleContextRechecks.cs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"44fa6a2a12642e0c53e293395a46c5f744523e54e52718469e01e74338e9c413"}},{"ruleId":"D2","level":"warning","message":{"text":"PowerShellFetchExecScriptRecheck.TextLines (cognitive 30): PowerShellFetchExecScriptRecheck.TextLines has cognitive complexity 30 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/PowerShellFetchExecScriptRecheck.cs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb8a135652aa6b50cbeda99a634526046133ee595e9e035fe5e721d431a9c324"}},{"ruleId":"D2","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.SbomAdvice (cognitive 30): SupplyChainProvenanceAnalyzer.SbomAdvice has cognitive complexity 30 (threshold 15). 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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":3794}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5fb2d08440d47ee8b39f2f651a87aabfdb6bdd74e8650a740a587975db53a1b"}},{"ruleId":"D2","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.ScriptBlocks (cognitive 30): SupplyChainProvenanceAnalyzer.ScriptBlocks has cognitive complexity 30 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":9471}}}],"partialFingerprints":{"codehealthFindingId/v1":"c59ca4b764c2da164678a2e840a5f95a65857f8c242935ed20105095d078f4c3"}},{"ruleId":"D2","level":"warning","message":{"text":"Customers.razor \u203A OnInitializedAsync (cognitive 30): Customers.razor \u203A OnInitializedAsync has cognitive complexity 30 (threshold 15). Of this number, 29 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Kennel.Assay.Core/Governance/Ui/Customers.razor"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"70f522faa076bb71ccd9d821c5f27dce363904da1bf24c035ab45346557fca6c"}},{"ruleId":"D2","level":"warning","message":{"text":"EmitterNames.blankLiterals (cognitive 30): EmitterNames.blankLiterals has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 3 (8 pts), ternaries 1 (4 pts), boolean chains 3 (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":"engine/sidecars/java-spoon/src/main/java/dev/canine/codehealth/java/EmitterNames.java"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2c78d62daa251cf237ea35aa467bf7bf974fdd8cb35afcd0889534580ab399d"}},{"ruleId":"D2","level":"warning","message":{"text":"Main.main (cognitive 30): Main.main has cognitive complexity 30 (threshold 15). Drivers by points: error handling 5 (10 pts), ternaries 4 (8 pts), loops 5 (6 pts), if/else 4, match/switch 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/java-spoon/src/main/java/dev/canine/codehealth/java/Main.java"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"206bda34085df74eb4b8a19241f9d170010971bb7565e93be32e899627b24905"}},{"ruleId":"D2","level":"warning","message":{"text":"bakeoff.score_run (cognitive 30): bakeoff.score_run has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (18 pts), ternaries 7 (8 pts), boolean chains 4 (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":"tools/llm-bakeoff/bakeoff.py"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c56e0cc55305e5452a5efcd6c890f22e00f26153e1085fe0636979532476f2d"}},{"ruleId":"D2","level":"warning","message":{"text":"analyse.main (cognitive 30): analyse.main has cognitive complexity 30 (threshold 15). Drivers by points: loops 8 (15 pts), if/else 9 (10 pts), ternaries 2 (3 pts), boolean chains 2 (nesting depth added 9). 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":"tools/rescan/analyse.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f43e9798c54bd4b211637a221480050faaa6669af3c7f9d5613bdf3ccbc53f1"}},{"ruleId":"D2","level":"warning","message":{"text":"judge-with-tools.run_tool (cognitive 30): judge-with-tools.run_tool has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 6, error handling 3 (6 pts), ternaries 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/judge-with-tools.py"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"091eea108c86c832a2bd5932658dc2b4d56d1e5237633ce9e283c956d57e52c9"}},{"ruleId":"D2","level":"warning","message":{"text":"CSharpSourceScanner.ReadSingleQuoteBody (cognitive 29): CSharpSourceScanner.ReadSingleQuoteBody has cognitive complexity 29 (threshold 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":"engine/src/CodeHealth.Core/ApiSurface/CSharpSourceScanner.cs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"854196ecea6360e65a7f252d03fe8e4e9d4126f0a15e87c129189b00ce50bc39"}},{"ruleId":"D2","level":"warning","message":{"text":"ComplianceSecurityAnalyzer.ResolveConstantKeyRoot (cognitive 29): ComplianceSecurityAnalyzer.ResolveConstantKeyRoot has cognitive complexity 29 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs"},"region":{"startLine":3310}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9b5ce59ca0f0aa509dee8241db9f9a044cfa2285f736612520c32029f410924"}},{"ruleId":"D2","level":"warning","message":{"text":"RoslynExplicitDebtCollector.IllustrationBlockLines (cognitive 29): RoslynExplicitDebtCollector.IllustrationBlockLines has cognitive complexity 29 (threshold 15). 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":"engine/src/CodeHealth.Core/ExplicitDebt/RoslynExplicitDebtCollector.cs"},"region":{"startLine":2844}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c2808f2679f8b0580b47791730fcd8ab85eb65f39ea3a9a47b4868cd7eda7b1"}},{"ruleId":"D2","level":"warning","message":{"text":"RoslynExplicitDebtCollector.CollectNoWarn (cognitive 29): RoslynExplicitDebtCollector.CollectNoWarn has cognitive complexity 29 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ExplicitDebt/RoslynExplicitDebtCollector.cs"},"region":{"startLine":5080}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef3e50a1886634ca16515e4e3ee2c9fc685dbeac4f5209478a6a60b3328252a6"}},{"ruleId":"D2","level":"warning","message":{"text":"RoslynExplicitDebtCollector.ReadSeverityAssignments (cognitive 29): RoslynExplicitDebtCollector.ReadSeverityAssignments has cognitive complexity 29 (threshold 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":"engine/src/CodeHealth.Core/ExplicitDebt/RoslynExplicitDebtCollector.cs"},"region":{"startLine":6279}}}],"partialFingerprints":{"codehealthFindingId/v1":"05ee897eecd2744c8d48de58247c434115b00ebe9d56c47a0ecd80e77218f263"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendMarkupRefs.CollectInlineHtmlModuleImports (cognitive 29): FrontendMarkupRefs.CollectInlineHtmlModuleImports has cognitive complexity 29 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendMarkupRefs.cs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"b55df05d7e7c7fb1dfa922be837607c2100503c579f5538a1a3f8638d2fff6db"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendMarkupRefs.ExtractSrcAttribute (cognitive 29): FrontendMarkupRefs.ExtractSrcAttribute has cognitive complexity 29 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendMarkupRefs.cs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d4c03bc96d33dd1d9cbd6bed4b07fbc0646d8a11f7e6aa9dce00924dcc2dde2"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendTestReachability.ScanDataInitialiser (cognitive 29): FrontendTestReachability.ScanDataInitialiser has cognitive complexity 29 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendTestReachability.cs"},"region":{"startLine":1716}}}],"partialFingerprints":{"codehealthFindingId/v1":"25bec8e842ecba3689ee3c271850b0be9c01dbf1225c57602c794e060cdac782"}},{"ruleId":"D2","level":"warning","message":{"text":"IndentedMarkupProducer.ReadValue (cognitive 29): IndentedMarkupProducer.ReadValue has cognitive complexity 29 (threshold 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":"engine/src/CodeHealth.Core/Markup/IndentedMarkupProducer.cs"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"39cf7ff22e3fc638b06cea5c7037742b760e0698f9f12308638751db1991826f"}},{"ruleId":"D2","level":"warning","message":{"text":"DomainModelAnalyzer.IntegrationEventCoupling (cognitive 29): DomainModelAnalyzer.IntegrationEventCoupling has cognitive complexity 29 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"f23ce2741a01b04ef0efe7e74d246690e799e503986ce9361996d61934b2a0d1"}},{"ruleId":"D2","level":"warning","message":{"text":"EventDrivenAnalyzer.SyncInHandler (cognitive 29): EventDrivenAnalyzer.SyncInHandler has cognitive complexity 29 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs"},"region":{"startLine":1285}}}],"partialFingerprints":{"codehealthFindingId/v1":"25c3d51606a7f857c1f62b97edb00055d9968324200b814b906a9479dbe2b21d"}},{"ruleId":"D2","level":"warning","message":{"text":"RoslynProjectStatistician.CollectAsync (cognitive 29): RoslynProjectStatistician.CollectAsync has cognitive complexity 29 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Statistics/RoslynProjectStatistician.cs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"09385664bd14fcd0dcfd346b38d9660b125ffdf07e56380377af720c0f4d0598"}},{"ruleId":"D2","level":"warning","message":{"text":"CommittedCoverageReader.MergeXmlPerFile (cognitive 29): CommittedCoverageReader.MergeXmlPerFile has cognitive complexity 29 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Testing/CommittedCoverageReader.cs"},"region":{"startLine":957}}}],"partialFingerprints":{"codehealthFindingId/v1":"c94a883e5febfb5a8faa13c8bd41ac9a5ecbb2d42e6d2094c1fc16f9350517ee"}},{"ruleId":"D2","level":"warning","message":{"text":"CommittedCoverageReader.MergeIstanbulJsonPerFile (cognitive 29): CommittedCoverageReader.MergeIstanbulJsonPerFile has cognitive complexity 29 (threshold 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":"engine/src/CodeHealth.Core/Testing/CommittedCoverageReader.cs"},"region":{"startLine":1179}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5509e5aec0e38e8ba7e06f5ed18c03e4cd830893361854506b9f0429731ddb1"}},{"ruleId":"D2","level":"warning","message":{"text":"RoslynTestQualityCollector.BuildHelperIndex (cognitive 29): RoslynTestQualityCollector.BuildHelperIndex has cognitive complexity 29 (threshold 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":"engine/src/CodeHealth.Core/Testing/RoslynTestQualityCollector.cs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"75c48cb59916633719126b7087af1129063f95eaafffaad3118b9a664ebcbf3c"}},{"ruleId":"D2","level":"warning","message":{"text":"DuplicationAnalyzer.ForkFamilies (cognitive 29): DuplicationAnalyzer.ForkFamilies has cognitive complexity 29 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.CodeQuality/CodeShape/DuplicationAnalyzer.cs"},"region":{"startLine":1065}}}],"partialFingerprints":{"codehealthFindingId/v1":"1450bbd7ac77389bec8cf5491727c4da5b583046420a73d793352de98d63fde2"}},{"ruleId":"D2","level":"warning","message":{"text":"JsValueFlow.MaskStringLiteralContents (cognitive 29): JsValueFlow.MaskStringLiteralContents has cognitive complexity 29 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/JsValueFlow.cs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a99ec9898f4cb4ec9bb81d651ec8160c2d1cf3f158e852466041d32f42b1185"}},{"ruleId":"D2","level":"warning","message":{"text":"StaticAnalysisAnalyzer.RunAsync (cognitive 29): StaticAnalysisAnalyzer.RunAsync has cognitive complexity 29 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 13 belong to 6 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":"engine/src/CodeHealth.Dimensions.Security/StaticAnalysisAnalyzer.cs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"a089310691f6591b0a07589990c2fa623b1ecd10301608bd04d0405aad256c49"}},{"ruleId":"D2","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.MutableContainerImagePulls (cognitive 29): SupplyChainProvenanceAnalyzer.MutableContainerImagePulls has cognitive complexity 29 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":1250}}}],"partialFingerprints":{"codehealthFindingId/v1":"c45c4836784f6cb36562dbd4a1051e922491f10c99b59e0d955c1bdc49ccaa9a"}},{"ruleId":"D2","level":"warning","message":{"text":"RepoFindings.razor \u203A HideRuleAsync (cognitive 29): RepoFindings.razor \u203A HideRuleAsync has cognitive complexity 29 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Kennel.Watchdog.Core/Agents/Ui/RepoFindings.razor"},"region":{"startLine":1267}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdac96b5072fce7b954d20994393a373d7d12a959a5c54bc46ec408b7cd892c9"}},{"ruleId":"D2","level":"warning","message":{"text":"ModelBuilder.BuildMembers (cognitive 29): ModelBuilder.BuildMembers has cognitive complexity 29 (threshold 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":"engine/src/CodeHealth.CodeModel.Jvm/Builder.cs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f1a503cb41e93c00f61f5a032f478d3e0f08de5c3275ed683863d1b1f5f66fd"}},{"ruleId":"D2","level":"warning","message":{"text":"rate_audit.main (cognitive 29): rate_audit.main has cognitive complexity 29 (threshold 15). Drivers by points: ternaries 8 (16 pts), if/else 5 (11 pts), boolean chains 1, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/rate_audit.py"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"19ebb307c61604585b485de0fa1b949510cb313f75291da37c638decb3369964"}},{"ruleId":"D2","level":"warning","message":{"text":"codehealth_rust_sidecar::rep_prefixes (cognitive 29): codehealth_rust_sidecar::rep_prefixes has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 3 (9 pts), loops 4 (6 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/rust-frontend/src/main.rs"},"region":{"startLine":2845}}}],"partialFingerprints":{"codehealthFindingId/v1":"92a5d7fb19a141a64e911271db1bd5f3decabd379bfd58c22733ffffc6679dc4"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 29): (anonymous) has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12, ternaries 7 (9 pts), boolean chains 6, loops 2 (nesting depth added 2). Most of this is not in the body itself: 2 of the 29 points are its own statements and the rest belongs to 7 function items inside it that branch (dsmInit::(anonymous), dsmInit::highlight, dsmInit, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Kennel.Ui/wwwroot/kennel-ui.js"},"region":{"startLine":2073}}}],"partialFingerprints":{"codehealthFindingId/v1":"e11cbc65ceee38bcfca6e2f803ec0d40c0066641ba979b665d4cf6326fc7cb1c"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceClassifier.IsDemoPrefixedSampleProject (cognitive 28): SourceClassifier.IsDemoPrefixedSampleProject has cognitive complexity 28 (threshold 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":"engine/src/CodeHealth.Core/Classification/SourceClassifier.cs"},"region":{"startLine":3023}}}],"partialFingerprints":{"codehealthFindingId/v1":"af084eb1fe243189666ee6a78cf72c336c1aa7bd897805bd17ca2b8d1e9cba8c"}},{"ruleId":"D2","level":"warning","message":{"text":"Lcom4Calculator.Analyze (cognitive 28): Lcom4Calculator.Analyze has cognitive complexity 28 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Cohesion/Lcom4Calculator.cs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"ded3f968e1051f1d2128c88b02062869a5fb7e876e68885b70a0c22ad1ef7253"}},{"ruleId":"D2","level":"warning","message":{"text":"ComplianceSecurityAnalyzer.ScanCredentialExposure (cognitive 28): ComplianceSecurityAnalyzer.ScanCredentialExposure has cognitive complexity 28 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent 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":"engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs"},"region":{"startLine":1436}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e04713862fdf7e6e01d5dd9cc4c66f89b9526bb8dcbfcd1702c731fffb184ba"}},{"ruleId":"D2","level":"warning","message":{"text":"ComplianceSecurityAnalyzer.ScanUnauthenticatedCipherMode (cognitive 28): ComplianceSecurityAnalyzer.ScanUnauthenticatedCipherMode has cognitive complexity 28 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent 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":"engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs"},"region":{"startLine":2418}}}],"partialFingerprints":{"codehealthFindingId/v1":"55bdf1d812169d85f632777659bac6f60cd272b90df6b2ae93bdecb4481e960a"}},{"ruleId":"D2","level":"warning","message":{"text":"FileSystemDocumentationCollector.CollectAsync (cognitive 28): FileSystemDocumentationCollector.CollectAsync has cognitive complexity 28 (threshold 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":"engine/src/CodeHealth.Core/Docs/FileSystemDocumentationCollector.cs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5c539d262dd202d627515a9efd359f276064f0f10f4f2d75be4922699f7cf22"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendBoundaries.CollectThirdPartyBuildOutputImports (cognitive 28): FrontendBoundaries.CollectThirdPartyBuildOutputImports has cognitive complexity 28 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendBoundaries.cs"},"region":{"startLine":1786}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf2a42c28e7a0d7ca0330e90227def6e5fe093fdbf64360a86340b43b24c01dd"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendComplexity.Analyze (cognitive 28): FrontendComplexity.Analyze has cognitive complexity 28 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendComplexity.cs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"16c4964af8a865ba14a27f3e10789c03dd787afac2f736ff4e8fe50be4ffc3e2"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendDeadCode.GitignorePatternMayCover (cognitive 28): FrontendDeadCode.GitignorePatternMayCover has cognitive complexity 28 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendDeadCode.cs"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"22acf868052de36ada99718d576c2d7348ab5accb81019ab730bc09f80163510"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendDeadCode.GitignoreGlobMatches (cognitive 28): FrontendDeadCode.GitignoreGlobMatches has cognitive complexity 28 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendDeadCode.cs"},"region":{"startLine":837}}}],"partialFingerprints":{"codehealthFindingId/v1":"586f82d3688cfc4dfea99ea12d125cc3ecd5cb0ba00bc92c26227d29f34aa231"}},{"ruleId":"D2","level":"warning","message":{"text":"TaggedTemplateMarkupProducer.Read (cognitive 28): TaggedTemplateMarkupProducer.Read has cognitive complexity 28 (threshold 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":"engine/src/CodeHealth.Core/Markup/TaggedTemplateMarkupProducer.cs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b0aa305442f0e1deb66c4b8d93047e8c748c146367f86383a6b23eddf373979"}},{"ruleId":"D2","level":"warning","message":{"text":"AccessibilityAnalyzer.NeverInteractiveComponentTags (cognitive 28): AccessibilityAnalyzer.NeverInteractiveComponentTags has cognitive complexity 28 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs"},"region":{"startLine":1495}}}],"partialFingerprints":{"codehealthFindingId/v1":"5289539ef10d9a50821aed6836599c3ef17b76cdd02cebcbf2948dfc7cf716e6"}},{"ruleId":"D2","level":"warning","message":{"text":"AccessibilityAnalyzer.CollectCssPointerClasses (cognitive 28): AccessibilityAnalyzer.CollectCssPointerClasses has cognitive complexity 28 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent 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":"engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs"},"region":{"startLine":5507}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c6565ff13aa7e954d236236d6b996e4bedace58ebf0e924bc4b618043eff1ec"}},{"ruleId":"D2","level":"warning","message":{"text":"EventDrivenAnalyzer.EventCommandShape (cognitive 28): EventDrivenAnalyzer.EventCommandShape has cognitive complexity 28 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent 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":"engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs"},"region":{"startLine":1583}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa541a265d61627f364df8bc57b6d918aeecec6b394ced05a60682b3cc2ecddb"}},{"ruleId":"D2","level":"warning","message":{"text":"LogicDefectAnalyzer.InspectContradictedHandoff (cognitive 28): LogicDefectAnalyzer.InspectContradictedHandoff has cognitive complexity 28 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent 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":"engine/src/CodeHealth.Core/ModelAware/LogicDefectAnalyzer.cs"},"region":{"startLine":2603}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad1531f2ea97ed52d5c754febd698dcf8aae5e66b5b801c1af86e5f17020cb9d"}},{"ruleId":"D2","level":"warning","message":{"text":"ScatteredDerivation.Find (cognitive 28): ScatteredDerivation.Find has cognitive complexity 28 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/ScatteredDerivation.cs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"1516a37033d75d2591a336ef53a5e2c2f8a40fe0b2e7f1b527add3727b5c8296"}},{"ruleId":"D2","level":"warning","message":{"text":"VacuousFormatGate.Detect (cognitive 28): VacuousFormatGate.Detect has cognitive complexity 28 (threshold 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":"engine/src/CodeHealth.Core/Readiness/VacuousFormatGate.cs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"959cb88c22e99d1ba96d1cc588ade7d0b445e284936ae203ac5c09759dba0eb7"}},{"ruleId":"D2","level":"warning","message":{"text":"DeclaredScriptExecutables.ForRepo (cognitive 28): DeclaredScriptExecutables.ForRepo has cognitive complexity 28 (threshold 15). 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":"engine/src/CodeHealth.Core/Scoring/DeclaredScriptExecutables.cs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f01b94dea195662f5f5a762bd81c94a372730cb4d8987df291a3e265ff17212"}},{"ruleId":"D2","level":"warning","message":{"text":"DiskSourceFiles.HasFrontendSource (cognitive 28): DiskSourceFiles.HasFrontendSource has cognitive complexity 28 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: one other method here (DiskSourceFiles.EnumerateFrontend) 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":"engine/src/CodeHealth.Core/Scoring/DiskSourceFiles.cs"},"region":{"startLine":1488}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0785b4747881b119f1249faf1b46fd067ce1963c3828cde11f1cf0977f706fc"}},{"ruleId":"D2","level":"warning","message":{"text":"DiskSourceFiles.EnumerateFrontend (cognitive 28): DiskSourceFiles.EnumerateFrontend has cognitive complexity 28 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: one other method here (DiskSourceFiles.HasFrontendSource) 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":"engine/src/CodeHealth.Core/Scoring/DiskSourceFiles.cs"},"region":{"startLine":1558}}}],"partialFingerprints":{"codehealthFindingId/v1":"de7e1458b7656dfd22f16d1af1314dfb98d28af33c666bd1febee702483dfaa3"}},{"ruleId":"D2","level":"warning","message":{"text":"DiskTestScanner.JsTestFiles (cognitive 28): DiskTestScanner.JsTestFiles has cognitive complexity 28 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Testing/DiskTestScanner.cs"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ba7e1d63da4842c134a13c473f27374db6afa6a78f19b2597c374095e1179ec"}},{"ruleId":"D2","level":"warning","message":{"text":"ProcessToolRunner.RunAsync (cognitive 28): ProcessToolRunner.RunAsync has cognitive complexity 28 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 9 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":"engine/src/CodeHealth.Toolchain/Tools/ProcessToolRunner.cs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"50a3bca689c8f9df295f9d55b73b6fd98951b12be99438952d933569c29806b7"}},{"ruleId":"D2","level":"warning","message":{"text":"DegradedDiagnosticsReport.Render (cognitive 28): DegradedDiagnosticsReport.Render has cognitive complexity 28 (threshold 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":"engine/src/CodeHealth.Cli/Diagnostics/DegradedDiagnosticsReport.cs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b03967573550a2b009dce5b2445dc290f3bc357929fcde4a15434ba609e08a7"}},{"ruleId":"D2","level":"warning","message":{"text":"InternalApiConsistencyAnalyzer.RunAsync (cognitive 28): InternalApiConsistencyAnalyzer.RunAsync has cognitive complexity 28 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Architecture/InternalApiConsistencyAnalyzer.cs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"310eadb19f04cb227641598d671ea944548ed62a0c5f567b8d190923314f899e"}},{"ruleId":"D2","level":"warning","message":{"text":"DeclaredDependencies.FromManifests (cognitive 28): DeclaredDependencies.FromManifests has cognitive complexity 28 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/DeclaredDependencies.cs"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"745ea597774df15d8f0297c6bc689d6772cd94049fd12d9dab877214a7f6a425"}},{"ruleId":"D2","level":"warning","message":{"text":"FileModel.DeclareLocals (cognitive 28): FileModel.DeclareLocals has cognitive complexity 28 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/SqlBuilderCompositionWalk.cs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e0a23eeed82a351c26d6a59c36b261b4d8ad0a553d125d9515ff0579b102c18"}},{"ruleId":"D2","level":"warning","message":{"text":"FileModel.ExpressionNeutralises (cognitive 28): FileModel.ExpressionNeutralises has cognitive complexity 28 (threshold 15). 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/SqlBuilderCompositionWalk.cs"},"region":{"startLine":892}}}],"partialFingerprints":{"codehealthFindingId/v1":"308410c1cffe58e2c3f816b5b58309e87df34a819bd5fde5f7647f1bd0ddb305"}},{"ruleId":"D2","level":"warning","message":{"text":"gold-record.main (cognitive 28): gold-record.main has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 3, loops 2 (3 pts), ternaries 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/gold-record.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"e62fbbf995a31f9d2dd68d4bf05a5491cd27b87a236edf5d7ca8354630efe7b4"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::(anonymous)::describe (cognitive 28): (anonymous)::(anonymous)::describe has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (14 pts), ternaries 4 (9 pts), boolean chains 5 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Kennel.Ui/wwwroot/kennel-ui.js"},"region":{"startLine":974}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d410d644df4db1919a4771097d821a559324e67dc50dbb28f232e7ab1db6874"}},{"ruleId":"D2","level":"warning","message":{"text":"ServiceProjectPartition.Build (cognitive 27): ServiceProjectPartition.Build has cognitive complexity 27 (threshold 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":"engine/src/CodeHealth.Core/Architecture/ServiceProjectPartition.cs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"34248d4beeabe00170b2f78aa048148073797cb9453ac20bd4443c34a4f4e453"}},{"ruleId":"D2","level":"warning","message":{"text":"LineBasedGodClassDetector.DisjointFieldClusters (cognitive 27): LineBasedGodClassDetector.DisjointFieldClusters has cognitive complexity 27 (threshold 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":"engine/src/CodeHealth.Core/CodeShape/LineBasedGodClassDetector.cs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"29b1a98f044743176fe321a64002eedcf60bc7c7150a79b806255a8b7695e628"}},{"ruleId":"D2","level":"warning","message":{"text":"NeutralMethodLengthScanner.DeclaredMethodsByFile (cognitive 27): NeutralMethodLengthScanner.DeclaredMethodsByFile has cognitive complexity 27 (threshold 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":"engine/src/CodeHealth.Core/CodeShape/NeutralMethodLengthScanner.cs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a699aa2f88320c1e7667ef7f9369e65e5fe92ab9fe376787aa0814754829f39"}},{"ruleId":"D2","level":"warning","message":{"text":"GoModuleHygiene.Read (cognitive 27): GoModuleHygiene.Read has cognitive complexity 27 (threshold 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":"engine/src/CodeHealth.Core/Dependencies/GoModuleHygiene.cs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"4809d49ebbbe926814388a8736eb068a0f4360313a8b92381a007f6ea54453a9"}},{"ruleId":"D2","level":"warning","message":{"text":"RoslynExplicitDebtCollector.CollectPragmaDisables (cognitive 27): RoslynExplicitDebtCollector.CollectPragmaDisables has cognitive complexity 27 (threshold 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":"engine/src/CodeHealth.Core/ExplicitDebt/RoslynExplicitDebtCollector.cs"},"region":{"startLine":3974}}}],"partialFingerprints":{"codehealthFindingId/v1":"71de8e1887b235a144519136b8f68afda257bc6c290eef8fa446b2f0f42376e1"}},{"ruleId":"D2","level":"warning","message":{"text":"BuildOutputSources.ToSource (cognitive 27): BuildOutputSources.ToSource has cognitive complexity 27 (threshold 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":"engine/src/CodeHealth.Core/Frontend/BuildOutputSources.cs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a405b1c2b39acd64a285c7636f21b10476305fa163d00347f558a5e9a753087"}},{"ruleId":"D2","level":"warning","message":{"text":"DirectoryForkDetector.Analyze (cognitive 27): DirectoryForkDetector.Analyze has cognitive complexity 27 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent 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":"engine/src/CodeHealth.Core/Frontend/DirectoryForkDetector.cs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"a52e792e98db5c3ec34e5f776c4f124247f18e388f3b614606f19d7b73c3f80e"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendManifestEntryPoints.CollectWebExtensionScriptRefs (cognitive 27): FrontendManifestEntryPoints.CollectWebExtensionScriptRefs has cognitive complexity 27 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendManifestEntryPoints.cs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d1de3d66a7d50d9094a755343647f69f81072cfe0d3d4a46dbfe25aa139d12f"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendScriptCommandRefs.CollectPnpmLockPeerContracts (cognitive 27): FrontendScriptCommandRefs.CollectPnpmLockPeerContracts has cognitive complexity 27 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendScriptCommandRefs.cs"},"region":{"startLine":961}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8d04d346a24ed7fe70d44da5b94b725ddc01a50c62f9618174e2ca7c506dfe1"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendTestAndDocRefs.AddImportMapKeys (cognitive 27): FrontendTestAndDocRefs.AddImportMapKeys has cognitive complexity 27 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendTestAndDocRefs.cs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dc5208605fc62a2599cd36c0ad6b9f782c9d5a471dbec89a59cf86027c06d3d"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendTestSuiteMasking.CollectExcludedFileModuleRefs (cognitive 27): FrontendTestSuiteMasking.CollectExcludedFileModuleRefs has cognitive complexity 27 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendTestSuiteMasking.cs"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fed1c40e41dcbfb5f175bd647bb4867c13428e66b304f5266180b5de3c4ecf3"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendToolAndRuntimeRefs.CollectToolConfigModuleRefs (cognitive 27): FrontendToolAndRuntimeRefs.CollectToolConfigModuleRefs has cognitive complexity 27 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendToolAndRuntimeRefs.cs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e6f729bceca0214313139d2dea796b777a763c32e3ca2cbd04a342cecf1005a"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendToolAndRuntimeRefs.CollectPackageRootSpawnRefs (cognitive 27): FrontendToolAndRuntimeRefs.CollectPackageRootSpawnRefs has cognitive complexity 27 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendToolAndRuntimeRefs.cs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"798b1e7f66522a7c6efd5852508316e6ce3f7303b529511c9946cf56c8fc037a"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendWorkspaceWalk.CollectScriptExecutedToolTreeImports (cognitive 27): FrontendWorkspaceWalk.CollectScriptExecutedToolTreeImports has cognitive complexity 27 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendWorkspaceWalk.cs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"d62c76b3ecd95d2e513babddb7b1034dcf40168a1adce32835640fa8284055f1"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleResolver.Resolve (cognitive 27): ModuleResolver.Resolve has cognitive complexity 27 (threshold 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":"engine/src/CodeHealth.Core/Frontend/ModuleResolver.cs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"08dc43068a5e4d5f528bbcc808e5655386629a9e6e7c30cd09a6379b6ed862c1"}},{"ruleId":"D2","level":"warning","message":{"text":"AccessibilityAnalyzer.CountProgrammaticDomFactoryCalls (cognitive 27): AccessibilityAnalyzer.CountProgrammaticDomFactoryCalls has cognitive complexity 27 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs"},"region":{"startLine":6090}}}],"partialFingerprints":{"codehealthFindingId/v1":"41357d858e83c4156b742f36d9c495a9c5c96d03e1f4c7b3bde8b3c245b5e4cd"}},{"ruleId":"D2","level":"warning","message":{"text":"AccessibilityAnalyzer.CountUnreadTemplateMarkup (cognitive 27): AccessibilityAnalyzer.CountUnreadTemplateMarkup has cognitive complexity 27 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.TaggedTemplateBlindness.cs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"3677036a66be19b4347219c7128a888f86172ac4a780fa9a285fa46a62019ca0"}},{"ruleId":"D2","level":"warning","message":{"text":"DomainModelAnalyzer.PrimitiveDataClumps (cognitive 27): DomainModelAnalyzer.PrimitiveDataClumps has cognitive complexity 27 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 3 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs"},"region":{"startLine":5228}}}],"partialFingerprints":{"codehealthFindingId/v1":"c05e0675ac460be70849edd393603e68200353336cc9bf601152571d045a15a3"}},{"ruleId":"D2","level":"warning","message":{"text":"MarkupTaintPass.CollectAsync (cognitive 27): MarkupTaintPass.CollectAsync has cognitive complexity 27 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/MarkupTaintPass.cs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1e4907f906a914a571d964e2a8a1f0cbe9985f5d5e3e19924ce627ab009b10f"}},{"ruleId":"D2","level":"warning","message":{"text":"CodebaseSize.CountTestLocFromCsprojPathsAsync (cognitive 27): CodebaseSize.CountTestLocFromCsprojPathsAsync has cognitive complexity 27 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Scoring/CodebaseSize.cs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab6f0d38e9e44d8fcd01522d99d0ff3fea56fe2d837c6b688fbde2ac9564f7ae"}},{"ruleId":"D2","level":"warning","message":{"text":"ArchGraphSvg.Render (cognitive 27): ArchGraphSvg.Render has cognitive complexity 27 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent 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":"engine/src/CodeHealth.Reporting/Svg/ArchGraphSvg.cs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b1d1b71ea7639c7b593dbd8e1f2203063cd88755888be4f9ec0717824d75cd5"}},{"ruleId":"D2","level":"warning","message":{"text":"ComposeHostNamespaceScan.FindingsIn (cognitive 27): ComposeHostNamespaceScan.FindingsIn has cognitive complexity 27 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/ComposeHostNamespaceScan.cs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b98f26d37a792b9c58d12c153c204cf65f4ca987bc3cc1bd958d7f32c62f37f"}},{"ruleId":"D2","level":"warning","message":{"text":"DeclaredDependencies.FixSatisfiesOpenPythonRequirement (cognitive 27): DeclaredDependencies.FixSatisfiesOpenPythonRequirement has cognitive complexity 27 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/DeclaredDependencies.cs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b8bdfdba2b1081b17dd88ff3a280bbcf8768c4dfcb3c46b706327fc9ee2850e"}},{"ruleId":"D2","level":"warning","message":{"text":"DeclaredDependencies.ParseCargoWorkspaceMembers (cognitive 27): DeclaredDependencies.ParseCargoWorkspaceMembers has cognitive complexity 27 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/DeclaredDependencies.cs"},"region":{"startLine":1017}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccd34064b8d3537632564746a7cbb90d24d8376abd3e3b678b01f2ef303ef48c"}},{"ruleId":"D2","level":"warning","message":{"text":"DockerfileShapeRuleFilter.Filter (cognitive 27): DockerfileShapeRuleFilter.Filter has cognitive complexity 27 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/DockerfileShapeRuleFilter.cs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"617e32ac797b6044eac939d563b3b3a15206b3e21010caa7876004f82d8e0c3c"}},{"ruleId":"D2","level":"warning","message":{"text":"MarkupEscapingRecheck.ReadHtmlValueExpression (cognitive 27): MarkupEscapingRecheck.ReadHtmlValueExpression has cognitive complexity 27 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/MarkupEscapingRecheck.cs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"675c7c670b75a81c66ce8ca9f77853801b1d029d5a9909f96344baac28f5ac1c"}},{"ruleId":"D2","level":"warning","message":{"text":"SemgrepClaimRecheck.PremiseRefutedByTheCitedSource (cognitive 27): SemgrepClaimRecheck.PremiseRefutedByTheCitedSource has cognitive complexity 27 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/SemgrepClaimRecheck.cs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d5253c00d805ba81ebf331be609c183a7727faf9b7aa93ef29ffdc9f0e0fac4"}},{"ruleId":"D2","level":"warning","message":{"text":"UnverifiedTrustAnchorScan.FetchLine (cognitive 27): UnverifiedTrustAnchorScan.FetchLine has cognitive complexity 27 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/UnverifiedTrustAnchorScan.cs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"736d34dc8c96805345fbf5ed3c8bf276f9196a5fd90c7df928f76196fff0e1f5"}},{"ruleId":"D2","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.JobSteps (cognitive 27): SupplyChainProvenanceAnalyzer.JobSteps has cognitive complexity 27 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":2140}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4804f92a1919a980704d6a5d0d497c83448ba660357c201e36959a79daa1621"}},{"ruleId":"D2","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.ScopesEveryJob (cognitive 27): SupplyChainProvenanceAnalyzer.ScopesEveryJob has cognitive complexity 27 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":6179}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5c9fc8fd5867352babac5aa31a96d698cf5481dbeea87980a76543ba7f05b07"}},{"ruleId":"D2","level":"warning","message":{"text":"Branches.walk (cognitive 27): Branches.walk has cognitive complexity 27 (threshold 15). Drivers by points: loops 11 (12 pts), if/else 3 (6 pts), ternaries 3 (6 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/java-spoon/src/main/java/dev/canine/codehealth/java/Branches.java"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"b58cead3d10dbb606ba7fc4c0531809229c74b8e0f8f3cbf873141b2447a9775"}},{"ruleId":"D2","level":"warning","message":{"text":"render_dimension_noise.beeswarm (cognitive 27): render_dimension_noise.beeswarm has cognitive complexity 27 (threshold 15). Drivers by points: if/else 3 (13 pts), loops 4 (10 pts), ternaries 1 (3 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/depthnoise/render_dimension_noise.py"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"46c930c992e182b1e8d28e7251bd1fe77d16ee3b7dcc2019d1d09cd15ab8fa7c"}},{"ruleId":"D2","level":"warning","message":{"text":"render_dimension_noise.render (cognitive 27): render_dimension_noise.render has cognitive complexity 27 (threshold 15). Drivers by points: loops 9 (13 pts), if/else 6 (11 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/depthnoise/render_dimension_noise.py"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c8c5e055258cff94b6a8f8987337045b0e1c46c001f8e443fc73909a6d1a656"}},{"ruleId":"D2","level":"warning","message":{"text":"audit-rubrics.main (cognitive 27): audit-rubrics.main has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 5, loops 4, ternaries 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/audit-rubrics.py"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"5764357082777d5a2e633c7135419e37fad6c2bc6ff25ab7b6649b26acea1401"}},{"ruleId":"D2","level":"warning","message":{"text":"programme-status.stale_window_report (cognitive 27): programme-status.stale_window_report has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (16 pts), ternaries 2 (4 pts), boolean chains 3, error handling 1 (2 pts), loops 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/programme-status.py"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"d279f0de9ffe57b2c4ed4d0eee10a6d2670a2cd269bfc025b4afa59c23e2432c"}},{"ruleId":"D2","level":"warning","message":{"text":"programme-status.divergent_gold_report (cognitive 27): programme-status.divergent_gold_report has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 4, error handling 1 (2 pts), loops 2, ternaries 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/programme-status.py"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"44c03a5306ec47fe8a3c4b9c6b43e6a9b1646e4c56b33acab76b46e92ec33618"}},{"ruleId":"D2","level":"warning","message":{"text":"report_round.measure_dimensions (cognitive 27): report_round.measure_dimensions has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 10, 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":"tools/train/report_round.py"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc8ccf2b5ed67ac990546107aaa665fb2b357c399435d9c07483bb690fcc0466"}},{"ruleId":"D2","level":"warning","message":{"text":"sidecarlib.arm_status (cognitive 27): sidecarlib.arm_status has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (11 pts), error handling 4 (7 pts), boolean chains 5, loops 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/sidecarlib.py"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"246516a6a1474953426a5068c5ac784a6efb6904cc8f18c0b2f0f18d1aa74861"}},{"ruleId":"D2","level":"warning","message":{"text":"main.scanBodyText (cognitive 27): main.scanBodyText has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 6, loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/go/bodylines.go"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7427a27e7d790350d0aec577b2ece1a2ac44cb43e110203c4ec9cdc1d864fc1"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 27): (anonymous) has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 9, ternaries 3 (4 pts), error handling 1 (nesting depth added 3). Most of this is not in the body itself: 3 of the 27 points are its own statements and the rest belongs to 17 function items inside it that branch (wire::render, wire, wire::render::(anonymous), \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Kennel.Ui/wwwroot/kennel-ui.js"},"region":{"startLine":1810}}}],"partialFingerprints":{"codehealthFindingId/v1":"a44eb8e52fdf6efa3c5cc8f07b074a5b6991ec4131d33642899d07a276550681"}},{"ruleId":"D2","level":"warning","message":{"text":"SliceLocalityDetector.LocalityAsync (cognitive 26): SliceLocalityDetector.LocalityAsync has cognitive complexity 26 (threshold 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":"engine/src/CodeHealth.Core/Architecture/SliceLocalityDetector.cs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ffe4651306018d39cb41624858bbceffa3597d6c8c445a28aeb7ea81a56d3a6"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceClassifier.EnumerateEcosystemMarkers (cognitive 26): SourceClassifier.EnumerateEcosystemMarkers has cognitive complexity 26 (threshold 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":"engine/src/CodeHealth.Core/Classification/SourceClassifier.cs"},"region":{"startLine":3633}}}],"partialFingerprints":{"codehealthFindingId/v1":"708373cbd9a2d2c0cd91f925d111e750f843a544433e464cc16d5cfb1d64e41c"}},{"ruleId":"D2","level":"warning","message":{"text":"ChainedFamilyRollup.Append (cognitive 26): ChainedFamilyRollup.Append has cognitive complexity 26 (threshold 15). 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":"engine/src/CodeHealth.Core/CodeShape/ChainedFamilyRollup.cs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"14cca20bbbbbcb1de27646d4178c18b73d236a635a7a08a769ddd5838730d7d5"}},{"ruleId":"D2","level":"warning","message":{"text":"BundlerManifestHygiene.ReadLocks (cognitive 26): BundlerManifestHygiene.ReadLocks has cognitive complexity 26 (threshold 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":"engine/src/CodeHealth.Core/Dependencies/BundlerManifestHygiene.cs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"3185aeec3744f8f0783c26eb8638f8e6bfcefa21283393754e26f3f3d97ebe99"}},{"ruleId":"D2","level":"warning","message":{"text":"RoslynDeadCodeDetector.IsCandidate (cognitive 26): RoslynDeadCodeDetector.IsCandidate has cognitive complexity 26 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ExplicitDebt/RoslynDeadCodeDetector.cs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"f95259458f2a36df73fa761772dea1b475614f3c37002a7fd6e2b7862ab5e44b"}},{"ruleId":"D2","level":"warning","message":{"text":"ObsoleteSuppressionScopes.Build (cognitive 26): ObsoleteSuppressionScopes.Build has cognitive complexity 26 (threshold 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":"engine/src/CodeHealth.Core/ExplicitDebt/RoslynExplicitDebtCollector.cs"},"region":{"startLine":5720}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ad9e80730e778c7aa91fda37f05acb113f8d4ef2fecd7b1457e3be51f118087"}},{"ruleId":"D2","level":"warning","message":{"text":"RoslynExplicitDebtCollector.CollectVbInvertedNullGuards (cognitive 26): RoslynExplicitDebtCollector.CollectVbInvertedNullGuards has cognitive complexity 26 (threshold 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":"engine/src/CodeHealth.Core/ExplicitDebt/RoslynExplicitDebtCollector.Vb.cs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"2da2597686854e48c5fdf4359829b299756fcc0baadef00ac69cc02e063daafd"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendBoundaries.CollectTestSuiteDependencyViolations (cognitive 26): FrontendBoundaries.CollectTestSuiteDependencyViolations has cognitive complexity 26 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendBoundaries.cs"},"region":{"startLine":952}}}],"partialFingerprints":{"codehealthFindingId/v1":"54fdd5360cea5d1e78ba37b2a565b2232e924bb69e7136b889ff8135ec11f710"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendDependencyHygiene.IsDependencyUsed (cognitive 26): FrontendDependencyHygiene.IsDependencyUsed has cognitive complexity 26 (threshold 15). 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":"engine/src/CodeHealth.Core/Frontend/FrontendDependencyHygiene.cs"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"281746cdb8435980888725d147600672de60cae6722af7b87cd8032b704456c5"}},{"ruleId":"D2","level":"warning","message":{"text":"JsFunctionScanner.Scan (cognitive 26): JsFunctionScanner.Scan has cognitive complexity 26 (threshold 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":"engine/src/CodeHealth.Core/Frontend/JsFunctionScanner.cs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aa577d6f6077b6604ebad29ac7ab38808285d711cfc531beb65a7755bac119f"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleResolver.ResolveWorkspacePackage (cognitive 26): ModuleResolver.ResolveWorkspacePackage has cognitive complexity 26 (threshold 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":"engine/src/CodeHealth.Core/Frontend/ModuleResolver.cs"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b3b87d678b7e6c6b72a541a1dbcbf9a2bee48544da2c06817e56370d1264094"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleSyntaxScanner.ScanExportClause (cognitive 26): ModuleSyntaxScanner.ScanExportClause has cognitive complexity 26 (threshold 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":"engine/src/CodeHealth.Core/Frontend/ModuleSyntaxScanner.cs"},"region":{"startLine":868}}}],"partialFingerprints":{"codehealthFindingId/v1":"60e692cec0473fb74c8c5eee107c8bb3541aed73401298254c9835fbf1f8a4c4"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleSyntaxScanner.SelfDirectoryCompositionArg (cognitive 26): ModuleSyntaxScanner.SelfDirectoryCompositionArg has cognitive complexity 26 (threshold 15). 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":"engine/src/CodeHealth.Core/Frontend/ModuleSyntaxScanner.cs"},"region":{"startLine":1174}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ce5a71cd97b42f927b53ce73214cf5757af92261b8ea47613693c5007d03f9d"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleSyntaxScanner.PatternBindingNames (cognitive 26): ModuleSyntaxScanner.PatternBindingNames has cognitive complexity 26 (threshold 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":"engine/src/CodeHealth.Core/Frontend/ModuleSyntaxScanner.cs"},"region":{"startLine":2015}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3d5859fb45ecd0294e76a7a1776aa2087a4af5b94921dfa9f69fbd2abe01a11"}},{"ruleId":"D2","level":"warning","message":{"text":"AccessibilityAnalyzer.IsFocusForwardingOnly (cognitive 26): AccessibilityAnalyzer.IsFocusForwardingOnly has cognitive complexity 26 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs"},"region":{"startLine":8898}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ce0065dfd5a150fb902eff7bfb575a4a0b93b56691284a7f4abc6402639dba1"}},{"ruleId":"D2","level":"warning","message":{"text":"AccessibilityAnalyzer.NestingControlAncestor (cognitive 26): AccessibilityAnalyzer.NestingControlAncestor has cognitive complexity 26 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs"},"region":{"startLine":9306}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ce9ab6fe32ce63651fb29f2f0d795e0ff1ff447290561fb41c66c6eec39d5b2"}},{"ruleId":"D2","level":"warning","message":{"text":"CsprojReferenceGraph.Build (cognitive 26): CsprojReferenceGraph.Build has cognitive complexity 26 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/CsprojReferenceGraph.cs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"99789afd64ab8bec078c29480bbf9d5bbbb3754ca66950cd89c565cc77e62f17"}},{"ruleId":"D2","level":"warning","message":{"text":"DomainModelAnalyzer.PrimitiveDataClumps (cognitive 26): DomainModelAnalyzer.PrimitiveDataClumps has cognitive complexity 26 (threshold 15). Of this number, 24 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":"engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"8723fc638085ccde9bd7ad82c4b54be0a9d6b1147594d1fe6b1526c2ab205ad4"}},{"ruleId":"D2","level":"warning","message":{"text":"MutationIdempotencyAnalyzer.GatherRoslynAsync (cognitive 26): MutationIdempotencyAnalyzer.GatherRoslynAsync has cognitive complexity 26 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (MutationIdempotencyAnalyzer.GatherNeutralAsync) 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":"engine/src/CodeHealth.Core/ModelAware/MutationIdempotencyAnalyzer.cs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab6aa294ca3fac7ff1679d95ddc0edd96b6c8317d3ff16bcb4dfa6eba693cc8b"}},{"ruleId":"D2","level":"warning","message":{"text":"MutationIdempotencyAnalyzer.GatherNeutralAsync (cognitive 26): MutationIdempotencyAnalyzer.GatherNeutralAsync has cognitive complexity 26 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (MutationIdempotencyAnalyzer.GatherRoslynAsync) 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":"engine/src/CodeHealth.Core/ModelAware/MutationIdempotencyAnalyzer.cs"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"51e0ab6f5cf2fafe425f190d1994ffce79a1269e770c428e9c85ba0acde6b1bb"}},{"ruleId":"D2","level":"warning","message":{"text":"TestFrameworkDetector.Detect (cognitive 26): TestFrameworkDetector.Detect has cognitive complexity 26 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/RuntimeBoot/TestFrameworkDetector.cs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e79671cc55b799bf223d9c6c50a246ecb6d959e54e14fc15041b940222630c1"}},{"ruleId":"D2","level":"warning","message":{"text":"SupplyChainHygieneAnalyzer.Detect (cognitive 26): SupplyChainHygieneAnalyzer.Detect has cognitive complexity 26 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/SupplyChainHygieneAnalyzer.cs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ee36f3c5593cebeae101e3d44f54d4681d13b39f9a560380b901889675dd0c7"}},{"ruleId":"D2","level":"warning","message":{"text":"ChangelogNarrator.SemanticDedupeAsync (cognitive 26): ChangelogNarrator.SemanticDedupeAsync has cognitive complexity 26 (threshold 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":"engine/src/CodeHealth.Reporting/Changelog/ChangelogNarrator.cs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c8d692777fe2a3a2a411b961b7ccb1c77703aeace4392b9e11791e5361b2c28"}},{"ruleId":"D2","level":"warning","message":{"text":"BrowserSandboxDisabledScan.SedInPlaceOperands (cognitive 26): BrowserSandboxDisabledScan.SedInPlaceOperands has cognitive complexity 26 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/BrowserSandboxDisabledScan.cs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcc21033ba31f10d9ea1c6378766b45dfc31d78bba7e69ff022f07a6d48a08b8"}},{"ruleId":"D2","level":"warning","message":{"text":"CommittedSecretManifestScan.CommittedCredentialEntries (cognitive 26): CommittedSecretManifestScan.CommittedCredentialEntries has cognitive complexity 26 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/CommittedSecretManifestScan.cs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ba936564f05a7148bdf99befa729be6e429795e8fb3e2c72dd8fe88a8f2ee7e"}},{"ruleId":"D2","level":"warning","message":{"text":"SemgrepUnsafeAdvice.DoesArithmeticOnAUintptr (cognitive 26): SemgrepUnsafeAdvice.DoesArithmeticOnAUintptr has cognitive complexity 26 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/SemgrepUnsafeAdvice.cs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ef07bd33e61cee0dbe601bda62aa83255c465f5345ddc6da131dddcb12046a0"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkflowInputGateRecheck.NeedsOf (cognitive 26): WorkflowInputGateRecheck.NeedsOf has cognitive complexity 26 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/WorkflowInputGateRecheck.cs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d2caca0858ca342e8ec66ce58f804359a30c1530ea61508b0e69e8b52e5634a"}},{"ruleId":"D2","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.SigningAdvice (cognitive 26): SupplyChainProvenanceAnalyzer.SigningAdvice has cognitive complexity 26 (threshold 15). 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: 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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":3448}}}],"partialFingerprints":{"codehealthFindingId/v1":"201b5ab0948dccf1d93f5faaf83c74350d1dc51389e8a6d11b9a9da30d20f06d"}},{"ruleId":"D2","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.PrTestStepSecretBindings (cognitive 26): SupplyChainProvenanceAnalyzer.PrTestStepSecretBindings has cognitive complexity 26 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":6789}}}],"partialFingerprints":{"codehealthFindingId/v1":"2419a0c6b92c4e672524148dccdeecc53f921faec15e2dcf564ebd920e41dc2e"}},{"ruleId":"D2","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.ManifestDeclaredScripts (cognitive 26): SupplyChainProvenanceAnalyzer.ManifestDeclaredScripts has cognitive complexity 26 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.PackagingReach.cs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"89ffde190e14cb3650c0e495876acd293a5ebb55da70a877e23d98e3eee52f4b"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenAiCompatibleLlmProvider.CompleteAsync (cognitive 26): OpenAiCompatibleLlmProvider.CompleteAsync has cognitive complexity 26 (threshold 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":"engine/src/CodeHealth.Llm.OpenAiCompatible/OpenAiCompatibleLlmProvider.cs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"3183a07fb54815126e7ee5aa8319507ea7390dd8a0c94a28fc115cf1dd2f4328"}},{"ruleId":"D2","level":"warning","message":{"text":"BodyEmit.forBody (cognitive 26): BodyEmit.forBody has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (16 pts), match/switch 5 (6 pts), boolean chains 4 (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":"engine/sidecars/scala-frontend/src/main/scala/dev/canine/codehealth/scala/BodyEmit.scala"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"497d77303c504a8992d65bf5ad1816b56e5c3bc741c47f1e151c9da04a248d4f"}},{"ruleId":"D2","level":"warning","message":{"text":"main.field_members (cognitive 26): main.field_members has cognitive complexity 26 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 4 (8 pts), boolean chains 3, ternaries 1 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/python-frontend/main.py"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5a16740a0d733feb2f5ce7437cd7cc0b998a49c138d84b949a89a86a214e35f"}},{"ruleId":"D2","level":"warning","message":{"text":"render_depth_noise.render (cognitive 26): render_depth_noise.render has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 5 (7 pts), ternaries 2 (4 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":"tools/depthnoise/render_depth_noise.py"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdb5ac2e76ae45747eee984348817ccd8878505ca399d103c7b005fd2041c780"}},{"ruleId":"D2","level":"warning","message":{"text":"quality.main (cognitive 26): quality.main has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 6, loops 6, ternaries 3 (6 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/llm-bakeoff/quality.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"932760e485b8bb352c2674509e58ebcae37a871344bcc0cbb40345ffa70bd736"}},{"ruleId":"D2","level":"warning","message":{"text":"diff.compare (cognitive 26): diff.compare has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 9, loops 4 (6 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/rescan/diff.py"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"e774f6884640cb54b945d04b8b88d2b795c710126b2b123e4be1e73ca1c2e9dc"}},{"ruleId":"D2","level":"warning","message":{"text":"holdout-draw.main (cognitive 26): holdout-draw.main has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 6 (7 pts), boolean chains 2, error handling 1 (2 pts), ternaries 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":"tools/train/holdout-draw.py"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a817022bb30893e590b4753d8cc93cc7de005a62a15a19516020ccde77e1fd6"}},{"ruleId":"D2","level":"warning","message":{"text":"judge-validation-status.coverage_states (cognitive 26): judge-validation-status.coverage_states has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 4 (7 pts), ternaries 3 (6 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/judge-validation-status.py"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"33ceb73639d27adc5eb450850a5d50938007d02018084c85f0a5a173412c0b79"}},{"ruleId":"D2","level":"warning","message":{"text":"judge-with-tools.judge_one (cognitive 26): judge-with-tools.judge_one has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 3 (4 pts), boolean chains 3 (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":"tools/train/judge-with-tools.py"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"66a46fd8d9e718b16115fb04087f33c681e677462e27d3a70559060743a84253"}},{"ruleId":"D2","level":"warning","message":{"text":"seed-backlog.main (cognitive 26): seed-backlog.main has cognitive complexity 26 (threshold 15). Drivers by points: loops 6 (13 pts), if/else 4 (7 pts), ternaries 4 (5 pts), boolean chains 1 (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":"tools/train/seed-backlog.py"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4c6fa85eacfcaa18327c08348e4cd4e6923d6eb3a8bdc5f91ceb0db1f1cb5c6"}},{"ruleId":"D2","level":"warning","message":{"text":"ApiSurfaceExtractor.ScanControllerMethods (cognitive 25): ApiSurfaceExtractor.ScanControllerMethods has cognitive complexity 25 (threshold 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":"engine/src/CodeHealth.Core/ApiSurface/ApiSurfaceExtractor.cs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8e99a098eb1c274634363b88c792163974b4e846241d8cbaf67cbd16d2afe00"}},{"ruleId":"D2","level":"warning","message":{"text":"SliceLocalityDetector.LocalityAsync (cognitive 25): SliceLocalityDetector.LocalityAsync has cognitive complexity 25 (threshold 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":"engine/src/CodeHealth.Core/Architecture/SliceLocalityDetector.cs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"faeb1585a095234913a521093da8a2df6d5d7e928227db9baf0f3f20dcc4df8f"}},{"ruleId":"D2","level":"warning","message":{"text":"RoslynDuplicationDetector.IsSelfContainedTestSupportModule (cognitive 25): RoslynDuplicationDetector.IsSelfContainedTestSupportModule has cognitive complexity 25 (threshold 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":"engine/src/CodeHealth.Core/CodeShape/RoslynDuplicationDetector.cs"},"region":{"startLine":3021}}}],"partialFingerprints":{"codehealthFindingId/v1":"206164bfaf0aefaf71b394f2f48f2ebbc34cfad7082a070f9ee57304bfe93c4c"}},{"ruleId":"D2","level":"warning","message":{"text":"DartDeadLibraryField.IsFieldDeclaration (cognitive 25): DartDeadLibraryField.IsFieldDeclaration has cognitive complexity 25 (threshold 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":"engine/src/CodeHealth.Core/Dart/DartDeadLibraryField.cs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa9bb2156adfe90205198aa6f46b2a8065444210ed17816d152a3bb68273fba1"}},{"ruleId":"D2","level":"warning","message":{"text":"SwiftPackageHygiene.StripComments (cognitive 25): SwiftPackageHygiene.StripComments has cognitive complexity 25 (threshold 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":"engine/src/CodeHealth.Core/Dependencies/SwiftPackageHygiene.cs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"fceed43fa6e786b3c88b77ac7dc8edaac5739ed6effa885518263c1bfd7a93eb"}},{"ruleId":"D2","level":"warning","message":{"text":"AdrDetector.ReadNavigationConfigs (cognitive 25): AdrDetector.ReadNavigationConfigs has cognitive complexity 25 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Docs/AdrDetector.cs"},"region":{"startLine":1028}}}],"partialFingerprints":{"codehealthFindingId/v1":"3198a9ba381e3992401f7391d48c4ff06415167d4631a8ddd217a27b159ee779"}},{"ruleId":"D2","level":"warning","message":{"text":"RoslynCommentSampler.SampleAsync (cognitive 25): RoslynCommentSampler.SampleAsync has cognitive complexity 25 (threshold 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":"engine/src/CodeHealth.Core/Docs/CommentSampler.cs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dccdf9f22eb56891f7f2aa51e6769ccd29330f38cbb5645b1d7a3a1eb2eff2b"}},{"ruleId":"D2","level":"warning","message":{"text":"RoslynExplicitDebtCollector.CollectDeadLoopAccumulators (cognitive 25): RoslynExplicitDebtCollector.CollectDeadLoopAccumulators has cognitive complexity 25 (threshold 15). Of this number, 24 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":"engine/src/CodeHealth.Core/ExplicitDebt/RoslynExplicitDebtCollector.cs"},"region":{"startLine":1190}}}],"partialFingerprints":{"codehealthFindingId/v1":"592e3358cfe1d7db4b2d8ad7034bc4e44d2ddbb477a7e6d80d807a929669eea3"}},{"ruleId":"D2","level":"warning","message":{"text":"RoslynExplicitDebtCollector.DepictedAssignmentLines (cognitive 25): RoslynExplicitDebtCollector.DepictedAssignmentLines has cognitive complexity 25 (threshold 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":"engine/src/CodeHealth.Core/ExplicitDebt/RoslynExplicitDebtCollector.cs"},"region":{"startLine":2674}}}],"partialFingerprints":{"codehealthFindingId/v1":"f396fdb01b324775b514b2456e0951272f7d403419ed0be0380e465ab28a8dc5"}},{"ruleId":"D2","level":"warning","message":{"text":"UpstreamAttribution.HeaderBanner (cognitive 25): UpstreamAttribution.HeaderBanner has cognitive complexity 25 (threshold 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":"engine/src/CodeHealth.Core/FileQuality/UpstreamAttribution.cs"},"region":{"startLine":1803}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a75615880aef25b255de68a35a1a9429692eb6cc220b063ac176c8b10c3213b"}},{"ruleId":"D2","level":"warning","message":{"text":"BuildOutputSources.FromManifestDeclaredOutputDirectory (cognitive 25): BuildOutputSources.FromManifestDeclaredOutputDirectory has cognitive complexity 25 (threshold 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":"engine/src/CodeHealth.Core/Frontend/BuildOutputSources.cs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed9a9c1f13f77d60440ec7806fd33e7423a277f3df34b4891167a25acd47f670"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendDeadCode.FindUnregisteredContributions (cognitive 25): FrontendDeadCode.FindUnregisteredContributions has cognitive complexity 25 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendDeadCode.cs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae9c0c29b89b969ddd403b8f58a64ee43117cdb433fb1d48f6e3a60c40eb2276"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendEngineDimensions.SiblingFamilyFindings (cognitive 25): FrontendEngineDimensions.SiblingFamilyFindings has cognitive complexity 25 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 8 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/FrontendEngineDimensions.cs"},"region":{"startLine":1357}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f3428f5c5577f56713192f97c78883d160f1025213839d91680d20abdfd1427"}},{"ruleId":"D2","level":"warning","message":{"text":"Scanner.ScanTemplateChunk (cognitive 25): Scanner.ScanTemplateChunk has cognitive complexity 25 (threshold 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":"engine/src/CodeHealth.Core/Frontend/JsLexer.cs"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"84e85e83c1f5785681528dfb9cc034c14bc369f14c7bcef9a109f45a5f51a888"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleSyntaxScanner.SkipReturnTypeAnnotation (cognitive 25): ModuleSyntaxScanner.SkipReturnTypeAnnotation has cognitive complexity 25 (threshold 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":"engine/src/CodeHealth.Core/Frontend/ModuleSyntaxScanner.cs"},"region":{"startLine":1568}}}],"partialFingerprints":{"codehealthFindingId/v1":"c45f5cc34cd2fe0148b1ae4234e2424754993e960371c652f986d42b0571cb0d"}},{"ruleId":"D2","level":"warning","message":{"text":"CoherenceSmellAnalyzer.AnalyzeAsync (cognitive 25): CoherenceSmellAnalyzer.AnalyzeAsync has cognitive complexity 25 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/CoherenceSmellAnalyzer.cs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6a18902d0452afba5fe320bb1009798349bcecce0fab40bae2b5267ed1d8be1"}},{"ruleId":"D2","level":"warning","message":{"text":"DomainConventions.IsDomainEvent (cognitive 25): DomainConventions.IsDomainEvent has cognitive complexity 25 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/DomainConventions.cs"},"region":{"startLine":1040}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e8a59caafca655b3fc43d48d413218693041fabd8cb438af8deb80e8cd2bf25"}},{"ruleId":"D2","level":"warning","message":{"text":"EventSourcingAnalyzer.AnalyzeAsync (cognitive 25): EventSourcingAnalyzer.AnalyzeAsync has cognitive complexity 25 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/EventSourcingAnalyzer.cs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eaf8a23f22df65787995545ee3e4e6984fb00a74b328719c520c4650d675d21"}},{"ruleId":"D2","level":"warning","message":{"text":"MarkupTaintPass.IsTainted (cognitive 25): MarkupTaintPass.IsTainted has cognitive complexity 25 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/MarkupTaintPass.cs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"8be9f80d50d775a38442f06eec918cf53f55795565367884778f79f0bf0a7d4e"}},{"ruleId":"D2","level":"warning","message":{"text":"DomainComplexityClassifier.Classify (cognitive 25): DomainComplexityClassifier.Classify has cognitive complexity 25 (threshold 15). 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":"engine/src/CodeHealth.Core/Scoring/DomainComplexity.cs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"d60501d7642bcf8f8ab5d65e799588ffd819cd8cdd86ea260f6178cc82b5dcfb"}},{"ruleId":"D2","level":"warning","message":{"text":"CompileExcludedTestFiles.Scan (cognitive 25): CompileExcludedTestFiles.Scan has cognitive complexity 25 (threshold 15). 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":"engine/src/CodeHealth.Core/Testing/CompileExcludedTestFiles.cs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4410d0f0f9f9651b1df6014ea4eaec28986e268a19deac6a0536fa5da21a75f"}},{"ruleId":"D2","level":"warning","message":{"text":"DuplicationAnalyzer.IndexShardParents (cognitive 25): DuplicationAnalyzer.IndexShardParents has cognitive complexity 25 (threshold 15). Of this number, 24 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":"engine/src/CodeHealth.Dimensions.CodeQuality/CodeShape/DuplicationAnalyzer.cs"},"region":{"startLine":1266}}}],"partialFingerprints":{"codehealthFindingId/v1":"49914739ceb7db0bbe4e8b03499c6dac5bf683bc8597e2164072c537551a0559"}},{"ruleId":"D2","level":"warning","message":{"text":"GodClassAnalyzer.AbsorbModuleRowsIntoFileRows (cognitive 25): GodClassAnalyzer.AbsorbModuleRowsIntoFileRows has cognitive complexity 25 (threshold 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":"engine/src/CodeHealth.Dimensions.CodeQuality/CodeShape/GodClassAnalyzer.cs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"f715d08280161a0629d6289b5fe6325d500226d5a484ae7104678d919074ca23"}},{"ruleId":"D2","level":"warning","message":{"text":"BuildTimeKeyMaterialScan.WorldReadable (cognitive 25): BuildTimeKeyMaterialScan.WorldReadable has cognitive complexity 25 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/BuildTimeKeyMaterialScan.cs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bea2b3f2b9940dfb8875d7465fe0eaae0e9b08e7dc1dc58d3af8d2692644b80"}},{"ruleId":"D2","level":"warning","message":{"text":"CsrfProtectionRecheck.AnIncludedConcernProtects (cognitive 25): CsrfProtectionRecheck.AnIncludedConcernProtects has cognitive complexity 25 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/CsrfProtectionRecheck.cs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc41320e69898af542e0231936e111797acd474d87b82af090564388c0cc21c8"}},{"ruleId":"D2","level":"warning","message":{"text":"DeclaredDependencies.ParseCargoToml (cognitive 25): DeclaredDependencies.ParseCargoToml has cognitive complexity 25 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/DeclaredDependencies.cs"},"region":{"startLine":1614}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc937d711c2d0bb425e3fd77009d59284f2e4f390d981d9eda5965385ecc507f"}},{"ruleId":"D2","level":"warning","message":{"text":"GoModuleContextRechecks.EnclosingGoModulePaths (cognitive 25): GoModuleContextRechecks.EnclosingGoModulePaths has cognitive complexity 25 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/GoModuleContextRechecks.cs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aa0ab6480978623e10023c94802b4fb0fe92e0e351f8fe834be06487c649958"}},{"ruleId":"D2","level":"warning","message":{"text":"JsSiblingScopeReadScan.ParameterListSpans (cognitive 25): JsSiblingScopeReadScan.ParameterListSpans has cognitive complexity 25 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/JsSiblingScopeReadScan.cs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"99ce62ddfc45057e28daa8648d5c60e537da9ce19b3fca2fec6afa6331715a32"}},{"ruleId":"D2","level":"warning","message":{"text":"NpmLockGraph.DeclaredEntryAbove (cognitive 25): NpmLockGraph.DeclaredEntryAbove has cognitive complexity 25 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/NpmLockGraph.cs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"c47a7e4356862fb6b4f8a75c28dc8e8f840dd5f2265b25cd17a2449cf1df6d6a"}},{"ruleId":"D2","level":"warning","message":{"text":"SocketAndUpgradeRecheck.NotGorillaUpgradeCall (cognitive 25): SocketAndUpgradeRecheck.NotGorillaUpgradeCall has cognitive complexity 25 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/SocketAndUpgradeRecheck.cs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ccea86f7bb206e2617ada35f0a1bb745151f0c9e56f197659bbaee54181740f"}},{"ruleId":"D2","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.LocatePublishCommand (cognitive 25): SupplyChainProvenanceAnalyzer.LocatePublishCommand has cognitive complexity 25 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.PublishTrigger.cs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a498af4a8b7cb6d66e88409be82de079b4561fea66eefc103528e4d8e2d1408"}},{"ruleId":"D2","level":"warning","message":{"text":"LlmAdrConformanceChecker.CheckAsync (cognitive 25): LlmAdrConformanceChecker.CheckAsync has cognitive complexity 25 (threshold 15). Most of this is not in the body itself: 5 of the 25 points are its own statements and the rest belongs to one function literal inside it that branches (line 37). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Docs/Llm/LlmAdrConformanceChecker.cs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb93f695f0662d5221d1d49c8e4ae30a7ed89504465b4a882b85a4c990b9604f"}},{"ruleId":"D2","level":"warning","message":{"text":"FSharpBody.strippedText (cognitive 25): FSharpBody.strippedText has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3 (10 pts), boolean chains 4 (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":"engine/src/CodeHealth.CodeModel.FSharp/Body.fs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"11b7b623e82fadf4318c7fb0f134f8cb62c45c9e63da9abb6b2a0c57894022c6"}},{"ruleId":"D2","level":"warning","message":{"text":"Emitter.emitType (cognitive 25): Emitter.emitType has cognitive complexity 25 (threshold 15). Drivers by points: if/else 18, boolean chains 6, match/switch 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/scala-frontend/src/main/scala/dev/canine/codehealth/scala/Emitter.scala"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b90ee0bc9c128ff62e20d875e0c7eae41112c59687bc3b458eef6df2e283471"}},{"ruleId":"D2","level":"warning","message":{"text":"expand_corpus.discover_language (cognitive 25): expand_corpus.discover_language has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (17 pts), loops 3 (6 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":"tools/multilang/expand_corpus.py"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"45fb5acd461305be4c476da1d64632972db9e064a60bfb8567dceff78a832250"}},{"ruleId":"D2","level":"warning","message":{"text":"judge-calibration.ask (cognitive 25): judge-calibration.ask has cognitive complexity 25 (threshold 15). Drivers by points: if/else 4 (9 pts), boolean chains 7, ternaries 1 (4 pts), loops 2 (3 pts), error handling 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/judge-calibration.py"},"region":{"startLine":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"47fc84e49472f41347206a88c58347e0c1a2a78c1fe4233dfad82dbeece3c391"}},{"ruleId":"D2","level":"warning","message":{"text":"codehealth_rust_sidecar::cfg_test_declared_module_files (cognitive 25): codehealth_rust_sidecar::cfg_test_declared_module_files has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 4 (10 pts), if/else 3 (8 pts), loops 3 (6 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":"engine/sidecars/rust-frontend/src/main.rs"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"070567b22c7b741c3ccee04504161b9147a2e52600bf6d1e011582174a2e24a2"}},{"ruleId":"D2","level":"warning","message":{"text":"ApiSurfaceExtractor.FindFollowingMethodName (cognitive 24): ApiSurfaceExtractor.FindFollowingMethodName has cognitive complexity 24 (threshold 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":"engine/src/CodeHealth.Core/ApiSurface/ApiSurfaceExtractor.cs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd98a2be03aa7e71d248e9b0d01d584a09413a0dcc37187a9aadc4d3789ef379"}},{"ruleId":"D2","level":"warning","message":{"text":"ArchitectureMapBuilder.ReferencedNamedTypes (cognitive 24): ArchitectureMapBuilder.ReferencedNamedTypes has cognitive complexity 24 (threshold 15). 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":"engine/src/CodeHealth.Core/Architecture/ArchitectureMapBuilder.cs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cb9f4c093e82bac9bf0077612b373ef73183ff118ed4289a693d8d6c683c208"}},{"ruleId":"D2","level":"warning","message":{"text":"ComplianceSecurityAnalyzer.ScanOptInGates (cognitive 24): ComplianceSecurityAnalyzer.ScanOptInGates has cognitive complexity 24 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent 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":"engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs"},"region":{"startLine":3858}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8d22685de10af26ee02ec8eef799e001da418acbf7eaf77e086474c60e1a49a"}},{"ruleId":"D2","level":"warning","message":{"text":"PiiDataMapAnalyzer.AnalyzeAsync (cognitive 24): PiiDataMapAnalyzer.AnalyzeAsync has cognitive complexity 24 (threshold 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":"engine/src/CodeHealth.Core/Compliance/PiiDataMap.cs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecddf1cb74ca0f7b5540a89d3e323e9e63678161dd56e210466c25731ab598b2"}},{"ruleId":"D2","level":"warning","message":{"text":"GeneratedCodePolicy.ParseFlutterL10n (cognitive 24): GeneratedCodePolicy.ParseFlutterL10n has cognitive complexity 24 (threshold 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":"engine/src/CodeHealth.Core/FileQuality/GeneratedCodePolicy.cs"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"72630264e2ec044b3023b4271c9e2d101b43ac0c78ddc5e0fe3a66865949c8dd"}},{"ruleId":"D2","level":"warning","message":{"text":"AmbientDeclarationFile.IsAmbientDeclarationFile (cognitive 24): AmbientDeclarationFile.IsAmbientDeclarationFile has cognitive complexity 24 (threshold 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":"engine/src/CodeHealth.Core/Frontend/AmbientDeclarationFile.cs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"a01260d5f95b0b0c3f6c8bff73fa27b67db003fa88a4e6d4f8cef577d968654e"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendDeadCode.LiveTwinOf (cognitive 24): FrontendDeadCode.LiveTwinOf has cognitive complexity 24 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendDeadCode.cs"},"region":{"startLine":1608}}}],"partialFingerprints":{"codehealthFindingId/v1":"aec5aa6980c03fde50105d3746cc3b9318fdf1a120a8d58a541a39f1336cd784"}},{"ruleId":"D2","level":"warning","message":{"text":"ExportUsageSolver.CollectReExports (cognitive 24): ExportUsageSolver.CollectReExports has cognitive complexity 24 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/FrontendDeadCode.cs"},"region":{"startLine":2143}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecd20e88c3a06bdb939f11daffc5e662ef35968658a914ac46af7e2ad67dd17c"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendScriptCommandRefs.CollectLockfilePeerContractsIn (cognitive 24): FrontendScriptCommandRefs.CollectLockfilePeerContractsIn has cognitive complexity 24 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendScriptCommandRefs.cs"},"region":{"startLine":866}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2589af7f890fae4cbd857c2509d219fd717199ba09d525d353066d9d571d91c"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendSpecifierScanning.FindsSpecifierInImportPosition (cognitive 24): FrontendSpecifierScanning.FindsSpecifierInImportPosition has cognitive complexity 24 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendSpecifierScanning.cs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ea83e0795ab0f837d014a1cccfe03e13c84aab0193fef7edee9f6e6412dd980"}},{"ruleId":"D2","level":"warning","message":{"text":"JsDuplicationDetector.SnapStraddlingExtentsToMembers (cognitive 24): JsDuplicationDetector.SnapStraddlingExtentsToMembers has cognitive complexity 24 (threshold 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":"engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs"},"region":{"startLine":3260}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a490f1acc711cacec44049b0c5e4e0d7b7021a0bf98917d97e66ecf163e6aaa"}},{"ruleId":"D2","level":"warning","message":{"text":"JsFunctionScanner.FindBodyOpen (cognitive 24): JsFunctionScanner.FindBodyOpen has cognitive complexity 24 (threshold 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":"engine/src/CodeHealth.Core/Frontend/JsFunctionScanner.cs"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"68fba2af50285b53c169b113dfc94d63de17343fc92c876b648bcb9202f733d1"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleResolver.TryResolveExports (cognitive 24): ModuleResolver.TryResolveExports has cognitive complexity 24 (threshold 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":"engine/src/CodeHealth.Core/Frontend/ModuleResolver.cs"},"region":{"startLine":1016}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c156e8645e5071d71c085d6a7aa023ff00122474e265da570deeb55b40f0702"}},{"ruleId":"D2","level":"warning","message":{"text":"PlatformSubstitutionTable.From (cognitive 24): PlatformSubstitutionTable.From has cognitive complexity 24 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent 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":"engine/src/CodeHealth.Core/Frontend/PlatformSubstitutionTable.cs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"a54ec55b0a29870b2df05072fdbaf358405b2c9e2e414650666d7d8f03b8043b"}},{"ruleId":"D2","level":"warning","message":{"text":"SfcScriptExtractor.AttributesIndicateTypeScript (cognitive 24): SfcScriptExtractor.AttributesIndicateTypeScript has cognitive complexity 24 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/SfcScriptExtractor.cs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea7afb1746b8c82e310a915240a07ed5a536e9d90c4e9e0ecf9d7b8445f01f3a"}},{"ruleId":"D2","level":"warning","message":{"text":"TokenAlignment.MatchingBlocks (cognitive 24): TokenAlignment.MatchingBlocks has cognitive complexity 24 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/TokenAlignment.cs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"37ddb4fb6ca8d3d7c9e728a2aecf9b52050ef26983b2889c96e9c150e03822be"}},{"ruleId":"D2","level":"warning","message":{"text":"AccessibilityAnalyzer.PageStructureElement (cognitive 24): AccessibilityAnalyzer.PageStructureElement has cognitive complexity 24 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs"},"region":{"startLine":3254}}}],"partialFingerprints":{"codehealthFindingId/v1":"0046caf5de33c599ac5337dde3b0107757dc95780d98b7f1ffe158ffc1fdb7a1"}},{"ruleId":"D2","level":"warning","message":{"text":"AccessibilityAnalyzer.CollectCssHiddenClasses (cognitive 24): AccessibilityAnalyzer.CollectCssHiddenClasses has cognitive complexity 24 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent 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":"engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs"},"region":{"startLine":5425}}}],"partialFingerprints":{"codehealthFindingId/v1":"c42134687cf030e16255aa48902c2b737582d6d0c9a19c976c0b4572826ba711"}},{"ruleId":"D2","level":"warning","message":{"text":"DomainConventions.IsValueObject (cognitive 24): DomainConventions.IsValueObject has cognitive complexity 24 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, 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":"engine/src/CodeHealth.Core/ModelAware/DomainConventions.cs"},"region":{"startLine":1177}}}],"partialFingerprints":{"codehealthFindingId/v1":"516efc37b97d652a5ea23b501ac1b03373caf47c1b5e5d1a59d34089b3777f45"}},{"ruleId":"D2","level":"warning","message":{"text":"DomainModelAnalyzer.StronglyTypedIds (cognitive 24): DomainModelAnalyzer.StronglyTypedIds has cognitive complexity 24 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 3 belong to 2 function literals inside it that branch. To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs"},"region":{"startLine":2156}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e24981d49baf18bd2ce7e0b0d2c020d789fff89835749569de2ea5153ce8fcc"}},{"ruleId":"D2","level":"warning","message":{"text":"EventDrivenAnalyzer.MessageTypesHandledBy (cognitive 24): EventDrivenAnalyzer.MessageTypesHandledBy has cognitive complexity 24 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent 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":"engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3727252123a4548c5fa409f5ab52df21059a6a176c7d860d9b723bfd1cf0655"}},{"ruleId":"D2","level":"warning","message":{"text":"EventSourcingAnalyzer.ImmutableEvents (cognitive 24): EventSourcingAnalyzer.ImmutableEvents has cognitive complexity 24 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/EventSourcingAnalyzer.cs"},"region":{"startLine":1007}}}],"partialFingerprints":{"codehealthFindingId/v1":"21bcce7cb98b05d888808079bc7b8aaef34d7296c0a0e038e05401276507b4aa"}},{"ruleId":"D2","level":"warning","message":{"text":"IncompletenessAnalyzer.ReturnsInterfaceDeclaredNullSentinel (cognitive 24): IncompletenessAnalyzer.ReturnsInterfaceDeclaredNullSentinel has cognitive complexity 24 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/IncompletenessAnalyzer.cs"},"region":{"startLine":2315}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e74972ded6d2a5b5b6a4312b275602d5ea3a4224d61360c7e5a0fc7d9db7f04"}},{"ruleId":"D2","level":"warning","message":{"text":"IncompletenessAnalyzer.UsageBannerCommentLines (cognitive 24): IncompletenessAnalyzer.UsageBannerCommentLines has cognitive complexity 24 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/IncompletenessAnalyzer.cs"},"region":{"startLine":3683}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b35d42983cfa04dbe0cb7780b575f9f84e5396291024c2c80c4e63824d5c13c"}},{"ruleId":"D2","level":"warning","message":{"text":"IncompletenessAnalyzer.ApplyOneHopReachabilityAsync (cognitive 24): IncompletenessAnalyzer.ApplyOneHopReachabilityAsync has cognitive complexity 24 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/IncompletenessAnalyzer.cs"},"region":{"startLine":4645}}}],"partialFingerprints":{"codehealthFindingId/v1":"a096abe70e3656c8cea1c60a7470f7a38b0f4c52edc58efccad35286a95d8331"}},{"ruleId":"D2","level":"warning","message":{"text":"RepoProfiler.DetectEventSourcing (cognitive 24): RepoProfiler.DetectEventSourcing has cognitive complexity 24 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 3 belong to 3 function literals inside it that branch. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/RepoProfiler.cs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a512083cf4884b4127aa278b00540b21d08f781527dc766e9b47700a87c05b9"}},{"ruleId":"D2","level":"warning","message":{"text":"StringContractSmellAnalyzer.Collect (cognitive 24): StringContractSmellAnalyzer.Collect has cognitive complexity 24 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/StringContractSmellAnalyzer.cs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"abc75c677b1d0bb74988d3e6abc0399555b0f9463b5d6246503762add8b5399b"}},{"ruleId":"D2","level":"warning","message":{"text":"SupplyChainHygieneAnalyzer.DeclaresGoDependencies (cognitive 24): SupplyChainHygieneAnalyzer.DeclaresGoDependencies has cognitive complexity 24 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/SupplyChainHygieneAnalyzer.cs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"59be1f2cb0493337b6db08baeeb8d06213502c80e3584a2b99dd715b2b8c83da"}},{"ruleId":"D2","level":"warning","message":{"text":"SupplyChainHygieneAnalyzer.BuildCard (cognitive 24): SupplyChainHygieneAnalyzer.BuildCard has cognitive complexity 24 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/SupplyChainHygieneAnalyzer.cs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9f9cb63d38e7934eb68c10d3b48ffd63592344e4782ea77440293f8f3b5b1bc"}},{"ruleId":"D2","level":"warning","message":{"text":"DeterministicNamingSampler.SampleAsync (cognitive 24): DeterministicNamingSampler.SampleAsync has cognitive complexity 24 (threshold 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":"engine/src/CodeHealth.Core/Naming/DeterministicNamingSampler.cs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b67a4f8cef5acf5c657cf6c646fbfae366e74a43280b61c4869a6b92de2b252"}},{"ruleId":"D2","level":"warning","message":{"text":"DotnetProjectLicensesCollector.NuGetFallbackAsync (cognitive 24): DotnetProjectLicensesCollector.NuGetFallbackAsync has cognitive complexity 24 (threshold 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":"engine/src/CodeHealth.Core/Security/DotnetProjectLicensesCollector.cs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3c8f052ac530e01ce14a520aef2deaaa1164de56cbdf790271bed111dc86d28"}},{"ruleId":"D2","level":"warning","message":{"text":"JsTestQualityCensus.DeclarationBody (cognitive 24): JsTestQualityCensus.DeclarationBody has cognitive complexity 24 (threshold 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":"engine/src/CodeHealth.Core/Testing/JsTestQualityCensus.cs"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9816c4b69304e44a95d9a25e492721f91f7f0303c40b7f3f3f24098f7f907d0"}},{"ruleId":"D2","level":"warning","message":{"text":"DsmHtml.AppendDetails (cognitive 24): DsmHtml.AppendDetails has cognitive complexity 24 (threshold 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":"engine/src/CodeHealth.Reporting/Architecture/DsmHtml.cs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"053e21644145ef58b20210b33365e30c1b0284200399b718f2b417fdccf90a8f"}},{"ruleId":"D2","level":"warning","message":{"text":"ChangeSetBuilder.MergeCommitSubsetShadows (cognitive 24): ChangeSetBuilder.MergeCommitSubsetShadows has cognitive complexity 24 (threshold 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":"engine/src/CodeHealth.Reporting/Changelog/Fusion/ChangeSetBuilder.cs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"4010c97f3953b227e543cf1597e0df6a635315c846b7f1bb21f1f6c33cb3076c"}},{"ruleId":"D2","level":"warning","message":{"text":"EngineeringReportRenderer.RenderMarkdown (cognitive 24): EngineeringReportRenderer.RenderMarkdown has cognitive complexity 24 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 3 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Reporting/Engineering/EngineeringReportRenderer.cs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"5321fdbe5bc3d74fa22d89465fd11e55b1dd9f2843d2ce7cc1f4aa8426964294"}},{"ruleId":"D2","level":"warning","message":{"text":"DsmSvg.Render (cognitive 24): DsmSvg.Render has cognitive complexity 24 (threshold 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":"engine/src/CodeHealth.Reporting/Svg/DsmSvg.cs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee4bf9e67faeb878ddd87888e12910911e77091923fbe57e7a0cc8ccefcedb12"}},{"ruleId":"D2","level":"warning","message":{"text":"ReportViewModelFactory.BuildNewSinceLast (cognitive 24): ReportViewModelFactory.BuildNewSinceLast has cognitive complexity 24 (threshold 15). 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":"engine/src/CodeHealth.Reporting/Templates/ReportViewModelFactory.cs"},"region":{"startLine":1352}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c3f47ecb9d59c279a9daa832ccc6ccc58ede8fd44f40e66bde1367c22a31af0"}},{"ruleId":"D2","level":"warning","message":{"text":"GodClassAnalyzer.ReduceMove (cognitive 24): GodClassAnalyzer.ReduceMove has cognitive complexity 24 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.CodeQuality/CodeShape/GodClassAnalyzer.cs"},"region":{"startLine":1288}}}],"partialFingerprints":{"codehealthFindingId/v1":"c00eaddd46355e99978fc5113049d0eee1db382e6fb120c65b2b589c9be5015a"}},{"ruleId":"D2","level":"warning","message":{"text":"AutomountedServiceAccountTokenScan.PodSpec (cognitive 24): AutomountedServiceAccountTokenScan.PodSpec has cognitive complexity 24 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/AutomountedServiceAccountTokenScan.cs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"4917cbf075094cccbf533f27147b1f43881efd585f4b32b5ec854ba21db2bcd8"}},{"ruleId":"D2","level":"warning","message":{"text":"DeclaredDependencies.SelectDeclaration (cognitive 24): DeclaredDependencies.SelectDeclaration has cognitive complexity 24 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/DeclaredDependencies.cs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"53d53b7526b68ff659fbfa1536314fe408dfa1d8938d707ac2fb131c47de5cb8"}},{"ruleId":"D2","level":"warning","message":{"text":"NamelessWorkloadPrivilegedScan.IsNamelessWorkloadDocument (cognitive 24): NamelessWorkloadPrivilegedScan.IsNamelessWorkloadDocument has cognitive complexity 24 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/NamelessWorkloadPrivilegedScan.cs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9bfa143ef1207c486fa874e87f5719a2ca757a4470529782d71632aee863226"}},{"ruleId":"D2","level":"warning","message":{"text":"ScanParsers.AdvisoryInstalledVersions (cognitive 24): ScanParsers.AdvisoryInstalledVersions has cognitive complexity 24 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/ScanParsers.cs"},"region":{"startLine":1153}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae6e6928053cd32d9121d4d2c8d0965c8543c03cb204b38b2c6e826534909d52"}},{"ruleId":"D2","level":"warning","message":{"text":"ScanParsers.LockResolvedMajors (cognitive 24): ScanParsers.LockResolvedMajors has cognitive complexity 24 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/ScanParsers.cs"},"region":{"startLine":2812}}}],"partialFingerprints":{"codehealthFindingId/v1":"0abdcaad02ff2c8cde0748c8ed7287b47040c14633e5444c01a5a6310819241a"}},{"ruleId":"D2","level":"warning","message":{"text":"FileModel.RegionNeutralises (cognitive 24): FileModel.RegionNeutralises has cognitive complexity 24 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/SqlBuilderCompositionWalk.cs"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"34648ea488e2853b634f339b12d63dbf56fb5a3d18eb890299bd31632972d4bc"}},{"ruleId":"D2","level":"warning","message":{"text":"UnverifiedTrustAnchorScan.OffendingFetch (cognitive 24): UnverifiedTrustAnchorScan.OffendingFetch has cognitive complexity 24 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/UnverifiedTrustAnchorScan.cs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7054e9ce9ef40e32c17f85096287bb04323595333f0eaab844c53ee3ed18636"}},{"ruleId":"D2","level":"warning","message":{"text":"SecretsHistoryAnalyzer.GateRenamedIntoTestTreeFindingsAsync (cognitive 24): SecretsHistoryAnalyzer.GateRenamedIntoTestTreeFindingsAsync has cognitive complexity 24 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/SecretsHistoryAnalyzer.cs"},"region":{"startLine":2127}}}],"partialFingerprints":{"codehealthFindingId/v1":"6258ab1d4b74e67afbf57f6bdfd8f808fc958cd4a9c2f1d81601921e7ed09c73"}},{"ruleId":"D2","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.MovingNpmGitDependencies (cognitive 24): SupplyChainProvenanceAnalyzer.MovingNpmGitDependencies has cognitive complexity 24 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":1702}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f0d02a5cbcbf1ffc41a84b4c41ab54578746f8c80cdf5f1f952a10d6e98ce87"}},{"ruleId":"D2","level":"warning","message":{"text":"RepoFindings.razor \u203A OnInitializedAsync (cognitive 24): RepoFindings.razor \u203A OnInitializedAsync has cognitive complexity 24 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Kennel.Watchdog.Core/Agents/Ui/RepoFindings.razor"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"3927e0cb4edcc01521e3069b766a317f6d15bbbfeaa6a8780da6b867ec2bfad3"}},{"ruleId":"D2","level":"warning","message":{"text":"FSharpSyntaxModel.collectDecls (cognitive 24): FSharpSyntaxModel.collectDecls has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 4 (10 pts), if/else 6 (9 pts), loops 2 (4 pts), boolean chains 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":"engine/src/CodeHealth.CodeModel.FSharp/SyntaxModel.fs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"b83237b8ee84b3b58d2419b92cb8a4caf9abe47556c7a00fd687556d74f4a057"}},{"ruleId":"D2","level":"warning","message":{"text":"Branches.walk (cognitive 24): Branches.walk has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 3 (7 pts), match/switch 2 (3 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":"engine/sidecars/kotlin-frontend/src/main/kotlin/dev/canine/codehealth/kotlin/Branches.kt"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"aab9116692e59bd073ef3c643d73cdc3dcd0e82f9fee8f5f4937a7adefb75933"}},{"ruleId":"D2","level":"warning","message":{"text":"Handler._proxy (cognitive 24): Handler._proxy has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (13 pts), error handling 4 (5 pts), boolean chains 4, loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/qwen-poc/effort-proxy.py"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6be50fac8eb538cd56f4547d744f921b8bb553295f7aa5acf7032e25f23db53"}},{"ruleId":"D2","level":"warning","message":{"text":"report_round.build_rows (cognitive 24): report_round.build_rows has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 17, if/else 2 (4 pts), loops 3 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/report_round.py"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"e03e26d51735165a7f6e5337344fd86b8acb9731634ed4e78030c48b6a659bc2"}},{"ruleId":"D2","level":"warning","message":{"text":"main.foldNamesOf (cognitive 24): main.foldNamesOf has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 4 (8 pts), match/switch 1 (nesting depth added 13). Most of this is not in the body itself: 0 of the 24 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 744, 731). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/go/bodylines.go"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"2514ccde9c1880e8890df2b03f09cd3b70aebe07db6c830cd9d04920ed95f841"}},{"ruleId":"D2","level":"warning","message":{"text":"codehealth_rust_sidecar::collect_crate_reexported_defs_in (cognitive 24): codehealth_rust_sidecar::collect_crate_reexported_defs_in has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (20 pts), loops 2, match/switch 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/rust-frontend/src/main.rs"},"region":{"startLine":2247}}}],"partialFingerprints":{"codehealthFindingId/v1":"178dad685a525530c9cdf0340b223ea0f8248b7dc08d7c4499487bcbd00a5f4a"}},{"ruleId":"D2","level":"warning","message":{"text":"ConventionalArchitectureTestDiscovery.DiscoverAsync (cognitive 23): ConventionalArchitectureTestDiscovery.DiscoverAsync has cognitive complexity 23 (threshold 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":"engine/src/CodeHealth.Core/Analyzers/ConventionalArchitectureTestDiscovery.cs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ac9312e7a96a70ec241691ec836d4bed7cbabcd5a091de2eef50118e8af07da"}},{"ruleId":"D2","level":"warning","message":{"text":"NamespaceDependencyGraphBuilder.Build (cognitive 23): NamespaceDependencyGraphBuilder.Build has cognitive complexity 23 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Architecture/NamespaceDependencyGraphBuilder.cs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"991de89a3a87d43b2ec18805ccf8378b6ee2a8d4b17c078d847a23a2f03451aa"}},{"ruleId":"D2","level":"warning","message":{"text":"CloudFormationExtractor.Extract (cognitive 23): CloudFormationExtractor.Extract has cognitive complexity 23 (threshold 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":"engine/src/CodeHealth.Core/Architecture/Topology/Extractors/CloudFormationExtractor.cs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"852afcd5cc4a2c64da3f485b4d864b22a3a0764dc7b8017fbe138fd74bda60a6"}},{"ruleId":"D2","level":"warning","message":{"text":"RoslynDuplicationDetector.IdiomSwaps (cognitive 23): RoslynDuplicationDetector.IdiomSwaps has cognitive complexity 23 (threshold 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":"engine/src/CodeHealth.Core/CodeShape/RoslynDuplicationDetector.cs"},"region":{"startLine":2348}}}],"partialFingerprints":{"codehealthFindingId/v1":"df7d23b3deecb8752f02f8ce7de91001be20d167aab43267c0e3d9328abc4513"}},{"ruleId":"D2","level":"warning","message":{"text":"ComplianceSecurityAnalyzer.SerialisedMemberTypes (cognitive 23): ComplianceSecurityAnalyzer.SerialisedMemberTypes has cognitive complexity 23 (threshold 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":"engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs"},"region":{"startLine":1739}}}],"partialFingerprints":{"codehealthFindingId/v1":"c41547aaf3493d97facc8704f25e3f7e39dbcff90e65ad8d711bc8ef0ae2c241"}},{"ruleId":"D2","level":"warning","message":{"text":"ComplianceSecurityAnalyzer.ScanStaticEncryptionIv (cognitive 23): ComplianceSecurityAnalyzer.ScanStaticEncryptionIv has cognitive complexity 23 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs"},"region":{"startLine":2181}}}],"partialFingerprints":{"codehealthFindingId/v1":"4addeb3bc0bb76339fe9604de0cdf66c0d0a59077770c86cf4eccdda91637f0f"}},{"ruleId":"D2","level":"warning","message":{"text":"ComplianceSecurityAnalyzer.DetectAgeBasedRetentionFields (cognitive 23): ComplianceSecurityAnalyzer.DetectAgeBasedRetentionFields has cognitive complexity 23 (threshold 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":"engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs"},"region":{"startLine":4476}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ad72ab4e5ed8929e1b81b57b947fdb978652fc377311770473bda4249021f36"}},{"ruleId":"D2","level":"warning","message":{"text":"YamlDisabledConfigScanner.TryConvict (cognitive 23): YamlDisabledConfigScanner.TryConvict has cognitive complexity 23 (threshold 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":"engine/src/CodeHealth.Core/ExplicitDebt/YamlDisabledConfigScanner.cs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"25c2b5271ac3d0727fcf9a0bb97223960102af53f57667bf1c8d46ca2c3aa42f"}},{"ruleId":"D2","level":"warning","message":{"text":"EntryPointCatalog.AddResolvedThroughAlias (cognitive 23): EntryPointCatalog.AddResolvedThroughAlias has cognitive complexity 23 (threshold 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":"engine/src/CodeHealth.Core/Frontend/EntryPointCatalog.cs"},"region":{"startLine":2072}}}],"partialFingerprints":{"codehealthFindingId/v1":"a89afecae7063607382425b09fc82a48b70fd0743aeb68da8eb168d452812095"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendBundlerConfigRefs.HandleFile (cognitive 23): FrontendBundlerConfigRefs.HandleFile has cognitive complexity 23 (threshold 15). 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":"engine/src/CodeHealth.Core/Frontend/FrontendBundlerConfigRefs.cs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"87896432db656e29bc97c9ceb6466445bec6f2ab0057d629d8dfe7ab3d79953a"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendDependencyHygiene.CollectTypeAndTestOnly (cognitive 23): FrontendDependencyHygiene.CollectTypeAndTestOnly has cognitive complexity 23 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendDependencyHygiene.cs"},"region":{"startLine":1765}}}],"partialFingerprints":{"codehealthFindingId/v1":"491f87750a664842d73db280e3d6eb43de9a44469232c977914ceef058234961"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendSpecifierScanning.EnumerateToolConfigFiles (cognitive 23): FrontendSpecifierScanning.EnumerateToolConfigFiles has cognitive complexity 23 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendSpecifierScanning.cs"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcff322cc26ac99aa99628f9cc910bcf3cf3caa0cbee0f07789cf59c36e059f4"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendTestAndDocRefs.EnumerateMarkdownFiles (cognitive 23): FrontendTestAndDocRefs.EnumerateMarkdownFiles has cognitive complexity 23 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendTestAndDocRefs.cs"},"region":{"startLine":994}}}],"partialFingerprints":{"codehealthFindingId/v1":"da3eb5848fc8eaa8cc44fd3eff165a734c0a9cb8bc36af3fb0f53f9ace2000cf"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendTestReachability.DetectMissingComponentRig (cognitive 23): FrontendTestReachability.DetectMissingComponentRig has cognitive complexity 23 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendTestReachability.cs"},"region":{"startLine":853}}}],"partialFingerprints":{"codehealthFindingId/v1":"83587f09799bb7fa4270ddce3d45ac6848264f09b7c848e270a0785bfb360198"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendTestReachability.IsReExportBarrel (cognitive 23): FrontendTestReachability.IsReExportBarrel has cognitive complexity 23 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendTestReachability.cs"},"region":{"startLine":1399}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f01b7533cf7dd0d8ec7d35f42220e082e9f2fda4a3a47c20fb83e9b5650848e"}},{"ruleId":"D2","level":"warning","message":{"text":"JsConstantOnlyField.Classes (cognitive 23): JsConstantOnlyField.Classes has cognitive complexity 23 (threshold 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":"engine/src/CodeHealth.Core/Frontend/JsConstantOnlyField.cs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"715d7b9301312ed9bb5204c5786db6b6467eaa224a4396cbe809b8dea3e1dc8b"}},{"ruleId":"D2","level":"warning","message":{"text":"JsFunctionScanner.NameBeforeTypeAnnotation (cognitive 23): JsFunctionScanner.NameBeforeTypeAnnotation has cognitive complexity 23 (threshold 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":"engine/src/CodeHealth.Core/Frontend/JsFunctionScanner.cs"},"region":{"startLine":1109}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f1c95761688ce3498a356fad24ab9f32a105cc50f26ced2162369c2d4f893ac"}},{"ruleId":"D2","level":"warning","message":{"text":"JsRedundantReDefault.FallbackOf (cognitive 23): JsRedundantReDefault.FallbackOf has cognitive complexity 23 (threshold 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":"engine/src/CodeHealth.Core/Frontend/JsRedundantReDefault.cs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ef55a350154f5976b348d99dc81e188fbb95b3c83b31672881587663046ac00"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleSyntaxScanner.IsInsideFunctionBody (cognitive 23): ModuleSyntaxScanner.IsInsideFunctionBody has cognitive complexity 23 (threshold 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":"engine/src/CodeHealth.Core/Frontend/ModuleSyntaxScanner.cs"},"region":{"startLine":1402}}}],"partialFingerprints":{"codehealthFindingId/v1":"b45a9aebbebe822e36b58514c3643744b5785a55a7d20f5afcb8c5620f320f7d"}},{"ruleId":"D2","level":"warning","message":{"text":"TemplateLanguageMarkupProducer.Mask (cognitive 23): TemplateLanguageMarkupProducer.Mask has cognitive complexity 23 (threshold 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":"engine/src/CodeHealth.Core/Markup/TemplateLanguageMarkupProducer.cs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4f78acb4207a30e5dac18ec8187939ce1bbb557a9c4ef1e25d1b8e17c7c1573"}},{"ruleId":"D2","level":"warning","message":{"text":"TemplateLanguageMarkupProducer.EndOfBladeDirective (cognitive 23): TemplateLanguageMarkupProducer.EndOfBladeDirective has cognitive complexity 23 (threshold 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":"engine/src/CodeHealth.Core/Markup/TemplateLanguageMarkupProducer.cs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"badfaad73c181801e640d25d9908f9a5f50b67b400da22ddc7cd1c54bd537f44"}},{"ruleId":"D2","level":"warning","message":{"text":"AmbientInputAnalyzer.Analyze (cognitive 23): AmbientInputAnalyzer.Analyze has cognitive complexity 23 (threshold 15). Of this number, 21 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":"engine/src/CodeHealth.Core/ModelAware/AmbientInputAnalyzer.cs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"11e24efc605919fa3c300429de9d94469f844e0c7fdb2cc1e399c0e7f300faef"}},{"ruleId":"D2","level":"warning","message":{"text":"ArchitectureModelAnalyzer.UnguardedMutations (cognitive 23): ArchitectureModelAnalyzer.UnguardedMutations has cognitive complexity 23 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/ArchitectureModelAnalyzer.cs"},"region":{"startLine":1108}}}],"partialFingerprints":{"codehealthFindingId/v1":"23cfe2874de5163580577c40cb38f711ca0235fc3775d130279a1e0df9938978"}},{"ruleId":"D2","level":"warning","message":{"text":"ArchitectureStyleDetector.DetectAsync (cognitive 23): ArchitectureStyleDetector.DetectAsync has cognitive complexity 23 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, 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":"engine/src/CodeHealth.Core/ModelAware/ArchitectureStyleDetector.cs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"b89c0331767e57dd68442c180d8c5df6423a50268413ebfeceb8c9446ef9d561"}},{"ruleId":"D2","level":"warning","message":{"text":"CryptoShreddingDetector.IsDiscarded (cognitive 23): CryptoShreddingDetector.IsDiscarded has cognitive complexity 23 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/CryptoShreddingDetector.cs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"3015f259a3f00d0d002f9b96679028c0eb494e7ab3847716c38185ec2ff98776"}},{"ruleId":"D2","level":"warning","message":{"text":"DomainModelAnalyzer.AddGoDomainInfraLeaks (cognitive 23): DomainModelAnalyzer.AddGoDomainInfraLeaks has cognitive complexity 23 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs"},"region":{"startLine":4758}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4a12236591220db82add9a2bf9b19911305ddbfeb4914dbc719b7b68d54aa31"}},{"ruleId":"D2","level":"warning","message":{"text":"EventDrivenAnalyzer.EventCommandShape (cognitive 23): EventDrivenAnalyzer.EventCommandShape has cognitive complexity 23 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs"},"region":{"startLine":927}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9272426a18df305b8e12761b5613f233f475783985484abb33d01c05b1398ce"}},{"ruleId":"D2","level":"warning","message":{"text":"InvocationMatching.FirstMatch (cognitive 23): InvocationMatching.FirstMatch has cognitive complexity 23 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/InvocationMatching.cs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b3d9869de09fb81283b47040eaeda82ac7853f286b9d11a45960df8cfd5b86c"}},{"ruleId":"D2","level":"warning","message":{"text":"LogicDefectAnalyzer.ConstructorSuppliedDefault (cognitive 23): LogicDefectAnalyzer.ConstructorSuppliedDefault has cognitive complexity 23 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/LogicDefectAnalyzer.cs"},"region":{"startLine":2929}}}],"partialFingerprints":{"codehealthFindingId/v1":"81a0427e4e70b02febd4eaa3dd18defd340c807ded2a24070f29c0e84a657fd5"}},{"ruleId":"D2","level":"warning","message":{"text":"MutationIdempotencyAnalyzer.DedupePipelines (cognitive 23): MutationIdempotencyAnalyzer.DedupePipelines has cognitive complexity 23 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/MutationIdempotencyAnalyzer.cs"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"362171e3d3970e473fe40f5816b11abf347c6c645d4424681320284c21c02d55"}},{"ruleId":"D2","level":"warning","message":{"text":"MutationIdempotencyAnalyzer.DedupePipelines (cognitive 23): MutationIdempotencyAnalyzer.DedupePipelines has cognitive complexity 23 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/MutationIdempotencyAnalyzer.cs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c8c3937e487f1c68e0c2b28f8e477ea130a47045ede9dac5eba06ec8a8a886b"}},{"ruleId":"D2","level":"warning","message":{"text":"RustDomainConventions.RustDualWrites (cognitive 23): RustDomainConventions.RustDualWrites has cognitive complexity 23 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 5 belong to 5 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":"engine/src/CodeHealth.Core/ModelAware/RustDomainConventions.cs"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab38bf85d8d7b6d0aae3dec5f738ddd2d1064b7b1058969a68bd9b446204ef92"}},{"ruleId":"D2","level":"warning","message":{"text":"DartAnalyzerExclusions.ParseExcludes (cognitive 23): DartAnalyzerExclusions.ParseExcludes has cognitive complexity 23 (threshold 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":"engine/src/CodeHealth.Core/Readiness/DartAnalyzerExclusions.cs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"be296669adb4f1a81344e74e8895f0ae0a5edf71cfeb823f43f07218cab58eed"}},{"ruleId":"D2","level":"warning","message":{"text":"ProductionReadinessAnalyzer.CiGateHonesty (cognitive 23): ProductionReadinessAnalyzer.CiGateHonesty has cognitive complexity 23 (threshold 15). 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":"engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8fd8923e759c7f83b012b958af06c4285d3281dc453a59f484d88bfab966a43"}},{"ruleId":"D2","level":"warning","message":{"text":"DiskSourceFiles.DominantJavaScriptExtension (cognitive 23): DiskSourceFiles.DominantJavaScriptExtension has cognitive complexity 23 (threshold 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":"engine/src/CodeHealth.Core/Scoring/DiskSourceFiles.cs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e1f22b2ea44619d508845bfa5912f0e08d2977341f1f825949bcdc0cdb7fa6d"}},{"ruleId":"D2","level":"warning","message":{"text":"CommittedCoverageReader.ParseXml (cognitive 23): CommittedCoverageReader.ParseXml has cognitive complexity 23 (threshold 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":"engine/src/CodeHealth.Core/Testing/CommittedCoverageReader.cs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f030e77c31249af31e88a7cc23a72951fd444ea841b9abb9d6485703f248cc6"}},{"ruleId":"D2","level":"warning","message":{"text":"CommittedCoverageReader.MergeLcovPerFile (cognitive 23): CommittedCoverageReader.MergeLcovPerFile has cognitive complexity 23 (threshold 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":"engine/src/CodeHealth.Core/Testing/CommittedCoverageReader.cs"},"region":{"startLine":1042}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7ee00f9ada44506f926fb41df7b5f9909b64b509914f6388012d08409ea94e9"}},{"ruleId":"D2","level":"warning","message":{"text":"PythonTestCensus.PythonTestFiles (cognitive 23): PythonTestCensus.PythonTestFiles has cognitive complexity 23 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Testing/PythonTestCensus.cs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"d622ecb2ff72babfc847fb6a57904fc9f17a48f62eaf7c5b1500a0f596992001"}},{"ruleId":"D2","level":"warning","message":{"text":"RoslynTestQualityCollector.IsFetchArgument (cognitive 23): RoslynTestQualityCollector.IsFetchArgument has cognitive complexity 23 (threshold 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":"engine/src/CodeHealth.Core/Testing/RoslynTestQualityCollector.cs"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ce4f8f315e1c26204059a66f247b1b11388fdf56a626e820a55ccedefedf5fd"}},{"ruleId":"D2","level":"warning","message":{"text":"SelfDeclaredUnreliableTests.EnumerateTestFiles (cognitive 23): SelfDeclaredUnreliableTests.EnumerateTestFiles has cognitive complexity 23 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Testing/SelfDeclaredUnreliableTests.cs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"b28cf14df236dcaedb19ed7e82865dd45a2c524033e76581764d252de4ef4577"}},{"ruleId":"D2","level":"warning","message":{"text":"ReportViewModelFactory.DeterministicBusinessBrief (cognitive 23): ReportViewModelFactory.DeterministicBusinessBrief has cognitive complexity 23 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Reporting/Templates/ReportViewModelFactory.cs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2300c1c6cb335937bc686fe1d4f05b4245d7e2868e06c72c1e02cf92b83a1a4"}},{"ruleId":"D2","level":"warning","message":{"text":"BuildTimeKeyMaterialScan.GeneratedKeys (cognitive 23): BuildTimeKeyMaterialScan.GeneratedKeys has cognitive complexity 23 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/BuildTimeKeyMaterialScan.cs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffb31fd045cea58106ea73f7804607eccfae90e8ea95baf00f92565c2a94ae90"}},{"ruleId":"D2","level":"warning","message":{"text":"CargoAuditWaivers.Read (cognitive 23): CargoAuditWaivers.Read has cognitive complexity 23 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/CargoAuditWaivers.cs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"e42f976eb54a9b15d1189218c48b638315e1fda4761c9a0539d583b0718b465f"}},{"ruleId":"D2","level":"warning","message":{"text":"JsRegexCaptureGroupRecheck.ReadRegexLiteralSpan (cognitive 23): JsRegexCaptureGroupRecheck.ReadRegexLiteralSpan has cognitive complexity 23 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/JsRegexCaptureGroupRecheck.cs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"0db484bcbc98f81ee4bf94fee62b25e15853e11e2286c51663757542c01ee0ed"}},{"ruleId":"D2","level":"warning","message":{"text":"JsSiblingScopeReadScan.FindingsIn (cognitive 23): JsSiblingScopeReadScan.FindingsIn has cognitive complexity 23 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/JsSiblingScopeReadScan.cs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ec7e54fcb9b294283467274d8152a492e58446073ec72028f36704a77a136e4"}},{"ruleId":"D2","level":"warning","message":{"text":"PrimaryConstructorShadow.Blank (cognitive 23): PrimaryConstructorShadow.Blank has cognitive complexity 23 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/PrimaryConstructorShadow.cs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"08d92d44799fe7e907e4f6bad2b1167dfdc7b62778453fe9f697f509921cedbf"}},{"ruleId":"D2","level":"warning","message":{"text":"ScanParsers.TrivyFindings (cognitive 23): ScanParsers.TrivyFindings has cognitive complexity 23 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/ScanParsers.cs"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"4714514bc5f689c2e1f5b493658f831ab7d06f65be6aeb56404024463770e627"}},{"ruleId":"D2","level":"warning","message":{"text":"SemgrepShapeFilter.IsUnreachableClaim (cognitive 23): SemgrepShapeFilter.IsUnreachableClaim has cognitive complexity 23 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/SemgrepShapeFilter.cs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe484b302bb0a3b440556f78d9f81ae2080d37b67ac9d5dfecbca334a9d729f2"}},{"ruleId":"D2","level":"warning","message":{"text":"UnpinnedToolchainInstallScan.CargoOffence (cognitive 23): UnpinnedToolchainInstallScan.CargoOffence has cognitive complexity 23 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/UnpinnedToolchainInstallScan.cs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0a38a8f006584d8677df5ae5374a763533d3b18749de94cab88de3e5faa212c"}},{"ruleId":"D2","level":"warning","message":{"text":"VendoredManifestScope.IsInDeclaredWorkspace (cognitive 23): VendoredManifestScope.IsInDeclaredWorkspace has cognitive complexity 23 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/VendoredManifestScope.cs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"75aa033830fcd6c74cc4e6b02a9bb427debf902ce0b96c3bd248950c0a7e1cff"}},{"ruleId":"D2","level":"warning","message":{"text":"SecretsHistoryAnalyzer.RustDocCommentRegions (cognitive 23): SecretsHistoryAnalyzer.RustDocCommentRegions has cognitive complexity 23 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/SecretsHistoryAnalyzer.cs"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"121f68e06f0c3521b2157b08e4c6325e6c930feb81417aab0a4b50796bc7c5df"}},{"ruleId":"D2","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.ReadCiInvokedScripts (cognitive 23): SupplyChainProvenanceAnalyzer.ReadCiInvokedScripts has cognitive complexity 23 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":5791}}}],"partialFingerprints":{"codehealthFindingId/v1":"6269f0edfbc658bf6fc729cb8bf1eb3e3ed949287d6b70c1b625cfac124ea473"}},{"ruleId":"D2","level":"warning","message":{"text":"ChangeCouplingAnalyzer.DetectCliques (cognitive 23): ChangeCouplingAnalyzer.DetectCliques has cognitive complexity 23 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.GitMining/ChangeCouplingAnalyzer.cs"},"region":{"startLine":1171}}}],"partialFingerprints":{"codehealthFindingId/v1":"35758085a6bd9da01b8b797e47a6d532a796f582758f527cb080cf6d3c41431e"}},{"ruleId":"D2","level":"warning","message":{"text":"JvmProvider.BuildProjects (cognitive 23): JvmProvider.BuildProjects has cognitive complexity 23 (threshold 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":"engine/src/CodeHealth.CodeModel.Jvm/JvmProvider.cs"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"480838b4c0fde72a987c6f2418f49ab25a492a3d0971f99855022670ad9b954a"}},{"ruleId":"D2","level":"warning","message":{"text":"scope-evidence._version_stamps (cognitive 23): scope-evidence._version_stamps has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (11 pts), error handling 2 (7 pts), loops 2 (3 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":"tools/train/scope-evidence.py"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba6d59f712cb8feacbddc6dc4ea5ffa6b386043147a8296ce916aa8ec29e0a32"}},{"ruleId":"D2","level":"warning","message":{"text":"TokenSink::walk (cognitive 23): TokenSink::walk has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 3 (8 pts), 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":"engine/sidecars/rust-frontend/src/main.rs"},"region":{"startLine":4780}}}],"partialFingerprints":{"codehealthFindingId/v1":"74239ec1a1311856b5468cdd86fbe495be9c2e2b15237964c67a59d77daa1258"}},{"ruleId":"D2","level":"warning","message":{"text":"codehealth_rust_sidecar::crate_and_module (cognitive 23): codehealth_rust_sidecar::crate_and_module has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (15 pts), match/switch 2 (4 pts), boolean chains 2, loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/rust-frontend/src/main.rs"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"230d278f80dd6a0c3422a9ab72e0dad62f6e51fa06e4b0e375a541f9841a2ed0"}},{"ruleId":"D2","level":"warning","message":{"text":"extract-file.typeEmitters (cognitive 23): extract-file.typeEmitters has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (8 pts), boolean chains 6, error handling 1 (4 pts), loops 3 (4 pts), ternaries 1 (nesting depth added 8). Most of this is not in the body itself: 0 of the 23 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 367, 385, 340, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/tsjs-frontend/extract-file.mjs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a27b6f7ce9e93783d11d3965aeb55a15a0e8762713fe969ad7b6fbdcf290f02"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 23): (anonymous) has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 6, ternaries 2 (3 pts), loops 1 (nesting depth added 4). Most of this is not in the body itself: 3 of the 23 points are its own statements and the rest belongs to 6 function items inside it that branch (apply, wire, initScansFilter, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Kennel.Ui/wwwroot/kennel-ui.js"},"region":{"startLine":1701}}}],"partialFingerprints":{"codehealthFindingId/v1":"66016b124f63124253281206a4359a06548b1f4d842ed358899b12db7ba48d02"}},{"ruleId":"D2","level":"warning","message":{"text":"discoverSurfaces (cognitive 23): discoverSurfaces has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 4, error handling 1 (3 pts), loops 2 (3 pts), ternaries 1 (3 pts) (nesting depth added 10). Of this number, 14 points are the body\u0027s own statements and 9 belong to 4 function items inside it that branch. To reduce it, split the body into named stages: move each independent 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":"engine/docker/analyzer/render/axe-render.mjs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"9447dcebe50b3e6a55b5006419c7b18e0f6c37877a8b91b74410c64eb72c25e4"}},{"ruleId":"D2","level":"warning","message":{"text":"VbBranchExtractor.Walk (cognitive 22): VbBranchExtractor.Walk has cognitive complexity 22 (threshold 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":"engine/src/CodeHealth.Core/CodeModel/Roslyn/VbBranchExtractor.cs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"27d0df0eaa707b29357f5b448f92bcc859764b518b448f4702ffac567de910ca"}},{"ruleId":"D2","level":"warning","message":{"text":"RoslynDuplicationDetector.AppendRenameClones (cognitive 22): RoslynDuplicationDetector.AppendRenameClones has cognitive complexity 22 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 4 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":"engine/src/CodeHealth.Core/CodeShape/RoslynDuplicationDetector.cs"},"region":{"startLine":2573}}}],"partialFingerprints":{"codehealthFindingId/v1":"59aba714ed72d9e4908b6923c2a20bca0c0b15c8bda7327ccb9f52f7a40b240c"}},{"ruleId":"D2","level":"warning","message":{"text":"RustInlineTestRegions.FindItemEnd (cognitive 22): RustInlineTestRegions.FindItemEnd has cognitive complexity 22 (threshold 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":"engine/src/CodeHealth.Core/CodeShape/RustInlineTestRegions.cs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"a60b92c2b46bea457e9fa3001603064aee36bb50eb3797362f97221aa0e0d81e"}},{"ruleId":"D2","level":"warning","message":{"text":"ComplianceSecurityAnalyzer.C3 (cognitive 22): ComplianceSecurityAnalyzer.C3 has cognitive complexity 22 (threshold 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":"engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs"},"region":{"startLine":5270}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c316443ee5c0c9abc0a2189bec622838cc5b36147414f478faa39081cb13aed"}},{"ruleId":"D2","level":"warning","message":{"text":"GoModuleHygiene.ParseModule (cognitive 22): GoModuleHygiene.ParseModule has cognitive complexity 22 (threshold 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":"engine/src/CodeHealth.Core/Dependencies/GoModuleHygiene.cs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"3615dc2addb5f0852a34efc8f102d1c58302eaa6d47b98b7b461090b23fbf9bb"}},{"ruleId":"D2","level":"warning","message":{"text":"HexCurrencyCollector.CollectAsync (cognitive 22): HexCurrencyCollector.CollectAsync has cognitive complexity 22 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent 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":"engine/src/CodeHealth.Core/Dependencies/HexCurrencyCollector.cs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3875fa1a4806cae38d3ddecd913a38f6b2366bacb08acf639ae5142e2cefc08"}},{"ruleId":"D2","level":"warning","message":{"text":"MavenManifestHygiene.ReadVersionCatalogue (cognitive 22): MavenManifestHygiene.ReadVersionCatalogue has cognitive complexity 22 (threshold 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":"engine/src/CodeHealth.Core/Dependencies/MavenManifestHygiene.cs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"fad86d24c0abeb4216ce077e6f9044fe081a85c6aa58065048739af8cb8a7b35"}},{"ruleId":"D2","level":"warning","message":{"text":"SwiftPackageHygiene.ParseDependencies (cognitive 22): SwiftPackageHygiene.ParseDependencies has cognitive complexity 22 (threshold 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":"engine/src/CodeHealth.Core/Dependencies/SwiftPackageHygiene.cs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"d81cc79aa0d0c5f6e640aada38a864e4603b69d16a40c1626220abd7811353e8"}},{"ruleId":"D2","level":"warning","message":{"text":"UnityRegistryClient.Parse (cognitive 22): UnityRegistryClient.Parse has cognitive complexity 22 (threshold 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":"engine/src/CodeHealth.Core/Dependencies/UnityRegistryClient.cs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"554b6641a180c6a96d6ed2de6f2753fdcb63e4f2206d26020c3d144ee8898a1e"}},{"ruleId":"D2","level":"warning","message":{"text":"VbaSourcePresence.IsVbaTree (cognitive 22): VbaSourcePresence.IsVbaTree has cognitive complexity 22 (threshold 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":"engine/src/CodeHealth.Core/Discovery/VbaSourcePresence.cs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2920f822ccc3dfc1b94e500f2ed4ce3f16c93e151177c1fdca8102071c06436"}},{"ruleId":"D2","level":"warning","message":{"text":"RazorCodeBlockProjection.CodeBlockBodies (cognitive 22): RazorCodeBlockProjection.CodeBlockBodies has cognitive complexity 22 (threshold 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":"engine/src/CodeHealth.Core/ExplicitDebt/RazorCodeBlockProjection.cs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"41d22f5049c448783c32a1b2602266911ab6672c08aa7abb03afed66a998a63d"}},{"ruleId":"D2","level":"warning","message":{"text":"RazorGeneratedDocumentSynthesizer.TemplateEnd (cognitive 22): RazorGeneratedDocumentSynthesizer.TemplateEnd has cognitive complexity 22 (threshold 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":"engine/src/CodeHealth.Core/ExplicitDebt/RazorGeneratedDocumentSynthesizer.cs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a885c3cc490414a72152d21972271fa3ed6d8ddd222b4e29332b99dbfccb307"}},{"ruleId":"D2","level":"warning","message":{"text":"EntryPointCatalog.ExtractScriptPaths (cognitive 22): EntryPointCatalog.ExtractScriptPaths has cognitive complexity 22 (threshold 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":"engine/src/CodeHealth.Core/Frontend/EntryPointCatalog.cs"},"region":{"startLine":1867}}}],"partialFingerprints":{"codehealthFindingId/v1":"66cc909922a02a4b18c3066a334df3b54c8aa16107766fda979aabb71e0fe409"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendDeadCode.GitignoreDisownsPath (cognitive 22): FrontendDeadCode.GitignoreDisownsPath has cognitive complexity 22 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendDeadCode.cs"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf11bb62c44c4c3694edf5e6e873fcb86680cc411bdb03e6719f1f7b1c2446f2"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendDeclaredPackageRefs.CollectManifestSelfConfiguredPackages (cognitive 22): FrontendDeclaredPackageRefs.CollectManifestSelfConfiguredPackages has cognitive complexity 22 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendDeclaredPackageRefs.cs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"d01401ea009d4ab3853a5f4581b105afa2cee5c472732eed948605e00aa8456d"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendDependencyHygiene.BuildUsageByManifest (cognitive 22): FrontendDependencyHygiene.BuildUsageByManifest has cognitive complexity 22 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendDependencyHygiene.cs"},"region":{"startLine":2604}}}],"partialFingerprints":{"codehealthFindingId/v1":"e84aca5d721e0e859af7d9ec186e40a02d090667088a982da2d3ed5431cebefd"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendSpecifierScanning.CollectDynamicSpecifierPackages (cognitive 22): FrontendSpecifierScanning.CollectDynamicSpecifierPackages has cognitive complexity 22 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendSpecifierScanning.cs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"5af66dcee71760de9bccfb4fa2846646c8bd67f07ed3272c2274601216df5369"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendToolAndRuntimeRefs.CollectManifestScriptFilePaths (cognitive 22): FrontendToolAndRuntimeRefs.CollectManifestScriptFilePaths has cognitive complexity 22 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendToolAndRuntimeRefs.cs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"54c2f8fa85403a8476a213b749b7358123aa1eae67c6c459defbcf6b8506d0bc"}},{"ruleId":"D2","level":"warning","message":{"text":"JsCloneNearExactness.IsNearExactEnoughToPublish (cognitive 22): JsCloneNearExactness.IsNearExactEnoughToPublish has cognitive complexity 22 (threshold 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":"engine/src/CodeHealth.Core/Frontend/JsCloneNearExactness.cs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"27c4cd9d4741ac21010f13a60c2303f0dde8fcfb3621e1d75e974cd82bf515d4"}},{"ruleId":"D2","level":"warning","message":{"text":"JsDuplicationDetector.RecogniseDeclarationRun (cognitive 22): JsDuplicationDetector.RecogniseDeclarationRun has cognitive complexity 22 (threshold 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":"engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs"},"region":{"startLine":1841}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ec567b8c297becf0a09bfa8bc0b5c32ce9069732f4b9ca5bdb3903e3a42275e"}},{"ruleId":"D2","level":"warning","message":{"text":"JsDuplicationDetector.MergeContiguousRuns (cognitive 22): JsDuplicationDetector.MergeContiguousRuns has cognitive complexity 22 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 7 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs"},"region":{"startLine":5812}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f329a1f62bbf4e94e3e4689c889070ffc8ce7db007256fb561c2d37886ebe03"}},{"ruleId":"D2","level":"warning","message":{"text":"JsRedundantReDefault.IsRedundantAt (cognitive 22): JsRedundantReDefault.IsRedundantAt has cognitive complexity 22 (threshold 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":"engine/src/CodeHealth.Core/Frontend/JsRedundantReDefault.cs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f5145b36ad0f578720e26f0946685268f3df98818cd0883b6c964638e530999"}},{"ruleId":"D2","level":"warning","message":{"text":"JsStringConstants.EvaluateExpression (cognitive 22): JsStringConstants.EvaluateExpression has cognitive complexity 22 (threshold 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":"engine/src/CodeHealth.Core/Frontend/JsStringConstants.cs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b9cd1624185d85aba1a990fb8fc8847957339da5344ab54763233b9552f8200"}},{"ruleId":"D2","level":"warning","message":{"text":"MinifiedJsHeuristics.LooksMinified (cognitive 22): MinifiedJsHeuristics.LooksMinified has cognitive complexity 22 (threshold 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":"engine/src/CodeHealth.Core/Frontend/MinifiedJsHeuristics.cs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d1df162d9e61ec4974ffc2e68577e16988b90b4119009bbaa6f03e58416de42"}},{"ruleId":"D2","level":"warning","message":{"text":"AccessibilityAnalyzer.CssInJsContrast (cognitive 22): AccessibilityAnalyzer.CssInJsContrast has cognitive complexity 22 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs"},"region":{"startLine":6023}}}],"partialFingerprints":{"codehealthFindingId/v1":"d71362d3e8b443e0f4ac915b7d832645c9b60b4c537bde8ae8335f018319a348"}},{"ruleId":"D2","level":"warning","message":{"text":"CsprojReferenceGraph.AncestorConditionedGroups (cognitive 22): CsprojReferenceGraph.AncestorConditionedGroups has cognitive complexity 22 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/CsprojReferenceGraph.cs"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"a67605c6161426873d6d15c07c635adc51c803244f0aba7370ab106c1b706843"}},{"ruleId":"D2","level":"warning","message":{"text":"DomainModelAnalyzer.MutableEntities (cognitive 22): DomainModelAnalyzer.MutableEntities has cognitive complexity 22 (threshold 15). Of this number, 20 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":"engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs"},"region":{"startLine":1066}}}],"partialFingerprints":{"codehealthFindingId/v1":"890313225ee3eb13a267f3f8dd27d76a78bc879ade4a1af08dddcaeb45503d41"}},{"ruleId":"D2","level":"warning","message":{"text":"InvocationMatching.FirstMatch (cognitive 22): InvocationMatching.FirstMatch has cognitive complexity 22 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/InvocationMatching.cs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"e30adcd313617b7410580d0f182c2e8795c5c9a6222bd64fab684a29311c59bf"}},{"ruleId":"D2","level":"warning","message":{"text":"LogicDefectAnalyzer.AnalyzeAsync (cognitive 22): LogicDefectAnalyzer.AnalyzeAsync has cognitive complexity 22 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/LogicDefectAnalyzer.cs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f50bcf43953e9b57666b191703828d9f4a8807118f0cccac131866368843007"}},{"ruleId":"D2","level":"warning","message":{"text":"PipelineVersionOutputScan.StepContext (cognitive 22): PipelineVersionOutputScan.StepContext has cognitive complexity 22 (threshold 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":"engine/src/CodeHealth.Core/Readiness/PipelineVersionOutputScan.cs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a605f4251ad3154140aae830a6c0c585fd67744ac942e86aed5b54f8fdac3a2"}},{"ruleId":"D2","level":"warning","message":{"text":"ProductionReadinessAnalyzer.OrchestratorScriptText (cognitive 22): ProductionReadinessAnalyzer.OrchestratorScriptText has cognitive complexity 22 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs"},"region":{"startLine":3956}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5128bf5805a93b513e37ae18755b44cfbaf49aea20bafea85e5d56a2616d9e0"}},{"ruleId":"D2","level":"warning","message":{"text":"ProductionReadinessAnalyzer.RunsStaticAnalysisViaBuildTarget (cognitive 22): ProductionReadinessAnalyzer.RunsStaticAnalysisViaBuildTarget has cognitive complexity 22 (threshold 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":"engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs"},"region":{"startLine":7409}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e440912aaaa2bd6f067d5cd7b9fc85bd7170754e2bfd8724311c9a9d683d15c"}},{"ruleId":"D2","level":"warning","message":{"text":"CodebaseSize.FromProjectsAsync (cognitive 22): CodebaseSize.FromProjectsAsync has cognitive complexity 22 (threshold 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":"engine/src/CodeHealth.Core/Scoring/CodebaseSize.cs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"d47857903fffbf76c4747a714110e2ad68a636ad430d36b52cd5d37f0b73b3bf"}},{"ruleId":"D2","level":"warning","message":{"text":"CodebaseValuator.Compute (cognitive 22): CodebaseValuator.Compute has cognitive complexity 22 (threshold 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":"engine/src/CodeHealth.Core/Scoring/CodebaseValuation.cs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3c6bda3a285c4ade21233fada25d29bcdf544022159e8a836684d757b73e69f"}},{"ruleId":"D2","level":"warning","message":{"text":"CommittedCoverageReader.MergePerFile (cognitive 22): CommittedCoverageReader.MergePerFile has cognitive complexity 22 (threshold 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":"engine/src/CodeHealth.Core/Testing/CommittedCoverageReader.cs"},"region":{"startLine":853}}}],"partialFingerprints":{"codehealthFindingId/v1":"a90e9317bbdd598cbe4a59e75906080d8ae82ae2f97cbc89878eecaae6f0d3f2"}},{"ruleId":"D2","level":"warning","message":{"text":"DuplicationAnalyzer.RunAsync (cognitive 22): DuplicationAnalyzer.RunAsync has cognitive complexity 22 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, 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":"engine/src/CodeHealth.Dimensions.CodeQuality/CodeShape/DuplicationAnalyzer.cs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8ba947fbecf37a7fcb8bc57c1f6f31bed10648c675d688968ceb3fa2775ac45"}},{"ruleId":"D2","level":"warning","message":{"text":"LicenseComplianceAnalyzer.RunAsync (cognitive 22): LicenseComplianceAnalyzer.RunAsync has cognitive complexity 22 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/LicenseComplianceAnalyzer.cs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f5a1751cb9e4d47803675d7ed49887041b1fe2ef6975c249bfee31eca0b4bfe"}},{"ruleId":"D2","level":"warning","message":{"text":"ConfigMapContentRuleFilter.JudgedNoKeyName (cognitive 22): ConfigMapContentRuleFilter.JudgedNoKeyName has cognitive complexity 22 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/ConfigMapContentRuleFilter.cs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d280629a9a83e1a659bb3f63eb7f63fea46fe5cc8f8d649122956686910afcc"}},{"ruleId":"D2","level":"warning","message":{"text":"DeclaredDependencies.ParseGoMod (cognitive 22): DeclaredDependencies.ParseGoMod has cognitive complexity 22 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/DeclaredDependencies.cs"},"region":{"startLine":1837}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea05abc176202290b46e50b0b9a98054f8ea2903526745a7908264f410266470"}},{"ruleId":"D2","level":"warning","message":{"text":"ScanParsers.GoAffectedImports (cognitive 22): ScanParsers.GoAffectedImports has cognitive complexity 22 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/ScanParsers.cs"},"region":{"startLine":3269}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ce3a57a8d3058f76148077f659816c077a6008881687b7e8b41421b49a65488"}},{"ruleId":"D2","level":"warning","message":{"text":"ScanParsers.OsvFixedCandidates (cognitive 22): ScanParsers.OsvFixedCandidates has cognitive complexity 22 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/ScanParsers.cs"},"region":{"startLine":3377}}}],"partialFingerprints":{"codehealthFindingId/v1":"3331950cc499d4e2862ed0f09eea35bbabebba56a26791397e4a8e911bd03e44"}},{"ruleId":"D2","level":"warning","message":{"text":"SocketAndUpgradeRecheck.CompositeLiteralSetsField (cognitive 22): SocketAndUpgradeRecheck.CompositeLiteralSetsField has cognitive complexity 22 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/SocketAndUpgradeRecheck.cs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"069e476d540f83f2450564b29cf85c7133f64ebaacc1a46271d3ffcf3117c510"}},{"ruleId":"D2","level":"warning","message":{"text":"UnpinnedToolchainInstallScan.NodeOffence (cognitive 22): UnpinnedToolchainInstallScan.NodeOffence has cognitive complexity 22 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/UnpinnedToolchainInstallScan.cs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"2103248fd443e24d8ad5be5f24b21ed7f9691db60385f359cf58e16b5bf2e580"}},{"ruleId":"D2","level":"warning","message":{"text":"UnverifiedRemoteInstallerScan.FetchHelpers (cognitive 22): UnverifiedRemoteInstallerScan.FetchHelpers has cognitive complexity 22 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/UnverifiedRemoteInstallerScan.cs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a465cc976590c585a7b95a9dc7d9453275e2d41005c1eb5222a06d5639cf189"}},{"ruleId":"D2","level":"warning","message":{"text":"WorldWritableOwnedPathScan.FindingsIn (cognitive 22): WorldWritableOwnedPathScan.FindingsIn has cognitive complexity 22 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/WorldWritableOwnedPathScan.cs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"eed087901f5b9b7de4d13ba542ab184f11fbb0e8291001d7a46b4a121b03a869"}},{"ruleId":"D2","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.IdentityDefectIn (cognitive 22): SupplyChainProvenanceAnalyzer.IdentityDefectIn has cognitive complexity 22 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.PackagingIdentity.cs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"86d9413f66fb47f9e171c2ef53037c9d6ae8c0cb9094b5d7583088f510529ed9"}},{"ruleId":"D2","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.ParseMakefile (cognitive 22): SupplyChainProvenanceAnalyzer.ParseMakefile has cognitive complexity 22 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.ReleasePathReach.cs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"89baa4687eb06c922223a372ee5d94065fcb4f39101d71b21240c95382d61f94"}},{"ruleId":"D2","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.UninvokedGoReleaserManifest (cognitive 22): SupplyChainProvenanceAnalyzer.UninvokedGoReleaserManifest has cognitive complexity 22 (threshold 15). 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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.ReleaseTrigger.cs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"41049dfd9eeffc89b11b435e3a0819b21acd3acff9a65a176896b1ce9e9669ec"}},{"ruleId":"D2","level":"warning","message":{"text":"LlmAdrEvaluator.EvaluateQualityAsync (cognitive 22): LlmAdrEvaluator.EvaluateQualityAsync has cognitive complexity 22 (threshold 15). Most of this is not in the body itself: 3 of the 22 points are its own statements and the rest belongs to one function literal inside it that branches (line 49). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Docs/Llm/LlmAdrEvaluator.cs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"7068ac9ac1cb5b70e5f04ebc61394de7ad54e1e7d656ed0f44dfc2cfaa3dad15"}},{"ruleId":"D2","level":"warning","message":{"text":"DecisionReportsList.razor \u203A LoadGalleryAsync (cognitive 22): DecisionReportsList.razor \u203A LoadGalleryAsync has cognitive complexity 22 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Kennel.Assay.Core/DecisionReports/Ui/DecisionReportsList.razor"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"8012adbf396acc8ca8914055e5a4f21f1073bc18cb9db61d3d8314f65fa7bccd"}},{"ruleId":"D2","level":"warning","message":{"text":"FSharpBody.flatTokens (cognitive 22): FSharpBody.flatTokens has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 5, 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":"engine/src/CodeHealth.CodeModel.FSharp/Body.fs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f89e00acc7706b61fe5ac4d83c11fb44525f3741dcbe3b2be2f55077a24e8d4"}},{"ruleId":"D2","level":"warning","message":{"text":"build-corpus.sample (cognitive 22): build-corpus.sample has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 3 (4 pts), error handling 1 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/llm-bakeoff/build-corpus.py"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"645d67bd6d2534c6c85ee1cd07fd4db8d8a83b0ee4b9ffba8ee5ce6aa2b5f6c2"}},{"ruleId":"D2","level":"warning","message":{"text":"build-sweep-corpus.sample (cognitive 22): build-sweep-corpus.sample has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 3 (4 pts), error handling 1 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/llm-bakeoff/build-sweep-corpus.py"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"138614b3f4d4ac01bd14283827bf079700b9496f0ee2cc28042fc122b86d78bf"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus.discover (cognitive 22): corpus.discover has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 3, 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":"tools/multilang/corpus.py"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"a87d1fae583e082d6e6f1d3dccbd9d9b5b6ed9843a977b256fd8c85b13336722"}},{"ruleId":"D2","level":"warning","message":{"text":"dod_gate.main (cognitive 22): dod_gate.main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 4, ternaries 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/multilang/dod_gate.py"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"26e8d0e1c387a05ba25bfd7098befe9433cfff357f879d7dd62c576ee8f5cfb3"}},{"ruleId":"D2","level":"warning","message":{"text":"evidence-ab.flips (cognitive 22): evidence-ab.flips has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 4 (12 pts), if/else 3 (5 pts), boolean chains 4, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/evidence-ab.py"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"9df67d5e704482121c84242f60ca0bd8e0f71fc09e485b4525d0fd6cf6b09569"}},{"ruleId":"D2","level":"warning","message":{"text":"judge-k3-report.render_markdown (cognitive 22): judge-k3-report.render_markdown has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 5 (9 pts), loops 5 (8 pts), if/else 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":"tools/train/judge-k3-report.py"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"93a1978b19906ec837b688d362ea858af64381e86004788afbfe074ae39aedd2"}},{"ruleId":"D2","level":"warning","message":{"text":"report_detection_delta.main (cognitive 22): report_detection_delta.main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 3, loops 3, ternaries 1 (2 pts) (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":"tools/train/report_detection_delta.py"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"760c4862d9987825f044d088b949fce1a8ae7666cdeef50f047c26d7c7d6e691"}},{"ruleId":"D2","level":"warning","message":{"text":"sidecarlib._sidecar_details (cognitive 22): sidecarlib._sidecar_details has cognitive complexity 22 (threshold 15). Drivers by points: loops 5 (15 pts), boolean chains 3, error handling 1 (3 pts), if/else 1 (nesting depth added 12). 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":"tools/train/sidecarlib.py"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"5309eccee16b9ebc3305beaa9ea02feae2d8f5507caf0cc0c670f7563048f193"}},{"ruleId":"D2","level":"warning","message":{"text":"BranchWalker.scanExpr (cognitive 22): BranchWalker.scanExpr has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 3 (6 pts), boolean chains 3 (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":"engine/sidecars/php-frontend/body.php"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6e3c1bcd4fbb9c0c64bb202614ab5413041ecf0b676360004babadf38242973"}},{"ruleId":"D2","level":"warning","message":{"text":"bodyResolver.recoverCatchOf (cognitive 22): bodyResolver.recoverCatchOf has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 8). Most of this is not in the body itself: 2 of the 22 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 472, 502). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/go/bodyshapes.go"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd7623288ebe0da5fc9dd2b035561781e4c42e92e5649e41899b97267594261f"}},{"ruleId":"D2","level":"warning","message":{"text":"extractor.addPackageValues (cognitive 22): extractor.addPackageValues has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (16 pts), boolean chains 3, loops 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":"engine/sidecars/go/extract.go"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"18b5879f2be3f0a0e5f2ffafc50ae4e05ceaf270fceda4cb0bdc6e7076c590b1"}},{"ruleId":"D2","level":"warning","message":{"text":"codehealth_rust_sidecar::dup_substitute (cognitive 22): codehealth_rust_sidecar::dup_substitute has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 4 (12 pts), if/else 2 (6 pts), loops 2 (4 pts) (nesting depth added 14). 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":"engine/sidecars/rust-frontend/src/main.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"a139ed557d766294a5c33429ebdaa642b37060a808cbae0916aa7c8c809bf6aa"}},{"ruleId":"D2","level":"warning","message":{"text":"codehealth_rust_sidecar::parse_matcher (cognitive 22): codehealth_rust_sidecar::parse_matcher has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 4 (13 pts), if/else 2 (8 pts), loops 1 (nesting depth added 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. 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":"engine/sidecars/rust-frontend/src/main.rs"},"region":{"startLine":2569}}}],"partialFingerprints":{"codehealthFindingId/v1":"37add8b93100b6e34bda9b2f4b366a267ca37c547480bcb23ef231b94038a047"}},{"ruleId":"D2","level":"warning","message":{"text":"CSharpCloneTokenizer.CollectUnrolledSequenceSpans (cognitive 21): CSharpCloneTokenizer.CollectUnrolledSequenceSpans has cognitive complexity 21 (threshold 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":"engine/src/CodeHealth.Core/CodeModel/Roslyn/CSharpCloneTokenizer.cs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"de4e50538327af609eeb3caaea970a8280c43f26590d73e2f5009750ec3ef527"}},{"ruleId":"D2","level":"warning","message":{"text":"NeutralFileLengthScanner.SignificantLineCount (cognitive 21): NeutralFileLengthScanner.SignificantLineCount has cognitive complexity 21 (threshold 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":"engine/src/CodeHealth.Core/CodeShape/NeutralFileLengthScanner.cs"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"80e8339d1182068fe44d7fe3207bd2708ce99582834761bbbc8b260a4addb902"}},{"ruleId":"D2","level":"warning","message":{"text":"Subsumption.Implies (cognitive 21): Subsumption.Implies has cognitive complexity 21 (threshold 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":"engine/src/CodeHealth.Core/CodeShape/Subsumption.cs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa7b4e8cf4449879743c76967b34d3151763f43351f98174f7bdb5043ee90155"}},{"ruleId":"D2","level":"warning","message":{"text":"NpmVersion.ComparePrerelease (cognitive 21): NpmVersion.ComparePrerelease has cognitive complexity 21 (threshold 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":"engine/src/CodeHealth.Core/Dependencies/NpmVersion.cs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"42da76b64bfed6dcfea496a6c488636f7ae9bcbaaf947dc489667bf265df59ef"}},{"ruleId":"D2","level":"warning","message":{"text":"RubyGemsCurrencyCollector.CollectAsync (cognitive 21): RubyGemsCurrencyCollector.CollectAsync has cognitive complexity 21 (threshold 15). Of this number, 20 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":"engine/src/CodeHealth.Core/Dependencies/RubyGemsCurrencyCollector.cs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"96d670fb645b02da191a79170a46515d81aa565a0683b2bd0d0b81050cfd59f2"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendDependencyHygiene.DeclaredEntryTargetsAllAbsent (cognitive 21): FrontendDependencyHygiene.DeclaredEntryTargetsAllAbsent has cognitive complexity 21 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendDependencyHygiene.cs"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"05c517fa5acfb3352eb012aa847550b3e4930e35364dc522cb1beb3f9e702985"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendManifestEntryPoints.AddMiniProgramComponents (cognitive 21): FrontendManifestEntryPoints.AddMiniProgramComponents has cognitive complexity 21 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendManifestEntryPoints.cs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b9359467fbc7ac6f550c8a017155671ab3e4e7aab57757c62f4a57fb0bd9516"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendScriptCommandRefs.CollectDeployConfigEntries (cognitive 21): FrontendScriptCommandRefs.CollectDeployConfigEntries has cognitive complexity 21 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendScriptCommandRefs.cs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"394bebf9d2db7170196f7b0c835fbed414246644188b234e053d3d5194855787"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendTestAndDocRefs.CollectScriptTestIncludeGlobs (cognitive 21): FrontendTestAndDocRefs.CollectScriptTestIncludeGlobs has cognitive complexity 21 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/FrontendTestAndDocRefs.cs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ca93bcdd37c3682f67939452ddddbad7dd22ff1295dc23089a6595d88a60ae6"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendWorkspaceLoader.CollectBuildOutputSourceMaps (cognitive 21): FrontendWorkspaceLoader.CollectBuildOutputSourceMaps has cognitive complexity 21 (threshold 15). Of this number, 20 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":"engine/src/CodeHealth.Core/Frontend/FrontendWorkspaceLoader.BuildOutput.cs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"573f25af88ac69e4828e9657743c1b81c156941f4c35088a703feaea7d1fdb93"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendWorkspaceWalk.Walk (cognitive 21): FrontendWorkspaceWalk.Walk has cognitive complexity 21 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendWorkspaceWalk.cs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"a29dc1827f82e1795d80f8b45fbd8ab283838f19a67c962d9eeeb74ba848a896"}},{"ruleId":"D2","level":"warning","message":{"text":"JsDuplicationDetector.MatchWholesale (cognitive 21): JsDuplicationDetector.MatchWholesale has cognitive complexity 21 (threshold 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":"engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs"},"region":{"startLine":5297}}}],"partialFingerprints":{"codehealthFindingId/v1":"06428593d4f86ef908389cd421641b98b44ab5a467ca5c4b3003b496bde62e99"}},{"ruleId":"D2","level":"warning","message":{"text":"JsDuplicationDetector.BuildDeclarationHeads (cognitive 21): JsDuplicationDetector.BuildDeclarationHeads has cognitive complexity 21 (threshold 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":"engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs"},"region":{"startLine":6368}}}],"partialFingerprints":{"codehealthFindingId/v1":"152c36b28c73c187687bb86c98b6a8b3103f03b9a3cc01b37089fb6f012abd4d"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleSyntaxScanner.DestructuredAwaitSymbols (cognitive 21): ModuleSyntaxScanner.DestructuredAwaitSymbols has cognitive complexity 21 (threshold 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":"engine/src/CodeHealth.Core/Frontend/ModuleSyntaxScanner.cs"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4719eda6f1d1b27ac21bac078718ff8432108d6dc7ad78fe599438057f26786"}},{"ruleId":"D2","level":"warning","message":{"text":"MaturityAnalyzer.ComposerPsr4Separation (cognitive 21): MaturityAnalyzer.ComposerPsr4Separation has cognitive complexity 21 (threshold 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":"engine/src/CodeHealth.Core/Maturity/MaturityAnalyzer.cs"},"region":{"startLine":2592}}}],"partialFingerprints":{"codehealthFindingId/v1":"4df88486dbd1404e115020dcce21955cebe10ff9e9cff0a398ec8be63cfc4511"}},{"ruleId":"D2","level":"warning","message":{"text":"AccessibilityAnalyzer.ConditionalToggleStateUnexposed (cognitive 21): AccessibilityAnalyzer.ConditionalToggleStateUnexposed has cognitive complexity 21 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs"},"region":{"startLine":4302}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eaf289211cd1407fafec6671fe2253b171f608cc6026ac51ee0b6792e8b92de"}},{"ruleId":"D2","level":"warning","message":{"text":"AccessibilityAnalyzer.EnumerateBuildStepCandidates (cognitive 21): AccessibilityAnalyzer.EnumerateBuildStepCandidates has cognitive complexity 21 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs"},"region":{"startLine":5828}}}],"partialFingerprints":{"codehealthFindingId/v1":"80aeb20582744675932c7006341201b3c3979b8fae1cde77376c0ebb63ab8baf"}},{"ruleId":"D2","level":"warning","message":{"text":"AccessibilityAnalyzer.EnumerateScriptFiles (cognitive 21): AccessibilityAnalyzer.EnumerateScriptFiles has cognitive complexity 21 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs"},"region":{"startLine":6212}}}],"partialFingerprints":{"codehealthFindingId/v1":"43389856efe65318c34ad7d58ce8659e8fd67f895cb9255afc4a9c52612342f2"}},{"ruleId":"D2","level":"warning","message":{"text":"AccessibilityAnalyzer.AppAssignsDocumentTitleAtRuntime (cognitive 21): AccessibilityAnalyzer.AppAssignsDocumentTitleAtRuntime has cognitive complexity 21 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs"},"region":{"startLine":7888}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdfa192052c46820a35bf276dc75fb02f4008e2eae6668ccc393086d0feb7cf5"}},{"ruleId":"D2","level":"warning","message":{"text":"AccessibilityAnalyzer.CountUnreadTemplateLanguageMarkup (cognitive 21): AccessibilityAnalyzer.CountUnreadTemplateLanguageMarkup has cognitive complexity 21 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.TemplateLanguageBlindness.cs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"9efdb910e75aa488ab588ad4ec10dd823cc679b88fca60da48bf55c1a5de85c6"}},{"ruleId":"D2","level":"warning","message":{"text":"AllowlistGate.Match (cognitive 21): AllowlistGate.Match has cognitive complexity 21 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/AllowlistGate.cs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e0f972e9c4947c2466dd3c643bf5fc38d4bafa1a06509a5f68ec06d6aaa2874"}},{"ruleId":"D2","level":"warning","message":{"text":"CoherenceSmellAnalyzer.Implies (cognitive 21): CoherenceSmellAnalyzer.Implies has cognitive complexity 21 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/CoherenceSmellAnalyzer.cs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"78d8c5126804d4c1c12acc46569fa8c5290f413e8a534e0682454f227c402b15"}},{"ruleId":"D2","level":"warning","message":{"text":"CqsAnalyzer.AnalyzeNeutralAsync (cognitive 21): CqsAnalyzer.AnalyzeNeutralAsync has cognitive complexity 21 (threshold 15). 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":"engine/src/CodeHealth.Core/ModelAware/CqsAnalyzer.cs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"81dc2acae01366f0080e51cc91cc0f8b191f0e098bdf20374a29045958b26237"}},{"ruleId":"D2","level":"warning","message":{"text":"DomainModelAnalyzer.DomainReferencesInfrastructure (cognitive 21): DomainModelAnalyzer.DomainReferencesInfrastructure has cognitive complexity 21 (threshold 15). Of this number, 20 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":"engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs"},"region":{"startLine":4592}}}],"partialFingerprints":{"codehealthFindingId/v1":"2111f85bb08236d8e6bafecc9d1a2d28ab85fc993c84684fbd37565e80583505"}},{"ruleId":"D2","level":"warning","message":{"text":"EnvironmentSeparationAnalyzer.FindEnvConfigs (cognitive 21): EnvironmentSeparationAnalyzer.FindEnvConfigs has cognitive complexity 21 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/EnvironmentSeparationAnalyzer.cs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"28d28b8299e9b2c80ad3c3de67da7a9808cb7ed63909633a50f944f414ce79e0"}},{"ruleId":"D2","level":"warning","message":{"text":"EventSourcingAnalyzer.FoldDeterminism (cognitive 21): EventSourcingAnalyzer.FoldDeterminism has cognitive complexity 21 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/EventSourcingAnalyzer.cs"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"93bcb3a9a4a82d1dc0ba9921c22f15472e1f40bf5cc99398ae8c371e03beca77"}},{"ruleId":"D2","level":"warning","message":{"text":"GoDomainConventions.MutatesOwnState (cognitive 21): GoDomainConventions.MutatesOwnState has cognitive complexity 21 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/GoDomainConventions.cs"},"region":{"startLine":2358}}}],"partialFingerprints":{"codehealthFindingId/v1":"2af3f1447c5864d98be2247dba891aac123ccc6d02badffd46e290fcfaabc698"}},{"ruleId":"D2","level":"warning","message":{"text":"GoDomainConventions.ReferencesImport (cognitive 21): GoDomainConventions.ReferencesImport has cognitive complexity 21 (threshold 15). Of this number, 20 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":"engine/src/CodeHealth.Core/ModelAware/GoDomainConventions.cs"},"region":{"startLine":2733}}}],"partialFingerprints":{"codehealthFindingId/v1":"36af976a986f2716bac411e810913cfcf86010f4a17d89a1aba802c5f801c11d"}},{"ruleId":"D2","level":"warning","message":{"text":"IncompletenessAnalyzer.UsageExampleCommentLines (cognitive 21): IncompletenessAnalyzer.UsageExampleCommentLines has cognitive complexity 21 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/IncompletenessAnalyzer.cs"},"region":{"startLine":3579}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbff4f35157b84792478a5bc0e6bf6039e30cb352bc7f57ba707894c1718aeeb"}},{"ruleId":"D2","level":"warning","message":{"text":"RubyDomainConventions.IsRubyDomainCommand (cognitive 21): RubyDomainConventions.IsRubyDomainCommand has cognitive complexity 21 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/RubyDomainConventions.cs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"02e7a287ec67e2886f54ceede46198cd787f0f98aa0c5cab102873e5f7b203d4"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeModelTestCensus.SkipReason (cognitive 21): CodeModelTestCensus.SkipReason has cognitive complexity 21 (threshold 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":"engine/src/CodeHealth.Core/Testing/CodeModelTestCensus.cs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba9bb34671b15310bfeed71b22f1012cfd5b68710641054d957d64d88bf7269f"}},{"ruleId":"D2","level":"warning","message":{"text":"CommittedCoverageReader.ParseGoCoverProfile (cognitive 21): CommittedCoverageReader.ParseGoCoverProfile has cognitive complexity 21 (threshold 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":"engine/src/CodeHealth.Core/Testing/CommittedCoverageReader.cs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"d305b624e324e84e5c85b8decc4dcb125e3db00d1cb5c0786d3ff45c8806c06c"}},{"ruleId":"D2","level":"warning","message":{"text":"CommittedCoverageReader.ParseJsonCoverage (cognitive 21): CommittedCoverageReader.ParseJsonCoverage has cognitive complexity 21 (threshold 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":"engine/src/CodeHealth.Core/Testing/CommittedCoverageReader.cs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3d67df2d9e62d5a2eddbf9296b82006af603f1f6be52545307f4faf5aa93174"}},{"ruleId":"D2","level":"warning","message":{"text":"GoTestCensus.ModuleOf (cognitive 21): GoTestCensus.ModuleOf has cognitive complexity 21 (threshold 15). 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":"engine/src/CodeHealth.Core/Testing/GoTestCensus.cs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"be7155bb8dc63bcd7918f4e95c591d6a20fdf9bf2aae07660731707e5fabec70"}},{"ruleId":"D2","level":"warning","message":{"text":"JsTestCensus.PackageOf (cognitive 21): JsTestCensus.PackageOf has cognitive complexity 21 (threshold 15). 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":"engine/src/CodeHealth.Core/Testing/JsTestCensus.cs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"2925d8d91f6ec7d48dfc379e6c4bb0223c5b7d9d3f9dc2b747a8160f90939115"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeTestSuiteProbe.ChooseRunner (cognitive 21): NodeTestSuiteProbe.ChooseRunner has cognitive complexity 21 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Testing/NodeTestSuiteProbe.cs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6cbbd791d7eaa1ba7da6eb8e7320a67dc782a255e257fa2112c6e83513d7035"}},{"ruleId":"D2","level":"warning","message":{"text":"PythonTestCensus.Strip (cognitive 21): PythonTestCensus.Strip has cognitive complexity 21 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Testing/PythonTestCensus.cs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6becdbc6725b5dd8a646dd0c466c423775ead903da75754fc8ff1fe8c8ec853"}},{"ruleId":"D2","level":"warning","message":{"text":"PythonTestCensus.DistributionOf (cognitive 21): PythonTestCensus.DistributionOf has cognitive complexity 21 (threshold 15). 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":"engine/src/CodeHealth.Core/Testing/PythonTestCensus.cs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd54f9542c60b37b10daeed199b78e8bedc3dcce40af63a0c7e86af42803eb96"}},{"ruleId":"D2","level":"warning","message":{"text":"RoslynTestQualityCollector.HasCommentedOutAssertion (cognitive 21): RoslynTestQualityCollector.HasCommentedOutAssertion has cognitive complexity 21 (threshold 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":"engine/src/CodeHealth.Core/Testing/RoslynTestQualityCollector.cs"},"region":{"startLine":1467}}}],"partialFingerprints":{"codehealthFindingId/v1":"956823c04ec85085cba7d8fd09d2c33c1c577ae24d5e267622763c8c66b70fcf"}},{"ruleId":"D2","level":"warning","message":{"text":"RoslynTestQualityCollector.CollectAssertingTypeNames (cognitive 21): RoslynTestQualityCollector.CollectAssertingTypeNames has cognitive complexity 21 (threshold 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":"engine/src/CodeHealth.Core/Testing/RoslynTestQualityCollector.cs"},"region":{"startLine":1870}}}],"partialFingerprints":{"codehealthFindingId/v1":"d816bbd5d38e7797debccaf8d0a2cf4dd2a0cbe1bda767d2510f70c97f2d3d42"}},{"ruleId":"D2","level":"warning","message":{"text":"RoslynTestQualityCollector.DetectSwallowedFailure (cognitive 21): RoslynTestQualityCollector.DetectSwallowedFailure has cognitive complexity 21 (threshold 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":"engine/src/CodeHealth.Core/Testing/RoslynTestQualityCollector.cs"},"region":{"startLine":2035}}}],"partialFingerprints":{"codehealthFindingId/v1":"920a177bb835fffee0d08ea93bd19bcb862f5f16062b57d64d59ed4613abb5f4"}},{"ruleId":"D2","level":"warning","message":{"text":"RustTestCensus.CrateOf (cognitive 21): RustTestCensus.CrateOf has cognitive complexity 21 (threshold 15). 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":"engine/src/CodeHealth.Core/Testing/RustTestCensus.cs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9fcd3a9f765ebf59eb88f1472b7be19a012c624d262101720c02cdcd3c529ce"}},{"ruleId":"D2","level":"warning","message":{"text":"MailmapIdentityMap.Load (cognitive 21): MailmapIdentityMap.Load has cognitive complexity 21 (threshold 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":"engine/src/CodeHealth.Toolchain/Git/MailmapIdentityMap.cs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"f89e3fc0ffeafb0ce3430b4ac25e2b6b0486d3da247cb6f0576cb3aad17ab092"}},{"ruleId":"D2","level":"warning","message":{"text":"AnalyzeCommand.SelectPrimaryNeutralModel (cognitive 21): AnalyzeCommand.SelectPrimaryNeutralModel has cognitive complexity 21 (threshold 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":"engine/src/CodeHealth.Cli/Commands/AnalyzeCommand.cs"},"region":{"startLine":3553}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba2932f2eaf37f6d56b63273fcf03564e081ddef4f204c0aba880f47bd0255b2"}},{"ruleId":"D2","level":"warning","message":{"text":"ChangeSetBuilder.SplitCluster (cognitive 21): ChangeSetBuilder.SplitCluster has cognitive complexity 21 (threshold 15). Of this number, 20 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":"engine/src/CodeHealth.Reporting/Changelog/Fusion/ChangeSetBuilder.cs"},"region":{"startLine":1046}}}],"partialFingerprints":{"codehealthFindingId/v1":"b60df1d837b6d11b6896c703ff76bfd147b469db9f3da808c5eb96d43a4d16e3"}},{"ruleId":"D2","level":"warning","message":{"text":"DuplicationAnalyzer.OmissionBetween (cognitive 21): DuplicationAnalyzer.OmissionBetween has cognitive complexity 21 (threshold 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":"engine/src/CodeHealth.Dimensions.CodeQuality/CodeShape/DuplicationAnalyzer.cs"},"region":{"startLine":2412}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cfc3677028a9ae4a1170dc5bf108d80e7da255d0ecb4c06aaf55753fbf1a01b"}},{"ruleId":"D2","level":"warning","message":{"text":"DuplicationAnalyzer.AddBoundNames (cognitive 21): DuplicationAnalyzer.AddBoundNames has cognitive complexity 21 (threshold 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":"engine/src/CodeHealth.Dimensions.CodeQuality/CodeShape/DuplicationAnalyzer.cs"},"region":{"startLine":2749}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bb2a15e4047899fb802ae8dcdb18cc991091949c65784b634dfa838307ed895"}},{"ruleId":"D2","level":"warning","message":{"text":"DependencyVulnerabilityUnion.CollapsePerPackage (cognitive 21): DependencyVulnerabilityUnion.CollapsePerPackage has cognitive complexity 21 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent 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":"engine/src/CodeHealth.Dimensions.Security/DependencyVulnerabilityUnion.cs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb4e25ad2c344e5a1b47efc774d077097995919536d34766f0274ccd0f895f41"}},{"ruleId":"D2","level":"warning","message":{"text":"BrowserSandboxDisabledScan.EnvAssignments (cognitive 21): BrowserSandboxDisabledScan.EnvAssignments has cognitive complexity 21 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/BrowserSandboxDisabledScan.cs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f7b2558e9c9f6aa6ec39e4e2d8acdadd50b1ed7b8dee985daeb5d926c17cfea"}},{"ruleId":"D2","level":"warning","message":{"text":"GenericDecodeAdviceRecheck.GenericValueDecodeInto (cognitive 21): GenericDecodeAdviceRecheck.GenericValueDecodeInto has cognitive complexity 21 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/GenericDecodeAdviceRecheck.cs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"d085a96e073f894cb5670778a3be09906f1aada932ce82770eb1bf465d8030dc"}},{"ruleId":"D2","level":"warning","message":{"text":"NamelessWorkloadNormalisedScan.RescanAsync (cognitive 21): NamelessWorkloadNormalisedScan.RescanAsync has cognitive complexity 21 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/NamelessWorkloadNormalisedScan.cs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"04eb1e7fceac0ef3c68769ec7dd189b6278b38767ca84080ba349dc94e0a3be3"}},{"ruleId":"D2","level":"warning","message":{"text":"NamespaceScopedRuleAggregator.KustomizationScope (cognitive 21): NamespaceScopedRuleAggregator.KustomizationScope has cognitive complexity 21 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/NamespaceScopedRuleAggregator.cs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea7c38251133e4e835dfd0aea0c5839c5a9631ba8f122c1c85df3612455ff664"}},{"ruleId":"D2","level":"warning","message":{"text":"ResponseWriteRequestTextRecheck.IsStringLiteralsOnly (cognitive 21): ResponseWriteRequestTextRecheck.IsStringLiteralsOnly has cognitive complexity 21 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/ResponseWriteRequestTextRecheck.cs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e3d379ae1f606193946410279c65b0b0b8b12a2eba875aec93434a09902f2af"}},{"ruleId":"D2","level":"warning","message":{"text":"ShellExecRecheck.JsChildProcessHasNoShell (cognitive 21): ShellExecRecheck.JsChildProcessHasNoShell has cognitive complexity 21 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/ShellExecRecheck.cs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bae6f40462fd088083fd0ddd483ada4b5a5b59ee71153fc87090fe5db1ca988"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkflowTriggerRecheck.FindWorkflowByName (cognitive 21): WorkflowTriggerRecheck.FindWorkflowByName has cognitive complexity 21 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/WorkflowTriggerRecheck.cs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c6281e5466d351f540c90248f421eac3d1dba704d919459396126d1c79e1ffc"}},{"ruleId":"D2","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.SecretArgvSites (cognitive 21): SupplyChainProvenanceAnalyzer.SecretArgvSites has cognitive complexity 21 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":9275}}}],"partialFingerprints":{"codehealthFindingId/v1":"942087fc2aa5d2ec8159def5603fbbbcc4373099338df6619027406265f4380c"}},{"ruleId":"D2","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.DeclaredPackagingScripts (cognitive 21): SupplyChainProvenanceAnalyzer.DeclaredPackagingScripts has cognitive complexity 21 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.PackagingReach.cs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"55e8c9c293bc9edaf5bf28e1263ff2943531b383aa47000acd535d2939523f03"}},{"ruleId":"D2","level":"warning","message":{"text":"KnowledgeDecayModel.LastSubstantiveAuthorStillActive (cognitive 21): KnowledgeDecayModel.LastSubstantiveAuthorStillActive has cognitive complexity 21 (threshold 15). 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":"engine/src/CodeHealth.Dimensions.GitMining/KnowledgeDecayModel.cs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a2e4d1c4ac491c962c9bf456858fac3f96724b9818117949968a844c3a4ceb8"}},{"ruleId":"D2","level":"warning","message":{"text":"FileExtractor._classify_bases (cognitive 21): FileExtractor._classify_bases has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (14 pts), ternaries 2 (4 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/python-frontend/main.py"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"96768214926675d8f85d9f17fd80194b2c7119292033602089399e6d177ec363"}},{"ruleId":"D2","level":"warning","message":{"text":"verified_history.append_verified_history (cognitive 21): verified_history.append_verified_history has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 7, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/depthnoise/verified_history.py"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fd42784e0e4a41fbd2af7e17cccdb1b46d6592a452af719bb49d0970e610ebf"}},{"ruleId":"D2","level":"warning","message":{"text":"expand_corpus.main (cognitive 21): expand_corpus.main has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (11 pts), ternaries 2 (5 pts), boolean chains 3, loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/multilang/expand_corpus.py"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfc29300f9869a2b74ebb4904edb4ef19c329f28b8df8e5735d6456056ad9625"}},{"ruleId":"D2","level":"warning","message":{"text":"scan._shipped_sources (cognitive 21): scan._shipped_sources has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 2 (4 pts), boolean chains 1, ternaries 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/multilang/scan.py"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"778e52732035e0e4c28ff9c06863adab1e0cd42364001d3fe13daeeed7b52996"}},{"ruleId":"D2","level":"warning","message":{"text":"judge-kpass-merge.main (cognitive 21): judge-kpass-merge.main has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 5 (6 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":"tools/train/judge-kpass-merge.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6ffe3292fa853dbf4c53721ee97798f8266c4f7cea54445e85d2fb1a89d47b4"}},{"ruleId":"D2","level":"warning","message":{"text":"production_untouched.main (cognitive 21): production_untouched.main has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 5 (8 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/production_untouched.py"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"982276d2ebebbcf04c29c792fe191d113cbb3d30441c7750c59328d4e18f8a94"}},{"ruleId":"D2","level":"warning","message":{"text":"programme-status.duplicate_pair_agreement (cognitive 21): programme-status.duplicate_pair_agreement has cognitive complexity 21 (threshold 15). Drivers by points: loops 4 (8 pts), if/else 3 (6 pts), ternaries 1 (4 pts), boolean chains 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/programme-status.py"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a923780e358450b9e40b080fc8e2ee5c7d42098799621c36021939c2d104797"}},{"ruleId":"D2","level":"warning","message":{"text":"sample-by-kind.main (cognitive 21): sample-by-kind.main has cognitive complexity 21 (threshold 15). Drivers by points: loops 7 (10 pts), if/else 7 (8 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/sample-by-kind.py"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0a271ac3aba83661c32d8eec683a41f18a0cb3d241ac66c7a35c251bc92a35d"}},{"ruleId":"D2","level":"warning","message":{"text":"codehealth_rust_sidecar::main (cognitive 21): codehealth_rust_sidecar::main has cognitive complexity 21 (threshold 15). Drivers by points: loops 7 (9 pts), match/switch 5 (8 pts), if/else 3 (4 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/rust-frontend/src/main.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"beb45580d8d3021777e73c9bef7d9d181ae9d8f88ec2ba6bd228fa64e9986079"}},{"ruleId":"D2","level":"warning","message":{"text":"codehealth_rust_sidecar::collect_impl (cognitive 21): codehealth_rust_sidecar::collect_impl has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (3 pts), boolean chains 2, match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/rust-frontend/src/main.rs"},"region":{"startLine":1763}}}],"partialFingerprints":{"codehealthFindingId/v1":"44f19ee3355231fdddf22bcb4e59e9fc0aa656fd6ff9f52dd72a143e77034fa1"}},{"ruleId":"D2","level":"warning","message":{"text":"codehealth_rust_sidecar::inner_named (cognitive 21): codehealth_rust_sidecar::inner_named has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (16 pts), loops 1 (4 pts), match/switch 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":"engine/sidecars/rust-frontend/src/main.rs"},"region":{"startLine":5033}}}],"partialFingerprints":{"codehealthFindingId/v1":"0637ef7286a98f0a18e01685ad89fbe561a21df87c1eac1bd8847cfbd66343ed"}},{"ruleId":"D2","level":"warning","message":{"text":"ts-helpers.walk (cognitive 21): ts-helpers.walk has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (16 pts), boolean chains 2, error handling 1, loops 1, ternaries 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/tsjs-frontend/ts-helpers.mjs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8f9301f7d8bfd7cae1c8e317c7d25a9af2c0f218c94e8c80b4d43898932d5dd"}},{"ruleId":"D2","level":"warning","message":{"text":"ElixirDoctest.DoctestSpans (cognitive 20): ElixirDoctest.DoctestSpans has cognitive complexity 20 (threshold 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":"engine/src/CodeHealth.Core/Classification/ElixirDoctest.cs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"8302cbe9d45126d5e9c25cbae0587ba104046f07dbc1182518f1ba582fb9134a"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceClassifier.ScanItemDelimiters (cognitive 20): SourceClassifier.ScanItemDelimiters has cognitive complexity 20 (threshold 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":"engine/src/CodeHealth.Core/Classification/SourceClassifier.cs"},"region":{"startLine":1300}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0e4b22fb8fb56fb690cef0ddaaf48edcce4fd2bfb53cd9f45cbb91e62d0bb0b"}},{"ruleId":"D2","level":"warning","message":{"text":"RoslynVbMethodBody.StripCommentsAndStrings (cognitive 20): RoslynVbMethodBody.StripCommentsAndStrings has cognitive complexity 20 (threshold 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":"engine/src/CodeHealth.Core/CodeModel/Roslyn/RoslynVbMethodBody.cs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cbec8c81ebd6541f43077a078044dfe03bf74619335f60ab52935e6fbf8178d"}},{"ruleId":"D2","level":"warning","message":{"text":"NeutralMethodLengthScanner.Scan (cognitive 20): NeutralMethodLengthScanner.Scan has cognitive complexity 20 (threshold 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":"engine/src/CodeHealth.Core/CodeShape/NeutralMethodLengthScanner.cs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfcbcb2bb511863a85e134721adc781606492032dcb62528071b1fc1245d0cd6"}},{"ruleId":"D2","level":"warning","message":{"text":"NeutralMethodLengthScanner.BodyExtent (cognitive 20): NeutralMethodLengthScanner.BodyExtent has cognitive complexity 20 (threshold 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":"engine/src/CodeHealth.Core/CodeShape/NeutralMethodLengthScanner.cs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"6928cf629978725363ae76eed4505b4a2507e08b88c402129d06699ee75a24ec"}},{"ruleId":"D2","level":"warning","message":{"text":"RazorCodeVirtualizer.SkipString (cognitive 20): RazorCodeVirtualizer.SkipString has cognitive complexity 20 (threshold 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":"engine/src/CodeHealth.Core/CodeShape/RazorCodeVirtualizer.cs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"94aa860b65263eade9f199b6bebc89b9431da65057af25542f741ac9a43bf276"}},{"ruleId":"D2","level":"warning","message":{"text":"ControlFlowComplexity.DominantShape (cognitive 20): ControlFlowComplexity.DominantShape has cognitive complexity 20 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Complexity/ControlFlowComplexity.cs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"f424105b5c5be42df21daf8e7b5599c7ecfe88fef60f94a69c9d335f86785b4d"}},{"ruleId":"D2","level":"warning","message":{"text":"ComplianceSecurityAnalyzer.DetectNamedPolicyEnums (cognitive 20): ComplianceSecurityAnalyzer.DetectNamedPolicyEnums has cognitive complexity 20 (threshold 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":"engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs"},"region":{"startLine":4395}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8572924d3661865a2fed3af95623c308ef409b685e0a75507aee9d6695a01f6"}},{"ruleId":"D2","level":"warning","message":{"text":"HostedHttpSurfaceScan.Enumerate (cognitive 20): HostedHttpSurfaceScan.Enumerate has cognitive complexity 20 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Compliance/HostedHttpSurfaceScan.cs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e4d9325d0ed12bc9d557e9ca9263a479c4680694c1058667d51e19859a808d8"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendAnalyzer.Score (cognitive 20): FrontendAnalyzer.Score has cognitive complexity 20 (threshold 15). 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":"engine/src/CodeHealth.Core/Discovery/FrontendAnalyzer.cs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea5f32374f3dc8a243d235aef307050a00757ff825dfa255dcff881c3a57fe66"}},{"ruleId":"D2","level":"warning","message":{"text":"MarkdownSnippetReferenceScanner.CollectHostFilesAsync (cognitive 20): MarkdownSnippetReferenceScanner.CollectHostFilesAsync has cognitive complexity 20 (threshold 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":"engine/src/CodeHealth.Core/ExplicitDebt/MarkdownSnippetReferenceScanner.cs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f90598ad1782b11d5d15e050c3274d52d54ee377368f403884455ba26912ea4"}},{"ruleId":"D2","level":"warning","message":{"text":"RazorGeneratedDocumentSynthesizer.CollectBoundReferencesAsync (cognitive 20): RazorGeneratedDocumentSynthesizer.CollectBoundReferencesAsync has cognitive complexity 20 (threshold 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":"engine/src/CodeHealth.Core/ExplicitDebt/RazorGeneratedDocumentSynthesizer.cs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e1fe2baec800b563de229f16cbb26351512789321292195f063e0946d3ed185"}},{"ruleId":"D2","level":"warning","message":{"text":"RoslynDeadCodeDetector.IsReflectivelyRegistered (cognitive 20): RoslynDeadCodeDetector.IsReflectivelyRegistered has cognitive complexity 20 (threshold 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":"engine/src/CodeHealth.Core/ExplicitDebt/RoslynDeadCodeDetector.cs"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"76b65300842fae95008e8224819ac8a324e26d89e313ed9aae5556c86bfa9507"}},{"ruleId":"D2","level":"warning","message":{"text":"UnloadedSourceReferenceScanner.Collect (cognitive 20): UnloadedSourceReferenceScanner.Collect has cognitive complexity 20 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ExplicitDebt/UnloadedSourceReferenceScanner.cs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"56c65f9b0b9648e74745b21c7172cb7f771c1d6cf11ef6ecccb987539a5ec258"}},{"ruleId":"D2","level":"warning","message":{"text":"DirectoryBarrelRefs.CollectEdges (cognitive 20): DirectoryBarrelRefs.CollectEdges has cognitive complexity 20 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/DirectoryBarrelRefs.cs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"3605d6fb136ce2d0a5c54a6c1ba2dc32d9b9bacdf3f6e182cd335f15850e8e4b"}},{"ruleId":"D2","level":"warning","message":{"text":"EntryPointCatalog.AddFileRoutedTrees (cognitive 20): EntryPointCatalog.AddFileRoutedTrees has cognitive complexity 20 (threshold 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":"engine/src/CodeHealth.Core/Frontend/EntryPointCatalog.cs"},"region":{"startLine":1422}}}],"partialFingerprints":{"codehealthFindingId/v1":"7622a1d058ec1e4b2d28ba824db70775642be1ad26f315d90898a694e3732537"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendBoundaries.DeclaredWorkspaceMemberDirectories (cognitive 20): FrontendBoundaries.DeclaredWorkspaceMemberDirectories has cognitive complexity 20 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendBoundaries.cs"},"region":{"startLine":1877}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0915537376c16c9fdc7eac4d7d1eb9f102cf8c962f19c41f3c3f6c7b060329b"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendManifestEntryPoints.AddRegistryFiles (cognitive 20): FrontendManifestEntryPoints.AddRegistryFiles has cognitive complexity 20 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendManifestEntryPoints.cs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"635e66d98328f0121b870c9bcf6579d20a263ee38869300ae9b94e2648c9453b"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendTestSuiteMasking.CollectRunnerSetupSiblingRefs (cognitive 20): FrontendTestSuiteMasking.CollectRunnerSetupSiblingRefs has cognitive complexity 20 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendTestSuiteMasking.cs"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e78bf32aa058f8520157d198482b1957910b112bb13f4e6a6612e82697cc09e"}},{"ruleId":"D2","level":"warning","message":{"text":"JsDuplicationDetector.IsSpecialisationDelegationRun (cognitive 20): JsDuplicationDetector.IsSpecialisationDelegationRun has cognitive complexity 20 (threshold 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":"engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs"},"region":{"startLine":3702}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc9e878d0aa4108a8b5aa9c3a0eefe432a3fd5fa4aa9caa2f8a5338cc183b713"}},{"ruleId":"D2","level":"warning","message":{"text":"Scanner.ScanRegex (cognitive 20): Scanner.ScanRegex has cognitive complexity 20 (threshold 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":"engine/src/CodeHealth.Core/Frontend/JsLexer.cs"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"baa9cb4e45a1823d9b956438938b7641fc3ff2b70f35dea7a9f23919f3e208aa"}},{"ruleId":"D2","level":"warning","message":{"text":"MaturityAnalyzer.PubPackageLayoutSeparation (cognitive 20): MaturityAnalyzer.PubPackageLayoutSeparation has cognitive complexity 20 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Maturity/MaturityAnalyzer.cs"},"region":{"startLine":2544}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f5045761c3d5a14d025191d49a8dac55304021f6fa91ea78176b5ff4ebeeb77"}},{"ruleId":"D2","level":"warning","message":{"text":"MaturityAnalyzer.EnumerateJvmModuleDirs (cognitive 20): MaturityAnalyzer.EnumerateJvmModuleDirs has cognitive complexity 20 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Maturity/MaturityAnalyzer.cs"},"region":{"startLine":2719}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d499e609bba5679ebdac4cd820e1b2c8301b8b2b41e43cfc6a37481bb4bceca"}},{"ruleId":"D2","level":"warning","message":{"text":"AccessibilityAnalyzer.TailwindContrast (cognitive 20): AccessibilityAnalyzer.TailwindContrast has cognitive complexity 20 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs"},"region":{"startLine":5245}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d73acf5ea59017bfe9fab5851d6116a96f1b1837270079cbf4fbd5d10972c99"}},{"ruleId":"D2","level":"warning","message":{"text":"AccessibilityAnalyzer.CollectTaggedTemplateMarkup (cognitive 20): AccessibilityAnalyzer.CollectTaggedTemplateMarkup has cognitive complexity 20 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.TaggedTemplateBlindness.cs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4a4f4f26b48a49fa56bf62ebfc7a1c31ffdc2ee7c8023f4be670a258cebc193"}},{"ruleId":"D2","level":"warning","message":{"text":"ConstructibleInvalidStateAnalyzer.Analyze (cognitive 20): ConstructibleInvalidStateAnalyzer.Analyze has cognitive complexity 20 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 4 belong to 4 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/ConstructibleInvalidStateAnalyzer.cs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"81e004a8533189a1482b2b71fe5c14e9e8e1dfeb93b636afd804ef81b3781c4f"}},{"ruleId":"D2","level":"warning","message":{"text":"DomainModelAnalyzer.AggregateBoundaries (cognitive 20): DomainModelAnalyzer.AggregateBoundaries has cognitive complexity 20 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"31b615baac655038f6e969f94375131ce25fdeda57fa59c9e715d0b13b945cc7"}},{"ruleId":"D2","level":"warning","message":{"text":"GoDomainConventions.CrossContextReferenceIdFields (cognitive 20): GoDomainConventions.CrossContextReferenceIdFields has cognitive complexity 20 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/GoDomainConventions.cs"},"region":{"startLine":3015}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4060318906ff16f46e104faf297fa674ea6b65a5d91720b47e8f92806b8b9a8"}},{"ruleId":"D2","level":"warning","message":{"text":"LogicDefectAnalyzer.FlagStateAt (cognitive 20): LogicDefectAnalyzer.FlagStateAt has cognitive complexity 20 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/LogicDefectAnalyzer.cs"},"region":{"startLine":2778}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d6765cadafca43a054fd1bd51b1a79919dc0c94b7a2ed1036ff95ffbdcd2df6"}},{"ruleId":"D2","level":"warning","message":{"text":"ModelAwareLlmJudge.SelectYesAsync (cognitive 20): ModelAwareLlmJudge.SelectYesAsync has cognitive complexity 20 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/ModelAwareLlmJudge.cs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"79827e96a3a2b98396339a264941982ada93471cb9298c77e73de44ede7c3fff"}},{"ruleId":"D2","level":"warning","message":{"text":"ModelAwareLlmJudge.ResolveId (cognitive 20): ModelAwareLlmJudge.ResolveId has cognitive complexity 20 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/ModelAwareLlmJudge.cs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"825a1cf82a5f982b696c18a7fb7f1f1b8f05f5f8aa500390d3f34d9ad4f6a7fe"}},{"ruleId":"D2","level":"warning","message":{"text":"MutationIdempotencyAnalyzer.EnvelopedCommands (cognitive 20): MutationIdempotencyAnalyzer.EnvelopedCommands has cognitive complexity 20 (threshold 15). 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":"engine/src/CodeHealth.Core/ModelAware/MutationIdempotencyAnalyzer.cs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"a449aa21e86eb4baae381155984f5e08b92581c5867ff546e061a54ad150db44"}},{"ruleId":"D2","level":"warning","message":{"text":"MutationIdempotencyAnalyzer.EnvelopedCommands (cognitive 20): MutationIdempotencyAnalyzer.EnvelopedCommands has cognitive complexity 20 (threshold 15). 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":"engine/src/CodeHealth.Core/ModelAware/MutationIdempotencyAnalyzer.cs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"f105f14a9ef2c982089c3fcb170669adcb7978fc59ed5eba211287a9814ec2ae"}},{"ruleId":"D2","level":"warning","message":{"text":"MutationIdempotencyAnalyzer.MutationWrite (cognitive 20): MutationIdempotencyAnalyzer.MutationWrite has cognitive complexity 20 (threshold 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. This shape REPEATS in the file: one other method here (MutationIdempotencyAnalyzer.MutationWrite) 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":"engine/src/CodeHealth.Core/ModelAware/MutationIdempotencyAnalyzer.cs"},"region":{"startLine":1133}}}],"partialFingerprints":{"codehealthFindingId/v1":"86597276e3f87a7b9f305da667b3eba9df15389c0f4a2dba53fce11a893cfc88"}},{"ruleId":"D2","level":"warning","message":{"text":"MutationIdempotencyAnalyzer.MutationWrite (cognitive 20): MutationIdempotencyAnalyzer.MutationWrite has cognitive complexity 20 (threshold 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. This shape REPEATS in the file: one other method here (MutationIdempotencyAnalyzer.MutationWrite) 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":"engine/src/CodeHealth.Core/ModelAware/MutationIdempotencyAnalyzer.cs"},"region":{"startLine":1166}}}],"partialFingerprints":{"codehealthFindingId/v1":"814a55503024bcef5be91b06e45dd7a51c165d799b3d58c6a6d5616ecdc9d4ff"}},{"ruleId":"D2","level":"warning","message":{"text":"PerformanceAnalyzer.DiscoverBenchmarksOnDisk (cognitive 20): PerformanceAnalyzer.DiscoverBenchmarksOnDisk has cognitive complexity 20 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/PerformanceAnalyzer.cs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"425a0e218f69ea94c1ca82899b8a2385078cf3dcdf7537da16ec8522f9cdd7c2"}},{"ruleId":"D2","level":"warning","message":{"text":"ScalaDomainConventions.AnemicEntities (cognitive 20): ScalaDomainConventions.AnemicEntities has cognitive complexity 20 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/ScalaDomainConventions.cs"},"region":{"startLine":856}}}],"partialFingerprints":{"codehealthFindingId/v1":"772a5767aad11b823afd3b34ba6ccd91ba4612043b1fa518d359baac00db1dc7"}},{"ruleId":"D2","level":"warning","message":{"text":"SecurityDefectAnalyzer.AnalyzeAsync (cognitive 20): SecurityDefectAnalyzer.AnalyzeAsync has cognitive complexity 20 (threshold 15). 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":"engine/src/CodeHealth.Core/ModelAware/SecurityDefectAnalyzer.cs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2d9cbeb5077f35621cd05c216bc1e1d8e48e6e9553a54026f6a2ca2184e6d0e"}},{"ruleId":"D2","level":"warning","message":{"text":"StringContractSmellAnalyzer.ResolveContracts (cognitive 20): StringContractSmellAnalyzer.ResolveContracts has cognitive complexity 20 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/StringContractSmellAnalyzer.cs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"da34fce0bbb2ab39f0fbd011f55413b705a45ff488034deb41bb959503644c48"}},{"ruleId":"D2","level":"warning","message":{"text":"PipelineVersionOutputScan.ScanWorkflow (cognitive 20): PipelineVersionOutputScan.ScanWorkflow has cognitive complexity 20 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Readiness/PipelineVersionOutputScan.cs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"be8bf572eaee41cff76cff99ef6d75b33d6ab8c461bebd3fc3b5f3d6875512e0"}},{"ruleId":"D2","level":"warning","message":{"text":"DotnetProjectLicensesCollector.FilterToProductPackages (cognitive 20): DotnetProjectLicensesCollector.FilterToProductPackages has cognitive complexity 20 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Security/DotnetProjectLicensesCollector.cs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"76d6beed05fff348045d5d645243000a0270335507e86da68b8b0250dd1e5b17"}},{"ruleId":"D2","level":"warning","message":{"text":"XmlProjectGraphBuilder.EmbeddedProjectFiles (cognitive 20): XmlProjectGraphBuilder.EmbeddedProjectFiles has cognitive complexity 20 (threshold 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":"engine/src/CodeHealth.Core/Statistics/XmlProjectGraphBuilder.cs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"28fc1e655e476b0a32d987f3ed355595de5a171f954cf68fb8e1f57e5972c96a"}},{"ruleId":"D2","level":"warning","message":{"text":"DiskTestScanner.HasRustInlineTestSuite (cognitive 20): DiskTestScanner.HasRustInlineTestSuite has cognitive complexity 20 (threshold 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":"engine/src/CodeHealth.Core/Testing/DiskTestScanner.cs"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"59704b13fe5867cea0962f5accff6428e2ccf34c8a75427f99d19abf4f7bd745"}},{"ruleId":"D2","level":"warning","message":{"text":"DiskTestScanner.DeclaresJsTestRunner (cognitive 20): DiskTestScanner.DeclaresJsTestRunner has cognitive complexity 20 (threshold 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":"engine/src/CodeHealth.Core/Testing/DiskTestScanner.cs"},"region":{"startLine":1031}}}],"partialFingerprints":{"codehealthFindingId/v1":"f52c3579551f71154e807d481cc49e072a8f46ec86eef66f2cb82040a6e43013"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeTestSuiteProbe.DeclaredOnPathToRoot (cognitive 20): NodeTestSuiteProbe.DeclaredOnPathToRoot has cognitive complexity 20 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Testing/NodeTestSuiteProbe.cs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeba79229460767daf87e2d113477355bf3e97578c2ee63de77315f278d46c68"}},{"ruleId":"D2","level":"warning","message":{"text":"PreprocessorTestRegions.HandleDirective (cognitive 20): PreprocessorTestRegions.HandleDirective has cognitive complexity 20 (threshold 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":"engine/src/CodeHealth.Core/Testing/PreprocessorTestRegions.cs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"5398eba1d1e22e1715dfeeae02348b941b3f317fa1a66d093d88504f6b15da27"}},{"ruleId":"D2","level":"warning","message":{"text":"XPlatCollectorProbe.EnumerateBuildFiles (cognitive 20): XPlatCollectorProbe.EnumerateBuildFiles has cognitive complexity 20 (threshold 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":"engine/src/CodeHealth.Core/Testing/XPlatCollectorProbe.cs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"8df2ed6d6ed4d2d6fb31a62e532de41b637b68f9152d5d55764772652091ab7d"}},{"ruleId":"D2","level":"warning","message":{"text":"PartialLoadDiagnosticsReport.Render (cognitive 20): PartialLoadDiagnosticsReport.Render has cognitive complexity 20 (threshold 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":"engine/src/CodeHealth.Cli/Diagnostics/PartialLoadDiagnosticsReport.cs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ba95fcf55ccdd72ac41fc1d9af33bb8b3112cc570653f62cc113a1436f772b4"}},{"ruleId":"D2","level":"warning","message":{"text":"DsmHtml.AppendTable (cognitive 20): DsmHtml.AppendTable has cognitive complexity 20 (threshold 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":"engine/src/CodeHealth.Reporting/Architecture/DsmHtml.cs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"2025b004f0b56a569cec5a458d9391212a21dc98ea1331af626caf040cba09b7"}},{"ruleId":"D2","level":"warning","message":{"text":"FileQualityScorer.Score (cognitive 20): FileQualityScorer.Score has cognitive complexity 20 (threshold 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":"engine/src/CodeHealth.Reporting/FileQuality/FileQualityScorer.cs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"088c6f087c7572eb2b53394ebac0c2f5c225badddfdc580d98086a1e577960e8"}},{"ruleId":"D2","level":"warning","message":{"text":"ProjectCohesionAnalyzer.RunAsync (cognitive 20): ProjectCohesionAnalyzer.RunAsync has cognitive complexity 20 (threshold 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":"engine/src/CodeHealth.Dimensions.Architecture/ProjectCohesionAnalyzer.cs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"919288234b562a824d55b92469666a0a70993a023967bcf27c2f9960924fa257"}},{"ruleId":"D2","level":"warning","message":{"text":"GodClassAnalyzer.SignificantJsLineCount (cognitive 20): GodClassAnalyzer.SignificantJsLineCount has cognitive complexity 20 (threshold 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":"engine/src/CodeHealth.Dimensions.CodeQuality/CodeShape/GodClassAnalyzer.cs"},"region":{"startLine":922}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5e479b86a64c7cd31580f9bab27b742054e891fbf1942071a3d0f159e44c69b"}},{"ruleId":"D2","level":"warning","message":{"text":"ComplexityScoring.BuildResult (cognitive 20): ComplexityScoring.BuildResult has cognitive complexity 20 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 8 belong to one function literal inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.CodeQuality/Complexity/ComplexityScoring.cs"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4f127a22e09204b69794dfdc1651a431185e05ea1c6b5e3a66a1f6b57e752f1"}},{"ruleId":"D2","level":"warning","message":{"text":"IlEfficiencyAnalyzer.RunAsync (cognitive 20): IlEfficiencyAnalyzer.RunAsync has cognitive complexity 20 (threshold 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":"engine/src/CodeHealth.Dimensions.CodeQuality/IlEfficiencyAnalyzer.cs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"335601ca5a93186a288e46119583ef5a6902ac6601c206ae83774eb937a00642"}},{"ruleId":"D2","level":"warning","message":{"text":"CargoLockGraph.GitPinnedGateAbove (cognitive 20): CargoLockGraph.GitPinnedGateAbove has cognitive complexity 20 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/CargoLockGraph.cs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e6dd8589f61d20bc9b3b6e4ccc60129ae8425c0e51000a74beb97a13b8a9071"}},{"ruleId":"D2","level":"warning","message":{"text":"DeclaredDependencies.FromRepository (cognitive 20): DeclaredDependencies.FromRepository has cognitive complexity 20 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/DeclaredDependencies.cs"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd11d5f77156bc38b02166c2ade3795f8ec58f4d2de7f9be63df64cacbb5d161"}},{"ruleId":"D2","level":"warning","message":{"text":"KsvSecurityContextAggregator.Collapse (cognitive 20): KsvSecurityContextAggregator.Collapse has cognitive complexity 20 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/KsvSecurityContextAggregator.cs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"20b93ca4783637798730e3ce56e2f0346ff925b302e79ef893322735f850d791"}},{"ruleId":"D2","level":"warning","message":{"text":"MarkupEscapingRecheck.ScanModuleForHtmlEscapingTemplate (cognitive 20): MarkupEscapingRecheck.ScanModuleForHtmlEscapingTemplate has cognitive complexity 20 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/MarkupEscapingRecheck.cs"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"564f1b9c83615d252bc68f0468ff21498b05e8033130b3b999ef79ed379df2b4"}},{"ruleId":"D2","level":"warning","message":{"text":"NoOpToolShimScan.SplitRedirect (cognitive 20): NoOpToolShimScan.SplitRedirect has cognitive complexity 20 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/NoOpToolShimScan.cs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"13fe2e70e4cc9639d2b6eeb64364db1d1dc886a88742081bd069d936a6da1596"}},{"ruleId":"D2","level":"warning","message":{"text":"OsvScannerIgnores.Parse (cognitive 20): OsvScannerIgnores.Parse has cognitive complexity 20 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/OsvScannerIgnores.cs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"98c48fde1c341d44d5d13238323a7ed91440ad9405be5c3f9b14a0df166ca84c"}},{"ruleId":"D2","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.EnumerateManifestCandidates (cognitive 20): SupplyChainProvenanceAnalyzer.EnumerateManifestCandidates has cognitive complexity 20 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":5080}}}],"partialFingerprints":{"codehealthFindingId/v1":"81551ad44e58bc4d134400dc97b77fa64e6bbef2c435800ea3296f324ee11174"}},{"ruleId":"D2","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.LineLeaksCredentialInArgv (cognitive 20): SupplyChainProvenanceAnalyzer.LineLeaksCredentialInArgv has cognitive complexity 20 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":9818}}}],"partialFingerprints":{"codehealthFindingId/v1":"d047ed960958d9f5f3d2c24f246a5bf8a0ac0548b2cb86b28b822ea4b6b89565"}},{"ruleId":"D2","level":"warning","message":{"text":"ChangeCouplingAnalyzer.IsStringCatalogueFile (cognitive 20): ChangeCouplingAnalyzer.IsStringCatalogueFile has cognitive complexity 20 (threshold 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":"engine/src/CodeHealth.Dimensions.GitMining/ChangeCouplingAnalyzer.cs"},"region":{"startLine":2446}}}],"partialFingerprints":{"codehealthFindingId/v1":"14e113c60b5ac28854c532e78d54f545d14b17b608b33d0ce9a955b092343f5f"}},{"ruleId":"D2","level":"warning","message":{"text":"GitMiningSourceFiles.IsConstantEnumerationText (cognitive 20): GitMiningSourceFiles.IsConstantEnumerationText has cognitive complexity 20 (threshold 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":"engine/src/CodeHealth.Dimensions.GitMining/GitMiningSourceFiles.cs"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"e225124631e3a6e238071cf6ea4014713f805472188c81731164e0d28b26a3e2"}},{"ruleId":"D2","level":"warning","message":{"text":"CoverageAnalyzer.PolyglotUnmeasured (cognitive 20): CoverageAnalyzer.PolyglotUnmeasured has cognitive complexity 20 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 4 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":"engine/src/CodeHealth.Dimensions.Testing/CoverageAnalyzer.cs"},"region":{"startLine":1267}}}],"partialFingerprints":{"codehealthFindingId/v1":"894a38044ff82325d39be1208637671e998a77e2cdfadd979895740f26148d72"}},{"ruleId":"D2","level":"warning","message":{"text":"FSharpSyntaxModel.typeDefnOf (cognitive 20): FSharpSyntaxModel.typeDefnOf has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 6 (17 pts), if/else 2, boolean chains 1 (nesting depth added 11). 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":"engine/src/CodeHealth.CodeModel.FSharp/SyntaxModel.fs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"41473431fce8abdcd76de9a064baec2fb361e96853bf0ef384349adda144d204"}},{"ruleId":"D2","level":"warning","message":{"text":"highconc-sweep.main (cognitive 20): highconc-sweep.main has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 5 (10 pts), if/else 4 (7 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":"tools/llm-bakeoff/highconc-sweep.py"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"39ecaa99553802bf9d588dc6232210ac7e53a6f534a678799d32fef4cd9eb5e5"}},{"ruleId":"D2","level":"warning","message":{"text":"build_onboard_manifest.main (cognitive 20): build_onboard_manifest.main has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 5, loops 4 (5 pts), ternaries 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/multilang/build_onboard_manifest.py"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"479e0b496466ebe3d72a7b3cec9adc903fc688efbfd8270068a7879ae5c299da"}},{"ruleId":"D2","level":"warning","message":{"text":"scan.warn_image_stale (cognitive 20): scan.warn_image_stale has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (11 pts), ternaries 2 (4 pts), boolean chains 3, loops 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":"tools/multilang/scan.py"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"90e0df4e35828e076a8dd2e3ebb2bbd8d91f97c5706df9ca37abf6643109d0ef"}},{"ruleId":"D2","level":"warning","message":{"text":"census.audit (cognitive 20): census.audit has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 4, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/rescan/census.py"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7c37221e284a5fcc52f4239c61b35a5afb6cc3e4b1109d78c4a48f8f21aa541"}},{"ruleId":"D2","level":"warning","message":{"text":"adjudication.main (cognitive 20): adjudication.main has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 5 (10 pts), if/else 5, boolean chains 4, error handling 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/adjudication.py"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"755cb00a74d50eeb461523f7c497ac5832520c1d9d903a2c485725c90f055ec0"}},{"ruleId":"D2","level":"warning","message":{"text":"judge_assignment.render_markdown (cognitive 20): judge_assignment.render_markdown has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 5, boolean chains 3, ternaries 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":"tools/train/judge_assignment.py"},"region":{"startLine":1626}}}],"partialFingerprints":{"codehealthFindingId/v1":"77def201fbfa258a5527c239ab80baa4d9b237aca95acb74364cd1b1cd7313a9"}},{"ruleId":"D2","level":"warning","message":{"text":"maturity.main (cognitive 20): maturity.main has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 5 (10 pts), boolean chains 5, if/else 2 (3 pts), loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/maturity.py"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"3550060731cc7983b769afafa4075b60233332c0bf0fe4fae03027a3faaf8b56"}},{"ruleId":"D2","level":"warning","message":{"text":"scope-evidence.project_contents_evidence (cognitive 20): scope-evidence.project_contents_evidence has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 pts), error handling 1 (3 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/scope-evidence.py"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"b00b84e76e8135ada11201790685be8c0257e0ed0284a487f2988299e85e1394"}},{"ruleId":"D2","level":"warning","message":{"text":"SymbolCollector.enterNode (cognitive 20): SymbolCollector.enterNode has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 8, if/else 5 (6 pts), ternaries 2 (4 pts), loops 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":"engine/sidecars/php-frontend/main.php"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"5469e89573e6cc034f0c4a8396b638b5abf370ed13d18a19817acedbcec86c53"}},{"ruleId":"D2","level":"warning","message":{"text":"main.dataLiteralMaskOver (cognitive 20): main.dataLiteralMaskOver has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 4 (5 pts), boolean chains 3, match/switch 1 (nesting depth added 4). Most of this is not in the body itself: 4 of the 20 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 337, 322). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/go/bodylines.go"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fb0d7cdb28fdddd88410f96852910508164161ac777173eea63359ca2c54ae9"}},{"ruleId":"D2","level":"warning","message":{"text":"extractor.computeImplements (cognitive 20): extractor.computeImplements has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 4 (5 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/go/implements.go"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"b796fd99d60a130a69dd95f8ac157a6913481163452cc67d260d712da163ceeb"}},{"ruleId":"D2","level":"warning","message":{"text":"Model::resolve_impl_owner (cognitive 20): Model::resolve_impl_owner has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 1, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/rust-frontend/src/main.rs"},"region":{"startLine":980}}}],"partialFingerprints":{"codehealthFindingId/v1":"27f35a8e262d8595d7d09aad7a83ad37b44203fd41fac24a0359b54ca97d23a8"}},{"ruleId":"D2","level":"warning","message":{"text":"BodyVisitor::walk_select_arms (cognitive 20): BodyVisitor::walk_select_arms has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (4 pts), match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/rust-frontend/src/main.rs"},"region":{"startLine":3726}}}],"partialFingerprints":{"codehealthFindingId/v1":"67e63297f33e77424ecb25ffc760c7c19722d41e7f6f8ca0b50594a986446b34"}},{"ruleId":"D2","level":"warning","message":{"text":"codehealth_rust_sidecar::split_attrs (cognitive 20): codehealth_rust_sidecar::split_attrs has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/rust-frontend/src/main.rs"},"region":{"startLine":5101}}}],"partialFingerprints":{"codehealthFindingId/v1":"048eb28ce58fbd27d005256a014c116cde878142ecb720905c5646baeb5d09c7"}},{"ruleId":"D2","level":"warning","message":{"text":"AggregateSiblingContexts.Detect (cognitive 19): AggregateSiblingContexts.Detect has cognitive complexity 19 (threshold 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":"engine/src/CodeHealth.Core/Architecture/AggregateSiblingContexts.cs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad3d98faac48f8e78e9ad6330d765da90b1e80777a136ac17224ed89c32c4aed"}},{"ruleId":"D2","level":"warning","message":{"text":"ContainerDetector.BuildAsync (cognitive 19): ContainerDetector.BuildAsync has cognitive complexity 19 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent 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":"engine/src/CodeHealth.Core/Architecture/ContainerDetector.cs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"95957e6bf497299b0f6f37ba933d2f2552ff200c4f4c86df6d74ff49ba8c2323"}},{"ruleId":"D2","level":"warning","message":{"text":"ContainerDetector.HostKind (cognitive 19): ContainerDetector.HostKind has cognitive complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Architecture/ContainerDetector.cs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"d91e5b274e6570ef89145f6a0643b44f81397d069f6e3ad820f36b425538456c"}},{"ruleId":"D2","level":"warning","message":{"text":"RepoTopologyScanner.EnumerateFiles (cognitive 19): RepoTopologyScanner.EnumerateFiles has cognitive complexity 19 (threshold 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":"engine/src/CodeHealth.Core/Architecture/Topology/RepoTopologyScanner.cs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"acdbea6496278cb26a4254371aa26d06b81b76b7857c5efe02898b08e51a3450"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceClassifier.CountCatalogueLines (cognitive 19): SourceClassifier.CountCatalogueLines has cognitive complexity 19 (threshold 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":"engine/src/CodeHealth.Core/Classification/SourceClassifier.cs"},"region":{"startLine":1336}}}],"partialFingerprints":{"codehealthFindingId/v1":"a568b3562eb86729a1e18243d78787dd86970df94c767ee1f1946a89ae757976"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceClassifier.PackageJsonVerdict (cognitive 19): SourceClassifier.PackageJsonVerdict has cognitive complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Classification/SourceClassifier.cs"},"region":{"startLine":3473}}}],"partialFingerprints":{"codehealthFindingId/v1":"27f6886aa19e751e34c62989a3e0ff1ec6c4d77fc6bd105fb36e3983318e3647"}},{"ruleId":"D2","level":"warning","message":{"text":"NeutralGodClassScanner.Scan (cognitive 19): NeutralGodClassScanner.Scan has cognitive complexity 19 (threshold 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":"engine/src/CodeHealth.Core/CodeShape/NeutralGodClassScanner.cs"},"region":{"startLine":1011}}}],"partialFingerprints":{"codehealthFindingId/v1":"461f0d0fbe439adb00c9955c92fff28872bb0312cf9b34a30ed9284d9560ef52"}},{"ruleId":"D2","level":"warning","message":{"text":"NeutralMethodLengthScanner.ReadSignature (cognitive 19): NeutralMethodLengthScanner.ReadSignature has cognitive complexity 19 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/CodeShape/NeutralMethodLengthScanner.cs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"9487c51f5ddaae731d119c909078f7935b5b1568198dd8373b37470e3950cbc8"}},{"ruleId":"D2","level":"warning","message":{"text":"ComplianceSecurityAnalyzer.ScanWeakKdfWorkFactor (cognitive 19): ComplianceSecurityAnalyzer.ScanWeakKdfWorkFactor has cognitive complexity 19 (threshold 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":"engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs"},"region":{"startLine":2892}}}],"partialFingerprints":{"codehealthFindingId/v1":"0966f735c62b66fa8a365c1f1860d17162936b19b1c1748984adbc28ce095fa9"}},{"ruleId":"D2","level":"warning","message":{"text":"ComplianceSecurityAnalyzer.ScanWeakHashTrustGates (cognitive 19): ComplianceSecurityAnalyzer.ScanWeakHashTrustGates has cognitive complexity 19 (threshold 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":"engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs"},"region":{"startLine":3642}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb3ce36e3b728aa52a198c9037e0c00f92b539561046e1651884d9c88fc760d3"}},{"ruleId":"D2","level":"warning","message":{"text":"HostedHttpSurfaceScan.Scan (cognitive 19): HostedHttpSurfaceScan.Scan has cognitive complexity 19 (threshold 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":"engine/src/CodeHealth.Core/Compliance/HostedHttpSurfaceScan.cs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"eecd1e7bfb73356869921a3d7805e49ac50dae725f978a94a431f2021bf62ad2"}},{"ruleId":"D2","level":"warning","message":{"text":"HexRegistryClient.Parse (cognitive 19): HexRegistryClient.Parse has cognitive complexity 19 (threshold 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":"engine/src/CodeHealth.Core/Dependencies/HexRegistryClient.cs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"b354c12cedb8bfa310884042072659418f9be802513597b5fcb7aa49fdbdeb37"}},{"ruleId":"D2","level":"warning","message":{"text":"UnityCurrencyCollector.CollectAsync (cognitive 19): UnityCurrencyCollector.CollectAsync has cognitive complexity 19 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Dependencies/UnityCurrencyCollector.cs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"94d8ace6aabb5f74a243b2c71bb5d301fdd160195afbcef744f09b9b9a0a6430"}},{"ruleId":"D2","level":"warning","message":{"text":"FileSystemDocumentationCollector.MeasureCoverageAsync (cognitive 19): FileSystemDocumentationCollector.MeasureCoverageAsync has cognitive complexity 19 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent 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":"engine/src/CodeHealth.Core/Docs/FileSystemDocumentationCollector.cs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee285dce9d312bfde46abbd6eba8675b90f6486d6aaa01966d01f0343d1b4fdb"}},{"ruleId":"D2","level":"warning","message":{"text":"RazorGeneratedDocumentSynthesizer.Fork (cognitive 19): RazorGeneratedDocumentSynthesizer.Fork has cognitive complexity 19 (threshold 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":"engine/src/CodeHealth.Core/ExplicitDebt/RazorGeneratedDocumentSynthesizer.cs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ea56e1daae9bcf43ed0d18df7f19654ec263f48acc726b54f311ea7c556c0da"}},{"ruleId":"D2","level":"warning","message":{"text":"RazorGeneratedDocumentSynthesizer.ReadDirectives (cognitive 19): RazorGeneratedDocumentSynthesizer.ReadDirectives has cognitive complexity 19 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent 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":"engine/src/CodeHealth.Core/ExplicitDebt/RazorGeneratedDocumentSynthesizer.cs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbb8d62028c27e29d37eede4bd7e7d6c32b2e426c5ec2fd622f9752e33eac83d"}},{"ruleId":"D2","level":"warning","message":{"text":"RoslynExplicitDebtCollector.SegmentRuns (cognitive 19): RoslynExplicitDebtCollector.SegmentRuns has cognitive complexity 19 (threshold 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":"engine/src/CodeHealth.Core/ExplicitDebt/RoslynExplicitDebtCollector.cs"},"region":{"startLine":2442}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b3365c493443f674517d40279174b98be1dda08d0ac95f5d9ccd09442a4f80a"}},{"ruleId":"D2","level":"warning","message":{"text":"ChangelogFiles.IsChangelogFileName (cognitive 19): ChangelogFiles.IsChangelogFileName has cognitive complexity 19 (threshold 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":"engine/src/CodeHealth.Core/FileQuality/ChangelogFiles.cs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c155e7665cafa86f7f6b2af0fb63e2fa736e98c3a3731f0acedc4ef1ac677c4"}},{"ruleId":"D2","level":"warning","message":{"text":"GeneratedRegionScan.Analyse (cognitive 19): GeneratedRegionScan.Analyse has cognitive complexity 19 (threshold 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":"engine/src/CodeHealth.Core/FileQuality/GeneratedRegionScan.cs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"e273f79667371985ec304ad6029aefe95f02a6df292d0a5c988c043d28204e6c"}},{"ruleId":"D2","level":"warning","message":{"text":"UpstreamAttribution.ReadOwnDeclarations (cognitive 19): UpstreamAttribution.ReadOwnDeclarations has cognitive complexity 19 (threshold 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":"engine/src/CodeHealth.Core/FileQuality/UpstreamAttribution.cs"},"region":{"startLine":1669}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ed3524f3015fc21b48a79c79f9b55c3921476f09b5f56c96adae44ac02840f2"}},{"ruleId":"D2","level":"warning","message":{"text":"DocsSiteTrees.Detect (cognitive 19): DocsSiteTrees.Detect has cognitive complexity 19 (threshold 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":"engine/src/CodeHealth.Core/Frontend/DocsSiteTrees.cs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"1afc489220b1e9a014d78d1db1f0a16919003c4ec02f2237f69e7ede9c089db7"}},{"ruleId":"D2","level":"warning","message":{"text":"EntryPointCatalog.DetectTooling (cognitive 19): EntryPointCatalog.DetectTooling has cognitive complexity 19 (threshold 15). 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":"engine/src/CodeHealth.Core/Frontend/EntryPointCatalog.cs"},"region":{"startLine":984}}}],"partialFingerprints":{"codehealthFindingId/v1":"153107c7c3166b367cbcc0026e8b2fa9e1b522b6ca6463a644aca76f088b0faa"}},{"ruleId":"D2","level":"warning","message":{"text":"FirstPartyJs.Enumerate (cognitive 19): FirstPartyJs.Enumerate has cognitive complexity 19 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/FirstPartyJs.cs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8615e7c737fd8a3785081f76b6057603b459af849cbea05b61b18b4d3da4348"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendBoundaries.ProjectSliceCycles (cognitive 19): FrontendBoundaries.ProjectSliceCycles has cognitive complexity 19 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendBoundaries.cs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a3a6fdcccb1282ba966bb4e2d7e2fe89edc0071a0358b2f1340d40e7dd53441"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendBoundaries.CollectLayeredViolations (cognitive 19): FrontendBoundaries.CollectLayeredViolations has cognitive complexity 19 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendBoundaries.cs"},"region":{"startLine":856}}}],"partialFingerprints":{"codehealthFindingId/v1":"46363d726ba4c210e87bdb642faf1ad826efc379f0664aeb221f1dfbb2867d9e"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendDeadCode.FindEntrylessPackages (cognitive 19): FrontendDeadCode.FindEntrylessPackages has cognitive complexity 19 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendDeadCode.cs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0d4008363f39b412f60e44829df0d46ece65e036cc79ecae036299a7106098b"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendDeclaredPackageRefs.CollectSourceNamedPluginPackages (cognitive 19): FrontendDeclaredPackageRefs.CollectSourceNamedPluginPackages has cognitive complexity 19 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendDeclaredPackageRefs.cs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"36e73f43f1d4370cf64c9d5bc8642e2382bc85bb3211d7f00d0f02fcf952af3a"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendSpecifierScanning.IsInsideComment (cognitive 19): FrontendSpecifierScanning.IsInsideComment has cognitive complexity 19 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendSpecifierScanning.cs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"647052851b9e4c3e67891f0ffceaa23e6eea16c5d75ef7d2b669edc624b41644"}},{"ruleId":"D2","level":"warning","message":{"text":"JsDuplicationDetector.OutermostEnclosingCallee (cognitive 19): JsDuplicationDetector.OutermostEnclosingCallee has cognitive complexity 19 (threshold 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":"engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs"},"region":{"startLine":2036}}}],"partialFingerprints":{"codehealthFindingId/v1":"dde0742b04473923916af9212d2dae710260f9cd7ec5aabb8068dec9be4c4508"}},{"ruleId":"D2","level":"warning","message":{"text":"JsDuplicationDetector.TryCollapsePeriodicRun (cognitive 19): JsDuplicationDetector.TryCollapsePeriodicRun has cognitive complexity 19 (threshold 15). 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":"engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs"},"region":{"startLine":4661}}}],"partialFingerprints":{"codehealthFindingId/v1":"0887e31d29c268b3fc23afd6be22a172b1b853e37b173d58ec9b324b25a9d7bf"}},{"ruleId":"D2","level":"warning","message":{"text":"Scanner.TryScanJsxTypeArguments (cognitive 19): Scanner.TryScanJsxTypeArguments has cognitive complexity 19 (threshold 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":"engine/src/CodeHealth.Core/Frontend/JsLexer.Jsx.cs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9ad4c7d55cf0d89c574c3a071375d3e5f778a60707e7b72bae85f0441786f05"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleSyntaxScanner.IsFunctionSignatureParen (cognitive 19): ModuleSyntaxScanner.IsFunctionSignatureParen has cognitive complexity 19 (threshold 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":"engine/src/CodeHealth.Core/Frontend/ModuleSyntaxScanner.cs"},"region":{"startLine":1616}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac72040846683b9a6542ed52f3368a0947b1814ffa244d721aa2cd40567e7d1b"}},{"ruleId":"D2","level":"warning","message":{"text":"MaturityAnalyzer.AppendVerifiableEvidence (cognitive 19): MaturityAnalyzer.AppendVerifiableEvidence has cognitive complexity 19 (threshold 15). 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":"engine/src/CodeHealth.Core/Maturity/MaturityAnalyzer.cs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfeb22ed7f5bb21349d77e10f14868e5118540ca1127ab567dcf36fa7c2595a9"}},{"ruleId":"D2","level":"warning","message":{"text":"MaturityAnalyzer.HasPerPackageSrcLayout (cognitive 19): MaturityAnalyzer.HasPerPackageSrcLayout has cognitive complexity 19 (threshold 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":"engine/src/CodeHealth.Core/Maturity/MaturityAnalyzer.cs"},"region":{"startLine":3109}}}],"partialFingerprints":{"codehealthFindingId/v1":"173651f7bb12a73e1935284b656820983eea319120ff308b833be6f0cad0ceb7"}},{"ruleId":"D2","level":"warning","message":{"text":"ArchitectureModelAnalyzer.StatefulSingletons (cognitive 19): ArchitectureModelAnalyzer.StatefulSingletons has cognitive complexity 19 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 5 belong to 5 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":"engine/src/CodeHealth.Core/ModelAware/ArchitectureModelAnalyzer.cs"},"region":{"startLine":852}}}],"partialFingerprints":{"codehealthFindingId/v1":"6516a920964ed2098342870a20679f3b6ef998475765ddf5be3ebb671cdd7ec2"}},{"ruleId":"D2","level":"warning","message":{"text":"ArchitectureModelAnalyzer.RetentionScopes (cognitive 19): ArchitectureModelAnalyzer.RetentionScopes has cognitive complexity 19 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/ArchitectureModelAnalyzer.cs"},"region":{"startLine":1775}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5579a8ac68ae9ea3ab74b2a56f9c0208c3cc9379f065f5d98c886c7015d521e"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeCompositionByRoleAnalyzer.AnalyzeAsync (cognitive 19): CodeCompositionByRoleAnalyzer.AnalyzeAsync has cognitive complexity 19 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/CodeCompositionByRoleAnalyzer.cs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"34de8a12dd5a3c86661f3a627f37ee45be67aa0c9391d12a59a7b196a24851a6"}},{"ruleId":"D2","level":"warning","message":{"text":"GoDomainConventions.RepositoryContractLeak (cognitive 19): GoDomainConventions.RepositoryContractLeak has cognitive complexity 19 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/GoDomainConventions.cs"},"region":{"startLine":1410}}}],"partialFingerprints":{"codehealthFindingId/v1":"31ce5d59266eb43ca03fbf23a89b0647ad80bd41afbdfb57a6c50ebeba9472e9"}},{"ruleId":"D2","level":"warning","message":{"text":"IncompletenessAnalyzer.HasSubstantiveSiblingImplementation (cognitive 19): IncompletenessAnalyzer.HasSubstantiveSiblingImplementation has cognitive complexity 19 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/IncompletenessAnalyzer.cs"},"region":{"startLine":2408}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b5b935f1167f2f8891a9e87b06a267c54ee77cf542f1603bc0c2c79c7777a10"}},{"ruleId":"D2","level":"warning","message":{"text":"JsInteropContractAnalyzer.InlineMarkupScripts (cognitive 19): JsInteropContractAnalyzer.InlineMarkupScripts has cognitive complexity 19 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/JsInteropContractAnalyzer.cs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"235a7fbc1543b76f989be1ba8dcb4fbcc4a737f2348e9501a2adc15690e1893a"}},{"ruleId":"D2","level":"warning","message":{"text":"ComposePsParser.ParseObjects (cognitive 19): ComposePsParser.ParseObjects has cognitive complexity 19 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/RuntimeBoot/ComposePsParser.cs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"29980a9758621cf1fa0c9dc8fa02d9920a3095dbe2bd41997aec238214e06bb0"}},{"ruleId":"D2","level":"warning","message":{"text":"DevServerDetector.ShallowestPackageJsons (cognitive 19): DevServerDetector.ShallowestPackageJsons has cognitive complexity 19 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/RuntimeBoot/DevServerDetector.cs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca44cfe8750002c88aebfe524164341a98b04b6f19b35a3a82d5ff7a3ba59573"}},{"ruleId":"D2","level":"warning","message":{"text":"ProductionReadinessAnalyzer.DeclaresNonEmptyUpdateList (cognitive 19): ProductionReadinessAnalyzer.DeclaresNonEmptyUpdateList has cognitive complexity 19 (threshold 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":"engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs"},"region":{"startLine":5584}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a626ac7d70ea4f4833c0575229acfa2b490d79b2106705c622bc39fcfbae8d1"}},{"ruleId":"D2","level":"warning","message":{"text":"ProductionReadinessAnalyzer.ReadAllMatching (cognitive 19): ProductionReadinessAnalyzer.ReadAllMatching has cognitive complexity 19 (threshold 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":"engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs"},"region":{"startLine":7753}}}],"partialFingerprints":{"codehealthFindingId/v1":"98e005d3c9187ae383f7c9868645014091af0f6ce804dfaac9ba898f8f4683bc"}},{"ruleId":"D2","level":"warning","message":{"text":"PublishedPackageLockfiles.Inspect (cognitive 19): PublishedPackageLockfiles.Inspect has cognitive complexity 19 (threshold 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":"engine/src/CodeHealth.Core/Readiness/PublishedPackageLockfiles.cs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"67f7af1cbf8c9d2fb0721cd8213f081a959357218a5d6d3ee1c5c7c1d81b6be0"}},{"ruleId":"D2","level":"warning","message":{"text":"BuildlessCSharpProjects.Build (cognitive 19): BuildlessCSharpProjects.Build has cognitive complexity 19 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Roslyn/BuildlessCSharpProjects.cs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d97a692ca5fb8d2c8e0246688877166b903899bcc564805802c4f0b5edbd1f5"}},{"ruleId":"D2","level":"warning","message":{"text":"DiskSourceFiles.FrontendShareCensusAsync (cognitive 19): DiskSourceFiles.FrontendShareCensusAsync has cognitive complexity 19 (threshold 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":"engine/src/CodeHealth.Core/Scoring/DiskSourceFiles.cs"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"6711877dedd6a68a28c7abb16cd4cbf890d567fd225441adeb64e74d8d1d4999"}},{"ruleId":"D2","level":"warning","message":{"text":"CommittedCoverageReader.MergeGoCoverProfilePerFile (cognitive 19): CommittedCoverageReader.MergeGoCoverProfilePerFile has cognitive complexity 19 (threshold 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":"engine/src/CodeHealth.Core/Testing/CommittedCoverageReader.cs"},"region":{"startLine":1111}}}],"partialFingerprints":{"codehealthFindingId/v1":"a11c22d9b794a706594bcd84ab25fd3cd97d35e748ecb465bef81ee4f922ba90"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeBrowserProvision.ProvisionShim (cognitive 19): NodeBrowserProvision.ProvisionShim has cognitive complexity 19 (threshold 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":"engine/src/CodeHealth.Core/Testing/NodeBrowserProvision.cs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"192fcf7ffd1def72a8f320068cbae9d4f3b3967a61f45a340c0a5be96aad9504"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeTestReliabilityCollector.ParseMocha (cognitive 19): NodeTestReliabilityCollector.ParseMocha has cognitive complexity 19 (threshold 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":"engine/src/CodeHealth.Core/Testing/NodeTestReliabilityCollector.cs"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"726108a9042b6765bd3053f7cb43c007c9bdb04cdec422a4605766864ed72202"}},{"ruleId":"D2","level":"warning","message":{"text":"PythonTestCensus.BlankString (cognitive 19): PythonTestCensus.BlankString has cognitive complexity 19 (threshold 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":"engine/src/CodeHealth.Core/Testing/PythonTestCensus.cs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf48efc52c49db22c23e81c8e9aeaa977383e31626de75f8ad024760b97be1b3"}},{"ruleId":"D2","level":"warning","message":{"text":"RoslynTestQualityCollector.AssertionsViaLocalHelpers (cognitive 19): RoslynTestQualityCollector.AssertionsViaLocalHelpers has cognitive complexity 19 (threshold 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":"engine/src/CodeHealth.Core/Testing/RoslynTestQualityCollector.cs"},"region":{"startLine":1706}}}],"partialFingerprints":{"codehealthFindingId/v1":"5782ca0e872c1100a4426d489f992085822f7f9e2cd6cdf15e26fd7edb172e23"}},{"ruleId":"D2","level":"warning","message":{"text":"SolutionProjectCaseResolver.Resolve (cognitive 19): SolutionProjectCaseResolver.Resolve has cognitive complexity 19 (threshold 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":"engine/src/CodeHealth.Toolchain/Roslyn/SolutionProjectCaseResolver.cs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"fff1f3185a4d8b7c9c754c1a2f0583dc17c1fab98f3e9d8d2da182afc47b0009"}},{"ruleId":"D2","level":"warning","message":{"text":"DegradedDiagnosticsReport.Walk (cognitive 19): DegradedDiagnosticsReport.Walk has cognitive complexity 19 (threshold 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":"engine/src/CodeHealth.Cli/Diagnostics/DegradedDiagnosticsReport.cs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"7be5dbe43ae08a8988ef05616128636dd6fb76146b99483f466f9f3e80515c34"}},{"ruleId":"D2","level":"warning","message":{"text":"ReportViewModelFactory.BuildDimensionCards (cognitive 19): ReportViewModelFactory.BuildDimensionCards has cognitive complexity 19 (threshold 15). Most of this is not in the body itself: 0 of the 19 points are its own statements and the rest belongs to one function literal inside it that branches (line 1556). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Reporting/Templates/ReportViewModelFactory.cs"},"region":{"startLine":1555}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb17df4941ed8463c5347ba08be6b1f5b33e3834fb7b6c3d9ce2ea7434900b8e"}},{"ruleId":"D2","level":"warning","message":{"text":"DuplicationAnalyzer.ScrubAnnotationArguments (cognitive 19): DuplicationAnalyzer.ScrubAnnotationArguments has cognitive complexity 19 (threshold 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":"engine/src/CodeHealth.Dimensions.CodeQuality/CodeShape/DuplicationAnalyzer.cs"},"region":{"startLine":2015}}}],"partialFingerprints":{"codehealthFindingId/v1":"25f0b4c93c79b751331f17cc1b100609d32a270568a629b9a1670716a22be3cc"}},{"ruleId":"D2","level":"warning","message":{"text":"CargoLockGraph.DeclaredEntryAbove (cognitive 19): CargoLockGraph.DeclaredEntryAbove has cognitive complexity 19 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/CargoLockGraph.cs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"85e5310ca2e228de6e7d4a33e95dd7af4bd3f3caac58ebc5978e8bf90676638f"}},{"ruleId":"D2","level":"warning","message":{"text":"DockerfileSyntax.Statements (cognitive 19): DockerfileSyntax.Statements has cognitive complexity 19 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/DockerfileSyntax.cs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a126930098413e07c0cbfdf8f90f5bd5749515a7110ecea90f5c24e5e183179"}},{"ruleId":"D2","level":"warning","message":{"text":"DuplicateResourceCopyAggregator.Collapse (cognitive 19): DuplicateResourceCopyAggregator.Collapse has cognitive complexity 19 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/DuplicateResourceCopyAggregator.cs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"509780f64bc30c2bdf5e11412433596107a9989ca829d3f213e06e6a160bea94"}},{"ruleId":"D2","level":"warning","message":{"text":"HostPathPersistentVolumeScan.HostPathBacking (cognitive 19): HostPathPersistentVolumeScan.HostPathBacking has cognitive complexity 19 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/HostPathPersistentVolumeScan.cs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"280cfe8f6523ecf90c1052f90d6ed6bd6e49afc3e8cec9cc086a704e0aa1c65d"}},{"ruleId":"D2","level":"warning","message":{"text":"ScanParsers.SemgrepUnparsedRegions (cognitive 19): ScanParsers.SemgrepUnparsedRegions has cognitive complexity 19 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/ScanParsers.cs"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"56c173164cf527bf7a82433b662e224a5cbde6d4ebce7395391d0d1991599ad3"}},{"ruleId":"D2","level":"warning","message":{"text":"SecretNoiseFilter.RubyFormulaTestBlockRegions (cognitive 19): SecretNoiseFilter.RubyFormulaTestBlockRegions has cognitive complexity 19 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/SecretNoiseFilter.cs"},"region":{"startLine":4503}}}],"partialFingerprints":{"codehealthFindingId/v1":"083817dfac299966ecd1d4ceb6430f5a50265303fcb0e35768c4296fcf813d60"}},{"ruleId":"D2","level":"warning","message":{"text":"FileModel.HelperNeutralises (cognitive 19): FileModel.HelperNeutralises has cognitive complexity 19 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/SqlBuilderCompositionWalk.cs"},"region":{"startLine":1070}}}],"partialFingerprints":{"codehealthFindingId/v1":"2159a79094012ae1380b0bcb03c30ea1a0ebcb3c79e48c2b00d73e2909323c9e"}},{"ruleId":"D2","level":"warning","message":{"text":"TextSentinelConstantIndex.IndexLines (cognitive 19): TextSentinelConstantIndex.IndexLines has cognitive complexity 19 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/TextSentinelConstantIndex.cs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bd80cfe07235228e2fadc4955ec994bd6ceca9392748e905d06f02a01a349b0"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkflowInputGateRecheck.AdmitsOnlyShellSafeText (cognitive 19): WorkflowInputGateRecheck.AdmitsOnlyShellSafeText has cognitive complexity 19 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/WorkflowInputGateRecheck.cs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"b654ec635d6ce5b8519779275e49222dd0b5a1497a9f363202566158cb1bbf21"}},{"ruleId":"D2","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.UnpinnedUseSites (cognitive 19): SupplyChainProvenanceAnalyzer.UnpinnedUseSites has cognitive complexity 19 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfbbc8d81ce92c29c2651688802429c425637b23d80669500ee0ced07c71ed89"}},{"ruleId":"D2","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.DirtyPublishSites (cognitive 19): SupplyChainProvenanceAnalyzer.DirtyPublishSites has cognitive complexity 19 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":1987}}}],"partialFingerprints":{"codehealthFindingId/v1":"13763bd7d05132705b07ee2f69ce35a76ed09fdeb5006d5c6c3336b8131f4dc3"}},{"ruleId":"D2","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.BuildIntegrityArms (cognitive 19): SupplyChainProvenanceAnalyzer.BuildIntegrityArms has cognitive complexity 19 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":2265}}}],"partialFingerprints":{"codehealthFindingId/v1":"399a752b0c0c2be9641fdc41d701da7842791d9e22cb2fa8ae868b6a9fdd75da"}},{"ruleId":"D2","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.ExpandWorkspacePattern (cognitive 19): SupplyChainProvenanceAnalyzer.ExpandWorkspacePattern has cognitive complexity 19 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":4198}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8341da07185eefca178e714aa6f0f3e06c0f0bad751cc6e5c09d0bb3d009e66"}},{"ruleId":"D2","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.ReadLocalCompositeActions (cognitive 19): SupplyChainProvenanceAnalyzer.ReadLocalCompositeActions has cognitive complexity 19 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":5673}}}],"partialFingerprints":{"codehealthFindingId/v1":"eac3023055821b65fbfcd1fa96275908fc6bc6de34159343d683c50ac0c983b8"}},{"ruleId":"D2","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.WorkflowJobs (cognitive 19): SupplyChainProvenanceAnalyzer.WorkflowJobs has cognitive complexity 19 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":7585}}}],"partialFingerprints":{"codehealthFindingId/v1":"09dfa1babc1ed44f6cf72f62430e102b3e43867bdfc835cacef67f6f2ca72659"}},{"ruleId":"D2","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.ReleaseProcedureNamesTarget (cognitive 19): SupplyChainProvenanceAnalyzer.ReleaseProcedureNamesTarget has cognitive complexity 19 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.ReleasePathReach.cs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"b291c82fd688c46e82e7439357c9d76281b40827ea6d82432aa7676f831f1c64"}},{"ruleId":"D2","level":"warning","message":{"text":"ChangeCouplingAnalyzer.DetectHubs (cognitive 19): ChangeCouplingAnalyzer.DetectHubs has cognitive complexity 19 (threshold 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":"engine/src/CodeHealth.Dimensions.GitMining/ChangeCouplingAnalyzer.cs"},"region":{"startLine":1247}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f59e4a07760b9fd383de8d2358b7467c66ec7ae7ea1f18230c7148c784c939c"}},{"ruleId":"D2","level":"warning","message":{"text":"ChangeCouplingAnalyzer.IsTransitiveSubtype (cognitive 19): ChangeCouplingAnalyzer.IsTransitiveSubtype has cognitive complexity 19 (threshold 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":"engine/src/CodeHealth.Dimensions.GitMining/ChangeCouplingAnalyzer.cs"},"region":{"startLine":4398}}}],"partialFingerprints":{"codehealthFindingId/v1":"c747bf3fddcd5ef50d894ae729714ede2e2cdb037efe4338ba277bfe2a054487"}},{"ruleId":"D2","level":"warning","message":{"text":"FSharpProvider.CollectUntypedBodies (cognitive 19): FSharpProvider.CollectUntypedBodies has cognitive complexity 19 (threshold 15). Drivers by points: loops 6 (12 pts), match/switch 6 (7 pts) (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":"engine/src/CodeHealth.CodeModel.FSharp/FSharpProvider.fs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"920937cf165666521596996aa298ba6c3f797f8fc89cfd76965be14f98cda62b"}},{"ruleId":"D2","level":"warning","message":{"text":"FSharpBody.substring (cognitive 19): FSharpBody.substring has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.CodeModel.FSharp/Body.fs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"23199f8c73f68a0d1a5fd656019d089eb7a1c818779f535a1f05734658052371"}},{"ruleId":"D2","level":"warning","message":{"text":"Emitter.bufferBody (cognitive 19): Emitter.bufferBody has cognitive complexity 19 (threshold 15). Drivers by points: loops 12, if/else 2 (4 pts), boolean chains 2, ternaries 1 (nesting depth added 2). 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":"engine/sidecars/java-spoon/src/main/java/dev/canine/codehealth/java/Emitter.java"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"70fe487949f50183cc79f911e89af4dd947a91a5476a9ccc1cf2b9d7c73858ce"}},{"ruleId":"D2","level":"warning","message":{"text":"main.collect_self_fields (cognitive 19): main.collect_self_fields has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 3 (7 pts), boolean chains 2 (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":"engine/sidecars/python-frontend/main.py"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"42d551e70d7dce7f413960517ad90ae31b434feba6d677f5c63c20de6efd13ae"}},{"ruleId":"D2","level":"warning","message":{"text":"build-quality-pairs-v2.main (cognitive 19): build-quality-pairs-v2.main has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 4 (5 pts), ternaries 1 (2 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":"tools/llm-bakeoff/build-quality-pairs-v2.py"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"d93fc71a4a092068f92bf096de9ffdb821ba33ddd1b5f474594b79f094b756ba"}},{"ruleId":"D2","level":"warning","message":{"text":"baseline.run_and_extract (cognitive 19): baseline.run_and_extract has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (7 pts), loops 3 (6 pts), boolean chains 4, ternaries 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/multilang/baseline.py"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"49f5c678c6ebff2ebc9eeace2bd215b3ccf20973dcdaa7da8bbb4a2854fb6978"}},{"ruleId":"D2","level":"warning","message":{"text":"layer-attribution-probe.unconditional (cognitive 19): layer-attribution-probe.unconditional has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/backlog-sessions/01a081bf-3479/layer-attribution-probe.py"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b4e2c95c9f752fc37549a9e59f4f570bec75a93329cbd90fab298ba2e8a724a"}},{"ruleId":"D2","level":"warning","message":{"text":"judge-calibration.code_window (cognitive 19): judge-calibration.code_window has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3, loops 2, error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/judge-calibration.py"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"e08cfa0c43bd85c102948e81a4970ebb415c3040df226520e6ac650502ef329f"}},{"ruleId":"D2","level":"warning","message":{"text":"model-sweep.parse (cognitive 19): model-sweep.parse has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/model-sweep.py"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"c67eb8040e56605d42f5742e149817cb6ee8f10b540978188f94208f933554eb"}},{"ruleId":"D2","level":"warning","message":{"text":"report_round.fingerprint_rows (cognitive 19): report_round.fingerprint_rows has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 9, if/else 3 (6 pts), loops 3 (4 pts) (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":"tools/train/report_round.py"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"baccdc1d4405ea417b42202b6d42b6c191d638c7c490fe748e7dc1a4b29000de"}},{"ruleId":"D2","level":"warning","message":{"text":"select_todo.main (cognitive 19): select_todo.main has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3, ternaries 2, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/select_todo.py"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"21b578a8f8eb06094967ce608bdd9a268f9075230bc51fb7814082a75551a662"}},{"ruleId":"D2","level":"warning","message":{"text":"bodyResolver.memberAccessShapes (cognitive 19): bodyResolver.memberAccessShapes has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 2, match/switch 1 (nesting depth added 9). Most of this is not in the body itself: 0 of the 19 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 409, 402). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/go/bodyshapes.go"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"996638f6c89627ddd8eb9d8f67bd3bd74fe6bf1810a9e5a4c96bfc7d6fcc6d4d"}},{"ruleId":"D2","level":"warning","message":{"text":"codehealth_rust_sidecar::collect_exported_defs_in (cognitive 19): codehealth_rust_sidecar::collect_exported_defs_in has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (15 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/rust-frontend/src/main.rs"},"region":{"startLine":2132}}}],"partialFingerprints":{"codehealthFindingId/v1":"665035ec6634c5c9f1f1bf718e42957e0b8c34527348069732c580813423aedc"}},{"ruleId":"D2","level":"warning","message":{"text":"codehealth_rust_sidecar::cfg_selects_test (cognitive 19): codehealth_rust_sidecar::cfg_selects_test has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/rust-frontend/src/main.rs"},"region":{"startLine":5219}}}],"partialFingerprints":{"codehealthFindingId/v1":"55ea0f5520c970edc0da448642f0a15b56ddee67ec6a30eec3dbb7fe57dc5474"}},{"ruleId":"D2","level":"warning","message":{"text":"main (cognitive 19): main has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 4, error handling 3, loops 2 (3 pts) (nesting depth added 4). Most of this is not in the body itself: 6 of the 19 points are its own statements and the rest belongs to 9 function items inside it that branch (resolveModuleNames::(anonymous), (anonymous), isFile, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/tsjs-frontend/main.mjs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"3936b080e7334484d6d90e41d27ad55144c8a6706c0df02995f2a21cc8b95f3d"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceClassifier.IsDevelopmentOnlyTree (cognitive 18): SourceClassifier.IsDevelopmentOnlyTree has cognitive complexity 18 (threshold 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":"engine/src/CodeHealth.Core/Classification/SourceClassifier.cs"},"region":{"startLine":3573}}}],"partialFingerprints":{"codehealthFindingId/v1":"10443532012715894c1d38286544dbb84b89716948894ee866babd4cc45c7a22"}},{"ruleId":"D2","level":"warning","message":{"text":"NeutralFileLengthScanner.RustImplSubject (cognitive 18): NeutralFileLengthScanner.RustImplSubject has cognitive complexity 18 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/CodeShape/NeutralFileLengthScanner.cs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bafbf868d595686579f9943c129ab13e0523ef3d549d6541f8e18418b6962d0"}},{"ruleId":"D2","level":"warning","message":{"text":"RoslynDuplicationDetector.IsRenameCopy (cognitive 18): RoslynDuplicationDetector.IsRenameCopy has cognitive complexity 18 (threshold 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":"engine/src/CodeHealth.Core/CodeShape/RoslynDuplicationDetector.cs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fac24877f3cd9ba4d15f6aa9704ae1529e1fd21b69a318c4de38c14c4d7acc2"}},{"ruleId":"D2","level":"warning","message":{"text":"ComplianceSecurityAnalyzer.C1 (cognitive 18): ComplianceSecurityAnalyzer.C1 has cognitive complexity 18 (threshold 15). 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":"engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs"},"region":{"startLine":5054}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bf8ad6ab5b10c0da9b9c0bfc09ec51336a25c74e37979cd1385a34f1addcea5"}},{"ruleId":"D2","level":"warning","message":{"text":"BundlerManifestHygiene.RuntimeClosure (cognitive 18): BundlerManifestHygiene.RuntimeClosure has cognitive complexity 18 (threshold 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":"engine/src/CodeHealth.Core/Dependencies/BundlerManifestHygiene.cs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8588baa71d4c0857c3b91144d8b6bc181b50b889566e254ff3a6fc68530922d"}},{"ruleId":"D2","level":"warning","message":{"text":"NpmManifestHygiene.FloatingReason (cognitive 18): NpmManifestHygiene.FloatingReason has cognitive complexity 18 (threshold 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":"engine/src/CodeHealth.Core/Dependencies/NpmManifestHygiene.cs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a9e8d19aecbc33fcb335c38c550a7b2af88b383318818d9527a220bc87bfe39"}},{"ruleId":"D2","level":"warning","message":{"text":"UnityLockfileReader.ReadResolved (cognitive 18): UnityLockfileReader.ReadResolved has cognitive complexity 18 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent 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":"engine/src/CodeHealth.Core/Dependencies/UnityLockfileReader.cs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"6324d54294d113c5cde4cc2f2dbd7d720109ea5a0c8457c4c24d366a09bd950a"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendToolingManifests.DeclaredWorkspaceDirectories (cognitive 18): FrontendToolingManifests.DeclaredWorkspaceDirectories has cognitive complexity 18 (threshold 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":"engine/src/CodeHealth.Core/Discovery/FrontendToolingManifests.cs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c8cc7e42f2c884ba47c08732e3dff4ec8a41c3b6b961be21da529f6bf34785e"}},{"ruleId":"D2","level":"warning","message":{"text":"RazorMarkupReferenceScanner.CollectByComponentAsync (cognitive 18): RazorMarkupReferenceScanner.CollectByComponentAsync has cognitive complexity 18 (threshold 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":"engine/src/CodeHealth.Core/ExplicitDebt/RazorMarkupReferenceScanner.cs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9a9566d9ccb3ec8c760e0f8134d27df9da58fd21fce52239e5f3bf655f5c689"}},{"ruleId":"D2","level":"warning","message":{"text":"RoslynExplicitDebtCollector.DeclaresPublication (cognitive 18): RoslynExplicitDebtCollector.DeclaresPublication has cognitive complexity 18 (threshold 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":"engine/src/CodeHealth.Core/ExplicitDebt/RoslynExplicitDebtCollector.cs"},"region":{"startLine":4685}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aa069193871254b86010dea7221665d77961d9dbcd371ad705dc2db3697426a"}},{"ruleId":"D2","level":"warning","message":{"text":"XamlMarkupReferenceScanner.CollectByComponentAsync (cognitive 18): XamlMarkupReferenceScanner.CollectByComponentAsync has cognitive complexity 18 (threshold 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":"engine/src/CodeHealth.Core/ExplicitDebt/XamlMarkupReferenceScanner.cs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"6670656b8732e85cb1c2d3195f70812e965b7db914ab6b992d5d56bc518b8deb"}},{"ruleId":"D2","level":"warning","message":{"text":"EggMiddlewareNameRefs.Collect (cognitive 18): EggMiddlewareNameRefs.Collect has cognitive complexity 18 (threshold 15). 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":"engine/src/CodeHealth.Core/Frontend/EggMiddlewareNameRefs.cs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f5cf38a479e18455196890718d1dfca393c8889cee42d40ffeaa5a1cb429c1b"}},{"ruleId":"D2","level":"warning","message":{"text":"ForeignLanguageTestRefs.Collect (cognitive 18): ForeignLanguageTestRefs.Collect has cognitive complexity 18 (threshold 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":"engine/src/CodeHealth.Core/Frontend/ForeignLanguageTestRefs.cs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d9be7697b33f8dbb53e153cf73fc17aff1db6f600098a93305262e7fc2c293e"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendBoundaries.CollectCrossPackageAssetImports (cognitive 18): FrontendBoundaries.CollectCrossPackageAssetImports has cognitive complexity 18 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendBoundaries.cs"},"region":{"startLine":1669}}}],"partialFingerprints":{"codehealthFindingId/v1":"d160b8650b464656635fb37b1403e6c8eed9d54a20b9e77b5dfad506b6693eec"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendBoundaries.EnclosingPublishedPackage (cognitive 18): FrontendBoundaries.EnclosingPublishedPackage has cognitive complexity 18 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendBoundaries.cs"},"region":{"startLine":2000}}}],"partialFingerprints":{"codehealthFindingId/v1":"23b8b55fe245a59c86e8f93d4bf0aac4cf00ce902388511f70707edf78ea8154"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendBoundaries.IsNonProductionImporter (cognitive 18): FrontendBoundaries.IsNonProductionImporter has cognitive complexity 18 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendBoundaries.cs"},"region":{"startLine":2103}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa5a26fe1fddb19fa5bb9411b3852d619041309139192d6d75d5f839a0751605"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendDeclaredPackageRefs.CollectRouteTrees (cognitive 18): FrontendDeclaredPackageRefs.CollectRouteTrees has cognitive complexity 18 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendDeclaredPackageRefs.cs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"96bdd276dd1ade478d80022238e47667f5fbf2edd1b0030cb5c9ef8cadc3453a"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendDeclaredPackageRefs.CollectConfigReferencedPackages (cognitive 18): FrontendDeclaredPackageRefs.CollectConfigReferencedPackages has cognitive complexity 18 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendDeclaredPackageRefs.cs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d60443b254b10d4b08a0d970a6061452be7c4d6681a28ac6760dfaca0ca2505"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendEmittedTemplateRefs.AddEmittedTemplateTreeRefs (cognitive 18): FrontendEmittedTemplateRefs.AddEmittedTemplateTreeRefs has cognitive complexity 18 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendEmittedTemplateRefs.cs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"d11f6520d672345ce2f69231c38d7e5cf36e62a4ecee70aaf0100f949ef4a4b2"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendManifestParsing.ReadSubpathImports (cognitive 18): FrontendManifestParsing.ReadSubpathImports has cognitive complexity 18 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendManifestParsing.cs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf7d06f71fe92e50fefb09bdc8ea7b165dbeb9be0a02a1762d370de1d1e995eb"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendModuleGraph.ReachableFrom (cognitive 18): FrontendModuleGraph.ReachableFrom has cognitive complexity 18 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendModuleGraph.cs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb40635e0e01c05eb778a37ae862460d22d65ec6a9e7fa0e59f5cf42d6a29c7f"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendTestReachability.IsBehaviourFreeDataModule (cognitive 18): FrontendTestReachability.IsBehaviourFreeDataModule has cognitive complexity 18 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendTestReachability.cs"},"region":{"startLine":1320}}}],"partialFingerprints":{"codehealthFindingId/v1":"e03531a011f21554b7fa445622e393811a46270b16400a6b6b22d33eabfa5f16"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendToolAndRuntimeRefs.CollectUnwiredBenchmarkScripts (cognitive 18): FrontendToolAndRuntimeRefs.CollectUnwiredBenchmarkScripts has cognitive complexity 18 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/FrontendToolAndRuntimeRefs.cs"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f145330a4235952f4b78afd20d52d0e8e983fe3cba1fda752a6061587a7619a"}},{"ruleId":"D2","level":"warning","message":{"text":"JsConstantOnlyField.PropertyWrites (cognitive 18): JsConstantOnlyField.PropertyWrites has cognitive complexity 18 (threshold 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":"engine/src/CodeHealth.Core/Frontend/JsConstantOnlyField.cs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf7805989f00864bc82dabc8e7548f72b5d3cce885c495aeaed7bcff86578c18"}},{"ruleId":"D2","level":"warning","message":{"text":"Scanner.IsGenericArrowTypeParameterList (cognitive 18): Scanner.IsGenericArrowTypeParameterList has cognitive complexity 18 (threshold 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":"engine/src/CodeHealth.Core/Frontend/JsLexer.Jsx.cs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"011b33938b0a36ff9e821b90d420d5013ee5c43bd4552ead678d8326fffe9d84"}},{"ruleId":"D2","level":"warning","message":{"text":"Scanner.ScanJsxExpressionContainer (cognitive 18): Scanner.ScanJsxExpressionContainer has cognitive complexity 18 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/JsLexer.Jsx.cs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"603c8b914140e6924872bfe592d4e01db8452da3620ea06499c7f833baa02fd7"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleGlobPattern.ResolveRepoRelative (cognitive 18): ModuleGlobPattern.ResolveRepoRelative has cognitive complexity 18 (threshold 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":"engine/src/CodeHealth.Core/Frontend/ModuleGlobPattern.cs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"dee3248193667f2efdbb0e2c73860e6491ec3dcc3c36ba1ff7d00dd93fee2c16"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleResolver.ConditionAlternatives (cognitive 18): ModuleResolver.ConditionAlternatives has cognitive complexity 18 (threshold 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":"engine/src/CodeHealth.Core/Frontend/ModuleResolver.cs"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"620ed99eda0f7a4bf0bd17ab4dd78d70fa32e6d9b206f20407111ab1ebbd0a6e"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleSyntaxScanner.OpensFunctionBody (cognitive 18): ModuleSyntaxScanner.OpensFunctionBody has cognitive complexity 18 (threshold 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":"engine/src/CodeHealth.Core/Frontend/ModuleSyntaxScanner.cs"},"region":{"startLine":1473}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c946f18d97af69a9e9f9c20132404c8e4e2a9df8471d572faa51d7f1289b53c"}},{"ruleId":"D2","level":"warning","message":{"text":"TokenAlignment.LongestMatch (cognitive 18): TokenAlignment.LongestMatch has cognitive complexity 18 (threshold 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":"engine/src/CodeHealth.Core/Frontend/TokenAlignment.cs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"04fc96ac2362fa147d78acfa24694db62d0e31a53d3a2b0626f2f6be72578878"}},{"ruleId":"D2","level":"warning","message":{"text":"MarkupParser.NormalizeBoundAttributes (cognitive 18): MarkupParser.NormalizeBoundAttributes has cognitive complexity 18 (threshold 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":"engine/src/CodeHealth.Core/Markup/MarkupParser.cs"},"region":{"startLine":1252}}}],"partialFingerprints":{"codehealthFindingId/v1":"445334860e2975d0cd3c5bb3eea43f8db75e9b921436eee214ca944c226e81ed"}},{"ruleId":"D2","level":"warning","message":{"text":"MarkupParser.EnumerateMarkupFiles (cognitive 18): MarkupParser.EnumerateMarkupFiles has cognitive complexity 18 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Markup/MarkupParser.cs"},"region":{"startLine":1455}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe8718a150d53996189d113d18fe53943d2716f46b93c5242cc2595e48f71ff0"}},{"ruleId":"D2","level":"warning","message":{"text":"AccessibilityAnalyzer.VisualAndMotion (cognitive 18): AccessibilityAnalyzer.VisualAndMotion has cognitive complexity 18 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs"},"region":{"startLine":4496}}}],"partialFingerprints":{"codehealthFindingId/v1":"b11074528aa7a5fdf9f75652144c8e26a32daa4e83f6a5283aca114c4dcb340e"}},{"ruleId":"D2","level":"warning","message":{"text":"AccessibilityAnalyzer.StyleSheetContrast (cognitive 18): AccessibilityAnalyzer.StyleSheetContrast has cognitive complexity 18 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs"},"region":{"startLine":4568}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f3a5c9305d9cdce9ab0994a856a0cf3d421267100413729db6c9956d197d3fa"}},{"ruleId":"D2","level":"warning","message":{"text":"AccessibilityAnalyzer.ScriptReachesA11yCheck (cognitive 18): AccessibilityAnalyzer.ScriptReachesA11yCheck has cognitive complexity 18 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs"},"region":{"startLine":7026}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfea0982f4f5c65286eba75105ca01e98e66bf479be444e8ffa252bc9030d96e"}},{"ruleId":"D2","level":"warning","message":{"text":"EventDrivenAnalyzer.ScalaEventNaming (cognitive 18): EventDrivenAnalyzer.ScalaEventNaming has cognitive complexity 18 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs"},"region":{"startLine":2229}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1909da50191b9b0b44bf1cf66f1670404b47df32f651d32179b0d3ba39191ae"}},{"ruleId":"D2","level":"warning","message":{"text":"EventDrivenAnalyzer.DeclaredConstantsByType (cognitive 18): EventDrivenAnalyzer.DeclaredConstantsByType has cognitive complexity 18 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs"},"region":{"startLine":2397}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dc2c73fda9623ac40a5acaa18bdad65ebb5a22f4e4981b37cce2a172b653e86"}},{"ruleId":"D2","level":"warning","message":{"text":"GoDomainConventions.RecordsDomainEvents (cognitive 18): GoDomainConventions.RecordsDomainEvents has cognitive complexity 18 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/GoDomainConventions.cs"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"643a686fa2de41ec4b18d92949f1055e291bba92ef41eb605bd993120a196dcf"}},{"ruleId":"D2","level":"warning","message":{"text":"GoDomainConventions.BuildCrossContextProjections (cognitive 18): GoDomainConventions.BuildCrossContextProjections has cognitive complexity 18 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/GoDomainConventions.cs"},"region":{"startLine":1731}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aa8d9b9025d02a68098c773f60b8810f80e45e259ea4153801f76cf0d372cb0"}},{"ruleId":"D2","level":"warning","message":{"text":"HeadingLabelQualityAnalyzer.AnalyzeAsync (cognitive 18): HeadingLabelQualityAnalyzer.AnalyzeAsync has cognitive complexity 18 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/HeadingLabelQualityAnalyzer.cs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e92e7db88e4f505d6c4c3fec1fbc1e9f6c8621db82ea29b8c83fc942addec91"}},{"ruleId":"D2","level":"warning","message":{"text":"InvocationMatching.WalkTerminatesInMemory (cognitive 18): InvocationMatching.WalkTerminatesInMemory has cognitive complexity 18 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/InvocationMatching.cs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8e2b92a98be64a93c9811d09bb3b3dac62390a76a452fa7b2055a0f91ce5712"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkTextQualityAnalyzer.AnalyzeAsync (cognitive 18): LinkTextQualityAnalyzer.AnalyzeAsync has cognitive complexity 18 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/LinkTextQualityAnalyzer.cs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceba3d4a5c6bdc739df10abf26b79eaa2593161798e9d7dbfc819177798edbc0"}},{"ruleId":"D2","level":"warning","message":{"text":"LogicDefectAnalyzer.InspectKeyedSettingFallback (cognitive 18): LogicDefectAnalyzer.InspectKeyedSettingFallback has cognitive complexity 18 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/LogicDefectAnalyzer.cs"},"region":{"startLine":3090}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4797fc21327f4d540146842684114f947e8234499d992b06dcd180f2b7a7388"}},{"ruleId":"D2","level":"warning","message":{"text":"MarkupTaintPass.CollectSelfContradictions (cognitive 18): MarkupTaintPass.CollectSelfContradictions has cognitive complexity 18 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/MarkupTaintPass.cs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"79e7c7e2e1d96548448913221848a708170194b1d622c5f1a22251eafd9d90c0"}},{"ruleId":"D2","level":"warning","message":{"text":"BootMechanismDetector.EnumerateRelevantFiles (cognitive 18): BootMechanismDetector.EnumerateRelevantFiles has cognitive complexity 18 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/RuntimeBoot/BootMechanismDetector.cs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"a095d8795583317d395f7309cbb41c0f016f3e7d329d0a919ff5aa1e8eb11033"}},{"ruleId":"D2","level":"warning","message":{"text":"RustDomainConventions.BlockingWaitInHandler (cognitive 18): RustDomainConventions.BlockingWaitInHandler has cognitive complexity 18 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/RustDomainConventions.cs"},"region":{"startLine":984}}}],"partialFingerprints":{"codehealthFindingId/v1":"47f461754447e8afaf46284f69012b45daae1cf6fc919fd2bac9f19337f5c47d"}},{"ruleId":"D2","level":"warning","message":{"text":"SecurityDefectAnalyzer.InspectAddressClassifier (cognitive 18): SecurityDefectAnalyzer.InspectAddressClassifier has cognitive complexity 18 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent 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":"engine/src/CodeHealth.Core/ModelAware/SecurityDefectAnalyzer.cs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4960c22c4a53200bd07e53ad251251cf2bf83a0b7f066337a895f85ca060e3f"}},{"ruleId":"D2","level":"warning","message":{"text":"SymbolHelpers.IsStronglyTypedId (cognitive 18): SymbolHelpers.IsStronglyTypedId has cognitive complexity 18 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/SymbolHelpers.cs"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"c57a2725cf6e4bdfea9e8293c8f6c4a72747cb16bfb656c8fadd1f62acd4e776"}},{"ruleId":"D2","level":"warning","message":{"text":"CiRerunUntilGreenGate.FindLoop (cognitive 18): CiRerunUntilGreenGate.FindLoop has cognitive complexity 18 (threshold 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":"engine/src/CodeHealth.Core/Readiness/CiRerunUntilGreenGate.cs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7ed3d2d85df2e41f664063f578f932d15e158ad82338023f0ea5d949539a9d8"}},{"ruleId":"D2","level":"warning","message":{"text":"CiRerunUntilGreenGate.Jobs (cognitive 18): CiRerunUntilGreenGate.Jobs has cognitive complexity 18 (threshold 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":"engine/src/CodeHealth.Core/Readiness/CiRerunUntilGreenGate.cs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"640a7b34242bb6dfaf1e46d34463b993317627c9cd94eafbf2d963da61007df5"}},{"ruleId":"D2","level":"warning","message":{"text":"ProductionReadinessAnalyzer.TestWorkflowsNotGatingPullRequests (cognitive 18): ProductionReadinessAnalyzer.TestWorkflowsNotGatingPullRequests has cognitive complexity 18 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent 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":"engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"f15b4a0eb29d3299a68e00e14cd9bef19f21562c72888b0e2e6016f5d11bb6bc"}},{"ruleId":"D2","level":"warning","message":{"text":"ProductionReadinessAnalyzer.SastWorkflowsNotGatingMerges (cognitive 18): ProductionReadinessAnalyzer.SastWorkflowsNotGatingMerges has cognitive complexity 18 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent 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":"engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9262c6553b342ccda2141e3e3cbe8c2327a1a08ee27ff1c750107bd0a14b437"}},{"ruleId":"D2","level":"warning","message":{"text":"ArchitectureDepth.From (cognitive 18): ArchitectureDepth.From has cognitive complexity 18 (threshold 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":"engine/src/CodeHealth.Core/Scoring/ArchitectureDepth.cs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"065ab13fe1aed8ccdd345a378473c786777013ab8d339ef87330c0e6b987f625"}},{"ruleId":"D2","level":"warning","message":{"text":"CodebaseSize.FromDiskAsync (cognitive 18): CodebaseSize.FromDiskAsync has cognitive complexity 18 (threshold 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":"engine/src/CodeHealth.Core/Scoring/CodebaseSize.cs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"aee110be5ec4a5db45a858bc7485ff0f22529e5a0e214a63960cb297589dee0d"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeBrowserProvision.ExpectedRevisions (cognitive 18): NodeBrowserProvision.ExpectedRevisions has cognitive complexity 18 (threshold 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":"engine/src/CodeHealth.Core/Testing/NodeBrowserProvision.cs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"7234f0a826166f78b40f8f16ff8ba2faa9ec9b80b9bcea01d8b31162eaa69025"}},{"ruleId":"D2","level":"warning","message":{"text":"RenameAliases.Build (cognitive 18): RenameAliases.Build has cognitive complexity 18 (threshold 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":"engine/src/CodeHealth.Toolchain/Git/RenameAliases.cs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"895306930d6027ff10eb127e30c4e3cf42565a5158f1c40a0214471737c86c82"}},{"ruleId":"D2","level":"warning","message":{"text":"RenameAliases.RecreatedRenameSources (cognitive 18): RenameAliases.RecreatedRenameSources has cognitive complexity 18 (threshold 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":"engine/src/CodeHealth.Toolchain/Git/RenameAliases.cs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"8056b9c603744ab365f3a583791179c7909110bdf5fb14ce78aadb80a81bcd33"}},{"ruleId":"D2","level":"warning","message":{"text":"SdkPinReconciler.TryReconcileFile (cognitive 18): SdkPinReconciler.TryReconcileFile has cognitive complexity 18 (threshold 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":"engine/src/CodeHealth.Toolchain/MsBuild/SdkPinReconciler.cs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e1906c7f88c86015d6df5c2cbbace592f893405b06f3f8a4f989607ad32510c"}},{"ruleId":"D2","level":"warning","message":{"text":"ChangeSetBuilder.EmitCommitClusters (cognitive 18): ChangeSetBuilder.EmitCommitClusters has cognitive complexity 18 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent 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":"engine/src/CodeHealth.Reporting/Changelog/Fusion/ChangeSetBuilder.cs"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"17bd98b68bcf819df6bdfcc6ec15b57ca32ebc504d2b61e1379e6e0fde5c66fd"}},{"ruleId":"D2","level":"warning","message":{"text":"RunLimitations.CoverageRows (cognitive 18): RunLimitations.CoverageRows has cognitive complexity 18 (threshold 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":"engine/src/CodeHealth.Reporting/Limitations/RunLimitations.cs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"363e2641fce5498824d9f1fd47ab77e8b8f56e72973464779fa4180bfbdaadf4"}},{"ruleId":"D2","level":"warning","message":{"text":"WindowedTrendComputer.Compute (cognitive 18): WindowedTrendComputer.Compute has cognitive complexity 18 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent 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":"engine/src/CodeHealth.History/Trends/WindowedTrendComputer.cs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb7d4b04ca2b5ed7a9f8094046845a3b13fb7b2ac021f30b149715e7cb6457a1"}},{"ruleId":"D2","level":"warning","message":{"text":"ArchitecturalIntegrityAnalyzer.RunAsync (cognitive 18): ArchitecturalIntegrityAnalyzer.RunAsync has cognitive complexity 18 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: 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":"engine/src/CodeHealth.Dimensions.Architecture/ArchitecturalIntegrityAnalyzer.cs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"835c06ff207b8f3f2ed4a4527fff846a061d5eebc6502c899c436977153d6f73"}},{"ruleId":"D2","level":"warning","message":{"text":"CloneSpanShape.DataRunTokens (cognitive 18): CloneSpanShape.DataRunTokens has cognitive complexity 18 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent 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":"engine/src/CodeHealth.Dimensions.CodeQuality/CodeShape/DuplicationAnalyzer.cs"},"region":{"startLine":3912}}}],"partialFingerprints":{"codehealthFindingId/v1":"c348c5adb63a518d91b64b5486e15bf444288dc5a348c54bf6d4291675001b68"}},{"ruleId":"D2","level":"warning","message":{"text":"DependencyVulnerabilityAnalyzer.CollectPackages (cognitive 18): DependencyVulnerabilityAnalyzer.CollectPackages has cognitive complexity 18 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/DependencyVulnerabilityAnalyzer.cs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"25d18be11ec8ae6d85cba7d47337dc83766711e7b13b8d9965850634691db45c"}},{"ruleId":"D2","level":"warning","message":{"text":"ConfigCredentialBindingScan.LooksLikeCommittedCredential (cognitive 18): ConfigCredentialBindingScan.LooksLikeCommittedCredential has cognitive complexity 18 (threshold 15). 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/ConfigCredentialBindingScan.cs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"7015826561373bfa8be9e8bcdb4d188d40f2b4c431af99c64ac80bb2f0fac2e2"}},{"ruleId":"D2","level":"warning","message":{"text":"DeclaredDependencies.RangeAdmits (cognitive 18): DeclaredDependencies.RangeAdmits has cognitive complexity 18 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/DeclaredDependencies.cs"},"region":{"startLine":1438}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f69b26402204088cad168b377313c40f7778aa61798d440cffcf519f69e3d75"}},{"ruleId":"D2","level":"warning","message":{"text":"DependencyUpdateCooldownCollapse.Collapse (cognitive 18): DependencyUpdateCooldownCollapse.Collapse has cognitive complexity 18 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/DependencyUpdateCooldownCollapse.cs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eb8805942cbc28f8da2668b055f9ae9ed649e655e3e5fc03ddfca2346c68443"}},{"ruleId":"D2","level":"warning","message":{"text":"JsSiblingScopeReadScan.BareAssignedNames (cognitive 18): JsSiblingScopeReadScan.BareAssignedNames has cognitive complexity 18 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/JsSiblingScopeReadScan.cs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d07efc759c3f31cd61231300964b6e3c3fc8c7c0a6b5b9fdec2ca79e48adf4c"}},{"ruleId":"D2","level":"warning","message":{"text":"MarkupEscapingRecheck.EveryTagAttributeValueLiterallyQuoted (cognitive 18): MarkupEscapingRecheck.EveryTagAttributeValueLiterallyQuoted has cognitive complexity 18 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/MarkupEscapingRecheck.cs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"45d7b1fd6abbc7ac73f5543f8a5ea811756ba88778a15d3f0a5af5836c777184"}},{"ruleId":"D2","level":"warning","message":{"text":"MutableGitCloneScan.FindingsInStage (cognitive 18): MutableGitCloneScan.FindingsInStage has cognitive complexity 18 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/MutableGitCloneScan.cs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ce505ae636b60a1f5a08390bc8e3503b8812321dd6de2e85052d0e4134cc64d"}},{"ruleId":"D2","level":"warning","message":{"text":"PrimaryConstructorShadow.SkipTypeName (cognitive 18): PrimaryConstructorShadow.SkipTypeName has cognitive complexity 18 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/PrimaryConstructorShadow.cs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"e815ca7418e095041403d0f1623ab56c78812ab937a8b1bb4245b83c2a2802e4"}},{"ruleId":"D2","level":"warning","message":{"text":"PullRequestTargetCheckoutRecheck.CheckoutStepBlock (cognitive 18): PullRequestTargetCheckoutRecheck.CheckoutStepBlock has cognitive complexity 18 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/PullRequestTargetCheckoutRecheck.cs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad06e7062494ba71b4c41151d655acbb5b9a3454e51e6e84563edb1b2dec2990"}},{"ruleId":"D2","level":"warning","message":{"text":"SecretNoiseFilter.IsEnumeratedDocExampleBinding (cognitive 18): SecretNoiseFilter.IsEnumeratedDocExampleBinding has cognitive complexity 18 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/SecretNoiseFilter.cs"},"region":{"startLine":2647}}}],"partialFingerprints":{"codehealthFindingId/v1":"84afb5c1ffa51e257c4b0f776d1309a7f132b0d54160bd3c1021efb13377bce8"}},{"ruleId":"D2","level":"warning","message":{"text":"SecretNoiseFilter.IsPublicHyperlinkUrlParameter (cognitive 18): SecretNoiseFilter.IsPublicHyperlinkUrlParameter has cognitive complexity 18 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/SecretNoiseFilter.cs"},"region":{"startLine":3167}}}],"partialFingerprints":{"codehealthFindingId/v1":"f676fc747f7acc7bf91abc6cb080662d07a8c55e221e7d3116d3e80a19089c72"}},{"ruleId":"D2","level":"warning","message":{"text":"SemgrepClaimRecheck.CallHasNoShell (cognitive 18): SemgrepClaimRecheck.CallHasNoShell has cognitive complexity 18 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/SemgrepClaimRecheck.cs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"d74458f314f5eab02f95c462085f88ce53dbefb3fb1f2088d76e8b7b559de4a1"}},{"ruleId":"D2","level":"warning","message":{"text":"FileModel.IsDelimiterDoublingQuoter (cognitive 18): FileModel.IsDelimiterDoublingQuoter has cognitive complexity 18 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/SqlBuilderCompositionWalk.cs"},"region":{"startLine":1226}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e167483b4b0fcf1bdc159d3ae00a41086887b35dd2d5764d512d42d79b29c20"}},{"ruleId":"D2","level":"warning","message":{"text":"SecretsHistoryAnalyzer.StripNotGroups (cognitive 18): SecretsHistoryAnalyzer.StripNotGroups has cognitive complexity 18 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/SecretsHistoryAnalyzer.cs"},"region":{"startLine":1742}}}],"partialFingerprints":{"codehealthFindingId/v1":"01b50a2309a51c5595ceb3a184cfa09c4f6b63d71919941d25ede7525dd0d300"}},{"ruleId":"D2","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.AnyDeep (cognitive 18): SupplyChainProvenanceAnalyzer.AnyDeep has cognitive complexity 18 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":4564}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b7aeefd2a6f21615f8c4a241f1618c5910b3f204a5976de77668cce6845f881"}},{"ruleId":"D2","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.ScanBuildManifests (cognitive 18): SupplyChainProvenanceAnalyzer.ScanBuildManifests has cognitive complexity 18 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":5920}}}],"partialFingerprints":{"codehealthFindingId/v1":"70bf8a97a29f3d8b2f367ac20e37fe6939f387c18d960cc8599eaee463ed7204"}},{"ruleId":"D2","level":"warning","message":{"text":"ChangeCouplingAnalyzer.IsVersionStampFile (cognitive 18): ChangeCouplingAnalyzer.IsVersionStampFile has cognitive complexity 18 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent 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":"engine/src/CodeHealth.Dimensions.GitMining/ChangeCouplingAnalyzer.cs"},"region":{"startLine":2679}}}],"partialFingerprints":{"codehealthFindingId/v1":"f69f4976ba1d676e637d1a16d2f6c30576045d6456708aef168177d3c1a11567"}},{"ruleId":"D2","level":"warning","message":{"text":"ChangeCouplingAnalyzer.CallsRustSplitInherentImplMethods (cognitive 18): ChangeCouplingAnalyzer.CallsRustSplitInherentImplMethods has cognitive complexity 18 (threshold 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":"engine/src/CodeHealth.Dimensions.GitMining/ChangeCouplingAnalyzer.cs"},"region":{"startLine":3031}}}],"partialFingerprints":{"codehealthFindingId/v1":"c433a164b302670e7e3ac8c2517e30ca0ac10c953ee1bf32168e9761dacf8928"}},{"ruleId":"D2","level":"warning","message":{"text":"ChangeCouplingAnalyzer.RepoDeclaredBaseClasses (cognitive 18): ChangeCouplingAnalyzer.RepoDeclaredBaseClasses has cognitive complexity 18 (threshold 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":"engine/src/CodeHealth.Dimensions.GitMining/ChangeCouplingAnalyzer.cs"},"region":{"startLine":3884}}}],"partialFingerprints":{"codehealthFindingId/v1":"06e301e0fab11fcdb2076ec2f070e7ac366530b840b1e358f26ce1a037c29dab"}},{"ruleId":"D2","level":"warning","message":{"text":"TestReliabilityAnalyzer.NodeOnlyAsync (cognitive 18): TestReliabilityAnalyzer.NodeOnlyAsync has cognitive complexity 18 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Testing/TestReliabilityAnalyzer.cs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"0611e64b126568e05c36a4c4705e6df20c07569707733dcc10766780aff14033"}},{"ruleId":"D2","level":"warning","message":{"text":"TestReliabilityAnalyzer.PolyglotUnmeasured (cognitive 18): TestReliabilityAnalyzer.PolyglotUnmeasured has cognitive complexity 18 (threshold 15). 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":"engine/src/CodeHealth.Dimensions.Testing/TestReliabilityAnalyzer.cs"},"region":{"startLine":868}}}],"partialFingerprints":{"codehealthFindingId/v1":"d35b2f1d6eacc41d9ac993f5d63e1ebf8107cbfa742dad1f0a0e86c8f009f48f"}},{"ruleId":"D2","level":"warning","message":{"text":"FSharpBody.gather (cognitive 18): FSharpBody.gather has cognitive complexity 18 (threshold 15). Drivers by points: loops 4 (11 pts), if/else 3 (4 pts), match/switch 2 (3 pts) (nesting depth added 9). 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":"engine/src/CodeHealth.CodeModel.FSharp/Body.fs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"94bfb0aeca066a2221c1c8bf271e99264be792a1ba6331faef284ea8dd2f8238"}},{"ruleId":"D2","level":"warning","message":{"text":"check.main (cognitive 18): check.main has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8, boolean chains 5, ternaries 3 (4 pts), loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/java-spoon/selftest/check.py"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"11bd0fce29b3eed125800c24f75799c5420af84d6997f0d653f4503e56fa4317"}},{"ruleId":"D2","level":"warning","message":{"text":"BranchWalker._scan_expr (cognitive 18): BranchWalker._scan_expr has cognitive complexity 18 (threshold 15). Drivers by points: loops 6 (12 pts), if/else 4, ternaries 1 (2 pts) (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":"engine/sidecars/python-frontend/bodyfacts.py"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bb224c587db2e008107ad973008e66785f675e0f0e805956e996329cb0b84ec"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver.call_target (cognitive 18): Resolver.call_target has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), ternaries 2 (5 pts), boolean chains 3, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/python-frontend/common.py"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"06630eabdcbf582933256581dfdfdcc0656eb736ea6a90ab238335e9be07a971"}},{"ruleId":"D2","level":"warning","message":{"text":"draw.naming_subject (cognitive 18): draw.naming_subject has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (10 pts), boolean chains 4, loops 2 (3 pts), ternaries 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":"tools/rescan/draw.py"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"c58cfb71f462445508eced7c4cf5e8a0fe9d4a2f1c6803983dc3db57615420cd"}},{"ruleId":"D2","level":"warning","message":{"text":"evidence-ab.tally (cognitive 18): evidence-ab.tally has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/evidence-ab.py"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea679d9aaea1594581acda8e53163d6378668c789a647b9b69624c83b7b0da55"}},{"ruleId":"D2","level":"warning","message":{"text":"fallback-judge.shape_check (cognitive 18): fallback-judge.shape_check has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 8, if/else 6, loops 3, ternaries 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":"tools/train/fallback-judge.py"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"9978081c92adf51384e69357d77874e6bbbc9c4a02b98bcfdc9722fcb2dcaba4"}},{"ruleId":"D2","level":"warning","message":{"text":"programme-status.snapshot_arms (cognitive 18): programme-status.snapshot_arms has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (7 pts), loops 3 (6 pts), error handling 1 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/programme-status.py"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d039184ab309656ab76f9b6e5217af199e5bbedcc7ad3e6b55c07d72995d8b0"}},{"ruleId":"D2","level":"warning","message":{"text":"report_round.self_check (cognitive 18): report_round.self_check has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 6, loops 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/report_round.py"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"fed69d8a3dd977a9bec7e283c57e16caf1799c4477b7a5d0ec3f5e1ba8f49371"}},{"ruleId":"D2","level":"warning","message":{"text":"report_verification.main (cognitive 18): report_verification.main has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9, boolean chains 3, error handling 2, loops 2, ternaries 1 (2 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/report_verification.py"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa04eb8fd32c538fa9bc54d1beef358e63fd557b012e9f165dd7204cb6e80f19"}},{"ruleId":"D2","level":"warning","message":{"text":"main.main (cognitive 18): main.main has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 5 (7 pts), boolean chains 1, ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/php-frontend/main.php"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a38ad93c5b954bfa164354425d6127c043527bd1a2e5aa46b3806214370f95b"}},{"ruleId":"D2","level":"warning","message":{"text":"main.parseGoMod (cognitive 18): main.parseGoMod has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/go/discover.go"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc16e40a1b77734cd15bac770654c52a2552c83614462ceacd1eed07c0b0c333"}},{"ruleId":"D2","level":"warning","message":{"text":"codehealth_rust_sidecar::collect_macro_rules_defs (cognitive 18): codehealth_rust_sidecar::collect_macro_rules_defs has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (15 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/rust-frontend/src/main.rs"},"region":{"startLine":2348}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dfd2e457df8aa9deb385039efb64d03862010f438bf3ec8cccfb9913ee85427"}},{"ruleId":"D2","level":"warning","message":{"text":"observe-proxy.main (cognitive 18): observe-proxy.main has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 6, error handling 2 (3 pts), loops 1 (nesting depth added 2). Most of this is not in the body itself: 3 of the 18 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 53, 61, 56, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/docker/analyzer/render/observe-proxy.mjs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"638ff34fc5a66b401bd26896ef04188ca39eebdc1e04f4c8261d265c3d2c2903"}},{"ruleId":"D2","level":"warning","message":{"text":"ts-helpers.stripStringsAndComments (cognitive 18): ts-helpers.stripStringsAndComments has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (8 pts), boolean chains 4, loops 2 (4 pts), ternaries 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":"engine/sidecars/tsjs-frontend/ts-helpers.mjs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"371e3596567da783b415a7f2a1840cb413b82ef8689297ee60d361416ffe4823"}},{"ruleId":"D2","level":"warning","message":{"text":"BicepExtractor.Extract (cognitive 17): BicepExtractor.Extract has cognitive complexity 17 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent 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":"engine/src/CodeHealth.Core/Architecture/Topology/Extractors/BicepExtractor.cs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"da238a9a7325966b8a190c25f1eee32f492004a26d941d8cd649ef79c5853a1b"}},{"ruleId":"D2","level":"warning","message":{"text":"PulumiExtractor.Classify (cognitive 17): PulumiExtractor.Classify has cognitive 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, 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":"engine/src/CodeHealth.Core/Architecture/Topology/Extractors/PulumiExtractor.cs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"be23a32901513dd7d10c80c70f31f69c4d1c36c9a739792737b66ee07fb09c1d"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceClassifier.IsTestDirectorySegment (cognitive 17): SourceClassifier.IsTestDirectorySegment has cognitive complexity 17 (threshold 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":"engine/src/CodeHealth.Core/Classification/SourceClassifier.cs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"373812ba911444850a50d9f10ac8c1f2aa0faaf69892658851502ae1930247b9"}},{"ruleId":"D2","level":"warning","message":{"text":"CSharpDeclarationRunTokenizer.Append (cognitive 17): CSharpDeclarationRunTokenizer.Append has cognitive complexity 17 (threshold 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":"engine/src/CodeHealth.Core/CodeModel/Roslyn/CSharpDeclarationRunTokenizer.cs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"36aff8bc294ae96b6caec941ef226afca35fc95ce2abb1234f3b14324e5bf65c"}},{"ruleId":"D2","level":"warning","message":{"text":"LineBasedGodClassDetector.GoStructGrainScan (cognitive 17): LineBasedGodClassDetector.GoStructGrainScan has cognitive complexity 17 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent 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":"engine/src/CodeHealth.Core/CodeShape/LineBasedGodClassDetector.cs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c85a411810d68e0075d0adb2ea3f6ecebdd4168919d98037e015a35b9837f1e"}},{"ruleId":"D2","level":"warning","message":{"text":"NeutralFileLengthScanner.SkipErlangCharLiteral (cognitive 17): NeutralFileLengthScanner.SkipErlangCharLiteral has cognitive complexity 17 (threshold 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":"engine/src/CodeHealth.Core/CodeShape/NeutralFileLengthScanner.cs"},"region":{"startLine":1195}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b523c499dd703796b02091459c223cab280f86e16ea308cacc1dc4276303280"}},{"ruleId":"D2","level":"warning","message":{"text":"PublishedSurfaceProbe.Discover (cognitive 17): PublishedSurfaceProbe.Discover has cognitive complexity 17 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/CodeShape/PublishedSurfaceProbe.cs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"76b039c677c0d84b755e6ba88738776d838fc4a3371f19a48bfb778d60787acf"}},{"ruleId":"D2","level":"warning","message":{"text":"RazorCodeVirtualizer.FindNextBlock (cognitive 17): RazorCodeVirtualizer.FindNextBlock has cognitive complexity 17 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/CodeShape/RazorCodeVirtualizer.cs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdbbda54e4c619d35fcba0138d19b85d9c89a9e3f26000d6066832ec6d4ba891"}},{"ruleId":"D2","level":"warning","message":{"text":"RoslynDuplicationDetector.AppendSoleLabelClones (cognitive 17): RoslynDuplicationDetector.AppendSoleLabelClones has cognitive complexity 17 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent 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":"engine/src/CodeHealth.Core/CodeShape/RoslynDuplicationDetector.cs"},"region":{"startLine":4218}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f9509ac483826ae2f688c4f6fbf89b0be14b1d578934265a48cb336bb15af84"}},{"ruleId":"D2","level":"warning","message":{"text":"LineLexer.CharLiteralEnd (cognitive 17): LineLexer.CharLiteralEnd has cognitive complexity 17 (threshold 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":"engine/src/CodeHealth.Core/CodeShape/RustInlineTestRegions.cs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b8ac31785ccb16439c05b6cb6f712d009494f4e171688d0eb333df77fc6170a"}},{"ruleId":"D2","level":"warning","message":{"text":"ComplianceSecurityAnalyzer.ScanWrongDirectionTransform (cognitive 17): ComplianceSecurityAnalyzer.ScanWrongDirectionTransform has cognitive complexity 17 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent 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":"engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs"},"region":{"startLine":2533}}}],"partialFingerprints":{"codehealthFindingId/v1":"12d2ceff34fdd49fda382a8d61fb7e92460c150b3d60e3764ef530321cd70fc3"}},{"ruleId":"D2","level":"warning","message":{"text":"ComplianceSecurityAnalyzer.DetectCustomAuthorizeAttributes (cognitive 17): ComplianceSecurityAnalyzer.DetectCustomAuthorizeAttributes has cognitive complexity 17 (threshold 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":"engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs"},"region":{"startLine":4288}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cea4ec5e048fdc87a0075343e94c838069980b1d6f8601a6e975fb72e03b9d1"}},{"ruleId":"D2","level":"warning","message":{"text":"ComplianceSecurityAnalyzer.DetectSelfHostedRpcSurface (cognitive 17): ComplianceSecurityAnalyzer.DetectSelfHostedRpcSurface has cognitive complexity 17 (threshold 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":"engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs"},"region":{"startLine":4585}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c7c34da99fb95d21191207e392e1d8668a79ae70227fb81af5f9c9b11b06fc5"}},{"ruleId":"D2","level":"warning","message":{"text":"MavenResolvedGraph.Parse (cognitive 17): MavenResolvedGraph.Parse has cognitive complexity 17 (threshold 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":"engine/src/CodeHealth.Core/Dependencies/MavenResolvedGraph.cs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff5839c7632fc56f7830ae24c263e1c669823ea3b973845e3e19591e904af347"}},{"ruleId":"D2","level":"warning","message":{"text":"NpmCurrencyCollector.CollectAsync (cognitive 17): NpmCurrencyCollector.CollectAsync has cognitive complexity 17 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Dependencies/NpmCurrencyCollector.cs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa8f6cb43dcbc13cd5eb63fc872b19491695b4cfe245cd7054ec84f62aa72f9e"}},{"ruleId":"D2","level":"warning","message":{"text":"UnityLockfileReader.ReadRegistryDirect (cognitive 17): UnityLockfileReader.ReadRegistryDirect has cognitive complexity 17 (threshold 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":"engine/src/CodeHealth.Core/Dependencies/UnityLockfileReader.cs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fbd2f83ab9818a619f86c905bf058246147c58284acca734af9fe05172d0ade"}},{"ruleId":"D2","level":"warning","message":{"text":"AdrDetector.IsExcludedNonAdr (cognitive 17): AdrDetector.IsExcludedNonAdr has cognitive complexity 17 (threshold 15). 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":"engine/src/CodeHealth.Core/Docs/AdrDetector.cs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"0909d3635205c467c9fef255f8825a19e0787cf50c4bf6fc5e7c5ed423bd02bc"}},{"ruleId":"D2","level":"warning","message":{"text":"ConditionalSymbolInventory.AddTemplateManifestSymbols (cognitive 17): ConditionalSymbolInventory.AddTemplateManifestSymbols has cognitive complexity 17 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ExplicitDebt/ConditionalSymbolInventory.cs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fc2da335ec3a9153f0e585b041f05c89505c0224abad91e66e21edae058d158"}},{"ruleId":"D2","level":"warning","message":{"text":"RazorMarkupReferenceScanner.CollectQualifiedMemberNamesAsync (cognitive 17): RazorMarkupReferenceScanner.CollectQualifiedMemberNamesAsync has cognitive complexity 17 (threshold 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":"engine/src/CodeHealth.Core/ExplicitDebt/RazorMarkupReferenceScanner.cs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"384f41aa48ee9a4c697e2593c47831be369f0ff064054e4b30b4e47055f9cfb5"}},{"ruleId":"D2","level":"warning","message":{"text":"RoslynExplicitDebtCollector.CollectContradictedWarningsAsErrors (cognitive 17): RoslynExplicitDebtCollector.CollectContradictedWarningsAsErrors has cognitive 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, split the body into named stages: move each independent 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":"engine/src/CodeHealth.Core/ExplicitDebt/RoslynExplicitDebtCollector.cs"},"region":{"startLine":5244}}}],"partialFingerprints":{"codehealthFindingId/v1":"3461ff6c8c24aae3ca6c5d903b27f19e01bc69c0a946acec19778a6fea53167c"}},{"ruleId":"D2","level":"warning","message":{"text":"RoslynExplicitDebtCollector.CollectEditorConfigSeverityNone (cognitive 17): RoslynExplicitDebtCollector.CollectEditorConfigSeverityNone has cognitive complexity 17 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent 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":"engine/src/CodeHealth.Core/ExplicitDebt/RoslynExplicitDebtCollector.cs"},"region":{"startLine":6414}}}],"partialFingerprints":{"codehealthFindingId/v1":"37db402f054a93733727021f56a5a45cd5bab5aef158e05d28b3899d12fcc6bd"}},{"ruleId":"D2","level":"warning","message":{"text":"RoslynExplicitDebtCollector.CollectVbObsoleteAsync (cognitive 17): RoslynExplicitDebtCollector.CollectVbObsoleteAsync has cognitive complexity 17 (threshold 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":"engine/src/CodeHealth.Core/ExplicitDebt/RoslynExplicitDebtCollector.Vb.cs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"905a03582c0455316c4e7f960256c5cd1921a74be4de7d9caf6f1d8c2cc1f234"}},{"ruleId":"D2","level":"warning","message":{"text":"XamlMarkupReferenceScanner.CollectTypeNamesAsync (cognitive 17): XamlMarkupReferenceScanner.CollectTypeNamesAsync has cognitive complexity 17 (threshold 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":"engine/src/CodeHealth.Core/ExplicitDebt/XamlMarkupReferenceScanner.cs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e0b462258661a46f915fac6926800b3fedf9629ef8da2faa553550d894effa5"}},{"ruleId":"D2","level":"warning","message":{"text":"YamlDisabledConfigScanner.IsAlsoSetLive (cognitive 17): YamlDisabledConfigScanner.IsAlsoSetLive has cognitive complexity 17 (threshold 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":"engine/src/CodeHealth.Core/ExplicitDebt/YamlDisabledConfigScanner.cs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c8b8ce2d4f31416fc867a3be95f09d693f66b17e2280ed1469e85d7c50acacd"}},{"ruleId":"D2","level":"warning","message":{"text":"DirectoryForkDetector.Descend (cognitive 17): DirectoryForkDetector.Descend has cognitive complexity 17 (threshold 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":"engine/src/CodeHealth.Core/Frontend/DirectoryForkDetector.cs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"27653d90d6e58df5f3cca8b233d119cbe1746ff9acd97917fc12dddccd875cea"}},{"ruleId":"D2","level":"warning","message":{"text":"EntryPointCatalog.AddPathLiteralInvocations (cognitive 17): EntryPointCatalog.AddPathLiteralInvocations has cognitive complexity 17 (threshold 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":"engine/src/CodeHealth.Core/Frontend/EntryPointCatalog.cs"},"region":{"startLine":2757}}}],"partialFingerprints":{"codehealthFindingId/v1":"804a4406548e1e969947d36b0c8907554107e83acc45dd99110a4a3aeb9fc0f8"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendDeclaredPackageRefs.CollectSourceEmittedSpecifierPackages (cognitive 17): FrontendDeclaredPackageRefs.CollectSourceEmittedSpecifierPackages has cognitive complexity 17 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendDeclaredPackageRefs.cs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ccdcb165e3e2dd5aaa1da328fdca812ecfe60642e66959d0f136149ad6e1ed7"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendDependencyHygiene.InsideAliasMap (cognitive 17): FrontendDependencyHygiene.InsideAliasMap has cognitive complexity 17 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendDependencyHygiene.cs"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"060a0c02d124c7da744e111b3d5d483ccbece718d293993d4ac5f814f4051642"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendDependencyHygiene.IsInvokedInScripts (cognitive 17): FrontendDependencyHygiene.IsInvokedInScripts has cognitive complexity 17 (threshold 15). 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":"engine/src/CodeHealth.Core/Frontend/FrontendDependencyHygiene.cs"},"region":{"startLine":1472}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e1e1efc18cef98888385918e71ba781d1d08539ee7b77d2459fa4a6e501af9d"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendEngineDimensions.DetectRemovalGate (cognitive 17): FrontendEngineDimensions.DetectRemovalGate has cognitive complexity 17 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendEngineDimensions.cs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d4a17b2cae3c73d71e777a7ba41063ad83a26151e12e1a9f6696dac7a8cb960"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendEngineDimensions.HygieneDimension (cognitive 17): FrontendEngineDimensions.HygieneDimension has cognitive complexity 17 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendEngineDimensions.cs"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"40834da0c80a4bd489c04c5cb1d16945167e85424a07c8431e396d041d7e8e1a"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendPathLiteralRefs.CollectGoEmbedRefs (cognitive 17): FrontendPathLiteralRefs.CollectGoEmbedRefs has cognitive complexity 17 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendPathLiteralRefs.cs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb8debbcac26f3eaaeb7f358232b1b7241496f8a212eab34dc5c27adcd03a3b6"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendPathLiteralRefs.AddComputedDirPathRefs (cognitive 17): FrontendPathLiteralRefs.AddComputedDirPathRefs has cognitive complexity 17 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendPathLiteralRefs.cs"},"region":{"startLine":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd84d5ed20c37220aa29de025c04ea1fe2c86b1ebc211fe7ef4b0254ce958740"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendScriptCommandRefs.ShellLauncherScripts (cognitive 17): FrontendScriptCommandRefs.ShellLauncherScripts has cognitive complexity 17 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendScriptCommandRefs.cs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5fcd2746371b9c484d57230e30e2828c9a26ea4016f275329cd86c33ed3cb09"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendWorkspaceLoader.EnumerateSourceMaps (cognitive 17): FrontendWorkspaceLoader.EnumerateSourceMaps has cognitive complexity 17 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendWorkspaceLoader.BuildOutput.cs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3363b3f509ecd6799be724d8f5c7955ea8048bc316dae12eebbad9229e5cc90"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendWorkspaceWalk.CollectVendoredNodeModuleDirectories (cognitive 17): FrontendWorkspaceWalk.CollectVendoredNodeModuleDirectories has cognitive complexity 17 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/FrontendWorkspaceWalk.cs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ce8052239ebe061fe87b9b52038083f9b83ef2300143743f1b2dd79af8c1ddb"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendWorkspaceWalk.IsNpmBinEntryDirectory (cognitive 17): FrontendWorkspaceWalk.IsNpmBinEntryDirectory has cognitive complexity 17 (threshold 15). 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":"engine/src/CodeHealth.Core/Frontend/FrontendWorkspaceWalk.cs"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8e43abe09e2a22bbc2423c882fd0f2eb0c61c0543831f8b9401eccb9e4a02b2"}},{"ruleId":"D2","level":"warning","message":{"text":"JsCloneNearExactness.Agreement (cognitive 17): JsCloneNearExactness.Agreement has cognitive complexity 17 (threshold 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":"engine/src/CodeHealth.Core/Frontend/JsCloneNearExactness.cs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ce76a247d2885e007552e54de777ae4bd8e7386c9743e164eaf6cefbf956a7c"}},{"ruleId":"D2","level":"warning","message":{"text":"JsComplexity.BuildMask (cognitive 17): JsComplexity.BuildMask has cognitive complexity 17 (threshold 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":"engine/src/CodeHealth.Core/Frontend/JsComplexity.cs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aaf50c838a320deb49aebb96786af2217fd348fb6c22dd80635fa19335787ee"}},{"ruleId":"D2","level":"warning","message":{"text":"JsDuplicationDetector.IsTypeMemberList (cognitive 17): JsDuplicationDetector.IsTypeMemberList has cognitive complexity 17 (threshold 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":"engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs"},"region":{"startLine":7640}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d9d9a3b9221a670872c1bd2bd8cf73ad75a6d56edb03846731d433a56bb1931"}},{"ruleId":"D2","level":"warning","message":{"text":"JsStringConstants.BindParameters (cognitive 17): JsStringConstants.BindParameters has cognitive complexity 17 (threshold 15). 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":"engine/src/CodeHealth.Core/Frontend/JsStringConstants.cs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"529ad657d91f4186c3be8d1c7899e27aaffbb4ef98e48da5a9e4b10897ef4738"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleResolver.TryResolveImportsMap (cognitive 17): ModuleResolver.TryResolveImportsMap has cognitive complexity 17 (threshold 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":"engine/src/CodeHealth.Core/Frontend/ModuleResolver.cs"},"region":{"startLine":863}}}],"partialFingerprints":{"codehealthFindingId/v1":"c432b2b2c0ce9cff7d6e64f2566fd358754a4e216691fc64ded73f9552354ccd"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleSyntaxScanner.TryCommonJsExport (cognitive 17): ModuleSyntaxScanner.TryCommonJsExport has cognitive complexity 17 (threshold 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":"engine/src/CodeHealth.Core/Frontend/ModuleSyntaxScanner.cs"},"region":{"startLine":1094}}}],"partialFingerprints":{"codehealthFindingId/v1":"07815a9bb15c656d36dfaad68a70cb85aca509d4813b96a3a8f67f1b1f422172"}},{"ruleId":"D2","level":"warning","message":{"text":"TsConfigStrictness.Read (cognitive 17): TsConfigStrictness.Read has cognitive complexity 17 (threshold 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":"engine/src/CodeHealth.Core/Frontend/TsConfigStrictness.cs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d271df2ca981e41a3a0e84d9128cd491d4e928be69cf423df0734571a58478f"}},{"ruleId":"D2","level":"warning","message":{"text":"MaturityAnalyzer.JvmStandardLayoutSeparation (cognitive 17): MaturityAnalyzer.JvmStandardLayoutSeparation has cognitive complexity 17 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Maturity/MaturityAnalyzer.cs"},"region":{"startLine":2642}}}],"partialFingerprints":{"codehealthFindingId/v1":"d84d3b0f360f44453a541eb0aaf85c7fc2939997646daf9b296c3cb5d5cd3931"}},{"ruleId":"D2","level":"warning","message":{"text":"AccessibilityAnalyzer.LoadedScriptText (cognitive 17): AccessibilityAnalyzer.LoadedScriptText has cognitive complexity 17 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d8d96f3253f8e29f317ae9cfe8c6a82a037e813a62acdfc1233c7eb5d496cb8"}},{"ruleId":"D2","level":"warning","message":{"text":"AccessibilityAnalyzer.ScanIconLibraryImports (cognitive 17): AccessibilityAnalyzer.ScanIconLibraryImports has cognitive complexity 17 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent 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":"engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs"},"region":{"startLine":2041}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d7664f52cebd0840ae2a41e181f55cba70e6968342326c72cb58c6fbe50683a"}},{"ruleId":"D2","level":"warning","message":{"text":"AccessibilityAnalyzer.CollectScriptRevealedIds (cognitive 17): AccessibilityAnalyzer.CollectScriptRevealedIds has cognitive complexity 17 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs"},"region":{"startLine":5598}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d526aa2e47538268d390db5320137663a48a58bae2bb69830f9881a67375bfd"}},{"ruleId":"D2","level":"warning","message":{"text":"AccessibilityAnalyzer.EnumerateStyleFiles (cognitive 17): AccessibilityAnalyzer.EnumerateStyleFiles has cognitive complexity 17 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs"},"region":{"startLine":5969}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b1e27d8448b74abe8f6d6e4a3e0e50ab197dcec7d8d9d6c8abcd564db1fcff4"}},{"ruleId":"D2","level":"warning","message":{"text":"AccessibilityAnalyzer.CountUnreadHtmlStringMarkup (cognitive 17): AccessibilityAnalyzer.CountUnreadHtmlStringMarkup has cognitive complexity 17 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.HtmlStringBlindness.cs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"02c1b01cd7867bdd9a882c62754e921c9c7b6559045a43c3b472f64c3f266137"}},{"ruleId":"D2","level":"warning","message":{"text":"AllowlistGate.Prove (cognitive 17): AllowlistGate.Prove has cognitive complexity 17 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/AllowlistGate.cs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"b495d188b5e9264b00c60ebdd3cf6c05fba703d09b9976c2a52e9e8c31e3c23e"}},{"ruleId":"D2","level":"warning","message":{"text":"AllowlistGate.Evaluate (cognitive 17): AllowlistGate.Evaluate has cognitive complexity 17 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/AllowlistGate.cs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb5c1ff93dae3e1a901ec3ba792e3ee189c62ffe6dc9094a9e61bd52e242bb1d"}},{"ruleId":"D2","level":"warning","message":{"text":"CSharpCorrectnessAnalyzer.IsAssertedCompleteBeforehand (cognitive 17): CSharpCorrectnessAnalyzer.IsAssertedCompleteBeforehand has cognitive complexity 17 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/CSharpCorrectnessAnalyzer.cs"},"region":{"startLine":2478}}}],"partialFingerprints":{"codehealthFindingId/v1":"257e73464764df190999787ea843ba541e22cae259a06fe9fdcfbad578dde41b"}},{"ruleId":"D2","level":"warning","message":{"text":"CsprojReferenceGraph.BuildDisplayNames (cognitive 17): CsprojReferenceGraph.BuildDisplayNames has cognitive complexity 17 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/CsprojReferenceGraph.cs"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ecc1b5d046666e7fc0079951b55559e1f0a6031bd00f62914a760b3b10580ff"}},{"ruleId":"D2","level":"warning","message":{"text":"ErlangDomainConventions.BlockingHandlers (cognitive 17): ErlangDomainConventions.BlockingHandlers has cognitive complexity 17 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/ErlangDomainConventions.cs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f05a32486f2398f1e438fa15c0f9e53d9a621254ceb897d2499e7714aed58a4"}},{"ruleId":"D2","level":"warning","message":{"text":"GoDomainConventions.FoldMethods (cognitive 17): GoDomainConventions.FoldMethods has cognitive complexity 17 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent 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":"engine/src/CodeHealth.Core/ModelAware/GoDomainConventions.cs"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"98ddcd8940262d8bbac32ecb52d0870cfc9c84402830961f0216fd6fba674f30"}},{"ruleId":"D2","level":"warning","message":{"text":"IncompletenessAnalyzer.OverriddenMethodNamesAsync (cognitive 17): IncompletenessAnalyzer.OverriddenMethodNamesAsync has cognitive complexity 17 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/IncompletenessAnalyzer.cs"},"region":{"startLine":1219}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a771c95312f39b7449015d4ac5759627daab4510a6fa6aed9e4406986bbe662"}},{"ruleId":"D2","level":"warning","message":{"text":"IncompletenessAnalyzer.MessageSaysNotDone (cognitive 17): IncompletenessAnalyzer.MessageSaysNotDone has cognitive complexity 17 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent 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":"engine/src/CodeHealth.Core/ModelAware/IncompletenessAnalyzer.cs"},"region":{"startLine":3076}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5f8275ff2d378ea2911590bb395019496b627a2b77b0701d343ebe341dc4eaa"}},{"ruleId":"D2","level":"warning","message":{"text":"LogicDefectAnalyzer.InspectDroppedDisposalDuty (cognitive 17): LogicDefectAnalyzer.InspectDroppedDisposalDuty has cognitive complexity 17 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 7 belong to 7 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/LogicDefectAnalyzer.cs"},"region":{"startLine":1644}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ff0b37b8271e5e1a9b908fe799b6c561bac417663b4698d3ca91fef7cceda7c"}},{"ruleId":"D2","level":"warning","message":{"text":"LogicDefectAnalyzer.InspectUnsynchronisedHandoff (cognitive 17): LogicDefectAnalyzer.InspectUnsynchronisedHandoff has cognitive complexity 17 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent 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":"engine/src/CodeHealth.Core/ModelAware/LogicDefectAnalyzer.cs"},"region":{"startLine":3472}}}],"partialFingerprints":{"codehealthFindingId/v1":"85823e0a6217582cc0b606ff03bb651e3745caf8aa4f84dd2f5b63dbc3fea0f9"}},{"ruleId":"D2","level":"warning","message":{"text":"SecurityDefectAnalyzer.InspectUncappedDocumentWalk (cognitive 17): SecurityDefectAnalyzer.InspectUncappedDocumentWalk has cognitive complexity 17 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent 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":"engine/src/CodeHealth.Core/ModelAware/SecurityDefectAnalyzer.cs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"57c67b587e47f72048a4ce04a77eb07078100c78a793e0e635d057d19ef8a1f7"}},{"ruleId":"D2","level":"warning","message":{"text":"SecurityDefectAnalyzer.CountsItsDescent (cognitive 17): SecurityDefectAnalyzer.CountsItsDescent has cognitive complexity 17 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/SecurityDefectAnalyzer.cs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2b81acfcbd207e247923b6e6e48257df44bc207d6f4119806ba150ca1dae99b"}},{"ruleId":"D2","level":"warning","message":{"text":"SwiftDomainConventions.SwiftDualWrites (cognitive 17): SwiftDomainConventions.SwiftDualWrites has cognitive complexity 17 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/SwiftDomainConventions.cs"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"281909ec6e39cfbc5c578b434f556e741ad3be8ea974928bae787e1aeafc0e5a"}},{"ruleId":"D2","level":"warning","message":{"text":"ProductionReadinessAnalyzer.HasSourceBackupControl (cognitive 17): ProductionReadinessAnalyzer.HasSourceBackupControl has cognitive complexity 17 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs"},"region":{"startLine":1490}}}],"partialFingerprints":{"codehealthFindingId/v1":"37dd8d76d0a2af8db427b47c4d0320e3b870e92beb245a8cfcc71386b28ec9aa"}},{"ruleId":"D2","level":"warning","message":{"text":"ProductionReadinessAnalyzer.ContainerStackText (cognitive 17): ProductionReadinessAnalyzer.ContainerStackText has cognitive complexity 17 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs"},"region":{"startLine":2442}}}],"partialFingerprints":{"codehealthFindingId/v1":"c99aee18398b18d4d60f683ee1b4e7219ad74a7f0f2b22dc4ef9d572772b5e5b"}},{"ruleId":"D2","level":"warning","message":{"text":"ProductionReadinessAnalyzer.FirstPartyChartManifests (cognitive 17): ProductionReadinessAnalyzer.FirstPartyChartManifests has cognitive complexity 17 (threshold 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":"engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs"},"region":{"startLine":3119}}}],"partialFingerprints":{"codehealthFindingId/v1":"50b30a759d95c0b79cf52653b6bf33395232c6ba048d0cbec3a4846b3ff5f92f"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeSecretScanner.ScanAsync (cognitive 17): NativeSecretScanner.ScanAsync has cognitive complexity 17 (threshold 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":"engine/src/CodeHealth.Core/Security/NativeSecretScanner.cs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fd88210e6c3bfcac986adb6466e709c4dbd7d5983932558c56786bc413d7d30"}},{"ruleId":"D2","level":"warning","message":{"text":"SyftSbomNormalizer.ReadLicenses (cognitive 17): SyftSbomNormalizer.ReadLicenses has cognitive complexity 17 (threshold 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":"engine/src/CodeHealth.Core/Security/SyftSbomNormalizer.cs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fec67db8b000f186c99366d7bd1278a2409e007d285b63bcb01493e6ba719bf"}},{"ruleId":"D2","level":"warning","message":{"text":"DependencyGraph.FindCycles (cognitive 17): DependencyGraph.FindCycles has cognitive complexity 17 (threshold 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":"engine/src/CodeHealth.Core/Statistics/DependencyGraph.cs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"3735e99ff339ce4f5a0dc3dfe87a4c6cc958353f5c652235d4a03ecfe30737a3"}},{"ruleId":"D2","level":"warning","message":{"text":"DotnetBuildStatistician.UninitialisedSubmodules (cognitive 17): DotnetBuildStatistician.UninitialisedSubmodules has cognitive complexity 17 (threshold 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":"engine/src/CodeHealth.Core/Statistics/DotnetBuildStatistician.cs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea4335a6b6a327ff744f794e72ae27ce8406cbf6ef2c95597e7c525dd4abb133"}},{"ruleId":"D2","level":"warning","message":{"text":"CommittedCoverageReader.EnumerateCandidates (cognitive 17): CommittedCoverageReader.EnumerateCandidates has cognitive complexity 17 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Testing/CommittedCoverageReader.cs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"06b5629a3132f1f9b47c2c09ec9d02444091cc2a147884d4c3d2f453dfe388bd"}},{"ruleId":"D2","level":"warning","message":{"text":"CoverletCoverageCollector.CollectUncachedAsync (cognitive 17): CoverletCoverageCollector.CollectUncachedAsync has cognitive complexity 17 (threshold 15). 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":"engine/src/CodeHealth.Core/Testing/CoverletCoverageCollector.cs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf3f8c5b06f3fbaeb6e736c2915cd0af9db668dd3ea71c853785570e99131e68"}},{"ruleId":"D2","level":"warning","message":{"text":"DiskTestScanner.EnumerateTestSyntax (cognitive 17): DiskTestScanner.EnumerateTestSyntax has cognitive complexity 17 (threshold 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":"engine/src/CodeHealth.Core/Testing/DiskTestScanner.cs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1c974bf2b2fac650b097e89986a0d06f84d1add5b64303a2bcba4f23de5fcdb"}},{"ruleId":"D2","level":"warning","message":{"text":"DiskTestScanner.HasFormulaInlineTestSuite (cognitive 17): DiskTestScanner.HasFormulaInlineTestSuite has cognitive complexity 17 (threshold 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":"engine/src/CodeHealth.Core/Testing/DiskTestScanner.cs"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"4177114930b235e01b206a5d1116db693fd3c52b1e8caf8a00c4a5b516c8f03d"}},{"ruleId":"D2","level":"warning","message":{"text":"GoTestCensus.GoTestFiles (cognitive 17): GoTestCensus.GoTestFiles has cognitive complexity 17 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Testing/GoTestCensus.cs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b109599963a7b428784e76065cec5c3aa475c95141480718c21a2f7959d0977"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeTestSuiteCoverageCollector.CollectUncachedAsync (cognitive 17): NodeTestSuiteCoverageCollector.CollectUncachedAsync has cognitive complexity 17 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 3 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Testing/NodeTestSuiteCoverageCollector.cs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"55b3d1615dc70e7a88cdf581f8acee5ab31894a0a7b5977040a92b84b445e4c0"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeTestSuiteCoverageCollector.GatherLcov (cognitive 17): NodeTestSuiteCoverageCollector.GatherLcov has cognitive complexity 17 (threshold 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":"engine/src/CodeHealth.Core/Testing/NodeTestSuiteCoverageCollector.cs"},"region":{"startLine":870}}}],"partialFingerprints":{"codehealthFindingId/v1":"78c4372ec855689845d64cbc0cee449474d277f494e3bd30ba64fd178cf3cf11"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeTestSuiteProbe.FindLockfile (cognitive 17): NodeTestSuiteProbe.FindLockfile has cognitive complexity 17 (threshold 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":"engine/src/CodeHealth.Core/Testing/NodeTestSuiteProbe.cs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8ab0fcd32de3daf2235d413fae19835367db2ee623e5f4355297c44a24014c1"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeWorkspaceSiblingBuilder.EntryPoint (cognitive 17): NodeWorkspaceSiblingBuilder.EntryPoint has cognitive complexity 17 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Testing/NodeWorkspaceSiblingBuilder.cs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d50cd2a22a19c99eac7204cc6ebd72bb14c2939b1765df9fceef449ea6c3d80"}},{"ruleId":"D2","level":"warning","message":{"text":"RoslynTestQualityCollector.PublicHost (cognitive 17): RoslynTestQualityCollector.PublicHost has cognitive complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Testing/RoslynTestQualityCollector.cs"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd0b969b1762e1da606778d1619af9cd674647f8233154930229ecf47d2d2af5"}},{"ruleId":"D2","level":"warning","message":{"text":"RustTestCensus.RustFiles (cognitive 17): RustTestCensus.RustFiles has cognitive complexity 17 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Testing/RustTestCensus.cs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d218d98505cecdc55162c6420be64a33b43133ea4e95ed0acda0105fe704973"}},{"ruleId":"D2","level":"warning","message":{"text":"TestProjectDetection.UnconditionalIsTestProject (cognitive 17): TestProjectDetection.UnconditionalIsTestProject has cognitive complexity 17 (threshold 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":"engine/src/CodeHealth.Core/Testing/TestProjectDetection.cs"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"b80aa3dfc8afb07afe9342407af2b37515f8ea94651e56f9b6bbd7a3e17433da"}},{"ruleId":"D2","level":"warning","message":{"text":"XPlatCollectorProbe.IsWiredUp (cognitive 17): XPlatCollectorProbe.IsWiredUp has cognitive complexity 17 (threshold 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":"engine/src/CodeHealth.Core/Testing/XPlatCollectorProbe.cs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fc8663f12970c512d76641faed081a76acabf0fc0d4bba5852756695035cfb6"}},{"ruleId":"D2","level":"warning","message":{"text":"ResxFileRefNormalizer.NormalizeFile (cognitive 17): ResxFileRefNormalizer.NormalizeFile has cognitive complexity 17 (threshold 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":"engine/src/CodeHealth.Toolchain/MsBuild/ResxFileRefNormalizer.cs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"d76a6e5fc9102d4a433d4634904ad6f0488367efbeb648cb40dd799456b567bc"}},{"ruleId":"D2","level":"warning","message":{"text":"MsBuildRoslynWorkspace.BreakProjectReferenceCycles (cognitive 17): MsBuildRoslynWorkspace.BreakProjectReferenceCycles has cognitive complexity 17 (threshold 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":"engine/src/CodeHealth.Toolchain/Roslyn/MsBuildRoslynWorkspace.cs"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"57ecc60417a263696aae1f781a2fb93c8566baee89c1dbbb6a9268b47429a854"}},{"ruleId":"D2","level":"warning","message":{"text":"FileProgressSink.WriteSnapshot (cognitive 17): FileProgressSink.WriteSnapshot has cognitive complexity 17 (threshold 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":"engine/src/CodeHealth.Cli/Ui/FileProgressSink.cs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"81ec67274222f9453536ef3994b0db09d0ed3c7808d8f0fb27ebc023fb7dcb9e"}},{"ruleId":"D2","level":"warning","message":{"text":"ChangelogDraftRenderer.RenderSystemOverview (cognitive 17): ChangelogDraftRenderer.RenderSystemOverview has cognitive complexity 17 (threshold 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":"engine/src/CodeHealth.Reporting/Changelog/ChangelogDraftRenderer.cs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ae05d9ccedcc1482e06529f1e4ba458b1767fceb9cf5edb0ae6fa748075f77a"}},{"ruleId":"D2","level":"warning","message":{"text":"ChangelogNarrator.DescribeEntryAsync (cognitive 17): ChangelogNarrator.DescribeEntryAsync has cognitive complexity 17 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent 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":"engine/src/CodeHealth.Reporting/Changelog/ChangelogNarrator.cs"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc55e196d8b17c9df0dd07a929e942d853a1d7d0b88f841703e7152919e8dd8b"}},{"ruleId":"D2","level":"warning","message":{"text":"ReportViewModelFactory.BuildTrajectory (cognitive 17): ReportViewModelFactory.BuildTrajectory has cognitive complexity 17 (threshold 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":"engine/src/CodeHealth.Reporting/Templates/ReportViewModelFactory.cs"},"region":{"startLine":2130}}}],"partialFingerprints":{"codehealthFindingId/v1":"e83cede0ca4155179b6a0f0355eb3616ca6630ed9a159ca5ca2d99408396da09"}},{"ruleId":"D2","level":"warning","message":{"text":"NavigabilityAnalyzer.RunAsync (cognitive 17): NavigabilityAnalyzer.RunAsync has cognitive complexity 17 (threshold 15). 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":"engine/src/CodeHealth.Dimensions.Architecture/NavigabilityAnalyzer.cs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"47facd937ba94e50ae64369f85e91a46e7771f0d9fab81ae575a7849fbc23844"}},{"ruleId":"D2","level":"warning","message":{"text":"CloneSpanShape.OpenBlocksInsideEnclosingDeclaration (cognitive 17): CloneSpanShape.OpenBlocksInsideEnclosingDeclaration has cognitive complexity 17 (threshold 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":"engine/src/CodeHealth.Dimensions.CodeQuality/CodeShape/DuplicationAnalyzer.cs"},"region":{"startLine":4445}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f778c72aa008d49fe7a8812b485538799fa1ccc015858e6c5995678174e4d42"}},{"ruleId":"D2","level":"warning","message":{"text":"ComplexityDisclosure.NestedItemDisclosure (cognitive 17): ComplexityDisclosure.NestedItemDisclosure has cognitive complexity 17 (threshold 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":"engine/src/CodeHealth.Dimensions.CodeQuality/Complexity/ComplexityDisclosure.cs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"664bb7c06217040b84d6be07cabcc3d5a310d48abee62748920341bcabaf160e"}},{"ruleId":"D2","level":"warning","message":{"text":"ComplexityScoring.DropRepublishedSidecarUnits (cognitive 17): ComplexityScoring.DropRepublishedSidecarUnits has cognitive complexity 17 (threshold 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":"engine/src/CodeHealth.Dimensions.CodeQuality/Complexity/ComplexityScoring.cs"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6db5e8db4863d11dd52ead72e6ec5ed81903a79d23d48f835f6a5b64a479d29"}},{"ruleId":"D2","level":"warning","message":{"text":"OsvDependencyVulnerabilityArm.CollectAsync (cognitive 17): OsvDependencyVulnerabilityArm.CollectAsync has cognitive complexity 17 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 3 belong to 2 function literals inside it that branch. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/OsvScannerAnalyzer.cs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcd03f25b819b2a3ad355fe6c721a366e3739617b48bf93084b8153816675c24"}},{"ruleId":"D2","level":"warning","message":{"text":"ComposeServiceSurface.BuiltAsAnyOf (cognitive 17): ComposeServiceSurface.BuiltAsAnyOf has cognitive complexity 17 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/ComposeServiceSurface.cs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ea20b430f68b74c504ba83882937628ae72020454c38aa59c96444e6d7de90c"}},{"ruleId":"D2","level":"warning","message":{"text":"DockerfileSyntax.AppendHeredocScript (cognitive 17): DockerfileSyntax.AppendHeredocScript has cognitive complexity 17 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/DockerfileSyntax.cs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"0143df5a5e858316506c38782c5616a47c674762c52350b083046a59b3bfffc7"}},{"ruleId":"D2","level":"warning","message":{"text":"EolActionMajorRepositoryFold.Fold (cognitive 17): EolActionMajorRepositoryFold.Fold has cognitive complexity 17 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/EolActionMajorRepositoryFold.cs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5f39c42690b430f726f4882b2c5b0825aa595ed550a9d0058bccadff6b161d5"}},{"ruleId":"D2","level":"warning","message":{"text":"InactivePreprocessorRegion.EnclosingCondition (cognitive 17): InactivePreprocessorRegion.EnclosingCondition has cognitive complexity 17 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/InactivePreprocessorRegion.cs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9b94b20bf1b400aee2acf6b61f03b48855b3ced42e8abfba7dc82114113a365"}},{"ruleId":"D2","level":"warning","message":{"text":"JsSiblingScopeReadScan.BindsOnLine (cognitive 17): JsSiblingScopeReadScan.BindsOnLine has cognitive complexity 17 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/JsSiblingScopeReadScan.cs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"99bdb311e66887ae2facfaa6b4c939de22b95337a647ac3f736005c99cbbb471"}},{"ruleId":"D2","level":"warning","message":{"text":"JsValueFlow.ArgumentNamesAllResolved (cognitive 17): JsValueFlow.ArgumentNamesAllResolved has cognitive complexity 17 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/JsValueFlow.cs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"73b0425e1dcc2e041ed1f0184dc0a0f0fb4325e17bc633e43a006255cb5f2f5b"}},{"ruleId":"D2","level":"warning","message":{"text":"MarkupEscapingRecheck.GoHtmlTemplateAutoEscaped (cognitive 17): MarkupEscapingRecheck.GoHtmlTemplateAutoEscaped has cognitive complexity 17 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/MarkupEscapingRecheck.cs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"fca39eb6848ca6ba9d4c877e6b1b153cc8d5d23adfda455083bea463fa204bf1"}},{"ruleId":"D2","level":"warning","message":{"text":"MutableGitCloneScan.StageRef (cognitive 17): MutableGitCloneScan.StageRef has cognitive complexity 17 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/MutableGitCloneScan.cs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"f05cd5ae8c3a9c73ea7b430f3f2772f20e23e42203f34de46d12c30ab0ecafc0"}},{"ruleId":"D2","level":"warning","message":{"text":"NginxDirectiveRecheck.NginxConfNeighbourhood (cognitive 17): NginxDirectiveRecheck.NginxConfNeighbourhood has cognitive complexity 17 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/NginxDirectiveRecheck.cs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aa2051385a1693d3cd187ae70924e180d6dfd27c2ddd67c8bae014b0d1eb97d"}},{"ruleId":"D2","level":"warning","message":{"text":"NoOpToolShimScan.FindingsInStage (cognitive 17): NoOpToolShimScan.FindingsInStage has cognitive complexity 17 (threshold 15). 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/NoOpToolShimScan.cs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4d2551b539c560cc126457bb72a014a13dbb89890cb94afe2e8cd6d0f817871"}},{"ruleId":"D2","level":"warning","message":{"text":"SemverRange.Admits (cognitive 17): SemverRange.Admits has cognitive complexity 17 (threshold 15). 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/NpmLockGraph.cs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"5798b99d6bdf296b9b2192a610ee495e50f6a587dc4d349a989a43d7dd2f0cfd"}},{"ruleId":"D2","level":"warning","message":{"text":"PathContainmentRecheck.CombineAppendsOnlyLiterals (cognitive 17): PathContainmentRecheck.CombineAppendsOnlyLiterals has cognitive complexity 17 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/PathContainmentRecheck.cs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"11ea825da9f3414a5215f82261f96f085bc1920ae6e855499b6419ec10a638b6"}},{"ruleId":"D2","level":"warning","message":{"text":"RubyArgumentMutatedScan.MutatesHere (cognitive 17): RubyArgumentMutatedScan.MutatesHere has cognitive complexity 17 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/RubyArgumentMutatedScan.cs"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5c85f897a8d12e482eb0204e1b54500add771e29658602091fdb1d02b78e391"}},{"ruleId":"D2","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.ScanGoReleaserManifest (cognitive 17): SupplyChainProvenanceAnalyzer.ScanGoReleaserManifest has cognitive complexity 17 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":5124}}}],"partialFingerprints":{"codehealthFindingId/v1":"2521bd4d934acec0d20c52595fe8bc8b2d297591ed92ab2cd731e5f1d788bef3"}},{"ruleId":"D2","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.JobNeeds (cognitive 17): SupplyChainProvenanceAnalyzer.JobNeeds has cognitive complexity 17 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":8581}}}],"partialFingerprints":{"codehealthFindingId/v1":"de3f49d636a0bf19d3f2f373e2358c6eb23bb43d0783f964c73dcd1e27f6223a"}},{"ruleId":"D2","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.UnapprovedBranchPushTriggeredPublishes (cognitive 17): SupplyChainProvenanceAnalyzer.UnapprovedBranchPushTriggeredPublishes has cognitive complexity 17 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":8637}}}],"partialFingerprints":{"codehealthFindingId/v1":"b128bf354fd7553906fee594f8f6b1a338a9fe7d28fa6a80b8de7d20eebadd61"}},{"ruleId":"D2","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.SupplementaryCiPublishes (cognitive 17): SupplyChainProvenanceAnalyzer.SupplementaryCiPublishes has cognitive complexity 17 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.PublishTrigger.cs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9de779a079f7357c501f069b2418b689368e50cb6ecaf30c9279c4a2138fb11"}},{"ruleId":"D2","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.UnlockedReleaseInstalls (cognitive 17): SupplyChainProvenanceAnalyzer.UnlockedReleaseInstalls has cognitive complexity 17 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent 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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.ReleaseInstallLock.cs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"df151f83d699274537e8b7e176dd3f1f7c8732f02bb7f2e8377632dd3207e5a6"}},{"ruleId":"D2","level":"warning","message":{"text":"ChangeCouplingAnalyzer.IsSharedPlatformContractSiblings (cognitive 17): ChangeCouplingAnalyzer.IsSharedPlatformContractSiblings has cognitive complexity 17 (threshold 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":"engine/src/CodeHealth.Dimensions.GitMining/ChangeCouplingAnalyzer.cs"},"region":{"startLine":3790}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a48c6140cf6d258a88cb1e4f26e7413f7037c25b5c64e91ce9b2275a0f978bb"}},{"ruleId":"D2","level":"warning","message":{"text":"ChangeCouplingAnalyzer.RepoDeclaredContracts (cognitive 17): ChangeCouplingAnalyzer.RepoDeclaredContracts has cognitive complexity 17 (threshold 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":"engine/src/CodeHealth.Dimensions.GitMining/ChangeCouplingAnalyzer.cs"},"region":{"startLine":3837}}}],"partialFingerprints":{"codehealthFindingId/v1":"0573afc347a2a2175cfc51c788c11a842a93637a651c9229c47ac6e7279547b8"}},{"ruleId":"D2","level":"warning","message":{"text":"FSharpBody.walk (cognitive 17): FSharpBody.walk has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (8 pts), match/switch 3 (6 pts), if/else 2 (3 pts) (nesting depth added 8). 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":"engine/src/CodeHealth.CodeModel.FSharp/Body.fs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"30837c8074f7428bef9dfc82b27c436d3cf7bb804adfeadc1e6bb72730785c13"}},{"ruleId":"D2","level":"warning","message":{"text":"ModelBuilder.BuildMembers (cognitive 17): ModelBuilder.BuildMembers has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.CodeModel.FSharp/Builder.fs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"923bbe9fdb5f49a889884a2ea92c74ad2209946af2c98ea490883fb5fb34f071"}},{"ruleId":"D2","level":"warning","message":{"text":"Emitter.emitType (cognitive 17): Emitter.emitType has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 2, loops 2, match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/kotlin-frontend/src/main/kotlin/dev/canine/codehealth/kotlin/Emitter.kt"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"994fdd78b81267ed6eb8c75743357e05ce78cbc19f9372cbbc72d5073e1463c1"}},{"ruleId":"D2","level":"warning","message":{"text":"Main.main (cognitive 17): Main.main has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (13 pts), match/switch 1 (2 pts), error handling 1, loops 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":"engine/sidecars/scala-frontend/src/main/scala/dev/canine/codehealth/scala/Main.scala"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a4e8634aca08565cb567d1379525ccbe722daed6bf7984d27bfa5862fa98e16"}},{"ruleId":"D2","level":"warning","message":{"text":"build-quality-pairs-v2.comment_lines (cognitive 17): build-quality-pairs-v2.comment_lines has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), ternaries 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/llm-bakeoff/build-quality-pairs-v2.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbfc032f6bfe04b1031e7e923a1ed236e3559a920ca4374b351dba19b51ee106"}},{"ruleId":"D2","level":"warning","message":{"text":"build-quality-pairs.comment_lines (cognitive 17): build-quality-pairs.comment_lines has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), ternaries 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/llm-bakeoff/build-quality-pairs.py"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cf4d4285ff180e0bd463536de69c9eec6182e1de4f286ca24195d8e325a6040"}},{"ruleId":"D2","level":"warning","message":{"text":"parallel-sweep.main (cognitive 17): parallel-sweep.main has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 5 (10 pts), if/else 3 (6 pts), 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":"tools/llm-bakeoff/parallel-sweep.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"6837ce62e15bce40d8a61161ae7b2915a3465e567d713c2d0ecf13a59b1384ba"}},{"ruleId":"D2","level":"warning","message":{"text":"runner.main (cognitive 17): runner.main has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6, loops 3 (5 pts), ternaries 3 (4 pts), boolean chains 2 (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":"tools/rescan/runner.py"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8d41f5c6e13ff64557c7b9006740da61a110f514f89be30c7effa81c77656e9"}},{"ruleId":"D2","level":"warning","message":{"text":"fallback-judge.render_md (cognitive 17): fallback-judge.render_md has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 4 (9 pts), loops 4 (5 pts), if/else 1 (2 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":"tools/train/fallback-judge.py"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0e93375bd235843dd65a0a19c64b4de68393a100c42994e5380e9638ac4555c"}},{"ruleId":"D2","level":"warning","message":{"text":"judge-calibration.enclosing_block (cognitive 17): judge-calibration.enclosing_block has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), boolean chains 6, loops 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/judge-calibration.py"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbcf0e1166c612d60dd924cf5b87305022a3566ab55280715b4ff136e80f4afd"}},{"ruleId":"D2","level":"warning","message":{"text":"BodyFacts.rethrows (cognitive 17): BodyFacts.rethrows has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), boolean chains 4, loops 2 (4 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":"engine/sidecars/php-frontend/body.php"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd346f4f0c7193b4b76d9ee6e200d538190801d56252eaf2e31ffefb06d7ab0e"}},{"ruleId":"D2","level":"warning","message":{"text":"main.invocationGroups (cognitive 17): main.invocationGroups has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (10 pts), loops 4 (5 pts), boolean chains 2 (nesting depth added 2). Most of this is not in the body itself: 7 of the 17 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 191, 175). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/go/bodylines.go"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdbdff870673e1d601039da9bff3c836172235434c96d6600ff78f840c13f53a"}},{"ruleId":"D2","level":"warning","message":{"text":"main.parsedFiles (cognitive 17): main.parsedFiles has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (9 pts), if/else 2 (8 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":"engine/sidecars/go/scan.go"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"23848aa35f5d25885cd15184152b66d9ed5b80584dff8ecbabc8d1750037fe4c"}},{"ruleId":"D2","level":"warning","message":{"text":"extractor.assertedTypeFqn (cognitive 17): extractor.assertedTypeFqn has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 2 (3 pts), boolean chains 2, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/go/implements.go"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"31719e73b9109ba42a1659929707654726eef4735cbc5f3cfa366718a077fd66"}},{"ruleId":"D2","level":"warning","message":{"text":"Emit.members (cognitive 17): Emit.members has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 3 (7 pts), if/else 4 (6 pts), boolean chains 2, loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/swift-frontend/Sources/codehealth-swift-sidecar/Emit.swift"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"915a704056bfb6254e4dc6e52bc0507bd021b7c44cd891165550ec99cabddfa2"}},{"ruleId":"D2","level":"warning","message":{"text":"codehealth_rust_sidecar::dup_parse_header (cognitive 17): codehealth_rust_sidecar::dup_parse_header has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 2 (7 pts), if/else 2 (5 pts), loops 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/rust-frontend/src/main.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"2488c289d469845b593d4a510ec347afc50bf5b1dcba0619e46ec7954bd895b4"}},{"ruleId":"D2","level":"warning","message":{"text":"codehealth_rust_sidecar::collect_macro_declared_types (cognitive 17): codehealth_rust_sidecar::collect_macro_declared_types has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 4 (9 pts), if/else 4 (7 pts), loops 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":"engine/sidecars/rust-frontend/src/main.rs"},"region":{"startLine":1939}}}],"partialFingerprints":{"codehealthFindingId/v1":"eda3a233a489e1ef793b5b53a9f7ce7ca54ec95112768d457ac73845e2a0618b"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::onLifecycle (cognitive 17): (anonymous)::onLifecycle has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (7 pts), error handling 2 (4 pts), boolean chains 3, ternaries 1 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Kennel.Ui/wwwroot/kennel-ui.js"},"region":{"startLine":2010}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc694e7c6ac61a73e71108ccd035dab15ca55d0c0c71ae2ec88adde56e130638"}},{"ruleId":"D2","level":"warning","message":{"text":"main (cognitive 17): main has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (5 pts), ternaries 4 (5 pts), if/else 3 (4 pts), other 2, boolean chains 1 (nesting depth added 3). Most of this is not in the body itself: 8 of the 17 points are its own statements and the rest belongs to 11 function items inside it that branch (card, (anonymous), (anonymous), \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/localdev/ui/capture.mjs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"48df9f9abfd52948e19184419493c76eff1d5ebbdd6f1dfdfb2e7165006d96e4"}},{"ruleId":"D2","level":"warning","message":{"text":"typeEmitters::heritageOf (cognitive 17): typeEmitters::heritageOf has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (7 pts), error handling 1 (4 pts), loops 2 (3 pts), boolean chains 2, other 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":"engine/sidecars/tsjs-frontend/extract-file.mjs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"21e4cecbe3835ca664fbf7943669d0dcf066d778bbdfe510560cba7f002dd63d"}},{"ruleId":"D2","level":"warning","message":{"text":"ApiSurfaceExtractor.CollectGroupPrefixes (cognitive 16): ApiSurfaceExtractor.CollectGroupPrefixes has cognitive complexity 16 (threshold 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":"engine/src/CodeHealth.Core/ApiSurface/ApiSurfaceExtractor.cs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bd5c27ad057717f200a2205af00e02398b4338e5bea99ea06f55c365d1f7b7d"}},{"ruleId":"D2","level":"warning","message":{"text":"ApiSurfaceExtractor.ScanAttributeControllers (cognitive 16): ApiSurfaceExtractor.ScanAttributeControllers has cognitive complexity 16 (threshold 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":"engine/src/CodeHealth.Core/ApiSurface/ApiSurfaceExtractor.cs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"496887eb81c5a42b85c6cff91f5b11042047444ab7efdaed52f7914c5cbf25d1"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceClassifier.WithoutNonDominantRegionInteriors (cognitive 16): SourceClassifier.WithoutNonDominantRegionInteriors has cognitive complexity 16 (threshold 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":"engine/src/CodeHealth.Core/Classification/SourceClassifier.cs"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"80a6add5148794f50b827d8b24079cd019eb99925725b18e402aaa09a77e8e5c"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceClassifier.IsWellKnownVendorFile (cognitive 16): SourceClassifier.IsWellKnownVendorFile has cognitive complexity 16 (threshold 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":"engine/src/CodeHealth.Core/Classification/SourceClassifier.cs"},"region":{"startLine":2267}}}],"partialFingerprints":{"codehealthFindingId/v1":"22adcc3563971ec35aa32cd054095bd66423e7429c8d7b7e3cffa1da7d6487c0"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceClassifier.HasDemonstrationSegment (cognitive 16): SourceClassifier.HasDemonstrationSegment has cognitive complexity 16 (threshold 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":"engine/src/CodeHealth.Core/Classification/SourceClassifier.cs"},"region":{"startLine":2528}}}],"partialFingerprints":{"codehealthFindingId/v1":"1482d9ee8a715e680d863bf6c0313e9f71200f24933ae1471eab4fbf46e89e0d"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceClassifier.IsDevelopmentOnlyDotnetProject (cognitive 16): SourceClassifier.IsDevelopmentOnlyDotnetProject has cognitive complexity 16 (threshold 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":"engine/src/CodeHealth.Core/Classification/SourceClassifier.cs"},"region":{"startLine":2958}}}],"partialFingerprints":{"codehealthFindingId/v1":"caff8f2e4463d139779e85f806f8174a3bfb94e266d5d20aaa09604fa724b0e4"}},{"ruleId":"D2","level":"warning","message":{"text":"CSharpCloneTokenizer.IsInExecutableBody (cognitive 16): CSharpCloneTokenizer.IsInExecutableBody has cognitive complexity 16 (threshold 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":"engine/src/CodeHealth.Core/CodeModel/Roslyn/CSharpCloneTokenizer.cs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"319599ceb1b1ceaf45351a601bf52f5688c68dcadabb8953e544d04173350dce"}},{"ruleId":"D2","level":"warning","message":{"text":"NeutralFileLengthScanner.DominantDeclaration (cognitive 16): NeutralFileLengthScanner.DominantDeclaration has cognitive complexity 16 (threshold 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":"engine/src/CodeHealth.Core/CodeShape/NeutralFileLengthScanner.cs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba8892c444ac8914a8f8916afeea2a2554dd856018d9c010f329c61cb8bc6412"}},{"ruleId":"D2","level":"warning","message":{"text":"RazorCodeVirtualizer.EnumerateRazorFiles (cognitive 16): RazorCodeVirtualizer.EnumerateRazorFiles has cognitive complexity 16 (threshold 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":"engine/src/CodeHealth.Core/CodeShape/RazorCodeVirtualizer.cs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e4df8d2e30e8d9daadd4affd4e5ee9b9a6e96559a67ead99ae20810824bafbe"}},{"ruleId":"D2","level":"warning","message":{"text":"RoslynDuplicationDetector.Coalesce (cognitive 16): RoslynDuplicationDetector.Coalesce has cognitive complexity 16 (threshold 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":"engine/src/CodeHealth.Core/CodeShape/RoslynDuplicationDetector.cs"},"region":{"startLine":3841}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ca663f28e6a40dca5998456998e9b0b473e7f0159dba6538f08d6458384c0df"}},{"ruleId":"D2","level":"warning","message":{"text":"FirstPartyJsComplexity.AddFileUnits (cognitive 16): FirstPartyJsComplexity.AddFileUnits has cognitive complexity 16 (threshold 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":"engine/src/CodeHealth.Core/Complexity/FirstPartyJsComplexity.cs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b7daf7b218e9be9c4c0f47245174287077f2421a63605b541ef80e39b65d22c"}},{"ruleId":"D2","level":"warning","message":{"text":"ComplianceSecurityAnalyzer.ScanRazorAuthorizationAsync (cognitive 16): ComplianceSecurityAnalyzer.ScanRazorAuthorizationAsync has cognitive complexity 16 (threshold 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":"engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs"},"region":{"startLine":6445}}}],"partialFingerprints":{"codehealthFindingId/v1":"58ea9fb6dfe465b7e8b5821733b1aca386acf209981977f6756ddb295bd1448b"}},{"ruleId":"D2","level":"warning","message":{"text":"GemVersion.Compare (cognitive 16): GemVersion.Compare has cognitive complexity 16 (threshold 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":"engine/src/CodeHealth.Core/Dependencies/GemVersion.cs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd2a70cc56da775f81774f716d5a95d26bd3800f3ce520361496e125f7f038b3"}},{"ruleId":"D2","level":"warning","message":{"text":"NpmLockfileReader.ReadPackageLock (cognitive 16): NpmLockfileReader.ReadPackageLock has cognitive complexity 16 (threshold 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":"engine/src/CodeHealth.Core/Dependencies/NpmLockfileReader.cs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b7cd9200eab195af570639324099a57d25689ef39de9580bad21c788cfecf58"}},{"ruleId":"D2","level":"warning","message":{"text":"NpmManifestHygiene.ResolvedDirectProduction (cognitive 16): NpmManifestHygiene.ResolvedDirectProduction has cognitive complexity 16 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Dependencies/NpmManifestHygiene.cs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"7be5f39e3b80c243004137f80de115c0dce99cd96d69e1e41237615ff4c3b46f"}},{"ruleId":"D2","level":"warning","message":{"text":"MarkdownSnippetReferenceScanner.SafeEnumerateMarkdown (cognitive 16): MarkdownSnippetReferenceScanner.SafeEnumerateMarkdown has cognitive complexity 16 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ExplicitDebt/MarkdownSnippetReferenceScanner.cs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"109ec4d6fafb12f53377dc03c41328883c25de851c2a0040418dc98020d2d4e6"}},{"ruleId":"D2","level":"warning","message":{"text":"RoslynExplicitDebtCollector.CollectComments (cognitive 16): RoslynExplicitDebtCollector.CollectComments has cognitive complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, 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":"engine/src/CodeHealth.Core/ExplicitDebt/RoslynExplicitDebtCollector.cs"},"region":{"startLine":1668}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e50d2ea750233c8094fa8591287d27bdb96a79cefc16a57735c070ad0d83ddf"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceCommentTaskScanner.CommentStart (cognitive 16): SourceCommentTaskScanner.CommentStart has cognitive complexity 16 (threshold 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":"engine/src/CodeHealth.Core/ExplicitDebt/SourceCommentTaskScanner.cs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"858fec8a2d6fb328dee7793b44a0f03d7ec31ac80c67e4bc6856ecd12dcc9970"}},{"ruleId":"D2","level":"warning","message":{"text":"YamlDisabledConfigScanner.ScanLines (cognitive 16): YamlDisabledConfigScanner.ScanLines has cognitive complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent 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":"engine/src/CodeHealth.Core/ExplicitDebt/YamlDisabledConfigScanner.cs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"08566a23df2d4d18e8aa2e281e027b647355611aeb162455749b805c17ae95be"}},{"ruleId":"D2","level":"warning","message":{"text":"DashboardExportHeuristics.DeclaresDashboardSchema (cognitive 16): DashboardExportHeuristics.DeclaresDashboardSchema has cognitive complexity 16 (threshold 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":"engine/src/CodeHealth.Core/FileQuality/DashboardExportHeuristics.cs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"44af750c14a6fa6190057a5f9c967ebfb97360ab39f328451262b8fa05e94cb5"}},{"ruleId":"D2","level":"warning","message":{"text":"GeneratedCodePolicy.ForRepo (cognitive 16): GeneratedCodePolicy.ForRepo has cognitive complexity 16 (threshold 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":"engine/src/CodeHealth.Core/FileQuality/GeneratedCodePolicy.cs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d19da247522689a7ac77c79a7004782f43499fb26f05f2d30ae255bf5c02f35"}},{"ruleId":"D2","level":"warning","message":{"text":"DirectoryForkDetector.HashTextFile (cognitive 16): DirectoryForkDetector.HashTextFile has cognitive complexity 16 (threshold 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":"engine/src/CodeHealth.Core/Frontend/DirectoryForkDetector.cs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"143e14a5f43786a769396a2e211006070c0d854147a115da8f63e478678b331d"}},{"ruleId":"D2","level":"warning","message":{"text":"ForeignPackageOwnership.IsForeignOwnedDirectory (cognitive 16): ForeignPackageOwnership.IsForeignOwnedDirectory has cognitive complexity 16 (threshold 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":"engine/src/CodeHealth.Core/Frontend/ForeignPackageOwnership.cs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"9103810fb8fb806a529589e33120240e31fc0c6f980a5803cacfdf9ee2c7d718"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendConfigResolution.ParsePnpmPackages (cognitive 16): FrontendConfigResolution.ParsePnpmPackages has cognitive complexity 16 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendConfigResolution.cs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"aea2c879ac165eee71525afaf8f0d8dd6715fa1c24646d4014a07f3fc1f7b320"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendSpecifierScanning.TemplateLiteralLiteralTail (cognitive 16): FrontendSpecifierScanning.TemplateLiteralLiteralTail has cognitive complexity 16 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendSpecifierScanning.cs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cafa01095ea2f7493d813e0e2195b12289207837ebc3d8c4ccac62d65059e5b"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendSpecifierScanning.CollectBundlerExternalSpecifiers (cognitive 16): FrontendSpecifierScanning.CollectBundlerExternalSpecifiers has cognitive complexity 16 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendSpecifierScanning.cs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"af14c6b227eaeeaace65bce5fa58ce23d4f159202b807b5086a2e0509691d520"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendTestReachability.EverySuiteRunsInABrowser (cognitive 16): FrontendTestReachability.EverySuiteRunsInABrowser has cognitive complexity 16 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendTestReachability.cs"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"65e1838c341e6fe671e72f7e6831aa0778e782e4f88aae9a1180612d41cbdd4c"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendTestReachability.IsDeclarationOnly (cognitive 16): FrontendTestReachability.IsDeclarationOnly has cognitive complexity 16 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendTestReachability.cs"},"region":{"startLine":1858}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aa81f869e735706fc6c4a3bcb4e0b9f9e06bec1a273a5f7019323d3c7be2577"}},{"ruleId":"D2","level":"warning","message":{"text":"TsConfigGlob.ToRegex (cognitive 16): TsConfigGlob.ToRegex has cognitive complexity 16 (threshold 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":"engine/src/CodeHealth.Core/Frontend/FrontendWorkspaceFacts.cs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"c132065c73ab1eedf83266d08c5669e69c00d487655b5737b1858505144de36b"}},{"ruleId":"D2","level":"warning","message":{"text":"JsComplexity.ComputeCyclomatic (cognitive 16): JsComplexity.ComputeCyclomatic has cognitive complexity 16 (threshold 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":"engine/src/CodeHealth.Core/Frontend/JsComplexity.cs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac5ce95afd50fbd5e4b0d2a761f0645a35e231d9606a0fa041fea066e8185fd9"}},{"ruleId":"D2","level":"warning","message":{"text":"JsDuplicationDetector.BestPeriodAnchor (cognitive 16): JsDuplicationDetector.BestPeriodAnchor has cognitive complexity 16 (threshold 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":"engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs"},"region":{"startLine":4808}}}],"partialFingerprints":{"codehealthFindingId/v1":"22fad5425650fc85f224023649a8bdbc4f1e64835d1d6a6cb0595e54a2557817"}},{"ruleId":"D2","level":"warning","message":{"text":"JsDuplicationDetector.IsLiteralJsxTagPunctuation (cognitive 16): JsDuplicationDetector.IsLiteralJsxTagPunctuation has cognitive complexity 16 (threshold 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":"engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs"},"region":{"startLine":8238}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9b27579ed8e398efefb099be84b22381bf91bf9580ae6d55680c9920c525d16"}},{"ruleId":"D2","level":"warning","message":{"text":"Scanner.ScanOnce (cognitive 16): Scanner.ScanOnce has cognitive complexity 16 (threshold 15). 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":"engine/src/CodeHealth.Core/Frontend/JsLexer.cs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"506e2d18e4093a2fecb028852cbade31423251e840a65368396b33c5c010d9ee"}},{"ruleId":"D2","level":"warning","message":{"text":"Scanner.DecodeUnicodeEscape (cognitive 16): Scanner.DecodeUnicodeEscape has cognitive complexity 16 (threshold 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":"engine/src/CodeHealth.Core/Frontend/JsLexer.cs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"c585dcc7b3622ec0c6b2b93d03d7270a6cac912827c717120e080cc38bc0fbac"}},{"ruleId":"D2","level":"warning","message":{"text":"JsScopeBindings.ArrowParameterRange (cognitive 16): JsScopeBindings.ArrowParameterRange has cognitive complexity 16 (threshold 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":"engine/src/CodeHealth.Core/Frontend/JsScopeBindings.cs"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"61b13c6b1e9ae521d12bd6e9ae8960b83b7027dcbbc1c4c6503a0599f15d0ff5"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleSyntaxScanner.AddRuntimeGlobLoaderImports (cognitive 16): ModuleSyntaxScanner.AddRuntimeGlobLoaderImports has cognitive complexity 16 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/ModuleSyntaxScanner.cs"},"region":{"startLine":1710}}}],"partialFingerprints":{"codehealthFindingId/v1":"e12732cef01f48dee741c25acbcd2e655386af0cdd9fa8074cac0eb4e5609507"}},{"ruleId":"D2","level":"warning","message":{"text":"ArchGraphClustering.Build (cognitive 16): ArchGraphClustering.Build has cognitive complexity 16 (threshold 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":"engine/src/CodeHealth.Core/Graph/ArchGraphClustering.cs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"806bfb400f2cb46e6b9d4efd4098e365219c251321e6fa2cdb37a3f253be70e5"}},{"ruleId":"D2","level":"warning","message":{"text":"AstroMarkupProducer.NextRawTextOpen (cognitive 16): AstroMarkupProducer.NextRawTextOpen has cognitive complexity 16 (threshold 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":"engine/src/CodeHealth.Core/Markup/AstroMarkupProducer.cs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"6183f7726b6361b6f387170e1b9fdafcfd03c04085390ff72f5c29888e737959"}},{"ruleId":"D2","level":"warning","message":{"text":"MaturityAnalyzer.IsArchitectureCodeTour (cognitive 16): MaturityAnalyzer.IsArchitectureCodeTour has cognitive complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent 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":"engine/src/CodeHealth.Core/Maturity/MaturityAnalyzer.cs"},"region":{"startLine":3886}}}],"partialFingerprints":{"codehealthFindingId/v1":"62296be373a952a088e4946cc86ed27c53fb76a222a7e18d2a2f544e72d3fd8a"}},{"ruleId":"D2","level":"warning","message":{"text":"AccessibilityAnalyzer.CollectPackageScriptFacts (cognitive 16): AccessibilityAnalyzer.CollectPackageScriptFacts has cognitive complexity 16 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs"},"region":{"startLine":6885}}}],"partialFingerprints":{"codehealthFindingId/v1":"ece0d52b7c933cdcf17b7eca699840ac5188595360b8b1d0cbc7990a1be348c6"}},{"ruleId":"D2","level":"warning","message":{"text":"AltTextQualityAnalyzer.AnalyzeAsync (cognitive 16): AltTextQualityAnalyzer.AnalyzeAsync has cognitive complexity 16 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/AltTextQualityAnalyzer.cs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"83d6372136f62f225eca096953570f8ea34c78fdc5f53e2d8c9c97a0413cd79e"}},{"ruleId":"D2","level":"warning","message":{"text":"ArchitectureModelAnalyzer.CaptiveDependencies (cognitive 16): ArchitectureModelAnalyzer.CaptiveDependencies has cognitive complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent 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":"engine/src/CodeHealth.Core/ModelAware/ArchitectureModelAnalyzer.cs"},"region":{"startLine":1815}}}],"partialFingerprints":{"codehealthFindingId/v1":"68725bb17995acbbdfe13e72ccdc03b41d6ff0790106d72d13ecbc031b078a04"}},{"ruleId":"D2","level":"warning","message":{"text":"CryptoShreddingDetector.IsDiscarded (cognitive 16): CryptoShreddingDetector.IsDiscarded has cognitive complexity 16 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 3 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":"engine/src/CodeHealth.Core/ModelAware/CryptoShreddingDetector.cs"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"6893c29ddc3c43bd1927e5cb0c509bcef02638bbcd94243577962e934f82df97"}},{"ruleId":"D2","level":"warning","message":{"text":"DomainModelAnalyzer.RepositoryContractSubjects (cognitive 16): DomainModelAnalyzer.RepositoryContractSubjects has cognitive complexity 16 (threshold 15). 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":"engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs"},"region":{"startLine":1760}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cb6e54bfbf711544d83d8261403dd7a90bb29bca56a5e807892b14dd469b6ad"}},{"ruleId":"D2","level":"warning","message":{"text":"DomainModelAnalyzer.FirstCrossAggregateStitch (cognitive 16): DomainModelAnalyzer.FirstCrossAggregateStitch has cognitive complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent 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":"engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs"},"region":{"startLine":2095}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9d9c084043b342cce9144d135407bb54af2f1d665a9fa7ff6623551a49c2d87"}},{"ruleId":"D2","level":"warning","message":{"text":"InvocationMatching.WalkTerminatesInMemory (cognitive 16): InvocationMatching.WalkTerminatesInMemory has cognitive complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent 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":"engine/src/CodeHealth.Core/ModelAware/InvocationMatching.cs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"53734e2ee11a80a380ae92133dd4bdcacc6074999b8e2d70f15d4b63467e04d3"}},{"ruleId":"D2","level":"warning","message":{"text":"LogicDefectAnalyzer.InspectInertConfigurationKnob (cognitive 16): LogicDefectAnalyzer.InspectInertConfigurationKnob has cognitive complexity 16 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/LogicDefectAnalyzer.cs"},"region":{"startLine":2869}}}],"partialFingerprints":{"codehealthFindingId/v1":"af3735d3c7a39028aa28f3bf54a47b4ca62e36ed8c2b40acb1382139b0d5b078"}},{"ruleId":"D2","level":"warning","message":{"text":"LogicDefectAnalyzer.EmptinessClaim (cognitive 16): LogicDefectAnalyzer.EmptinessClaim has cognitive complexity 16 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/LogicDefectAnalyzer.cs"},"region":{"startLine":4437}}}],"partialFingerprints":{"codehealthFindingId/v1":"c98f94621ed4bac37d2589c3aeb665aaf45db655a3882ae053b791896d09b529"}},{"ruleId":"D2","level":"warning","message":{"text":"MutationIdempotencyAnalyzer.BuildCard (cognitive 16): MutationIdempotencyAnalyzer.BuildCard has cognitive complexity 16 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/MutationIdempotencyAnalyzer.cs"},"region":{"startLine":913}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9bbdc1748e429c7c4bef6aba86003cd322a8674f169e8b95dadd6259df2da4f"}},{"ruleId":"D2","level":"warning","message":{"text":"MutationIdempotencyAnalyzer.IsFixedValueSetViaDomainMethod (cognitive 16): MutationIdempotencyAnalyzer.IsFixedValueSetViaDomainMethod has cognitive complexity 16 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/MutationIdempotencyAnalyzer.cs"},"region":{"startLine":1655}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7ddb05a2b2c2c1906d3e28d470b96e7f694b1e35be42142b1ab786eb0f149a2"}},{"ruleId":"D2","level":"warning","message":{"text":"OperabilityExtrasAnalyzer.LibraryPublicApiAsync (cognitive 16): OperabilityExtrasAnalyzer.LibraryPublicApiAsync has cognitive complexity 16 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/OperabilityExtrasAnalyzer.cs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"efea4ebc0bc096bf88377881d065e72302c726eab7396786cb45285734dfd137"}},{"ruleId":"D2","level":"warning","message":{"text":"PackageIndex.Build (cognitive 16): PackageIndex.Build has cognitive complexity 16 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/PackageIndex.cs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"e086bee1b4f356f23efe6287f6004ac46753f94c86d844a2f6313dfe3cb8e65f"}},{"ruleId":"D2","level":"warning","message":{"text":"BootedAppRenderer.DiscoverByPortProbeAsync (cognitive 16): BootedAppRenderer.DiscoverByPortProbeAsync has cognitive complexity 16 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/RuntimeAccessibility/BootedAppRenderer.cs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"988a5ce878b65b450f8d552bc44cfc9ed05ee5b1fdbfc5ea8e9a8f909df788f5"}},{"ruleId":"D2","level":"warning","message":{"text":"ScalaDomainConventions.BypassableInvariantEntities (cognitive 16): ScalaDomainConventions.BypassableInvariantEntities has cognitive complexity 16 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/ScalaDomainConventions.cs"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f4687cbd9148740391ed212bcb29092238042b648f9fc53bb67f95647881f23"}},{"ruleId":"D2","level":"warning","message":{"text":"SymbolHelpers.HasIdWrapperBase (cognitive 16): SymbolHelpers.HasIdWrapperBase has cognitive complexity 16 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/SymbolHelpers.cs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"53035fdb7a41528713b73523e23c934be43d356c939f037950fa0e5daaee1fdd"}},{"ruleId":"D2","level":"warning","message":{"text":"TemplateDetection.IsTemplateProject (cognitive 16): TemplateDetection.IsTemplateProject has cognitive complexity 16 (threshold 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":"engine/src/CodeHealth.Core/ModelAware/TemplateDetection.cs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c856bbfc85f1db63024b598d70336da143235ce89372a23744af2550948eb69"}},{"ruleId":"D2","level":"warning","message":{"text":"CiRerunUntilGreenGate.Steps (cognitive 16): CiRerunUntilGreenGate.Steps has cognitive complexity 16 (threshold 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":"engine/src/CodeHealth.Core/Readiness/CiRerunUntilGreenGate.cs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6626d900867c2eb3e847b0118d7c47033a6ed586c64a8d8d39804c94ddb69e2"}},{"ruleId":"D2","level":"warning","message":{"text":"CiWorkflowReader.AppendMakeRecipes (cognitive 16): CiWorkflowReader.AppendMakeRecipes has cognitive complexity 16 (threshold 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":"engine/src/CodeHealth.Core/Readiness/CiWorkflowReader.cs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1dbf11b1bf2c38c602260606f8533ddaf4f791168b7230ef7755b2b4202a2ef"}},{"ruleId":"D2","level":"warning","message":{"text":"ProductionReadinessAnalyzer.HasAppleNativePersistence (cognitive 16): ProductionReadinessAnalyzer.HasAppleNativePersistence has cognitive complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs"},"region":{"startLine":1824}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a8bac79bd03856472f84a1780e1eabbdbafde198e414f1e7da878a5d228a9e9"}},{"ruleId":"D2","level":"warning","message":{"text":"ProductionReadinessAnalyzer.HasKubernetesPersistentVolumeClaim (cognitive 16): ProductionReadinessAnalyzer.HasKubernetesPersistentVolumeClaim has cognitive complexity 16 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs"},"region":{"startLine":2505}}}],"partialFingerprints":{"codehealthFindingId/v1":"628b43815f3e440c50356489558bbcdabeb0177a07a7783a5142957a3cccf86d"}},{"ruleId":"D2","level":"warning","message":{"text":"ProductionReadinessAnalyzer.HasOtpApplicationVersion (cognitive 16): ProductionReadinessAnalyzer.HasOtpApplicationVersion has cognitive complexity 16 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs"},"region":{"startLine":3002}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6d82f0e9ba9c27d69f39ded86bb24ef069e24f2f5e7ee94d8ea8b9354b4784f"}},{"ruleId":"D2","level":"warning","message":{"text":"ProductionReadinessAnalyzer.InvokedScriptText (cognitive 16): ProductionReadinessAnalyzer.InvokedScriptText has cognitive complexity 16 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs"},"region":{"startLine":3645}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec86705312f29e91a5833fea5570b29284c0123a3a2dc3fe9c7791d53447708b"}},{"ruleId":"D2","level":"warning","message":{"text":"ProductionReadinessAnalyzer.ScanForAuditSuppression (cognitive 16): ProductionReadinessAnalyzer.ScanForAuditSuppression has cognitive complexity 16 (threshold 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":"engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs"},"region":{"startLine":5020}}}],"partialFingerprints":{"codehealthFindingId/v1":"45ae8bce90fce49ca9a9407920adebbc422c5036e649e59e73cdf1ad680c6454"}},{"ruleId":"D2","level":"warning","message":{"text":"ProductionReadinessAnalyzer.ComposePublishedPortEntries (cognitive 16): ProductionReadinessAnalyzer.ComposePublishedPortEntries has cognitive complexity 16 (threshold 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":"engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs"},"region":{"startLine":6661}}}],"partialFingerprints":{"codehealthFindingId/v1":"930159e3b2da844e30d37d5b38db3c9c5f55c71803e351bb7425ca39fa32a249"}},{"ruleId":"D2","level":"warning","message":{"text":"ProductionReadinessAnalyzer.HasInSourceHealthProbeEndpoints (cognitive 16): ProductionReadinessAnalyzer.HasInSourceHealthProbeEndpoints has cognitive complexity 16 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs"},"region":{"startLine":6780}}}],"partialFingerprints":{"codehealthFindingId/v1":"496958f332f58b89764fa78e9c5556fee815e034f418854fb5ca44ebca7092df"}},{"ruleId":"D2","level":"warning","message":{"text":"ProductionReadinessAnalyzer.IncludedMakefiles (cognitive 16): ProductionReadinessAnalyzer.IncludedMakefiles has cognitive complexity 16 (threshold 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":"engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs"},"region":{"startLine":7529}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9ff2dfada15cd8642ec0f481335aff2b363ee21dadb01f2946b70a23fdf372e"}},{"ruleId":"D2","level":"warning","message":{"text":"DiskSourceFiles.ProductionLocByFileAsync (cognitive 16): DiskSourceFiles.ProductionLocByFileAsync has cognitive complexity 16 (threshold 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":"engine/src/CodeHealth.Core/Scoring/DiskSourceFiles.cs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5b9cc0c62b924e68e4b9ffb1780f40d629d630ac07e824e0b92bef74b68a764"}},{"ruleId":"D2","level":"warning","message":{"text":"DiskSourceFiles.SkipTrivia (cognitive 16): DiskSourceFiles.SkipTrivia has cognitive complexity 16 (threshold 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":"engine/src/CodeHealth.Core/Scoring/DiskSourceFiles.cs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"447b5746f2a8079e2985fae3fe2c21f7e7ecc0a15626fd3a814817ccdd029095"}},{"ruleId":"D2","level":"warning","message":{"text":"DotnetProjectFiles.ExistUnder (cognitive 16): DotnetProjectFiles.ExistUnder has cognitive complexity 16 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Scoring/DotnetProjectFiles.cs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1e6379a75c05f7d9d30b78e5c079fa694a6ee1fbe906258522d0a297be9b547"}},{"ruleId":"D2","level":"warning","message":{"text":"LayerConventions.FindViolations (cognitive 16): LayerConventions.FindViolations has cognitive complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent 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":"engine/src/CodeHealth.Core/Statistics/LayerConventions.cs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aad3157a441b12d15335e5394c5a1c65c04788b86b6f33cd3f5ecc682eab460"}},{"ruleId":"D2","level":"warning","message":{"text":"DotnetTestReliabilityCollector.MergeTrx (cognitive 16): DotnetTestReliabilityCollector.MergeTrx has cognitive complexity 16 (threshold 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":"engine/src/CodeHealth.Core/Testing/DotnetTestReliabilityCollector.cs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c2fefa54fa57e7ef0f66f4648839d3b9d284d73d599887987d147eeb7ff7c04"}},{"ruleId":"D2","level":"warning","message":{"text":"JsTestQualityCensus.ParameterBefore (cognitive 16): JsTestQualityCensus.ParameterBefore has cognitive complexity 16 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Testing/JsTestQualityCensus.cs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"79acb2feb237b18ce103c282244610853bc322711a6e498db1bac5407a5e74de"}},{"ruleId":"D2","level":"warning","message":{"text":"RoslynTestQualityCollector.ReachableBodies (cognitive 16): RoslynTestQualityCollector.ReachableBodies has cognitive complexity 16 (threshold 15). 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":"engine/src/CodeHealth.Core/Testing/RoslynTestQualityCollector.cs"},"region":{"startLine":1321}}}],"partialFingerprints":{"codehealthFindingId/v1":"17be9335921706af00be823a59751da835b8e6fe7e839dbb1856f775bf01304d"}},{"ruleId":"D2","level":"warning","message":{"text":"LlmProviderRegistration.RegisterAll (cognitive 16): LlmProviderRegistration.RegisterAll has cognitive complexity 16 (threshold 15). Most of this is not in the body itself: 5 of the 16 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 106, 72). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Cli/Composition/LlmProviderRegistration.cs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"19c74a78a9fd646bb26bb483a421c0e3e61936c74ea117aae6a0d57185ab4e66"}},{"ruleId":"D2","level":"warning","message":{"text":"EngineeringReportRenderer.ConsolidateByRootCause (cognitive 16): EngineeringReportRenderer.ConsolidateByRootCause has cognitive complexity 16 (threshold 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":"engine/src/CodeHealth.Reporting/Engineering/EngineeringReportRenderer.cs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ba30fa01c8a5e48ef06cca58bcc43c615ccc09126d2596d55ea810be4cfcb55"}},{"ruleId":"D2","level":"warning","message":{"text":"ReportViewModelFactory.BuildLensGlances (cognitive 16): ReportViewModelFactory.BuildLensGlances has cognitive complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent 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":"engine/src/CodeHealth.Reporting/Templates/ReportViewModelFactory.cs"},"region":{"startLine":842}}}],"partialFingerprints":{"codehealthFindingId/v1":"af2ce747299b814e8a2d46b4728166baecc787cf47f910ff023f508c75d2870b"}},{"ruleId":"D2","level":"warning","message":{"text":"DuplicationAnalyzer.BuildDeclarationIndex (cognitive 16): DuplicationAnalyzer.BuildDeclarationIndex has cognitive complexity 16 (threshold 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":"engine/src/CodeHealth.Dimensions.CodeQuality/CodeShape/DuplicationAnalyzer.cs"},"region":{"startLine":3444}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b5c0d622993be74ace21e4acb7a36390851052a48cbb410bbba1e3488947a06"}},{"ruleId":"D2","level":"warning","message":{"text":"DependencyVulnerabilityAnalyzer.ParseVulnerabilitiesResult (cognitive 16): DependencyVulnerabilityAnalyzer.ParseVulnerabilitiesResult has cognitive complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent 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":"engine/src/CodeHealth.Dimensions.Security/DependencyVulnerabilityAnalyzer.cs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb00d2b9af86c75523e1f3bade1eca4896c7621cc23834a350e1eeb177aade4f"}},{"ruleId":"D2","level":"warning","message":{"text":"ComposeServiceSurface.PublishesPortsFor (cognitive 16): ComposeServiceSurface.PublishesPortsFor has cognitive complexity 16 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/ComposeServiceSurface.cs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"870e3f05105cbe196145d13004b6d4b484d17f13047f779a7e37f7f1e0f9e11f"}},{"ruleId":"D2","level":"warning","message":{"text":"DuplicateResourceCopyAggregator.MetadataScalar (cognitive 16): DuplicateResourceCopyAggregator.MetadataScalar has cognitive complexity 16 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/DuplicateResourceCopyAggregator.cs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdf9054aba9309b1cf5658c05250e7726bb5333825746525c74fc843f8aa56ba"}},{"ruleId":"D2","level":"warning","message":{"text":"LoopbackAddressRecheck.LoopbackUrlOrInterpolatedLoopbackHost (cognitive 16): LoopbackAddressRecheck.LoopbackUrlOrInterpolatedLoopbackHost has cognitive complexity 16 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/LoopbackAddressRecheck.cs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"d79f396cfa5e3e00e9b17f862bac01b973ab986017a3a9122a762cb4364e79dd"}},{"ruleId":"D2","level":"warning","message":{"text":"NamespaceScopedRuleAggregator.IndexDeclaredKinds (cognitive 16): NamespaceScopedRuleAggregator.IndexDeclaredKinds has cognitive complexity 16 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/NamespaceScopedRuleAggregator.cs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"3214035cb31dcbda44c5fc3c8ce01c27594f8d76688be0eeeca8ca82e642278a"}},{"ruleId":"D2","level":"warning","message":{"text":"PathCombineProvenanceRecheck.ExtractCombineArgs (cognitive 16): PathCombineProvenanceRecheck.ExtractCombineArgs has cognitive complexity 16 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/PathCombineProvenanceRecheck.cs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e314f9ebe744b78a39a6699e5a843102b0358b35d8d2dcdcb735cf7c992dcd6"}},{"ruleId":"D2","level":"warning","message":{"text":"PathContainmentRecheck.RandomValueNamesAFilePath (cognitive 16): PathContainmentRecheck.RandomValueNamesAFilePath has cognitive complexity 16 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/PathContainmentRecheck.cs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7e03974303ea56dbfb3f7f59b53f8c0cd21d3743b3f25fc9422808d4e5d6307"}},{"ruleId":"D2","level":"warning","message":{"text":"RubyArgumentMutatedScan.FirstDestructiveUse (cognitive 16): RubyArgumentMutatedScan.FirstDestructiveUse has cognitive complexity 16 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/RubyArgumentMutatedScan.cs"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"3303f4902cd00bfc25966c537329ed0912cac0183ca1cc91e2074da8101f7db7"}},{"ruleId":"D2","level":"warning","message":{"text":"RubyArgumentMutatedScan.ArgumentTextAt (cognitive 16): RubyArgumentMutatedScan.ArgumentTextAt has cognitive complexity 16 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/RubyArgumentMutatedScan.cs"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"acde45d9fb98920850973410cae85166c17b988cfb5e2402d89cc58c246686fc"}},{"ruleId":"D2","level":"warning","message":{"text":"SecretNoiseFilter.HasNonEmptyValue (cognitive 16): SecretNoiseFilter.HasNonEmptyValue has cognitive complexity 16 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/SecretNoiseFilter.cs"},"region":{"startLine":4331}}}],"partialFingerprints":{"codehealthFindingId/v1":"d51194cdd67222c10ddb951f3461e9974d3074b278461dc5a24b94906ff3a1a3"}},{"ruleId":"D2","level":"warning","message":{"text":"SemgrepShapeFilter.TopLevelArguments (cognitive 16): SemgrepShapeFilter.TopLevelArguments has cognitive complexity 16 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/SemgrepShapeFilter.cs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6faa728e6bfe324a17ff2c828d5cba094d8b93c035adbd07c4a43e0ee8638a9"}},{"ruleId":"D2","level":"warning","message":{"text":"UnverifiedAppVeyorInstallerRecheck.InvokesADownloadedArtefact (cognitive 16): UnverifiedAppVeyorInstallerRecheck.InvokesADownloadedArtefact has cognitive complexity 16 (threshold 15). 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/UnverifiedAppVeyorInstallerRecheck.cs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"62fb6483d3c1a250e336ea4d74d0a4a2d381c0937474a3b61b05b4e840d2241a"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkflowInputGateRecheck.WorkflowInputIsGateValidated (cognitive 16): WorkflowInputGateRecheck.WorkflowInputIsGateValidated has cognitive complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/WorkflowInputGateRecheck.cs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"5909bfe007723da1a77e8af52d65d1f9c9d4ddc179b20c703a35ed5f5ac69707"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkflowInputGateRecheck.CollectGatedInputs (cognitive 16): WorkflowInputGateRecheck.CollectGatedInputs has cognitive complexity 16 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/WorkflowInputGateRecheck.cs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"39db568fcd1aac7f32daa1dfd71e3d44afdd2435669b65c33341f0adb5bc5be5"}},{"ruleId":"D2","level":"warning","message":{"text":"SecretScanningAnalyzer.RunAsync (cognitive 16): SecretScanningAnalyzer.RunAsync has cognitive complexity 16 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/SecretScanningAnalyzer.cs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"00686a3f5fa98a311449f6eb31d2e7aa939ab974e93731549ed61b697941f998"}},{"ruleId":"D2","level":"warning","message":{"text":"SecretsHistoryAnalyzer.GateRustDocCommentFindings (cognitive 16): SecretsHistoryAnalyzer.GateRustDocCommentFindings has cognitive complexity 16 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/SecretsHistoryAnalyzer.cs"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf997248b2c03cf2134988b889fa4d201cff03cfcab6d23980398b19f4e95fa1"}},{"ruleId":"D2","level":"warning","message":{"text":"SecretsHistoryAnalyzer.RustCfgTestRegions (cognitive 16): SecretsHistoryAnalyzer.RustCfgTestRegions has cognitive complexity 16 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/SecretsHistoryAnalyzer.cs"},"region":{"startLine":1452}}}],"partialFingerprints":{"codehealthFindingId/v1":"4206a456aa057904b8d36545778c37560b6b47fbfb2f3288ba2af557740da6a8"}},{"ruleId":"D2","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.ClassifyDependencySection (cognitive 16): SupplyChainProvenanceAnalyzer.ClassifyDependencySection has cognitive complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent 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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":1432}}}],"partialFingerprints":{"codehealthFindingId/v1":"61c011a3a7684931b4d0030a6dad862d3e248768c427175e7d0a350cca128cd0"}},{"ruleId":"D2","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.ScanReleaseAutomation (cognitive 16): SupplyChainProvenanceAnalyzer.ScanReleaseAutomation has cognitive complexity 16 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":5619}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffb08095dac0c5b52544869ec09be8809378055521a231fdb6a1928764be37c6"}},{"ruleId":"D2","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.UnapprovedTagTriggeredPublishes (cognitive 16): SupplyChainProvenanceAnalyzer.UnapprovedTagTriggeredPublishes has cognitive complexity 16 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":8278}}}],"partialFingerprints":{"codehealthFindingId/v1":"647601c764af49637cde5c8021ab67f0d7211f8236e888473eca24501b9bf8ea"}},{"ruleId":"D2","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.CodeownersCoverageFor (cognitive 16): SupplyChainProvenanceAnalyzer.CodeownersCoverageFor has cognitive complexity 16 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":10434}}}],"partialFingerprints":{"codehealthFindingId/v1":"921971deb354d1caf19d3513206d078f493db5ad3ace080f1fdcf8861c90720d"}},{"ruleId":"D2","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.BranchProtectionFor (cognitive 16): SupplyChainProvenanceAnalyzer.BranchProtectionFor has cognitive complexity 16 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":10744}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bf5d037ea778c710e3ebe894f89e04018e6d5152558798f548bb935c1072905"}},{"ruleId":"D2","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.UninvokedRegistryPublishPath (cognitive 16): SupplyChainProvenanceAnalyzer.UninvokedRegistryPublishPath has cognitive complexity 16 (threshold 15). 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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.PublishTrigger.cs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"94a9c193be3fe5b4cf8ff86f7d57da4a154842796350ef67218fb442f8cc2f76"}},{"ruleId":"D2","level":"warning","message":{"text":"SupplyChainProvenanceAnalyzer.SupplementaryCiInvokesGoReleaser (cognitive 16): SupplyChainProvenanceAnalyzer.SupplementaryCiInvokesGoReleaser has cognitive complexity 16 (threshold 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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.ReleaseTrigger.cs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"b62f13d6daddadbbe25177f687b1cfb22bb4794bcb3d8814af807e2083953009"}},{"ruleId":"D2","level":"warning","message":{"text":"ChangeCouplingAnalyzer.ReferencesFileByPathLiteral (cognitive 16): ChangeCouplingAnalyzer.ReferencesFileByPathLiteral has cognitive complexity 16 (threshold 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":"engine/src/CodeHealth.Dimensions.GitMining/ChangeCouplingAnalyzer.cs"},"region":{"startLine":3244}}}],"partialFingerprints":{"codehealthFindingId/v1":"33babd0c6981fab574e25ea2876989c1202a001438dd1b7f96df2734006109ec"}},{"ruleId":"D2","level":"warning","message":{"text":"ChangeCouplingAnalyzer.RustEnumsOf (cognitive 16): ChangeCouplingAnalyzer.RustEnumsOf has cognitive complexity 16 (threshold 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":"engine/src/CodeHealth.Dimensions.GitMining/ChangeCouplingAnalyzer.cs"},"region":{"startLine":4096}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6d94d1ff300c602d42a3bf978f3776110fbc29014ebe524aa9082a7fed5a827"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentationQualityAnalyzer.RunAsync (cognitive 16): DocumentationQualityAnalyzer.RunAsync has cognitive complexity 16 (threshold 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":"engine/src/CodeHealth.Dimensions.Docs/DocumentationQualityAnalyzer.cs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"9874304759c949512e4023d24c7bef1cc88f65c8155ef0a2fe90558740b8dd68"}},{"ruleId":"D2","level":"warning","message":{"text":"Sparkline.razor \u203A Runs (cognitive 16): Sparkline.razor \u203A Runs has cognitive complexity 16 (threshold 15). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Kennel.Ui/Components/Sparkline.razor"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f66ed19d6fe5620f8a77a6fb034ab874cd3d376e3e211b523de67e8b0eed48b"}},{"ruleId":"D2","level":"warning","message":{"text":"FSharpSyntaxModel.abstractSlotOf (cognitive 16): FSharpSyntaxModel.abstractSlotOf has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), match/switch 3 (7 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.CodeModel.FSharp/SyntaxModel.fs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"66d4b320d1addb2b8d10d40d67040f090b85608d5c625eac4a6de5f08426c3ad"}},{"ruleId":"D2","level":"warning","message":{"text":"main.parse_project (cognitive 16): main.parse_project has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (6 pts), error handling 2 (4 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/python-frontend/main.py"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd55095470ad8b70e27457f23e3dfb084d11487ccee990daba5ca4fb4a75c60e"}},{"ruleId":"D2","level":"warning","message":{"text":"build-quality-pairs-v2.mix_conventions (cognitive 16): build-quality-pairs-v2.mix_conventions has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), loops 3 (4 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/llm-bakeoff/build-quality-pairs-v2.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a8cdd5bf9afe466787487ac478f05ecd0407e61aea49f233db813fb153bce52"}},{"ruleId":"D2","level":"warning","message":{"text":"head2head.run (cognitive 16): head2head.run has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 3 (7 pts), boolean chains 4, loops 2 (3 pts), if/else 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":"tools/llm-bakeoff/head2head.py"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d61ee81cafd7a5693c53b40d59f4f7b58d686c98140412bc9d7f91beba829e0"}},{"ruleId":"D2","level":"warning","message":{"text":"bench.grade (cognitive 16): bench.grade has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 3, ternaries 2 (3 pts), loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/qwen-eval/bench.py"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"69927e473e1f8f0caee88ba547156656ac49431a715723c9e4cd8b2150084b0b"}},{"ruleId":"D2","level":"warning","message":{"text":"bench.report (cognitive 16): bench.report has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11, loops 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/qwen-eval/bench.py"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8cdca1115a78ae137c4a473d8734b6079ce99edfd2cfc55cf5a98fb10f7a975"}},{"ruleId":"D2","level":"warning","message":{"text":"advisory.drift (cognitive 16): advisory.drift has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/rescan/advisory.py"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"9edec82326b07e7287c97b9bb294f565c6c4a1163bff70af0093752e296d85bf"}},{"ruleId":"D2","level":"warning","message":{"text":"check_submission_verdict.main (cognitive 16): check_submission_verdict.main has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 4, loops 2, error handling 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/check_submission_verdict.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"d89832112d8d04e16dfff31e9a94e8c21667e5847ad2a84dab570cdd7f69f92e"}},{"ruleId":"D2","level":"warning","message":{"text":"dimension-routing._backlog_rows (cognitive 16): dimension-routing._backlog_rows has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (5 pts), ternaries 2 (4 pts), boolean chains 3, error handling 2 (3 pts), loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/dimension-routing.py"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d08c60dc2941065fee2c422e34d12faae8461d785b72c4702294f74c5a0d157"}},{"ruleId":"D2","level":"warning","message":{"text":"judge-with-tools.main (cognitive 16): judge-with-tools.main has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (3 pts), boolean chains 1, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/judge-with-tools.py"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb8954affbd1b7e0cc84d0bfc50ae406f07f23569d6b5a572c46273d23a1d621"}},{"ruleId":"D2","level":"warning","message":{"text":"scope-evidence.graph_evidence (cognitive 16): scope-evidence.graph_evidence has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (7 pts), error handling 2 (4 pts), boolean chains 3, loops 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":"tools/train/scope-evidence.py"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"c81b390d244e16f1e2fce55d9d5a4a2a3c1ed80694635a4730ccbe7ff76fb6b7"}},{"ruleId":"D2","level":"warning","message":{"text":"w2_catalogue_check.main (cognitive 16): w2_catalogue_check.main has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (7 pts), loops 4 (5 pts), ternaries 3, boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/whitepapers/w2_catalogue_check.py"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"794632087b6dcd207f13545a86293abf0da9480e2e41e2988b4074c3073ea28c"}},{"ruleId":"D2","level":"warning","message":{"text":"BodyFacts.argTypeRefs (cognitive 16): BodyFacts.argTypeRefs has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 2 (6 pts), if/else 2 (5 pts), boolean chains 4, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/php-frontend/body.php"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdd5a64a8b580561b11fbceab7ccac43604ad583cda258013fa8710ebd80c321"}},{"ruleId":"D2","level":"warning","message":{"text":"Extractor.branchDecls (cognitive 16): Extractor.branchDecls has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (7 pts), loops 3 (7 pts), match/switch 1 (2 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":"engine/sidecars/swift-frontend/Sources/codehealth-swift-sidecar/Extractor.swift"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c7c3e29f4bb165026aff586dea6f98b0132e0ba39cf79eb2cca02bc5251bc1f"}},{"ruleId":"D2","level":"warning","message":{"text":"Modifiers.memberModifiers (cognitive 16): Modifiers.memberModifiers has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/swift-frontend/Sources/codehealth-swift-sidecar/Extractor.swift"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"077f31819a4bb4e3396151464233883dcfd374b2eb8da79518b0e28b5916628f"}},{"ruleId":"D2","level":"warning","message":{"text":"codehealth_rust_sidecar::match_prefixes (cognitive 16): codehealth_rust_sidecar::match_prefixes has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 5 (9 pts), if/else 2 (4 pts), loops 2 (3 pts) (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":"engine/sidecars/rust-frontend/src/main.rs"},"region":{"startLine":2714}}}],"partialFingerprints":{"codehealthFindingId/v1":"c95a23fdb3da08d156fd2a1b0b0f9a326d675d7b61b4fc3a7e99bc40dcf94d6c"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::renderDelta (cognitive 16): (anonymous)::renderDelta has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 9, if/else 4, ternaries 3. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Kennel.Ui/wwwroot/kennel-ui.js"},"region":{"startLine":1535}}}],"partialFingerprints":{"codehealthFindingId/v1":"2361a00b522b53fb700c27a4fa87ef2af1f51944d44dc5d4bee5e6c28c353c5a"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 16): (anonymous) has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7, boolean chains 5, ternaries 3 (4 pts) (nesting depth added 1). Most of this is not in the body itself: 3 of the 16 points are its own statements and the rest belongs to 6 function items inside it that branch (apply, initTeamPicker::(anonymous), initTeamPicker, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Kennel.Ui/wwwroot/kennel-ui.js"},"region":{"startLine":1771}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf0d3ff6ba0cf9f0a9cc760a17af80ea500f7751f552810b6be5547913d015fc"}},{"ruleId":"D2","level":"warning","message":{"text":"main (cognitive 16): main has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (8 pts), loops 3 (4 pts), ternaries 2 (4 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":"tools/localdev/ui/a11y-gate.mjs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f4c9998fea965536e06c85019c2cce694c12914b38837b2f195c6c15bfc5bb6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AccessibilityAnalyzer: TooManyMethods \u2014 4081 significant lines (blank, comment-only and punctuation-only lines excluded), 319 methods, declared across 4 files: ModelAware/AccessibilityAnalyzer.cs (303), ModelAware/AccessibilityAnalyzer.TaggedTemplateBlindness.cs (7), ModelAware/AccessibilityAnalyzer.TemplateLanguageBlindness.cs (7), ModelAware/AccessibilityAnalyzer.HtmlStringBlindness.cs (2). The bar is 30 methods; this is 289 over it, 10.63\u00D7 the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4bf5bae68a109578528e745318705d4c633ebafe58c5f8704f75be7adebb6ab"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AnalyzeCommand.ExecuteCoreAsync: MethodTooLong \u2014 ExecuteCoreAsync runs 915 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 815 over it, 9.15\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Cli/Commands/AnalyzeCommand.cs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c3550defaca0bc4e598f652c67cd4e639f44b2b980e78e240def498cb175dd5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs: FileTooLong \u2014 4035 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 3535 over it, 8.07\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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0e07cb208df365d99d9626f344095fee24ce6a6e1a76c65b73557dac2e6335e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SupplyChainProvenanceAnalyzer: TooManyMethods \u2014 4716 significant lines (blank, comment-only and punctuation-only lines excluded), 236 methods, declared across 8 files: CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs (188), CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.PublishTrigger.cs (13), CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.PackagingIdentity.cs (11), CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.ReleasePathReach.cs (8), \u002B4 more file(s). The bar is 30 methods; this is 206 over it, 7.87\u00D7 the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a68be5e769959529cb1a8c150c75a1ecb2e5609459837595be9742c9bf9e786"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ModelAware/AccessibilityAnalyzer.cs: FileTooLong \u2014 3770 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 3270 over it, 7.54\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":"engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b0a9bf19cfe4fe23fde9edbf16b198c67559abda8cb53c8d14be377fd796672"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ProductionReadinessAnalyzer: TooManyMethods \u2014 2806 significant lines (blank, comment-only and punctuation-only lines excluded), 189 methods. The bar is 30 methods; this is 159 over it, 6.30\u00D7 the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c2bee7dd6ad0130e36873c1342fc308a77475de699e3032fcf6f33da5187453"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RoslynExplicitDebtCollector: TooManyMethods \u2014 2274 significant lines (blank, comment-only and punctuation-only lines excluded), 189 methods, declared across 2 files: ExplicitDebt/RoslynExplicitDebtCollector.cs (170), ExplicitDebt/RoslynExplicitDebtCollector.Vb.cs (19). The bar is 30 methods; this is 159 over it, 6.30\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ExplicitDebt/RoslynExplicitDebtCollector.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a0bb28009d76d52d6e5906acab747a9997585334878dc0c4e386b61e40c17a5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/main.rs: FileTooLong \u2014 2942 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 100 free functions. The bar is 500 significant lines; this is 2442 over it, 5.88\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":"engine/sidecars/rust-frontend/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4971d5d41673b9c6307fc13a2e99f6055c70aff857bac111a4d697afa180d5a3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DependencyHygieneAnalyzer.RunAsync: MethodTooLong \u2014 RunAsync runs 572 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 472 over it, 5.72\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Dependencies/DependencyHygieneAnalyzer.cs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"8845f23bcae3d62065ba66e90aa80b4807da27362f38d9a3b737e56bbf5b9bca"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Frontend/JsDuplicationDetector.cs: FileTooLong \u2014 2836 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2336 over it, 5.67\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":"engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2522ef13b1d042da6299b08e65e63cd57f611d2ec083f4c4f051a4af4781263d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Readiness/ProductionReadinessAnalyzer.cs: FileTooLong \u2014 2815 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2315 over it, 5.63\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":"engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"872ca43b9fbfc908d8ae4c724dd7deffb28d455a88aeb220cafb62f12a3bcdf9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: LogicDefectAnalyzer: TooManyMethods \u2014 2008 significant lines (blank, comment-only and punctuation-only lines excluded), 167 methods. The bar is 30 methods; this is 137 over it, 5.57\u00D7 the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/LogicDefectAnalyzer.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9732ef733e647a6818d9b8beaf4eabb8ba12ce4e564d8992335086e61da62016"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Compliance/ComplianceSecurityAnalyzer.cs: FileTooLong \u2014 2654 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2154 over it, 5.31\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"952d491621c6509fd88f707648f9c61cb17920619c9b5050f624c41bc1a72222"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: IncompletenessAnalyzer: TooManyMethods \u2014 1685 significant lines (blank, comment-only and punctuation-only lines excluded), 146 methods. The bar is 30 methods; this is 116 over it, 4.87\u00D7 the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/IncompletenessAnalyzer.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"47f98c7baf5ddd8a566dae1c8f061ca5bad62a7acf30858c243df843b5bf3444"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: GoDomainConventions: TooManyMethods \u2014 1057 significant lines (blank, comment-only and punctuation-only lines excluded), 143 methods. The bar is 30 methods; this is 113 over it, 4.77\u00D7 the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/GoDomainConventions.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6039ad4715a44cb9bfee53caaf60f4a5c28ffbb3989ec4cfd7386ac0074e9484"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ModelAware/DomainModelAnalyzer.cs: FileTooLong \u2014 2348 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1848 over it, 4.70\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":"engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f46ac15a614d98090213ec64fefce91d3682f6f0195feb40c4c948905340ac66"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Commands/AnalyzeCommand.cs: FileTooLong \u2014 2209 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1709 over it, 4.42\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":"engine/src/CodeHealth.Cli/Commands/AnalyzeCommand.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2a17d2c259914539891421b5d503463fd2db56f0bb810a7dbca7f4822360f0f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DomainModelAnalyzer: TooManyMethods \u2014 2337 significant lines (blank, comment-only and punctuation-only lines excluded), 131 methods. The bar is 30 methods; this is 101 over it, 4.37\u00D7 the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"efbe50d3798c8c4ce6bfad9940ac168d96f0c8de5f44d8cfae6e43a63e6355f2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ExplicitDebt/RoslynExplicitDebtCollector.cs: FileTooLong \u2014 2159 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1659 over it, 4.32\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":"engine/src/CodeHealth.Core/ExplicitDebt/RoslynExplicitDebtCollector.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d333d663a1c8327d744d796421375b0d3a6d7d2da6fc23c7f8f62357ce6e85d6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: JsDuplicationDetector: TooManyMethods \u2014 2824 significant lines (blank, comment-only and punctuation-only lines excluded), 127 methods. The bar is 30 methods; this is 97 over it, 4.23\u00D7 the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"60c27de8bdfe1b2aaede63e3d4413115976ca107d45b55d232969b69cacb4614"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ComplianceSecurityAnalyzer: TooManyMethods \u2014 2550 significant lines (blank, comment-only and punctuation-only lines excluded), 125 methods. The bar is 30 methods; this is 95 over it, 4.17\u00D7 the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"73cb6cd4c31a214581b66ecac8d805c4662366a757213b479443905d0159387b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: CodeHealth.Dimensions.GitMining/ChangeCouplingAnalyzer.cs: FileTooLong \u2014 2053 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1553 over it, 4.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":"engine/src/CodeHealth.Dimensions.GitMining/ChangeCouplingAnalyzer.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"322237db4fe3ec7f864d16fad472c11f073c230e06262558e91f15c34fc06303"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ModelAware/LogicDefectAnalyzer.cs: FileTooLong \u2014 2025 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1525 over it, 4.05\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":"engine/src/CodeHealth.Core/ModelAware/LogicDefectAnalyzer.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7b33d7cb855f62741fce3fd4b87fcefb68f9209b43097e04f2253f9b83232a6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ChangeCouplingAnalyzer: TooManyMethods \u2014 2039 significant lines (blank, comment-only and punctuation-only lines excluded), 121 methods. The bar is 30 methods; this is 91 over it, 4.03\u00D7 the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.GitMining/ChangeCouplingAnalyzer.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e5cc580cdbe1752b9cd49ab86a7f23959eba956c30ae975df174a0a53c65eef"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: CodeShape/DuplicationAnalyzer.cs: FileTooLong \u2014 1862 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1362 over it, 3.72\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":"engine/src/CodeHealth.Dimensions.CodeQuality/CodeShape/DuplicationAnalyzer.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"513aaa9a36c48857a426b63e9255e31bb8d789dde90a48c08625309b250dbba0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CSharpCorrectnessAnalyzer.AnalyzeAsync: MethodTooLong \u2014 AnalyzeAsync runs 362 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 262 over it, 3.62\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":"engine/src/CodeHealth.Core/ModelAware/CSharpCorrectnessAnalyzer.cs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"87c79aa092019e8c43e12ccca85f6fd128979268c1cf67f2ae4643c6502755cb"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SecretNoiseFilter: TooManyMethods \u2014 1447 significant lines (blank, comment-only and punctuation-only lines excluded), 108 methods. The bar is 30 methods; this is 78 over it, 3.60\u00D7 the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/SecretNoiseFilter.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e70f62f5d80d8eba4e08a01f0159fb68ef0f8a3ceca6790f51d912914df25a44"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ReportViewModelFactory: TooManyMethods \u2014 1395 significant lines (blank, comment-only and punctuation-only lines excluded), 108 methods. The bar is 30 methods; this is 78 over it, 3.60\u00D7 the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Reporting/Templates/ReportViewModelFactory.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd39fff32236744b41570f96b7608a5d4748b7c557cdb66555e09c32d02d7cb6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ModelAware/IncompletenessAnalyzer.cs: FileTooLong \u2014 1695 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1195 over it, 3.39\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":"engine/src/CodeHealth.Core/ModelAware/IncompletenessAnalyzer.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8be2f17860990fac4db0b85e2deee3ffd4bec8fb526961451e919cefea0fe9ce"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SupplyChainProvenanceAnalyzer.WorkflowTokenHygiene: MethodTooLong \u2014 WorkflowTokenHygiene runs 323 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 223 over it, 3.23\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":8699}}}],"partialFingerprints":{"codehealthFindingId/v1":"36e78a15b4399c4b7c86adee09ddc5474568931c843f583902d4b2a9a0c55355"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SupplyChainProvenanceAnalyzer.RunAsync: MethodTooLong \u2014 RunAsync runs 311 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 211 over it, 3.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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":2625}}}],"partialFingerprints":{"codehealthFindingId/v1":"6479ef9dc79e687973b3688635f4f88f9e8a09de33bb8ba08c3a182d547e677d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AnalyzeCommand: TooManyMethods \u2014 2176 significant lines (blank, comment-only and punctuation-only lines excluded), 92 methods. The bar is 30 methods; this is 62 over it, 3.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Cli/Commands/AnalyzeCommand.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a436203066b332276ace9d0b4e1764c41f49bec683d3b3d21d6d1cf956c3ed6e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SourceClassifier: TooManyMethods \u2014 1210 significant lines (blank, comment-only and punctuation-only lines excluded), 90 methods. The bar is 30 methods; this is 60 over it, 3.00\u00D7 the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Classification/SourceClassifier.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"53f58e58b0514958dc62153e7b7bef1515cc1c0b1280b1ecd835d140f15bb59e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ScanParsers: TooManyMethods \u2014 1205 significant lines (blank, comment-only and punctuation-only lines excluded), 90 methods. The bar is 30 methods; this is 60 over it, 3.00\u00D7 the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/ScanParsers.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4930f4e6097b911b9e7dabd4088bf210a335c535b2bc38a7dd2e455ef6e60b07"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Maturity/MaturityAnalyzer.cs: FileTooLong \u2014 1470 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 970 over it, 2.94\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Maturity/MaturityAnalyzer.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4da89ad4073513636e10840e58d0f39ad2f32b36c1e6d868ae1d19832deeceec"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: train/judge_assignment.py: FileTooLong \u2014 1466 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 966 over it, 2.93\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":"tools/train/judge_assignment.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"07658c66a3832c57b518bb596bf7f2bfa08cd9d5e0c29bd531458b761326d4c6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ComplianceSecurityAnalyzer.S1: MethodTooLong \u2014 S1 runs 293 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 193 over it, 2.93\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs"},"region":{"startLine":5493}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d0fb441568df50f3b90ac863084dd1fa11ad9f38ce9f374d692801a8f315be1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Scanners/SecretNoiseFilter.cs: FileTooLong \u2014 1453 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 953 over it, 2.91\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":"engine/src/CodeHealth.Dimensions.Security/Scanners/SecretNoiseFilter.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"380f247330817a22009a070561a23560491301a644bb944ab0f9f58616c29ac6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Templates/ReportViewModelFactory.cs: FileTooLong \u2014 1407 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 907 over it, 2.81\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":"engine/src/CodeHealth.Reporting/Templates/ReportViewModelFactory.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd2f3a8cad14054c95e1cd05b97b6fb3fb7b57181d1f951bb26a44b375665424"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HotspotAnalyzer.RunAsync: MethodTooLong \u2014 RunAsync runs 279 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 179 over it, 2.79\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.GitMining/HotspotAnalyzer.cs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ca9da15d5f727054b4b2d6ab3023b72f6d66af1d84455b55936bb3c741198ca"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: KnowledgeConcentrationAnalyzer.RunAsync: MethodTooLong \u2014 RunAsync runs 274 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 174 over it, 2.74\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":"engine/src/CodeHealth.Dimensions.GitMining/KnowledgeConcentrationAnalyzer.cs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"62bc71ad61203b4b4e7b1b098ee821c389723375e41a25ab19ea94c2a5a27a26"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MaturityAnalyzer: TooManyMethods \u2014 1441 significant lines (blank, comment-only and punctuation-only lines excluded), 81 methods. The bar is 30 methods; this is 51 over it, 2.70\u00D7 the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Maturity/MaturityAnalyzer.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"29d1e70ed700b7f65446a987fe9a9f72e26ce03c84f584f6a62e292bf8ab16c9"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DependencyHygieneAnalyzer: ClassTooLong \u2014 1060 significant lines (blank, comment-only and punctuation-only lines excluded), 26 methods. The bar is 400 significant lines; this is 660 over it, 2.65\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":"engine/src/CodeHealth.Dimensions.Dependencies/DependencyHygieneAnalyzer.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"628f27807bc87c08ffa7c77c0512cd0e518e6b8da89b5771527d30958bbfb3e4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RoslynTestQualityCollector: TooManyMethods \u2014 995 significant lines (blank, comment-only and punctuation-only lines excluded), 79 methods. The bar is 30 methods; this is 49 over it, 2.63\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":"engine/src/CodeHealth.Core/Testing/RoslynTestQualityCollector.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9afcae4fe35d2357d380bafc9a72ed9ac3492c20de206edbd7cdd3cc892b78d2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DuplicationAnalyzer: TooManyMethods \u2014 1472 significant lines (blank, comment-only and punctuation-only lines excluded), 78 methods. The bar is 30 methods; this is 48 over it, 2.60\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.CodeQuality/CodeShape/DuplicationAnalyzer.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5f2d55cdfab625852e8b056609515b79b3a0c6fd140b6334a955caf190f74fb"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DomainConventions: TooManyMethods \u2014 685 significant lines (blank, comment-only and punctuation-only lines excluded), 78 methods. The bar is 30 methods; this is 48 over it, 2.60\u00D7 the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/DomainConventions.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"629364b85d3f9dd33c173a31c13f320296f54d025baf830fee9d77f885fa7f3b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ScoringSpecModel: ClassTooLong \u2014 1028 significant lines (blank, comment-only and punctuation-only lines excluded), 2 methods. The bar is 400 significant lines; this is 628 over it, 2.57\u00D7 the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Cli/Commands/ScoringSpecModel.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"315c74e059d9d0cc7ca00d3da8b3ffd5735f09b2a63dd4fa03380689cf3951e2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: CodeShape/RoslynDuplicationDetector.cs: FileTooLong \u2014 1272 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 772 over it, 2.54\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":"engine/src/CodeHealth.Core/CodeShape/RoslynDuplicationDetector.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4382f481dcb8b8f0148badf070dcdeba6568c96fa94afd41ee1dfae63b5985c4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: IncompletenessAnalyzer.AnalyzeAsync: MethodTooLong \u2014 AnalyzeAsync runs 250 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 150 over it, 2.50\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/IncompletenessAnalyzer.cs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6de64d21f56dec5b09f062b43f5b818781b11eed90ab6638575de71bd4757c8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Scanners/ScanParsers.cs: FileTooLong \u2014 1225 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 725 over it, 2.45\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":"engine/src/CodeHealth.Dimensions.Security/Scanners/ScanParsers.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e2515d7c07e1442ca32140e71060f8660e4566f06d81da543580ddcb05bf11d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SolutionShapeAnalyzer.RunAsync: MethodTooLong \u2014 RunAsync runs 242 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 142 over it, 2.42\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.CodeQuality/SolutionShape/SolutionShapeAnalyzer.cs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dbca492ea2c749b6629b2c8609a76dadc2ae5f6a27abfa4ee4a2a9ee837a8ed"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: EntryPointCatalog: TooManyMethods \u2014 1031 significant lines (blank, comment-only and punctuation-only lines excluded), 72 methods. The bar is 30 methods; this is 42 over it, 2.40\u00D7 the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/EntryPointCatalog.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2431a07d55860cab777522b3e1a5008416588b9287b4d6d0aa95606d60471d87"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: JsDuplicationDetector.BuildDeclarationEntryMask: MethodTooLong \u2014 BuildDeclarationEntryMask runs 238 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 138 over it, 2.38\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs"},"region":{"startLine":860}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c2d6f0f4a268db2939e3377cb5e3a0a5f223da6eaf4330ee7c9bdf8678dbc63"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ModelAware/EventDrivenAnalyzer.cs: FileTooLong \u2014 1168 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 668 over it, 2.34\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":"engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"04b27d58dd7b067496708e567f0377b026fe6f67ad116a4051b51e2c485fa6fc"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: FrontendDependencyHygiene: TooManyMethods \u2014 1012 significant lines (blank, comment-only and punctuation-only lines excluded), 70 methods. The bar is 30 methods; this is 40 over it, 2.33\u00D7 the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/FrontendDependencyHygiene.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"31efc89fb461db0911267205c6fa5489701db4c7f0cef7ef6773084507cd8fa3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RustDomainConventions: TooManyMethods \u2014 502 significant lines (blank, comment-only and punctuation-only lines excluded), 70 methods. The bar is 30 methods; this is 40 over it, 2.33\u00D7 the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/RustDomainConventions.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"44292763b672c4a7891971fa0566d1fbf29d17a692a58de75bd7ea87e0c571e1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ModelAware/CSharpCorrectnessAnalyzer.cs: FileTooLong \u2014 1126 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 626 over it, 2.25\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/CSharpCorrectnessAnalyzer.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"02e8faeed5549bacac65933ffa4b2c1e6afb221034704e0eca99500e82770c7e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CSharpCorrectnessAnalyzer: TooManyMethods \u2014 1117 significant lines (blank, comment-only and punctuation-only lines excluded), 66 methods. The bar is 30 methods; this is 36 over it, 2.20\u00D7 the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/CSharpCorrectnessAnalyzer.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f7b548600008181b316de5f42264e27c1101a43be4f3ce223d5f341249de8d0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SupplyChainProvenanceAnalyzer.BuildIntegrityArms: MethodTooLong \u2014 BuildIntegrityArms runs 218 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 118 over it, 2.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":2265}}}],"partialFingerprints":{"codehealthFindingId/v1":"49c398a5d8b448e7c5e8a93a1ef14a446dc4c8ab147cfcc3c0cfb78feb203035"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ExplicitDebtAnalyzer.ToFinding: MethodTooLong \u2014 ToFinding runs 217 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 117 over it, 2.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":"engine/src/CodeHealth.Dimensions.ExplicitDebt/ExplicitDebtAnalyzer.cs"},"region":{"startLine":1039}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a400d01bba51fce6ad75bb56e67d7f0bb22f3f2c727062025f12e2ddef5b67f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: CodeHealth.Dimensions.Dependencies/DependencyHygieneAnalyzer.cs: FileTooLong \u2014 1070 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 570 over it, 2.14\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":"engine/src/CodeHealth.Dimensions.Dependencies/DependencyHygieneAnalyzer.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e586b420d2f5dfe262ce0ecafe726640de71c08746a4c27db4cea2d44cc5e06a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RoslynDuplicationDetector.ScanAsync: MethodTooLong \u2014 ScanAsync runs 213 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 113 over it, 2.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/CodeShape/RoslynDuplicationDetector.cs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d59886a63a4b2986edf53fd6283c92be080489d3a29dc2c99cf89c49325326a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CouplingAnalyzer.RunAsync: MethodTooLong \u2014 RunAsync runs 213 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 113 over it, 2.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Architecture/CouplingAnalyzer.cs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f450d14265991993ddbb01a6406c1aae7600cf63ce2698f84745e47be068b38"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ModelAware/GoDomainConventions.cs: FileTooLong \u2014 1059 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 559 over it, 2.12\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/GoDomainConventions.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"519335e1ae891bbc9077cd0a688d648274deb84c81303caa3503ff8dccf6bf29"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Frontend/EntryPointCatalog.cs: FileTooLong \u2014 1056 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 556 over it, 2.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":"engine/src/CodeHealth.Core/Frontend/EntryPointCatalog.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"350dbfd4e55a84e7719388a87f450d13bb74e03ac3088af1f7553a4a2add1615"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DeclaredDependencies: TooManyMethods \u2014 816 significant lines (blank, comment-only and punctuation-only lines excluded), 63 methods. The bar is 30 methods; this is 33 over it, 2.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/DeclaredDependencies.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c77e526a831f4a3ae49af5b0cfcf01c43ae5f925e8e91f8ca7daff680e9bf063"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Commands/ScoringSpecModel.cs: FileTooLong \u2014 1037 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 537 over it, 2.07\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":"engine/src/CodeHealth.Cli/Commands/ScoringSpecModel.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"66b42a92c4bb9c9e00fb997e6758c536c2e697030ee92f813cd4cc33ecc3990d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Frontend/FrontendDependencyHygiene.cs: FileTooLong \u2014 1026 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 526 over it, 2.05\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":"engine/src/CodeHealth.Core/Frontend/FrontendDependencyHygiene.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"632fce732868b91d66ae2ac17e6793c383cd43b666fd7c5796cc9734eb4450be"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SwiftDomainConventions: TooManyMethods \u2014 416 significant lines (blank, comment-only and punctuation-only lines excluded), 61 methods. The bar is 30 methods; this is 31 over it, 2.03\u00D7 the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/SwiftDomainConventions.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b10b184bc4e8f9983c3bf1e1841e789269be3f2d31b8578335d2fd11d227e61"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Testing/RoslynTestQualityCollector.cs: FileTooLong \u2014 1011 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 511 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":"engine/src/CodeHealth.Core/Testing/RoslynTestQualityCollector.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c75254ae5cb1fb27569b8d9c6db8ce22bca92c60125fe7b88eed118dd66ed5b3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ExplicitDebtAnalyzer.RunAsync: MethodTooLong \u2014 RunAsync runs 202 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 102 over it, 2.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":"engine/src/CodeHealth.Dimensions.ExplicitDebt/ExplicitDebtAnalyzer.cs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"daba70197d4d97101ece1a20b9c0437b4f81c67bd79fc372d156ed4ef4c980b6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: KnowledgeFreshnessAnalyzer.RunAsync: MethodTooLong \u2014 RunAsync runs 198 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 98 over it, 1.98\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.GitMining/KnowledgeFreshnessAnalyzer.cs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"7adf85c97580178531197c9bf9435d6fdb9b7aa9a68a17502274199e4e4393f2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RoslynDuplicationDetector: TooManyMethods \u2014 1198 significant lines (blank, comment-only and punctuation-only lines excluded), 59 methods. The bar is 30 methods; this is 29 over it, 1.97\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/CodeShape/RoslynDuplicationDetector.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d313f03892bbd49d4242a6770695d0e78b0208cdb7c61da919d6def1ecb5582"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Scanner: TooManyMethods \u2014 696 significant lines (blank, comment-only and punctuation-only lines excluded), 58 methods, declared across 2 files: Frontend/JsLexer.cs (38), Frontend/JsLexer.Jsx.cs (20). The bar is 30 methods; this is 28 over it, 1.93\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":"engine/src/CodeHealth.Core/Frontend/JsLexer.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"50c8512213d07e0474746ef2197b58bb98e9cf017be466f89061ca6ea66feca2"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: FrontendEngineDimensions: ClassTooLong \u2014 770 significant lines (blank, comment-only and punctuation-only lines excluded), 29 methods. The bar is 400 significant lines; this is 370 over it, 1.93\u00D7 the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/FrontendEngineDimensions.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c879a91b2af2beb44ff479ab72c72c21d73033bfca42342846beeccdfd4a318"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DartDomainConventions: TooManyMethods \u2014 368 significant lines (blank, comment-only and punctuation-only lines excluded), 57 methods. The bar is 30 methods; this is 27 over it, 1.90\u00D7 the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/DartDomainConventions.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8f7891fa6770a0c3647f4d6461d3adef23a35291e0bfaf531ff8aab4cdb9218"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LogicDefectAnalyzer.AnalyzeAsync: MethodTooLong \u2014 AnalyzeAsync runs 188 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 88 over it, 1.88\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/LogicDefectAnalyzer.cs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b284eba6480212b1c1cd8bb1ca96a0dc4f92bfef72faa575ea2c2bb3dfb1df6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ReportViewModelFactory.Build: MethodTooLong \u2014 Build runs 188 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 88 over it, 1.88\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Reporting/Templates/ReportViewModelFactory.cs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"92605ff51f3e4a11b44082cdf0415c66d00d0ade2d0e2c4f8c98614ac4dabfa7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: elixir-frontend/main.exs: FileTooLong \u2014 933 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 84 functions. The bar is 500 significant lines; this is 433 over it, 1.87\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":"engine/sidecars/elixir-frontend/main.exs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f15664b06bed4765b1621e831d2bea7297d70b44aa2d267971f2eb472d506440"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SolutionShapeAnalyzer.BuildFindings: MethodTooLong \u2014 BuildFindings runs 186 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 86 over it, 1.86\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":"engine/src/CodeHealth.Dimensions.CodeQuality/SolutionShape/SolutionShapeAnalyzer.cs"},"region":{"startLine":823}}}],"partialFingerprints":{"codehealthFindingId/v1":"e86d44ecdf4add5acce688dc68feeda4e413eb712a92a48f8462362972a1c56d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ModelAware/ArchitectureModelAnalyzer.cs: FileTooLong \u2014 918 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 418 over it, 1.84\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":"engine/src/CodeHealth.Core/ModelAware/ArchitectureModelAnalyzer.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4eec7cb3da612cf6edc4c414dce868fa647715de2cbeeb6fc4915e575505e7f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: EventDrivenAnalyzer: TooManyMethods \u2014 1146 significant lines (blank, comment-only and punctuation-only lines excluded), 55 methods. The bar is 30 methods; this is 25 over it, 1.83\u00D7 the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8991396d3909fb637f285ec9d3e073e6236cbd90d589265d0c6f3d5dd23ea756"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: StaticAnalysisAnalyzer.RunAsync: MethodTooLong \u2014 RunAsync runs 182 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 82 over it, 1.82\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/StaticAnalysisAnalyzer.cs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e6820cccc00452ef0ed50e6026b8d0a4ac150c55772aebe489e11aa638416db"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SecretsHistoryAnalyzer: TooManyMethods \u2014 873 significant lines (blank, comment-only and punctuation-only lines excluded), 54 methods. The bar is 30 methods; this is 24 over it, 1.80\u00D7 the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/SecretsHistoryAnalyzer.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e41df47848ef8ac788d9c6087734caa780575869d3320672148b0848f4ee025b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DuplicationAnalyzer.RunAsync: MethodTooLong \u2014 RunAsync runs 180 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 80 over it, 1.80\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":"engine/src/CodeHealth.Dimensions.CodeQuality/CodeShape/DuplicationAnalyzer.cs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c3b62a46acdab3c9f325319e8e37d71bd212189aa9957795721e03b5893b0d1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NodeTestReliabilityCollector.CollectAsync: MethodTooLong \u2014 CollectAsync runs 178 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 78 over it, 1.78\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Testing/NodeTestReliabilityCollector.cs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeb76f13edfbbdd5778132aa06173a1396a69d2c42e0ca6047ed2de9b3ea6bd1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Frontend/FrontendDeadCode.cs: FileTooLong \u2014 884 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 384 over it, 1.77\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":"engine/src/CodeHealth.Core/Frontend/FrontendDeadCode.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"91f785fcb27cbe4b272b1492a3f6d8ba2bdea0835fd72f9be95a115f86902e23"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: CodeHealth.Dimensions.Security/SecretsHistoryAnalyzer.cs: FileTooLong \u2014 884 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 384 over it, 1.77\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":"engine/src/CodeHealth.Dimensions.Security/SecretsHistoryAnalyzer.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"80ee030894ff4f47c7a8b6e7cc5b901c9f8dea3eba30d5b5781d56de33858261"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ArchitectureModelAnalyzer: TooManyMethods \u2014 904 significant lines (blank, comment-only and punctuation-only lines excluded), 53 methods. The bar is 30 methods; this is 23 over it, 1.77\u00D7 the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/ArchitectureModelAnalyzer.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"daf3dae9fc448c4135bfcb9d4774db6fe0c1aa9331955c843b83c8a3a595b4a3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Frontend/ModuleSyntaxScanner.cs: FileTooLong \u2014 861 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 361 over it, 1.72\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":"engine/src/CodeHealth.Core/Frontend/ModuleSyntaxScanner.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eaa00dd15d18f48174a15a4a41f169dc7989374139de4f20ee26091fa9ea528"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AccessibilityAnalyzer.Analyze: MethodTooLong \u2014 Analyze runs 171 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 71 over it, 1.71\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"a44ea21bc8fed7a47eb6ca4390068040b1a39ee30d606ae5a4cb8ec6b206a982"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: FrontendBoundaries: TooManyMethods \u2014 826 significant lines (blank, comment-only and punctuation-only lines excluded), 51 methods. The bar is 30 methods; this is 21 over it, 1.70\u00D7 the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/FrontendBoundaries.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"710356d6162c45e5942571ff431924e12abdd2fe42e5cad97339d05610df94fa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Frontend/FrontendBoundaries.cs: FileTooLong \u2014 844 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 344 over it, 1.69\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/FrontendBoundaries.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"130f968350ebaf9cf951916e1f35842c4b4d35b130bb2e7d8d7ebd314e6232ca"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FrontendEngineDimensions.CloneRemediation: MethodTooLong \u2014 CloneRemediation runs 168 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 68 over it, 1.68\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":"engine/src/CodeHealth.Core/Frontend/FrontendEngineDimensions.cs"},"region":{"startLine":1477}}}],"partialFingerprints":{"codehealthFindingId/v1":"0df2fe57685eaf627861b1631661436f7288668b1133daed02bdc3c89ddbeff8"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: EventSourcingAnalyzer: ClassTooLong \u2014 662 significant lines (blank, comment-only and punctuation-only lines excluded), 27 methods. The bar is 400 significant lines; this is 262 over it, 1.66\u00D7 the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/EventSourcingAnalyzer.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"530ebbe5b87b66e1816a920ef7125bb957bb8abcbf6e3a6ff2458769e0106ae8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Scanners/DeclaredDependencies.cs: FileTooLong \u2014 827 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 327 over it, 1.65\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/DeclaredDependencies.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"12d2eb35c8f582ec0422cf2d5f3ddcef194e2864e83216118494ae6ab43bcee8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: NativeSecretScanner: TooManyMethods \u2014 685 significant lines (blank, comment-only and punctuation-only lines excluded), 49 methods. The bar is 30 methods; this is 19 over it, 1.63\u00D7 the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Security/NativeSecretScanner.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9eb5684f5dc3c1982b2e3a82c09a3bdfc9534eb743fd7b595aad4dea0a46901"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Commands/JvmSidecar.cs: FileTooLong \u2014 815 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 315 over it, 1.63\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":"engine/src/CodeHealth.Cli/Commands/JvmSidecar.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1601f0298d5f5c12dc216af1e829c3bccccd659f6b8046e5202161ee2d99611"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FrontendModuleGraph.Build: MethodTooLong \u2014 Build runs 163 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 63 over it, 1.63\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/FrontendModuleGraph.cs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2ce579792f83fb5e0901f66c7bd35ee6ba07ed8b54f2f7ebbde864e5e0d1c03"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ExplicitDebtAnalyzer: ClassTooLong \u2014 645 significant lines (blank, comment-only and punctuation-only lines excluded), 20 methods. The bar is 400 significant lines; this is 245 over it, 1.61\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.ExplicitDebt/ExplicitDebtAnalyzer.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"68c5a2fafdb11e776e687cf3f4d725d4156ff02c25e0fb87cc74f5a730e8b469"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FrontendTestReachability.Analyze: MethodTooLong \u2014 Analyze runs 160 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 60 over it, 1.60\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/FrontendTestReachability.cs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"db3eac614adcba66f50fe1a60f1d7ce1c9645ea865773124a0a289126b532152"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EventDrivenAnalyzer.OutboxDualWrite: MethodTooLong \u2014 OutboxDualWrite runs 157 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 57 over it, 1.57\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs"},"region":{"startLine":1680}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c766d75026de249cd74f79f2f13049db17232068df95ccf4f4488d59edbecd7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RubyDomainConventions: TooManyMethods \u2014 301 significant lines (blank, comment-only and punctuation-only lines excluded), 47 methods. The bar is 30 methods; this is 17 over it, 1.57\u00D7 the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/RubyDomainConventions.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7515174142b05f5636cbc1fa29c12b66177d5c07706eec30ec859e7c4053fb3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Emitter: TooManyMethods \u2014 47 methods. The bar is 30 methods; this is 17 over it, 1.57\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":"engine/sidecars/kotlin-frontend/src/main/kotlin/dev/canine/codehealth/kotlin/Emitter.kt"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"39ad33b366683d9ca58c87d941ac641c8e0dcbaa5ec850f9fb3c18ff1ea941b9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Emitter: TooManyMethods \u2014 47 methods. The bar is 30 methods; this is 17 over it, 1.57\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":"engine/sidecars/scala-frontend/src/main/scala/dev/canine/codehealth/scala/Emitter.scala"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"f358da6dc5dc43b7b04c6961b6e8c5220dbfb5564ee6ca26fe7221e37c249421"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Frontend/FrontendEngineDimensions.cs: FileTooLong \u2014 783 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 283 over it, 1.57\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":"engine/src/CodeHealth.Core/Frontend/FrontendEngineDimensions.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"73b33dbc9446aa41bc8d6ea43939ef311ddd234a83db924303b62c003d1b60a8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AccessibilityAnalyzer.AssessEnforcement: MethodTooLong \u2014 AssessEnforcement runs 156 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 56 over it, 1.56\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":"engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs"},"region":{"startLine":6348}}}],"partialFingerprints":{"codehealthFindingId/v1":"d99c35f5696a36e26d7db67efca0d5f8cfa7d70b27f906435556750df8f0d802"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ScalaDomainConventions: TooManyMethods \u2014 302 significant lines (blank, comment-only and punctuation-only lines excluded), 46 methods. The bar is 30 methods; this is 16 over it, 1.53\u00D7 the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/ScalaDomainConventions.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a6febd058225151255b4eaa4e2575d252942ebd99d6731231a722c6adb96bcc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Frontend/FrontendTestReachability.cs: FileTooLong \u2014 765 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 265 over it, 1.53\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/FrontendTestReachability.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8ad7a53a4de75beff4c8e880c3c924eed9afb2c7712f84cbb4b31b9d93a3c7d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MemberFamilyRollup.Collapse: MethodTooLong \u2014 Collapse runs 153 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 53 over it, 1.53\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/CodeShape/MemberFamilyRollup.cs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"1142340c062849c4490b74731923860381b9c9d47a14be24f293a7a4ead87451"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ChangeCouplingAnalyzer.RunAsync: MethodTooLong \u2014 RunAsync runs 152 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 52 over it, 1.52\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.GitMining/ChangeCouplingAnalyzer.cs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3fd7eb235ff333ca785fc2b5ac2fc717cd97a71d976a535e17e02f25b125e94"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SecretsHistoryAnalyzer.GateCorpusAndDocumentedExampleFindings: MethodTooLong \u2014 GateCorpusAndDocumentedExampleFindings runs 152 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 52 over it, 1.52\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/SecretsHistoryAnalyzer.cs"},"region":{"startLine":897}}}],"partialFingerprints":{"codehealthFindingId/v1":"04fd5c233f9ba8ce22cc710f0b04fc8605162655942c87effe5cbe10634b2fe7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: JvmSidecar: TooManyMethods \u2014 810 significant lines (blank, comment-only and punctuation-only lines excluded), 45 methods. The bar is 30 methods; this is 15 over it, 1.50\u00D7 the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Cli/Commands/JvmSidecar.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba3b0a4b09de6116852b538833256f44c927ed7a64d996d72dd5d59aedb12183"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: NeutralGodClassScanner: TooManyMethods \u2014 306 significant lines (blank, comment-only and punctuation-only lines excluded), 45 methods. The bar is 30 methods; this is 15 over it, 1.50\u00D7 the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/CodeShape/NeutralGodClassScanner.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa241c28e8a5aba7e8e062260c28b1b93c21d0364c23f7c3b6058ab623268080"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MutationIdempotencyAnalyzer: TooManyMethods \u2014 538 significant lines (blank, comment-only and punctuation-only lines excluded), 44 methods. The bar is 30 methods; this is 14 over it, 1.47\u00D7 the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/MutationIdempotencyAnalyzer.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b1c47f4354062ac7b8ffb31e3e176c8762dce26cfc9d4448b2b9b7f3e6da664"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CiWorkflowReader: TooManyMethods \u2014 437 significant lines (blank, comment-only and punctuation-only lines excluded), 44 methods. The bar is 30 methods; this is 14 over it, 1.47\u00D7 the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Readiness/CiWorkflowReader.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a46f95ad20d986cb49a89c5afe9aa13ce8ebe09f6a885c502579e3a3e609de1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ProductionReadinessAnalyzer.SecurityAndPerf: MethodTooLong \u2014 SecurityAndPerf runs 144 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 44 over it, 1.44\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs"},"region":{"startLine":4675}}}],"partialFingerprints":{"codehealthFindingId/v1":"f91e0d77bb331420e077284a51bb3491f5d93d96757b6fe40a46e3b1da8b9092"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: JsDuplicationDetector.TryMergeNearCloneSegment: MethodTooLong \u2014 TryMergeNearCloneSegment runs 143 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 43 over it, 1.43\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs"},"region":{"startLine":4204}}}],"partialFingerprints":{"codehealthFindingId/v1":"2469f6ea4d0ec3dc3acc047dd8d34885d2da98bf88eac495650a387e232bed8d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SolutionShapeAnalyzer: ClassTooLong \u2014 569 significant lines (blank, comment-only and punctuation-only lines excluded), 14 methods. The bar is 400 significant lines; this is 169 over it, 1.42\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":"engine/src/CodeHealth.Dimensions.CodeQuality/SolutionShape/SolutionShapeAnalyzer.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e71cfedcd609bedb676190464f8b1d723b4a0e1da2045ce7d3b4a7d81ee1e5d9"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CommittedCoverageReader: ClassTooLong \u2014 560 significant lines (blank, comment-only and punctuation-only lines excluded), 23 methods. The bar is 400 significant lines; this is 160 over it, 1.40\u00D7 the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Testing/CommittedCoverageReader.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1077ed0c64b1e73c332bb54829feb7ce421a638a0faa54c6c3725470b6c04c4e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Security/NativeSecretScanner.cs: FileTooLong \u2014 690 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 190 over it, 1.38\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Security/NativeSecretScanner.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8357f0bf9aab705f73fecfc064d1860efa26914b584497a63995125c5ebdd899"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ModelAware/DomainConventions.cs: FileTooLong \u2014 688 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 188 over it, 1.38\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/DomainConventions.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d415bc89289039c3c273374e1e0b3e3f645b64dac601ae805953795d87989939"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ModuleSyntaxScanner: TooManyMethods \u2014 860 significant lines (blank, comment-only and punctuation-only lines excluded), 41 methods. The bar is 30 methods; this is 11 over it, 1.37\u00D7 the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/ModuleSyntaxScanner.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5ffe4fa40022ced8021574d19ae9447baa3d0019ea5cdda159f396108b4e114"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MarkupParser: TooManyMethods \u2014 580 significant lines (blank, comment-only and punctuation-only lines excluded), 41 methods. The bar is 30 methods; this is 11 over it, 1.37\u00D7 the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Markup/MarkupParser.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bf0e39b5c864f4086deeb947bba0235448778cc604c17f4b8a691e58ae8f44e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DeepScan: TooManyMethods \u2014 572 significant lines (blank, comment-only and punctuation-only lines excluded), 41 methods. The bar is 30 methods; this is 11 over it, 1.37\u00D7 the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/DeepScan.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5f441c9243280668b980f752c2e02eab00bbd8725fa2753248d46c1e836a530"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: train/dimension-routing.py: FileTooLong \u2014 681 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 181 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":"tools/train/dimension-routing.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"79c9d7e2d0e1d068b58127d1c95409ae8df2610b922692651097bb4100086d5b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Scanners/SqlBuilderCompositionWalk.cs: FileTooLong \u2014 677 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 177 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/SqlBuilderCompositionWalk.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7222d9bcbf5e41f0f97689a03d486df686db3c8ac626519fceffecba38ec78cb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ProductionReadinessAnalyzer.ObservabilityAsync: MethodTooLong \u2014 ObservabilityAsync runs 135 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 35 over it, 1.35\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs"},"region":{"startLine":4266}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2c685e56443126615f6078193929bd280a27849d4c0bb96378c0cafc21d3aeb"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: JsFunctionScanner: ClassTooLong \u2014 539 significant lines (blank, comment-only and punctuation-only lines excluded), 25 methods. The bar is 400 significant lines; this is 139 over it, 1.35\u00D7 the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/JsFunctionScanner.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff8b6f3e4b09647ea517f2af654a4459e020dc5fdf3cd177c883104fe270e949"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ModelAware/EventSourcingAnalyzer.cs: FileTooLong \u2014 671 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 171 over it, 1.34\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":"engine/src/CodeHealth.Core/ModelAware/EventSourcingAnalyzer.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"32c6bd22f8e5cde111075347a306050b0c6a73602bcb0c06ad2c55b973805a05"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ModuleResolver: TooManyMethods \u2014 532 significant lines (blank, comment-only and punctuation-only lines excluded), 40 methods. The bar is 30 methods; this is 10 over it, 1.33\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":"engine/src/CodeHealth.Core/Frontend/ModuleResolver.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c455de8020a5ca2a2b19407d5c7de5cc2011997ab0bcd92c63d11e8750e2482"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ChangeSetBuilder: TooManyMethods \u2014 503 significant lines (blank, comment-only and punctuation-only lines excluded), 40 methods. The bar is 30 methods; this is 10 over it, 1.33\u00D7 the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Reporting/Changelog/Fusion/ChangeSetBuilder.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eddb6942568d3ba49e0e9553a5dad6f04bd7f94eb11ed9accb6166d1259494f5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ScanParsers.DependencyDetail: MethodTooLong \u2014 DependencyDetail runs 132 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 32 over it, 1.32\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/ScanParsers.cs"},"region":{"startLine":2102}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f371a72d007ac90c3905ca61b6e9bbe5bf42a9e34731fd2fbc647886e9dca74"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: CodeHealth.Dimensions.ExplicitDebt/ExplicitDebtAnalyzer.cs: FileTooLong \u2014 652 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 152 over it, 1.30\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":"engine/src/CodeHealth.Dimensions.ExplicitDebt/ExplicitDebtAnalyzer.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3577bf6d6f6e780c14aa8d748f67456884f30191fa65e659633296eeb2424ff"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: UpstreamAttribution: TooManyMethods \u2014 517 significant lines (blank, comment-only and punctuation-only lines excluded), 39 methods. The bar is 30 methods; this is 9 over it, 1.30\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/FileQuality/UpstreamAttribution.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f02c197f28a60e2b33cad94672bf2bfe972de2d53587fd2f38cee9f83b07228e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: NodeTestSuiteCoverageCollector: TooManyMethods \u2014 370 significant lines (blank, comment-only and punctuation-only lines excluded), 39 methods. The bar is 30 methods; this is 9 over it, 1.30\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Testing/NodeTestSuiteCoverageCollector.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cae6aedd9c7bd843d1c37243cf42aa4672f1297e9fed0a86c00ad0262e704afe"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: train/judge-calibration.py: FileTooLong \u2014 646 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 146 over it, 1.29\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":"tools/train/judge-calibration.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d0444a98e8554564719cc2ba630133a9fa95461e8dcdb9bf9ff7832410ce35c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AccessibilityAnalyzer.KeyboardSemantics: MethodTooLong \u2014 KeyboardSemantics runs 129 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 29 over it, 1.29\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs"},"region":{"startLine":3353}}}],"partialFingerprints":{"codehealthFindingId/v1":"b74d6cec7524165e29fef76c31239ebfaac139de41decd347798ee1c6b39c5cc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InfrastructureSecurityAnalyzer.RunAsync: MethodTooLong \u2014 RunAsync runs 129 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 29 over it, 1.29\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/InfrastructureSecurityAnalyzer.cs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"65ee866318a4aa075403cc0d07a81659e5d8df9fb9d44daf1c249a2fd37a4732"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MaturityAnalyzer.FolderStructure: MethodTooLong \u2014 FolderStructure runs 127 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 27 over it, 1.27\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Maturity/MaturityAnalyzer.cs"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"f467ff56723c560b0c0ba02d1440069a409f885e51de8eabd20ef77d5af509ce"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GodClassAnalyzer.RunAsync: MethodTooLong \u2014 RunAsync runs 125 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 25 over it, 1.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.CodeQuality/CodeShape/GodClassAnalyzer.cs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"a94efb49fb194fdd6c6fe85e0e81e769f90f6241103d9d0d47771d5eced659a6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ModelAware/MutationIdempotencyAnalyzer.cs: FileTooLong \u2014 618 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 118 over it, 1.24\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/MutationIdempotencyAnalyzer.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec16da04ef1352dbf88112050fe7353107955bfe54db5264e48d33bd23d57da4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AdrDetector: TooManyMethods \u2014 449 significant lines (blank, comment-only and punctuation-only lines excluded), 37 methods. The bar is 30 methods; this is 7 over it, 1.23\u00D7 the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Docs/AdrDetector.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b41afdcaa7cc624436cb9034bb049afa33681e85fe571eeb82c930f68ea349f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: JavaDomainConventions: TooManyMethods \u2014 241 significant lines (blank, comment-only and punctuation-only lines excluded), 37 methods. The bar is 30 methods; this is 7 over it, 1.23\u00D7 the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/JavaDomainConventions.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"95ff6b82859c50b7f277bfa48a41fe883eae65643cb35a7f94d304413e6cf01e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: FrontendBundlerConfigRefs: ClassTooLong \u2014 493 significant lines (blank, comment-only and punctuation-only lines excluded), 27 methods. The bar is 400 significant lines; this is 93 over it, 1.23\u00D7 the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/FrontendBundlerConfigRefs.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"48365df184f99920d19e88590cd2f67dc402e690254ddf4cbb2e47e414f0f7bd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FrontendWorkspaceLoader.Load: MethodTooLong \u2014 Load runs 122 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/FrontendWorkspaceLoader.cs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3eadda9f128c3f885486a28d620479bb853d9ecff4d8d6b761bdf2171cb645c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: train/programme-status.py: FileTooLong \u2014 606 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 106 over it, 1.21\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":"tools/train/programme-status.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"70bfe432ac237dec6f3a50470a3e663de4b735b1893b503faf20b8e85e4b4a54"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: LineBasedGodClassDetector: TooManyMethods \u2014 497 significant lines (blank, comment-only and punctuation-only lines excluded), 36 methods. The bar is 30 methods; this is 6 over it, 1.20\u00D7 the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/CodeShape/LineBasedGodClassDetector.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"28d4f54b41bcc49125333accc614b0c1346ff78f691168246589898187842214"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ComplexityScoring.BuildResult: MethodTooLong \u2014 BuildResult runs 120 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 20 over it, 1.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.CodeQuality/Complexity/ComplexityScoring.cs"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ac75d04b165945b6adc43db3f6e23285b7a82727ae6e60be49381f7bb3b3ed1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Model.emit_type: MethodTooLong \u2014 emit_type 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":"engine/sidecars/rust-frontend/src/main.rs"},"region":{"startLine":1296}}}],"partialFingerprints":{"codehealthFindingId/v1":"c33b90a32644d2cf37aed025240ccb649224805299b45ab69b22567f282111e4"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DockerfileShapeRuleFilter: ClassTooLong \u2014 475 significant lines (blank, comment-only and punctuation-only lines excluded), 24 methods. The bar is 400 significant lines; this is 75 over it, 1.19\u00D7 the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/DockerfileShapeRuleFilter.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7284569c7c2a32564339b6d39f7b8d6a59cead569b9ea3e666b2e68a58fe9367"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Scanners/DeepScan.cs: FileTooLong \u2014 591 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 91 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/DeepScan.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9100c24c4abfadc348f65bbe687cda7942ffa8fae369c2f5c5b4908c91c509f4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SourceClassifier.EcosystemMarkerVerdict: MethodTooLong \u2014 EcosystemMarkerVerdict runs 118 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Classification/SourceClassifier.cs"},"region":{"startLine":3231}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c0cb1d2a83a751ae7ab7011be6ffe511a52c777a436a2fb899f41d18e3421ff"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: JsDuplicationDetector.Detect: MethodTooLong \u2014 Detect runs 118 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs"},"region":{"startLine":2405}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fc2bd712a7e31f1bfeb73f4aae8f8f44c752526257350e5b79a4672b7991377"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AccessibilityAnalyzer.FormsAndLabels: MethodTooLong \u2014 FormsAndLabels runs 118 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs"},"region":{"startLine":2246}}}],"partialFingerprints":{"codehealthFindingId/v1":"f888cc4af0599041d6b4270501d0a8d1eb61140fbf29159f5bbfdc6cd7b044ff"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Markup/MarkupParser.cs: FileTooLong \u2014 585 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 85 over it, 1.17\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":"engine/src/CodeHealth.Core/Markup/MarkupParser.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1d868952816d81d7cd9244fbd3baa4de65c2cb927833351e722c2c9c60b3792"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PythonDomainConventions: TooManyMethods \u2014 230 significant lines (blank, comment-only and punctuation-only lines excluded), 35 methods. The bar is 30 methods; this is 5 over it, 1.17\u00D7 the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/PythonDomainConventions.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"31556a66c3788f9839d1678ee7b5f019aab06b6b43d8068a6b0655652eb9921c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: SolutionShape/SolutionShapeAnalyzer.cs: FileTooLong \u2014 579 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 79 over it, 1.16\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":"engine/src/CodeHealth.Dimensions.CodeQuality/SolutionShape/SolutionShapeAnalyzer.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6137c39fa535a395f6cad3eb13c472cd13c86d5453a0d51a3eb1c970d989eba3"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Emitter: ClassTooLong \u2014 462 significant lines (blank, comment-only and punctuation-only lines excluded), 34 methods. The bar is 400 significant lines; this is 62 over it, 1.16\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":"engine/sidecars/java-spoon/src/main/java/dev/canine/codehealth/java/Emitter.java"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"09deab65e757283f7277571e75a3a6bcf30b7e91c5dddeffcfbf676c38bd67d9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Scanners/UnverifiedRemoteInstallerScan.cs: FileTooLong \u2014 577 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 77 over it, 1.15\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":"engine/src/CodeHealth.Dimensions.Security/Scanners/UnverifiedRemoteInstallerScan.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9e1656a9b40a0b51a34acf14b0966fdecd7093cddba87ea119f3a4ed2d5fa4a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ArchitecturalIntegrityAnalyzer.RunAsync: MethodTooLong \u2014 RunAsync runs 114 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 14 over it, 1.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Architecture/ArchitecturalIntegrityAnalyzer.cs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"f54208c737bf2d62935686c250b3b09d4141233020ee65fb1c49f1e47424faae"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: NonProductionPaths: TooManyMethods \u2014 373 significant lines (blank, comment-only and punctuation-only lines excluded), 34 methods. The bar is 30 methods; this is 4 over it, 1.13\u00D7 the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/NonProductionPaths.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e95999465cf8c7f0ab0a8cfc7c8010755b7b736c8372b28a912c11c421426d5e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Emitter: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/java-spoon/src/main/java/dev/canine/codehealth/java/Emitter.java"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"175e8ceb216741e5e95189c8ca904eed8f364544b4e1ef29cdcf092c8e1ab384"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Testing/CommittedCoverageReader.cs: FileTooLong \u2014 566 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 66 over it, 1.13\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Testing/CommittedCoverageReader.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed40812cbadb2a53938cfc90c12531f43e1c480634b57a89dfd111fd0af2fb1d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: CodeHealth.CodeModel.FSharp/SyntaxModel.fs: FileTooLong \u2014 565 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 65 over it, 1.13\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.CodeModel.FSharp/SyntaxModel.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b22dc799f771a75e5dd2fa7de4a15672b2728122c89660a99f2d8932b6e4064b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: NeutralFileLengthScanner: TooManyMethods \u2014 476 significant lines (blank, comment-only and punctuation-only lines excluded), 33 methods. The bar is 30 methods; this is 3 over it, 1.10\u00D7 the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/CodeShape/NeutralFileLengthScanner.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d8d3eb94768888c564ad3da2b5f6d289715c3585624a28fb2ad3747447e6fc0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: FileModel: TooManyMethods \u2014 471 significant lines (blank, comment-only and punctuation-only lines excluded), 33 methods. The bar is 30 methods; this is 3 over it, 1.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/SqlBuilderCompositionWalk.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfd652d8663ead7ca17f8697419744c1b3e0d0d75e25687d622f2a1fa01a221c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: BundlerManifestHygiene: TooManyMethods \u2014 336 significant lines (blank, comment-only and punctuation-only lines excluded), 33 methods. The bar is 30 methods; this is 3 over it, 1.10\u00D7 the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Dependencies/BundlerManifestHygiene.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2521d42d02fc1a59401ab2327df80da08ce0fba117e036a98e8b0893379e371"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ShellExecRecheck: TooManyMethods \u2014 303 significant lines (blank, comment-only and punctuation-only lines excluded), 33 methods. The bar is 30 methods; this is 3 over it, 1.10\u00D7 the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/ShellExecRecheck.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f062ecdad27403121d578bb50bf138b38b56c4eeb18b7a1ee99658e1e5e5d8ce"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RepoFindings.razor \u203A __RazorCode_RepoFindings_1: TooManyMethods \u2014 33 methods. The bar is 30 methods; this is 3 over it, 1.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Kennel.Watchdog.Core/Agents/Ui/RepoFindings.razor"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5908a76eef78703efe1502c31a333909c9fe9470dcf207b3706d2490c624cff2"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DiskTestScanner: ClassTooLong \u2014 433 significant lines (blank, comment-only and punctuation-only lines excluded), 29 methods. The bar is 400 significant lines; this is 33 over it, 1.08\u00D7 the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Testing/DiskTestScanner.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2da371022fc74d1990f41c21cd06d765be400930290071a371d433e4107e3736"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: GodClassAnalyzer: ClassTooLong \u2014 432 significant lines (blank, comment-only and punctuation-only lines excluded), 22 methods. The bar is 400 significant lines; this is 32 over it, 1.08\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":"engine/src/CodeHealth.Dimensions.CodeQuality/CodeShape/GodClassAnalyzer.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e248d322a7e2c0fc133afea95e58ce67f2967041bb36ec35d25c2d3f08ede4b6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: CodeShape/LineBasedGodClassDetector.cs: FileTooLong \u2014 540 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 40 over it, 1.08\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/CodeShape/LineBasedGodClassDetector.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e533c62e86ac6efb721173c183c246e57901fa2dd1bd18ff38032b7afa5b02f6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Frontend/JsFunctionScanner.cs: FileTooLong \u2014 540 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 40 over it, 1.08\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/JsFunctionScanner.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cd16885e9fa7b7a03c7aefece513feb731f902ebaf7d58a514ddcfb65046710"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: JsDuplicationDetector.BestEditedCopy: MethodTooLong \u2014 BestEditedCopy runs 108 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs"},"region":{"startLine":5457}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a5de93488daa2d07edb6bb5b9dd2edc67f985c6687507d5bee5b49dc422f9f7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Scoring/DiskSourceFiles.cs: FileTooLong \u2014 535 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 35 over it, 1.07\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":"engine/src/CodeHealth.Core/Scoring/DiskSourceFiles.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"250800d36834afb0a389a09af04b62f801538acce585dc921a1bb104a8491b33"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GdprPersonalDataAnalyzer.AnalyzeAsync: MethodTooLong \u2014 AnalyzeAsync runs 107 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/GdprPersonalDataAnalyzer.cs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c001b42c0e075a1a140f2a58c9063d66f840cceb9692d30d89c91314589aec2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: FrontendDeadCode: TooManyMethods \u2014 688 significant lines (blank, comment-only and punctuation-only lines excluded), 32 methods. The bar is 30 methods; this is 2 over it, 1.07\u00D7 the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/FrontendDeadCode.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e94d3ab61317c288dcdae384ee9130a74971d15e769767d6241e323b23b8f969"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Frontend/ModuleResolver.cs: FileTooLong \u2014 533 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 33 over it, 1.07\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":"engine/src/CodeHealth.Core/Frontend/ModuleResolver.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"35f664da2ad9f09b34ed6d938a42c15a6f587c0b7392b85bb8b3ca477abaaa0e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Emitter: ClassTooLong \u2014 426 significant lines (blank, comment-only and punctuation-only lines excluded), 47 methods. The bar is 400 significant lines; this is 26 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/kotlin-frontend/src/main/kotlin/dev/canine/codehealth/kotlin/Emitter.kt"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f43eb4503d007b3be90928ad4401a9b199a7ba377b925801a7d86eab81be4be"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SemgrepShapeFilter: ClassTooLong \u2014 426 significant lines (blank, comment-only and punctuation-only lines excluded), 29 methods. The bar is 400 significant lines; this is 26 over it, 1.07\u00D7 the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/SemgrepShapeFilter.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bddbe676da07ee7c06d62759ce5337860d8a4352b8c6195b27eb6b0d2e51cb01"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: FrontendScriptCommandRefs: ClassTooLong \u2014 426 significant lines (blank, comment-only and punctuation-only lines excluded), 18 methods. The bar is 400 significant lines; this is 26 over it, 1.07\u00D7 the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/FrontendScriptCommandRefs.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6f4cfc4ea8e9d90eae2a967206245d2326e8e8df1aab5e312b882397195d237"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RunLimitations.BuildFailures: MethodTooLong \u2014 BuildFailures runs 106 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Reporting/Limitations/RunLimitations.cs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdcf62219adc5c28d060b5eab9da648d9427328420fbaa40d013b112cbfcf16a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Fusion/ChangeSetBuilder.cs: FileTooLong \u2014 526 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 26 over it, 1.05\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":"engine/src/CodeHealth.Reporting/Changelog/Fusion/ChangeSetBuilder.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"176a350a0de23e5cb69134f66bdcc18fae38029789292e3d5cd6f02ec1ac1c42"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FrontendEngineDimensions.DeadCodeDimension: MethodTooLong \u2014 DeadCodeDimension runs 105 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/FrontendEngineDimensions.cs"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"6451ad84af77d393c1d09300043d7a41fdaef85ef493b5c76cebd16df5146a46"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: UpstreamAttribution.ForRepo: MethodTooLong \u2014 ForRepo runs 104 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/FileQuality/UpstreamAttribution.cs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b3e2ce6b57f0b7563181a28ddff78e20bbd20d09db10fc7c2a762e7c7850713"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ProductionReadinessAnalyzer.DisasterRecovery: MethodTooLong \u2014 DisasterRecovery runs 104 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs"},"region":{"startLine":1889}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfa6c19354019d132c754084c079db4e3874e9c36a351f346e515537087045ec"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: FileQuality/UpstreamAttribution.cs: FileTooLong \u2014 519 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 19 over it, 1.04\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/FileQuality/UpstreamAttribution.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"417af9648d63b1bee3947f8a15064b070b62cc3b091278f3111ba053a1d52310"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: FrontendTestReachability: TooManyMethods \u2014 751 significant lines (blank, comment-only and punctuation-only lines excluded), 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/FrontendTestReachability.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f09ae6c69bb0b0bc19b5a8a003459a1b207f03268b4c2f6037158f1c93ecf01f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: UnverifiedRemoteInstallerScan: TooManyMethods \u2014 570 significant lines (blank, comment-only and punctuation-only lines excluded), 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/UnverifiedRemoteInstallerScan.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"76004f7e3c2887c35c6dccb7cd5bd64210cd9d36b977471b89456868da074a4c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DiskSourceFiles: TooManyMethods \u2014 524 significant lines (blank, comment-only and punctuation-only lines excluded), 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Scoring/DiskSourceFiles.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"13cedcbf8856965b9b4a8fba5f4a8f8fd8a6caab4aa5ec55737b7eceb60a4712"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SymbolHelpers: TooManyMethods \u2014 287 significant lines (blank, comment-only and punctuation-only lines excluded), 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/SymbolHelpers.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3ab2f102b8a17174c9bd0037fc4717e668b15ddc8f1feef59a40d3f5ac7c4c6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PhpDomainConventions: TooManyMethods \u2014 224 significant lines (blank, comment-only and punctuation-only lines excluded), 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/PhpDomainConventions.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"371a58fe38b6fb6370350ec3205c9c46ef908c78a6c7a788e2d3f4ea774d7509"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AppKindDetector.DetectAsync: MethodTooLong \u2014 DetectAsync runs 103 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/AppKindDetector.cs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"c02e3f9e95e6a7459a98cd3891e970c2ae887517b3dc6b518d9c61430cc8d8a3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ArchitectureModelAnalyzer.SliceCohesion: MethodTooLong \u2014 SliceCohesion runs 103 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/ArchitectureModelAnalyzer.cs"},"region":{"startLine":2008}}}],"partialFingerprints":{"codehealthFindingId/v1":"84e4cc01b388b45c1d8e0b7f53c385b706704ed7c70d1a2945037a1c0ee2f6c7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RepoFindings.razor \u203A OnInitializedAsync: MethodTooLong \u2014 OnInitializedAsync runs 103 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Kennel.Watchdog.Core/Agents/Ui/RepoFindings.razor"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f86fe5fa185b2cdeb3924356652c2824e02e4231794f955b93211cfa5b4ca00"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: FrontendTestAndDocRefs: ClassTooLong \u2014 410 significant lines (blank, comment-only and punctuation-only lines excluded), 23 methods. The bar is 400 significant lines; this is 10 over it, 1.03\u00D7 the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/FrontendTestAndDocRefs.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d92c7942217192d7e68097c80fbfa1f34688ec20c7ac961f3b69eea3164274ba"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ComplianceSecurityAnalyzer.ScanSubstring: MethodTooLong \u2014 ScanSubstring runs 102 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cffb37146293a972172433fd967b5746c9f45615dc83276736cc251eab7547d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ProductionReadinessAnalyzer.ReleaseHygiene: MethodTooLong \u2014 ReleaseHygiene runs 102 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs"},"region":{"startLine":2546}}}],"partialFingerprints":{"codehealthFindingId/v1":"0caf9fc19bfc9165a6adeb08a6d150f4ef12686189f9ab3d5815fa2656b2d724"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ChangeCouplingAnalyzer.BuildCoupledPairs: MethodTooLong \u2014 BuildCoupledPairs runs 102 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.GitMining/ChangeCouplingAnalyzer.cs"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2d3b304722b3d5741026f61251b264a8e7ca5691ac421976134668474748f49"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ArchGraphSvg.RenderClustered: MethodTooLong \u2014 RenderClustered runs 102 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Reporting/Svg/ArchGraphSvg.cs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b482aed8ee6d912e611bdaa812fea424a600f6b96b18c96f4a356cc2b06f6d6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: java/Emitter.java: FileTooLong \u2014 509 significant lines (blank, comment-only and punctuation-only lines excluded), about 91% of them inside a single declaration: Emitter (52-856). The bar is 500 significant lines; this is 9 over it, 1.02\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/java-spoon/src/main/java/dev/canine/codehealth/java/Emitter.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba1a088295d29dc674053b5008aa6e9dc708e3a102d510e149ff4f456de5d4f9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ModelAware/RustDomainConventions.cs: FileTooLong \u2014 505 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 5 over it, 1.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":"engine/src/CodeHealth.Core/ModelAware/RustDomainConventions.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"484927f6db57f1dd5ed10efd06f581c7787e8647e36ed7faf9d42d460f03350b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: JvmCodeType.SetGraph: MethodTooLong \u2014 SetGraph runs 101 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.CodeModel.Jvm/Model.cs"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b1c56e4ed7e05bb55684a4f7a98456d91abd0c383d6efe48703eb49c674f2bc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ModuleSyntaxScanner.Scan: MethodTooLong \u2014 Scan runs 101 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/ModuleSyntaxScanner.cs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e04510925c184e707430821117bd37a5ae95f4591315a3ac509c1563df1787f"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (114 shared lines): engine/src/CodeHealth.Core/ModelAware/HeadingLabelQualityAnalyzer.cs:26-171 | engine/src/CodeHealth.Core/ModelAware/LinkTextQualityAnalyzer.cs:26-176 \u2014 These two members are variants of one another: 114 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":"engine/src/CodeHealth.Core/ModelAware/HeadingLabelQualityAnalyzer.cs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d5777b440020f0866c666929c1e60acddf55d7d5799763c8010f6fd96fc18b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (85 shared lines): engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs:1578-1712 | engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs:4982-5170 \u2014 These two members are variants of one another: 85 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":"engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs"},"region":{"startLine":1578}}}],"partialFingerprints":{"codehealthFindingId/v1":"3985ba35a4a22d8ba223cb619c9d5c32172ea1d2eef328de1d6758689a88c1f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (51 shared lines): engine/src/CodeHealth.Core/ModelAware/DomainConventions.cs:288-373 | engine/src/CodeHealth.Core/ModelAware/DomainConventions.cs:1635-1743 \u2014 These two members are variants of one another: 51 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":"engine/src/CodeHealth.Core/ModelAware/DomainConventions.cs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ae65543daee88419e76e8ad035d5a7b149bc6672ba4f1961f54e8d41e98ea0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): engine/src/CodeHealth.Reporting/Security/SecurityWatchRenderer.cs:123-148 | engine/src/CodeHealth.Reporting/Security/SecurityWatchRenderer.cs:155-174 \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":"engine/src/CodeHealth.Reporting/Security/SecurityWatchRenderer.cs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f25a7a4b5c6696ff71980321b8ef7f78643203212b778f41904e71c15535ad8"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (10 members, 50\u002B identical tokens): engine/src/CodeHealth.Core/Compliance/HostedHttpSurfaceScan.cs:442-491 | engine/src/CodeHealth.Core/Scoring/DiskSourceFiles.cs:1489-1547 | engine/src/CodeHealth.Core/Scoring/DiskSourceFiles.cs:1559-1616 | engine/src/CodeHealth.Core/Testing/DiskTestScanner.cs:446-504 | engine/src/CodeHealth.Core/Testing/DiskTestScanner.cs:585-649 | engine/src/CodeHealth.Core/Testing/DiskTestScanner.cs:920-976 | engine/src/CodeHealth.Core/Testing/DiskTestScanner.cs:1193-1247 | engine/src/CodeHealth.Core/Testing/GoTestCensus.cs:512-545 | engine/src/CodeHealth.Core/Testing/PythonTestCensus.cs:375-417 | engine/src/CodeHealth.Core/Testing/RustTestCensus.cs:427-459 \u2014 These 10 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 10 times. The repair is at the members\u0027 grain \u2014 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. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 10 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Compliance/HostedHttpSurfaceScan.cs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"26d93a899dd7d74a12810b256ae2864763518474345df1b0559cbafd26820d38"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (9 members, 50\u002B identical tokens): engine/src/CodeHealth.Cli/Commands/AnalyzeCommand.cs:4002-4023 | engine/src/CodeHealth.Cli/Commands/AnalyzeCommand.cs:4062-4072 | engine/src/CodeHealth.Cli/Commands/AnalyzeCommand.cs:4127-4138 | engine/src/CodeHealth.Cli/Commands/AnalyzeCommand.cs:4221-4235 | engine/src/CodeHealth.Cli/Commands/AnalyzeCommand.cs:4315-4341 | engine/src/CodeHealth.Cli/Commands/AnalyzeCommand.cs:4560-4579 | engine/src/CodeHealth.Cli/Commands/AnalyzeCommand.cs:4606-4619 | engine/src/CodeHealth.Cli/Commands/AnalyzeCommand.cs:4646-4658 | engine/src/CodeHealth.Cli/Commands/AnalyzeCommand.cs:4687-4702 \u2014 These 9 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 9 times. The repair is at the members\u0027 grain \u2014 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. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 9 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Cli/Commands/AnalyzeCommand.cs"},"region":{"startLine":4002}}}],"partialFingerprints":{"codehealthFindingId/v1":"63ce9ddeb511fa35bb67a7cb8e438b48a6292d46754cb2cfb3b3b6e65e0bb131"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): engine/src/CodeHealth.Core/Dependencies/GoProxyClient.cs:193-233 | engine/src/CodeHealth.Core/Dependencies/HexRegistryClient.cs:159-199 | engine/src/CodeHealth.Core/Dependencies/OsvAdvisoryClient.cs:177-215 | engine/src/CodeHealth.Core/Dependencies/RubyGemsRegistryClient.cs:175-211 | engine/src/CodeHealth.Core/Dependencies/RubyGemsRegistryClient.cs:305-347 | engine/src/CodeHealth.Core/Dependencies/UnityRegistryClient.cs:162-205 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 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. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Dependencies/GoProxyClient.cs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"4289f57d0ad23e8bd2d7e4a56d69cc6077b7bd7dcbc6fdd8cb3e259742847ae8"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): engine/src/CodeHealth.Core/Markup/MarkupParser.cs:1456-1519 | engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.TemplateLanguageBlindness.cs:426-488 | engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs:5830-5884 | engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs:5970-6017 | engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs:6213-6272 | engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs:9916-9994 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 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. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Markup/MarkupParser.cs"},"region":{"startLine":1456}}}],"partialFingerprints":{"codehealthFindingId/v1":"26bab48c214448bb402f3928891cfac3f447d631e76892d58b371ae1da6408bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): engine/src/CodeHealth.Cli/Commands/JvmSidecar.cs:1371-1404 | engine/src/CodeHealth.Cli/Commands/JvmSidecar.cs:1436-1469 | engine/src/CodeHealth.Cli/Commands/JvmSidecar.cs:1501-1534 | engine/src/CodeHealth.Cli/Commands/JvmSidecar.cs:1554-1593 | engine/src/CodeHealth.Cli/Commands/JvmSidecar.cs:1601-1634 | engine/src/CodeHealth.Cli/Commands/JvmSidecar.cs:1847-1880 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 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. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Cli/Commands/JvmSidecar.cs"},"region":{"startLine":1371}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fd02fda35f283cf6c2b6c33b30911a5a16f481d37e2ab077eeaeaa50f3b6cc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): engine/src/CodeHealth.Dimensions.Architecture/BoundaryScopeJudge.cs:68-75 | engine/src/CodeHealth.Dimensions.Architecture/Llm/LlmApiConsistencyEvaluator.cs:79-86 | engine/src/CodeHealth.Dimensions.Architecture/Llm/LlmProjectCohesionEvaluator.cs:57-64 | engine/src/CodeHealth.Dimensions.Docs/Llm/PromptResource.cs:10-17 | engine/src/CodeHealth.Reporting/Changelog/ChangelogNarrator.cs:906-913 | engine/src/CodeHealth.Reporting/Prose/LlmReportProseGenerator.cs:253-260 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 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. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Architecture/BoundaryScopeJudge.cs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c67ff884bf80a9f4bd51dd677e5ffa24c622a367d8ff8e7ec5b5b36646c776e"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): engine/src/CodeHealth.Dimensions.Security/Scanners/BuildTimeKeyMaterialScan.cs:348-370 | engine/src/CodeHealth.Dimensions.Security/Scanners/BuildTimeKeyMaterialScan.cs:380-424 | engine/src/CodeHealth.Dimensions.Security/Scanners/MutableGitCloneScan.cs:106-155 | engine/src/CodeHealth.Dimensions.Security/Scanners/UnverifiedRemoteInstallerScan.cs:876-909 | engine/src/CodeHealth.Dimensions.Security/Scanners/UnverifiedRemoteInstallerScan.cs:1329-1370 | engine/src/CodeHealth.Dimensions.Security/Scanners/UnverifiedRemoteInstallerScan.cs:1375-1397 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 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. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/BuildTimeKeyMaterialScan.cs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"264804207e7a0c999bfdd3ae554fe5ab6b42928db2660787f879e4acc9cb6a9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): engine/src/CodeHealth.Dimensions.Security/Scanners/ComposeRuntimeSocketMountScan.cs:195-244 | engine/src/CodeHealth.Dimensions.Security/Scanners/ComposeServiceSurface.cs:300-349 | engine/src/CodeHealth.Dimensions.Security/Scanners/DockerfileSyntax.cs:619-668 | engine/src/CodeHealth.Dimensions.Security/Scanners/NamelessWorkloadPrivilegedScan.cs:258-313 | engine/src/CodeHealth.Dimensions.Security/Scanners/RubySourceFiles.cs:33-83 | engine/src/CodeHealth.Dimensions.Security/Scanners/WranglerPlaintextVarScan.cs:395-444 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 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. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/ComposeRuntimeSocketMountScan.cs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"2186c0496be1317186ea4212ba4fc78a649260a292aa73f558e0c0793f27b2fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): engine/src/CodeHealth.Dimensions.Security/Scanners/PowerShellFetchExecScriptRecheck.cs:39-69 | engine/src/CodeHealth.Dimensions.Security/Scanners/RecursiveOwnershipRootRecheck.cs:84-113 | engine/src/CodeHealth.Dimensions.Security/Scanners/ShellCommandPrefixRecheck.cs:95-125 | engine/src/CodeHealth.Dimensions.Security/Scanners/UnverifiedAppVeyorInstallerRecheck.cs:138-167 | engine/src/CodeHealth.Dimensions.Security/Scanners/UnverifiedPowerShellInstallerRecheck.cs:93-122 | engine/src/CodeHealth.Dimensions.Security/Scanners/UnverifiedShellInstallerRecheck.cs:90-119 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 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. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/PowerShellFetchExecScriptRecheck.cs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9e4e14ceb76bfc77eaca57a21b8cbb2c502e750175ae50cbcdbd12ff0bd8f91"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): engine/src/CodeHealth.Dimensions.Dependencies/DependencyHygieneAnalyzer.cs:1741-1824 | engine/src/CodeHealth.Dimensions.Dependencies/DependencyHygieneAnalyzer.cs:1875-1929 | engine/src/CodeHealth.Dimensions.Dependencies/DependencyHygieneAnalyzer.cs:1950-2019 | engine/src/CodeHealth.Dimensions.Dependencies/DependencyHygieneAnalyzer.cs:2026-2095 | engine/src/CodeHealth.Dimensions.Dependencies/DependencyHygieneAnalyzer.cs:2257-2328 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 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. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Dependencies/DependencyHygieneAnalyzer.cs"},"region":{"startLine":1741}}}],"partialFingerprints":{"codehealthFindingId/v1":"7daab1f979307acd6fc9c3a959916cb9cc21358d596e7005b4686910e5f82acb"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): engine/src/CodeHealth.Core/CodeModel/Roslyn/RoslynMethodBody.cs:260-297 | engine/src/CodeHealth.Core/CodeModel/Roslyn/RoslynMethodBody.cs:265-275 | engine/src/CodeHealth.Core/CodeModel/Roslyn/RoslynVbMethodBody.cs:249-259 | engine/src/CodeHealth.Core/ModelAware/InvocationMatching.cs:400-438 | engine/src/CodeHealth.Core/ModelAware/InvocationMatching.cs:406-416 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 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. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/CodeModel/Roslyn/RoslynMethodBody.cs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"0735cdc08135e11ec31f04aeb0532fd69f0e013d06e015b905de4bc1354f0a90"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): engine/src/CodeHealth.Core/Dart/DartDeadLibraryField.cs:508-527 | engine/src/CodeHealth.Core/Markup/MarkupParser.cs:1640-1659 | engine/src/CodeHealth.Core/Testing/JsTestQualityCensus.cs:218-237 | engine/src/CodeHealth.Dimensions.Security/Scanners/MarkupEscapingRecheck.cs:252-271 | engine/src/CodeHealth.Dimensions.Security/Scanners/PrimaryConstructorShadow.cs:284-322 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 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. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Dart/DartDeadLibraryField.cs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2fab08bb339c4d9ee80b96297d8e06c961bb99477489a7bcbce8bfae55c0813"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): engine/src/CodeHealth.Core/Dart/DartDeadLibraryField.cs:666-682 | engine/src/CodeHealth.Core/Dart/DartDeadLibraryField.cs:717-734 | engine/src/CodeHealth.Core/ModelAware/IncompletenessAnalyzer.cs:3250-3269 | engine/src/CodeHealth.Core/ModelAware/MutationIdempotencyAnalyzer.cs:1517-1538 | engine/src/CodeHealth.Dimensions.Security/Scanners/RubyDuplicateMethodDefinitionScan.cs:292-308 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 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. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Dart/DartDeadLibraryField.cs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cbe42a17d637ed26ad9ea59cd144faaaf44c661113cf901529308b9c3ad335d"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): engine/src/CodeHealth.Core/Dependencies/GoProxyClient.cs:117-124 | engine/src/CodeHealth.Core/Dependencies/HexRegistryClient.cs:126-135 | engine/src/CodeHealth.Core/Dependencies/OsvAdvisoryClient.cs:144-151 | engine/src/CodeHealth.Core/Dependencies/RubyGemsRegistryClient.cs:271-280 | engine/src/CodeHealth.Core/Dependencies/UnityRegistryClient.cs:130-137 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 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. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Dependencies/GoProxyClient.cs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea15c5b3df42ff90b8e1a5edcb69a1761090f519c512be2179a9568e480b62fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): engine/src/CodeHealth.Core/Frontend/FrontendDeadCode.cs:938-967 | engine/src/CodeHealth.Core/Frontend/FrontendEngine.cs:380-409 | engine/src/CodeHealth.Core/Frontend/FrontendTestSuiteMasking.cs:814-839 | engine/src/CodeHealth.Core/Frontend/FrontendToolAndRuntimeRefs.cs:115-144 | engine/src/CodeHealth.Core/Frontend/NonProductionTreeReadmission.cs:169-198 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 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. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/FrontendDeadCode.cs"},"region":{"startLine":938}}}],"partialFingerprints":{"codehealthFindingId/v1":"43d00f595197aecfd3a1320eaf5545f3d9266a8ee1c142d74505d40abe6d375f"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): engine/src/CodeHealth.Core/ModelAware/CqsAnalyzer.cs:147-190 | engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs:87-341 | engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs:74-303 | engine/src/CodeHealth.Core/ModelAware/EventSourcingAnalyzer.cs:120-230 | engine/src/CodeHealth.Core/ModelAware/MutationIdempotencyAnalyzer.cs:669-766 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 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. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/CqsAnalyzer.cs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f0275d97c31dac96c9a12dbfccc14ce648025461fc33202d698fd37df073f17"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs:3644-3695 | engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs:3967-4008 | engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs:4015-4053 | engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs:4063-4105 | engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs:4116-4153 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 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. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs"},"region":{"startLine":3644}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e55e46838f60c0f9fe05cc2e2a6bfe98a280c19b8c9b2e15c4413d3063d301c"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): engine/src/CodeHealth.Dimensions.Security/Scanners/PrivateKeyBlobHistoryScan.cs:532-538 | engine/src/CodeHealth.Dimensions.Security/SecretsHistoryAnalyzer.cs:2424-2430 | engine/src/CodeHealth.Toolchain/Git/GitDiffShapes.cs:479-485 | engine/src/CodeHealth.Toolchain/Git/GitLogHistoryExtractor.cs:254-260 | engine/src/CodeHealth.Toolchain/Git/LibGit2GitAccessor.cs:351-357 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 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. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/PrivateKeyBlobHistoryScan.cs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"b612c8760db353667080799ae98ac326e387902e4b68ea1921f061fd657bb7a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): engine/src/CodeHealth.Cli/Commands/AnalyzeCommand.cs:4169-4184 | engine/src/CodeHealth.Cli/Commands/AnalyzeCommand.cs:4191-4207 | engine/src/CodeHealth.Cli/Commands/AnalyzeCommand.cs:4257-4275 | engine/src/CodeHealth.Cli/Commands/AnalyzeCommand.cs:4282-4300 | engine/src/CodeHealth.Cli/Commands/AnalyzeCommand.cs:4366-4386 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 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. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Cli/Commands/AnalyzeCommand.cs"},"region":{"startLine":4169}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c6d1e3c37812fff2ddc359d8a99e9c38253ab08ce79ff2ad263735c483b0073"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): engine/src/CodeHealth.Core/CodeShape/ChainedCorrespondence.cs:81-214 | engine/src/CodeHealth.Core/CodeShape/ChainedFamilyRollup.cs:98-225 | engine/src/CodeHealth.Core/CodeShape/MemberFamilyRollup.cs:106-414 | engine/src/CodeHealth.Core/CodeShape/MemberPairRollup.cs:76-196 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 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. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/CodeShape/ChainedCorrespondence.cs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"63fa29097d979bfb8837b1f9fef8b14e7bb00f34688d9d89068c1e0218baad42"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): engine/src/CodeHealth.Core/CodeShape/ChainedCorrespondence.cs:385-410 | engine/src/CodeHealth.Core/CodeShape/ChainedFamilyRollup.cs:341-366 | engine/src/CodeHealth.Core/CodeShape/MemberFamilyRollup.cs:530-555 | engine/src/CodeHealth.Core/CodeShape/MemberPairRollup.cs:206-231 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 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. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/CodeShape/ChainedCorrespondence.cs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"881891505ff6c6b9e22d99720077e7f5ce532afa2bedc02109a6e38b4758eccc"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs:2080-2136 | engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs:2182-2276 | engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs:2419-2495 | engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs:2534-2595 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 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. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs"},"region":{"startLine":2080}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a9e3b74820d248ee723b59ca322fc5ff1a9c16c835b78d30c16c148f99062c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): engine/src/CodeHealth.Core/ExplicitDebt/RazorMarkupReferenceScanner.cs:120-156 | engine/src/CodeHealth.Core/ExplicitDebt/RazorMarkupReferenceScanner.cs:182-228 | engine/src/CodeHealth.Core/ExplicitDebt/XamlMarkupReferenceScanner.cs:117-151 | engine/src/CodeHealth.Core/ExplicitDebt/XamlMarkupReferenceScanner.cs:185-231 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 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. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ExplicitDebt/RazorMarkupReferenceScanner.cs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"60eaada3d964c5bb93914e050e0600a71bd84451174d354db0a1911e6d18a4d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): engine/src/CodeHealth.Core/Frontend/FrontendBundlerConfigRefs.cs:849-1130 | engine/src/CodeHealth.Core/Frontend/FrontendTestAndDocRefs.cs:73-144 | engine/src/CodeHealth.Core/Frontend/FrontendTestAndDocRefs.cs:170-200 | engine/src/CodeHealth.Core/Frontend/FrontendTestAndDocRefs.cs:210-232 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 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. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/FrontendBundlerConfigRefs.cs"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a9eb77c31a135944c5283ee82e9ebfa19eda0cbbf0198bd07048512ace58110"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs:3531-3563 | engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs:3592-3624 | engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs:3650-3670 | engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs:3766-3798 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 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. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs"},"region":{"startLine":3531}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cff22ca45611dee022c1f65303febc903a36bdf2cb5265984c3efc72cec57ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs:5354-5397 | engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs:5426-5483 | engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs:5508-5569 | engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs:5887-5921 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 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. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs"},"region":{"startLine":5354}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a43a1ac7bc0d8f2ac55f5361ab94bece08f9a257d03186921f5e7d2b150f29a"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): engine/src/CodeHealth.Core/ModelAware/JavaDomainConventions.cs:391-396 | engine/src/CodeHealth.Core/ModelAware/PhpDomainConventions.cs:520-525 | engine/src/CodeHealth.Core/ModelAware/PythonDomainConventions.cs:530-535 | engine/src/CodeHealth.Core/ModelAware/RubyDomainConventions.cs:702-707 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 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. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/JavaDomainConventions.cs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"c22f3be85d6908b8c0fc6c835e84fd9bedb990e2c7717c0d6c3c1d16f9c0194d"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): engine/src/CodeHealth.Core/ModelAware/JavaDomainConventions.cs:566-586 | engine/src/CodeHealth.Core/ModelAware/PhpDomainConventions.cs:538-558 | engine/src/CodeHealth.Core/ModelAware/PythonDomainConventions.cs:549-569 | engine/src/CodeHealth.Core/ModelAware/RubyDomainConventions.cs:720-741 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 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. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/JavaDomainConventions.cs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"da04bf1d948f725d91fa045fd9ec3ef4367b6e7e2f703ab5bebfc1f7fa7dac96"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): engine/src/CodeHealth.Core/ModelAware/RuntimeBoot/BootMechanismDetector.cs:41-82 | engine/src/CodeHealth.Core/ModelAware/RuntimeBoot/DevServerDetector.cs:81-128 | engine/src/CodeHealth.Core/ModelAware/RuntimeBoot/TestFrameworkDetector.cs:136-203 | engine/src/CodeHealth.Core/ModelAware/SupplyChainHygieneAnalyzer.cs:356-444 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 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. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/RuntimeBoot/BootMechanismDetector.cs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"40fcc26288420c0aca907d206f945fa15715be37d375096b3b83c42d7e46688a"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs:6268-6295 | engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs:6308-6346 | engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs:6781-6815 | engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs:7754-7801 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 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. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs"},"region":{"startLine":6268}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb8e6558da044d59f37c5117fab0b12b197596da2323f754e567ebde96569e14"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): engine/src/CodeHealth.Cli/Commands/JvmSidecar.cs:1411-1430 | engine/src/CodeHealth.Cli/Commands/JvmSidecar.cs:1476-1495 | engine/src/CodeHealth.Cli/Commands/JvmSidecar.cs:1641-1660 | engine/src/CodeHealth.Cli/Commands/JvmSidecar.cs:1749-1768 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 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. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Cli/Commands/JvmSidecar.cs"},"region":{"startLine":1411}}}],"partialFingerprints":{"codehealthFindingId/v1":"02990cb2c3bacac2cd1b5a1d640f72961e5d306a988bfd53ece8ba082a9a991e"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): engine/src/CodeHealth.Cli/Commands/JvmSidecar.cs:1666-1695 | engine/src/CodeHealth.Cli/Commands/JvmSidecar.cs:1715-1744 | engine/src/CodeHealth.Cli/Commands/JvmSidecar.cs:1774-1804 | engine/src/CodeHealth.Cli/Commands/JvmSidecar.cs:1810-1839 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 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. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Cli/Commands/JvmSidecar.cs"},"region":{"startLine":1666}}}],"partialFingerprints":{"codehealthFindingId/v1":"32985052ef0142d6645b8c6d1174db6abafdebe8161067e206c4768e0b42e000"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): engine/src/CodeHealth.Dimensions.Security/Scanners/BrowserSandboxDisabledScan.cs:112-152 | engine/src/CodeHealth.Dimensions.Security/Scanners/GitOwnershipCheckDisabledScan.cs:82-127 | engine/src/CodeHealth.Dimensions.Security/Scanners/SetuidBinaryGrantScan.cs:58-100 | engine/src/CodeHealth.Dimensions.Security/Scanners/WorldWritableOwnedPathScan.cs:91-149 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 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. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/BrowserSandboxDisabledScan.cs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"23751972b04d6003d83cc7f9c7c087071a34dbf312a955684654d6a20f38d506"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): engine/src/CodeHealth.Dimensions.Security/Scanners/DartDeadPrivateFieldRecheck.cs:55-105 | engine/src/CodeHealth.Dimensions.Security/Scanners/JsDeadFieldRoundTripRecheck.cs:55-113 | engine/src/CodeHealth.Dimensions.Security/Scanners/JsRedundantReDefaultRecheck.cs:54-77 | engine/src/CodeHealth.Dimensions.Security/Scanners/JsRegexCaptureGroupRecheck.cs:50-93 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 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. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/DartDeadPrivateFieldRecheck.cs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"796c15b34dc0ebeb505d9a5875b61858b8ba6fc529e7987fc28db52e14149e70"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): engine/src/CodeHealth.Dimensions.Security/SecretsHistoryAnalyzer.cs:613-653 | engine/src/CodeHealth.Dimensions.Security/SecretsHistoryAnalyzer.cs:690-728 | engine/src/CodeHealth.Dimensions.Security/SecretsHistoryAnalyzer.cs:749-788 | engine/src/CodeHealth.Dimensions.Security/SecretsHistoryAnalyzer.cs:1783-1813 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 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. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/SecretsHistoryAnalyzer.cs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"064c6de8774ea06046a25701d50a678e287c7406ee25a26826697c66e3fcafc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): engine/src/CodeHealth.Dimensions.GitMining/ChangeCouplingAnalyzer.cs:3839-3877 | engine/src/CodeHealth.Dimensions.GitMining/ChangeCouplingAnalyzer.cs:3886-3924 | engine/src/CodeHealth.Dimensions.GitMining/ChangeCouplingAnalyzer.cs:4245-4316 | engine/src/CodeHealth.Dimensions.GitMining/ChangeCouplingAnalyzer.cs:4400-4441 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 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. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.GitMining/ChangeCouplingAnalyzer.cs"},"region":{"startLine":3839}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c72e170edafc7d43479ebc0ecf45414fd469ddf893162893c7453fecd336911"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34\u2013108 lines \u00D7 2): engine/src/CodeHealth.Dimensions.GitMining/KnowledgeConcentrationAnalyzer.cs:198-231 | engine/src/CodeHealth.Dimensions.GitMining/KnowledgeConcentrationAnalyzer.cs:437-544 \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 \u0060engine/src/CodeHealth.Dimensions.GitMining/KnowledgeConcentrationAnalyzer.cs:437\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.GitMining/KnowledgeConcentrationAnalyzer.cs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2ed576d62775994b57d29b22488e199b551b57dbf9d2a50d7d4fb970544e76d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (68\u201376 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/EventSourcingAnalyzer.cs:499-574 | engine/src/CodeHealth.Core/ModelAware/EventSourcingAnalyzer.cs:1200-1267 \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 \u0060engine/src/CodeHealth.Core/ModelAware/EventSourcingAnalyzer.cs:499\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":"engine/src/CodeHealth.Core/ModelAware/EventSourcingAnalyzer.cs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"78629e9444eede5c255517c64e836bac010c5ad71418b50ce8637fb06a15f986"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (68\u201370 lines \u00D7 3): engine/src/CodeHealth.Core/ModelAware/AltTextQualityAnalyzer.cs:48-117 | engine/src/CodeHealth.Core/ModelAware/HeadingLabelQualityAnalyzer.cs:52-119 | engine/src/CodeHealth.Core/ModelAware/LinkTextQualityAnalyzer.cs:55-122 \u2014 before extracting anything, compare \u0060engine/src/CodeHealth.Core/ModelAware/HeadingLabelQualityAnalyzer.cs\u0060 and \u0060engine/src/CodeHealth.Core/ModelAware/LinkTextQualityAnalyzer.cs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 119 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Core/ModelAware/AltTextQualityAnalyzer.cs:48\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":"engine/src/CodeHealth.Core/ModelAware/AltTextQualityAnalyzer.cs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f02bca243d26def674bd9a1ef254ce1900987321d7a525ebf6b0b5ccde95130"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (46\u201361 lines \u00D7 2): engine/src/CodeHealth.History/RunSidecar.cs:100-145 | engine/src/CodeHealth.Reporting/RunReport.cs:68-128 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.History/RunSidecar.cs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbbecd1ca2c6a8dd03d9e1745b197ec73c2346eaec43f5839a7138aadf0e899d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (50\u201351 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/LogicDefectAnalyzer.cs:127-176 | engine/src/CodeHealth.Core/ModelAware/SecurityDefectAnalyzer.cs:167-217 \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 \u0060engine/src/CodeHealth.Core/ModelAware/LogicDefectAnalyzer.cs:127\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":"engine/src/CodeHealth.Core/ModelAware/LogicDefectAnalyzer.cs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"43fbc99882ff2725d9b4bc1323a6a58b101b095c1f3a0eab24538a391270a42d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33\u201347 lines \u00D7 2): engine/src/CodeHealth.Core/Architecture/BoundaryCouplingDetector.cs:119-165 | engine/src/CodeHealth.Core/Architecture/BoundaryCouplingDetector.cs:338-370 \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":"engine/src/CodeHealth.Core/Architecture/BoundaryCouplingDetector.cs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"db7d64d92bcac2ec6a6bdcef128f2ad78ad3cda757d7ee9acfb50518c4ec9a8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (39\u201343 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs:5430-5472 | engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs:5512-5550 \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 \u0060engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs:5430\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":"engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs"},"region":{"startLine":5430}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebec2d7a3e120f57737974520bfe971e7d793d0cce261ab806b9242e9a189e1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31\u201340 lines \u00D7 3): engine/src/CodeHealth.Core/ModelAware/LogicDefectAnalyzer.cs:133-172 | engine/src/CodeHealth.Core/ModelAware/MarkupTaintPass.cs:341-371 | engine/src/CodeHealth.Core/ModelAware/SecurityDefectAnalyzer.cs:171-210 \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 \u0060engine/src/CodeHealth.Core/ModelAware/LogicDefectAnalyzer.cs:133\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":"engine/src/CodeHealth.Core/ModelAware/LogicDefectAnalyzer.cs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"eee330bd5cf299383a1111fa8f05daba12a2c95cd2e02598c05f8db0f0350e65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34\u201340 lines \u00D7 2): engine/src/CodeHealth.Core/Scoring/DiskSourceFiles.cs:1492-1531 | engine/src/CodeHealth.Core/Testing/DiskTestScanner.cs:1195-1228 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Core/Scoring/DiskSourceFiles.cs:1492\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":"engine/src/CodeHealth.Core/Scoring/DiskSourceFiles.cs"},"region":{"startLine":1492}}}],"partialFingerprints":{"codehealthFindingId/v1":"a858756ffa0418948dfd7a9758daa9e41cfac3ac95d2067e150d215064932f04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201339 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/CSharpCorrectnessAnalyzer.cs:873-896 | engine/src/CodeHealth.Core/ModelAware/CSharpCorrectnessAnalyzer.cs:1054-1092 \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. 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":"engine/src/CodeHealth.Core/ModelAware/CSharpCorrectnessAnalyzer.cs"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"755a3cb38af11323435e3997538a3ce8e9d276a981c29001be5554781d319b3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (38 lines \u00D7 2): engine/src/CodeHealth.Core/Markup/TaggedTemplateMarkupProducer.cs:176-213 | engine/src/CodeHealth.Core/Markup/TemplateLanguageMarkupProducer.cs:158-195 \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":"engine/src/CodeHealth.Core/Markup/TaggedTemplateMarkupProducer.cs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcbeddec1cb69c8d3d46538d1266816a8d5a088568c496e1be357dc902daf99d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (36\u201338 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs:467-504 | engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs:5241-5276 \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 \u0060engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs:467\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"4469fb5d0595df982170599aad680a1437ecd632699c55501dc5fe52e6af5550"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (37 lines \u00D7 2): engine/src/CodeHealth.Core/CodeModel/Roslyn/RoslynMethodBody.cs:261-297 | engine/src/CodeHealth.Core/ModelAware/InvocationMatching.cs:402-438 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Core/ModelAware/InvocationMatching.cs:402\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. 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060engine/src/CodeHealth.Core/ModelAware/InvocationMatching.cs:401\u0060 calls \u0060ThrowIfNull\u0060 and \u0060engine/src/CodeHealth.Core/CodeModel/Roslyn/RoslynMethodBody.cs:260\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":"engine/src/CodeHealth.Core/CodeModel/Roslyn/RoslynMethodBody.cs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f941b8b157494651da6f7b95426228832633910cc5c2be615bce2d648203673"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (37 lines \u00D7 2): engine/src/CodeHealth.Core/ExplicitDebt/RazorMarkupReferenceScanner.cs:182-218 | engine/src/CodeHealth.Core/ExplicitDebt/XamlMarkupReferenceScanner.cs:185-221 \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 \u0060engine/src/CodeHealth.Core/ExplicitDebt/RazorMarkupReferenceScanner.cs:182\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":"engine/src/CodeHealth.Core/ExplicitDebt/RazorMarkupReferenceScanner.cs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"946a7772a13149d39b958640d249db7e32f148cfb5850434a6bd0668df35f71a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201337 lines \u00D7 2): engine/src/CodeHealth.Core/Frontend/FrontendBoundaries.cs:1125-1161 | engine/src/CodeHealth.Core/Frontend/FrontendBoundaries.cs:1705-1722 \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. 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":"engine/src/CodeHealth.Core/Frontend/FrontendBoundaries.cs"},"region":{"startLine":1125}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd7aae0c1369b9495ff495234acbbb9e29936ccfde6643c900a9a99bb2201dad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32\u201337 lines \u00D7 2): engine/src/CodeHealth.Core/Scoring/CodebaseSize.cs:187-223 | engine/src/CodeHealth.Core/Scoring/CodebaseSize.cs:265-296 \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 \u0060engine/src/CodeHealth.Core/Scoring/CodebaseSize.cs:187\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. 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. 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":"engine/src/CodeHealth.Core/Scoring/CodebaseSize.cs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c8b5ae0794768b11699fe7422d4abd8da3fccc8a1b9f3b8f8bc1d7151811270"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2): engine/src/CodeHealth.Dimensions.GitMining/ChangeCouplingAnalyzer.cs:4282-4316 | engine/src/CodeHealth.Dimensions.GitMining/ChangeCouplingAnalyzer.cs:4407-4441 \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 \u0060engine/src/CodeHealth.Dimensions.GitMining/ChangeCouplingAnalyzer.cs:4282\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. 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":"engine/src/CodeHealth.Dimensions.GitMining/ChangeCouplingAnalyzer.cs"},"region":{"startLine":4282}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0f0eac69a5d308ccc9b49faf447a7b5532f233649f36505f5cc2a29e1267abf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2): engine/src/CodeHealth.Dimensions.Security/Scanners/SecretNoiseFilter.cs:2918-2951 | engine/src/CodeHealth.Dimensions.Security/Scanners/SecretNoiseFilter.cs:3009-3042 \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 \u0060engine/src/CodeHealth.Dimensions.Security/Scanners/SecretNoiseFilter.cs:2918\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. 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/SecretNoiseFilter.cs"},"region":{"startLine":2918}}}],"partialFingerprints":{"codehealthFindingId/v1":"dad33097bc3bb88b1ab832391a613bdffcfd567e832ee21bf28aea4c00f27ed4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29\u201334 lines \u00D7 2): engine/src/CodeHealth.Dimensions.GitMining/ChangeCouplingAnalyzer.cs:568-596 | engine/src/CodeHealth.Dimensions.GitMining/HotspotAnalyzer.cs:736-769 \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":"engine/src/CodeHealth.Dimensions.GitMining/ChangeCouplingAnalyzer.cs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"9536978b13c9f0d5dc4412c5072152662fc1fa7a61c166f9da4f18626c2cecc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27\u201333 lines \u00D7 3): engine/src/CodeHealth.Core/Scoring/DiskSourceFiles.cs:1499-1531 | engine/src/CodeHealth.Core/Scoring/DiskSourceFiles.cs:1569-1601 | engine/src/CodeHealth.Core/Testing/DiskTestScanner.cs:1202-1228 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Core/Scoring/DiskSourceFiles.cs:1499\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":"engine/src/CodeHealth.Core/Scoring/DiskSourceFiles.cs"},"region":{"startLine":1499}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb12f87662f1a8edb90cb366400c1248c52dc0858528cb25fb87ede3c47341d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 3): engine/src/CodeHealth.Dimensions.Security/Scanners/UnverifiedAppVeyorInstallerRecheck.cs:172-204 | engine/src/CodeHealth.Dimensions.Security/Scanners/UnverifiedPowerShellInstallerRecheck.cs:127-159 | engine/src/CodeHealth.Dimensions.Security/Scanners/UnverifiedShellInstallerRecheck.cs:128-160 \u2014 before extracting anything, compare \u0060engine/src/CodeHealth.Dimensions.Security/Scanners/UnverifiedAppVeyorInstallerRecheck.cs\u0060 and \u0060engine/src/CodeHealth.Dimensions.Security/Scanners/UnverifiedPowerShellInstallerRecheck.cs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 69 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Dimensions.Security/Scanners/UnverifiedAppVeyorInstallerRecheck.cs:172\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. 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/UnverifiedAppVeyorInstallerRecheck.cs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"60e77bb8e006e6de652d2c9a1520f2a739937fd6ee68178f9818b14c918a4432"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28\u201333 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs:947-979 | engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs:1599-1626 \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 \u0060engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs:947\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs"},"region":{"startLine":947}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dc87df0272c91f3c3b83802b436d98fb7b2466c3ca880c7f42a2e8de5466dc8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32\u201333 lines \u00D7 2): engine/src/CodeHealth.Dimensions.Security/Scanners/DeepScan.cs:348-380 | engine/src/CodeHealth.Dimensions.Security/Scanners/DeepScan.cs:421-452 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060null\u0060 to \u0060IReadOnlyList\u003C(ScanRun Run, int FindingCount)\u003E? passes =\u0060 in one and \u0060IReadOnlyList\u003CScanFinding\u003E? scoredSubset =\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/DeepScan.cs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"2550d5ed46e2546123deb472d76d018e4639e3eb1151a8a309606a3aaeae7ccc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2): engine/src/CodeHealth.Core/Dependencies/MixManifestHygiene.cs:427-458 | engine/src/CodeHealth.Core/Dependencies/SwiftPackageHygiene.cs:557-588 \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":"engine/src/CodeHealth.Core/Dependencies/MixManifestHygiene.cs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4cc6b477a81c13c8ebc66d63f92d6e856501a6026e042822e1553c582c20e29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29\u201332 lines \u00D7 2): engine/src/CodeHealth.Reporting/Sarif/SarifReportRenderer.cs:88-119 | engine/src/CodeHealth.Reporting/Sarif/SarifReportRenderer.cs:150-178 \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 \u0060engine/src/CodeHealth.Reporting/Sarif/SarifReportRenderer.cs:88\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":"engine/src/CodeHealth.Reporting/Sarif/SarifReportRenderer.cs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"159ed424cfac93044ced442c6e5597ca8fd248deca787d5d3c4c0a9e449caabb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201331 lines \u00D7 5): engine/src/CodeHealth.Core/Scoring/DiskSourceFiles.cs:1499-1529 | engine/src/CodeHealth.Core/Scoring/DiskSourceFiles.cs:1569-1599 | engine/src/CodeHealth.Core/Testing/DiskTestScanner.cs:458-482 | engine/src/CodeHealth.Core/Testing/DiskTestScanner.cs:597-621 | engine/src/CodeHealth.Core/Testing/DiskTestScanner.cs:1202-1226 \u2014 there are 5 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 5 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Core/Scoring/DiskSourceFiles.cs:1499\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":"engine/src/CodeHealth.Core/Scoring/DiskSourceFiles.cs"},"region":{"startLine":1499}}}],"partialFingerprints":{"codehealthFindingId/v1":"81f2147841fe714ed26be6990a0836aff380c045ad168365583dbd73581874cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29\u201331 lines \u00D7 2): engine/src/CodeHealth.Dimensions.Security/Scanners/DependencyUpdateCooldownCollapse.cs:75-103 | engine/src/CodeHealth.Dimensions.Security/Scanners/EolActionMajorRepositoryFold.cs:168-198 \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 \u0060engine/src/CodeHealth.Dimensions.Security/Scanners/DependencyUpdateCooldownCollapse.cs:75\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/DependencyUpdateCooldownCollapse.cs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"c72ea57c632f43c12261079a562e8c256c06f7e7dfff0c3b3ed597f8a85aa521"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 6): engine/src/CodeHealth.Dimensions.Security/Scanners/ComposeRuntimeSocketMountScan.cs:215-244 | engine/src/CodeHealth.Dimensions.Security/Scanners/ComposeServiceSurface.cs:320-349 | engine/src/CodeHealth.Dimensions.Security/Scanners/DockerfileSyntax.cs:639-668 | engine/src/CodeHealth.Dimensions.Security/Scanners/NamelessWorkloadPrivilegedScan.cs:284-313 | engine/src/CodeHealth.Dimensions.Security/Scanners/RubySourceFiles.cs:54-83 | engine/src/CodeHealth.Dimensions.Security/Scanners/WranglerPlaintextVarScan.cs:415-444 \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 6 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Dimensions.Security/Scanners/ComposeRuntimeSocketMountScan.cs:215\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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060lines\u0060 to \u0060string[]\u0060 in one and \u0060IReadOnlyList\u003Cstring\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/ComposeRuntimeSocketMountScan.cs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"819a112fde19eb5b6cffb6cb8d42e286ee1f1c7e49357bd4aaae6ca07aa0176e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28\u201330 lines \u00D7 2): engine/src/CodeHealth.Dimensions.Dependencies/DependencyHygieneAnalyzer.cs:1394-1423 | engine/src/CodeHealth.Dimensions.Dependencies/DependencyHygieneAnalyzer.cs:1433-1460 \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 \u0060engine/src/CodeHealth.Dimensions.Dependencies/DependencyHygieneAnalyzer.cs:1394\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"engine/src/CodeHealth.Dimensions.Dependencies/DependencyHygieneAnalyzer.cs"},"region":{"startLine":1394}}}],"partialFingerprints":{"codehealthFindingId/v1":"d09cb29d45646d2e9210da8f5ebcce4dfb0639518480ba2c59a5b5253e15b447"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201330 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/RepoProfiler.cs:248-277 | engine/src/CodeHealth.Core/ModelAware/RepoProfiler.cs:655-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Core/ModelAware/RepoProfiler.cs:248\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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060types\u0060 to \u0060IReadOnlyList\u003CINamedTypeSymbol\u003E\u0060 in one and \u0060IReadOnlyList\u003CNm.ICodeType\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/RepoProfiler.cs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"806bd0f09c35ff830230c5e4d3bf3bf90c7e29cee8f12cdafa211681b5009f50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201329 lines \u00D7 5): engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs:3658-3686 | engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs:3984-3999 | engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs:4029-4044 | engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs:4077-4096 | engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs:4130-4144 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs:3658\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. 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":"engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs"},"region":{"startLine":3658}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6297e549a142a0d5f4c95b81dacd8649cc12b007a6a9417552a213b5fb12c96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201329 lines \u00D7 4): engine/src/CodeHealth.Dimensions.Architecture/CohesionAnalyzer.cs:90-111 | engine/src/CodeHealth.Dimensions.Dependencies/DependencyHygieneAnalyzer.cs:1395-1423 | engine/src/CodeHealth.Dimensions.Dependencies/DependencyHygieneAnalyzer.cs:1434-1460 | engine/src/CodeHealth.Dimensions.Dependencies/DependencyHygieneAnalyzer.cs:1469-1495 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Dimensions.Dependencies/DependencyHygieneAnalyzer.cs:1395\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. 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":"engine/src/CodeHealth.Dimensions.Architecture/CohesionAnalyzer.cs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9249b4d9fb59a47118c3098f9a14cd54fae41b2fb0fee6d581157732b6ca5c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 3): engine/src/CodeHealth.Core/Frontend/FrontendDeadCode.cs:938-966 | engine/src/CodeHealth.Core/Frontend/FrontendEngine.cs:380-408 | engine/src/CodeHealth.Core/Frontend/NonProductionTreeReadmission.cs:169-197 \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 \u0060engine/src/CodeHealth.Core/Frontend/FrontendDeadCode.cs:938\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":"engine/src/CodeHealth.Core/Frontend/FrontendDeadCode.cs"},"region":{"startLine":938}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4e1058b3c7a888315128a86628e44c5b24e0afdc7bbbbcd9c8ce09ee6bef853"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28\u201329 lines \u00D7 2): engine/src/CodeHealth.Core/CodeShape/ChainedCorrespondence.cs:93-120 | engine/src/CodeHealth.Core/CodeShape/MemberPairRollup.cs:85-113 \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 \u0060engine/src/CodeHealth.Core/CodeShape/ChainedCorrespondence.cs:93\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060engine/src/CodeHealth.Core/CodeShape/ChainedCorrespondence.cs:91\u0060 calls \u0060CommonDirectoryPrefixLength\u0060 and \u0060engine/src/CodeHealth.Core/CodeShape/MemberPairRollup.cs:81\u0060 does not \u2014 after which the two agree again for 4 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":"engine/src/CodeHealth.Core/CodeShape/ChainedCorrespondence.cs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"697e550197fd907c82abb913988d93d24e9de696fbfca32c401c041d88a423ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): engine/src/CodeHealth.Core/Dependencies/BundlerManifestHygiene.cs:540-568 | engine/src/CodeHealth.Core/Dependencies/BundlerManifestHygiene.cs:574-602 \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. 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":"engine/src/CodeHealth.Core/Dependencies/BundlerManifestHygiene.cs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ee811aa0747086542de9a909f71797a9ae9ba8e5edd36f47c9e2640fdfd42cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27\u201329 lines \u00D7 2): engine/src/CodeHealth.Core/Dependencies/GradleCurrencyCollector.cs:103-131 | engine/src/CodeHealth.Core/Dependencies/MavenCurrencyCollector.cs:112-138 \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 \u0060engine/src/CodeHealth.Core/Dependencies/GradleCurrencyCollector.cs:103\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":"engine/src/CodeHealth.Core/Dependencies/GradleCurrencyCollector.cs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"63bafcd66a0acd1411752fa9507da198597a00c20fa48bdc1a3d24aa6e094706"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201329 lines \u00D7 2): engine/src/CodeHealth.Core/Markup/MarkupParser.cs:1459-1487 | engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs:5834-5858 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Core/Markup/MarkupParser.cs:1459\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":"engine/src/CodeHealth.Core/Markup/MarkupParser.cs"},"region":{"startLine":1459}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5d456443590f542d60de4e88f64ae2eb4af8ec6c8be01f3fe0e6fe51943230d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201329 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/EventSourcingAnalyzer.cs:452-480 | engine/src/CodeHealth.Core/ModelAware/EventSourcingAnalyzer.cs:1162-1183 \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 \u0060engine/src/CodeHealth.Core/ModelAware/EventSourcingAnalyzer.cs:452\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":"engine/src/CodeHealth.Core/ModelAware/EventSourcingAnalyzer.cs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e2fb733c96e4151a0a7bbbf4c13231b21005c4c348b9d224c533c8c72c1930e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): engine/src/CodeHealth.Core/Frontend/FrontendDeclaredPackageRefs.cs:33-60 | engine/src/CodeHealth.Core/Frontend/FrontendWorkspaceWalk.cs:33-60 \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 \u0060engine/src/CodeHealth.Core/Frontend/FrontendDeclaredPackageRefs.cs:33\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/FrontendDeclaredPackageRefs.cs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"84087d67ef78817c3cc116357028f9a919ed2b1e6fa3d18c253c7e88e6e63efe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): engine/src/CodeHealth.Core/Markup/TemplMarkupProducer.cs:333-360 | engine/src/CodeHealth.Core/Markup/TemplateLanguageMarkupProducer.cs:447-474 \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":"engine/src/CodeHealth.Core/Markup/TemplMarkupProducer.cs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"37b5f8b76908f4328d156dc82827bc5d3813f1466fc04266bfcdc33dab9db524"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 3): engine/src/CodeHealth.Dimensions.Security/Scanners/DartDeadPrivateFieldRecheck.cs:68-94 | engine/src/CodeHealth.Dimensions.Security/Scanners/JsDeadFieldRoundTripRecheck.cs:79-105 | engine/src/CodeHealth.Dimensions.Security/Scanners/JsRegexCaptureGroupRecheck.cs:63-89 \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":"engine/src/CodeHealth.Dimensions.Security/Scanners/DartDeadPrivateFieldRecheck.cs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f703405cb7f871caad44a25f3122de79e1d52ef192c05fe3345f8f6143dbb27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): engine/src/CodeHealth.Core/Frontend/FrontendConfigResolution.cs:250-276 | engine/src/CodeHealth.Core/Frontend/FrontendManifestParsing.cs:58-84 \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 \u0060engine/src/CodeHealth.Core/Frontend/FrontendConfigResolution.cs:250\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":"engine/src/CodeHealth.Core/Frontend/FrontendConfigResolution.cs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bda6e46388395cfa4afc48dc490d69c02d54c2ab0ab2e8f24087aec6e23ccd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): engine/src/CodeHealth.Core/Frontend/ModuleSyntaxScanner.cs:1504-1530 | engine/src/CodeHealth.Core/Frontend/ModuleSyntaxScanner.cs:1618-1644 \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 \u0060engine/src/CodeHealth.Core/Frontend/ModuleSyntaxScanner.cs:1504\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":"engine/src/CodeHealth.Core/Frontend/ModuleSyntaxScanner.cs"},"region":{"startLine":1504}}}],"partialFingerprints":{"codehealthFindingId/v1":"5468ccba51c3fd5c38ce1d1715444770583b15dd8c384a2ea8cb1bd166474d04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201327 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/DomainConventions.cs:333-359 | engine/src/CodeHealth.Core/ModelAware/DomainConventions.cs:1711-1729 \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 \u0060engine/src/CodeHealth.Core/ModelAware/DomainConventions.cs:333\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060type\u0060 to \u0060INamedTypeSymbol\u0060 in one and \u0060Nm.ICodeType\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/DomainConventions.cs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0f9e17d8f5776804e89c5cbde55a444fbbee11dddc1c04cfac373dd6d5691a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201327 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs:771-797 | engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs:2238-2262 \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 \u0060engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs:771\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. 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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060types\u0060 to \u0060IReadOnlyList\u003CINamedTypeSymbol\u003E\u0060 in one and \u0060IReadOnlyList\u003CNm.ICodeType\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"914574d0eaa0e8f4ef9e5f780c101b7cba1cf03e1730ad101fa557625fdd4060"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): engine/src/CodeHealth.Dimensions.Security/SecretScanningAnalyzer.cs:254-280 | engine/src/CodeHealth.Dimensions.Security/SecretScanningAnalyzer.cs:304-330 \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. 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":"engine/src/CodeHealth.Dimensions.Security/SecretScanningAnalyzer.cs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"56be90fa256b01c5310e733349b67ea120698b3ffb1394d15a44e1263c102fb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 4): engine/src/CodeHealth.Core/CodeShape/ChainedCorrespondence.cs:385-410 | engine/src/CodeHealth.Core/CodeShape/ChainedFamilyRollup.cs:341-366 | engine/src/CodeHealth.Core/CodeShape/MemberFamilyRollup.cs:530-555 | engine/src/CodeHealth.Core/CodeShape/MemberPairRollup.cs:206-231 \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 4 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":"engine/src/CodeHealth.Core/CodeShape/ChainedCorrespondence.cs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"f962585a27e41bfc05201196a354820eb3215ca3ffa72a5be08bd92e60713b32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 3): engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs:5356-5381 | engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs:5511-5536 | engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs:5889-5914 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs:5356\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":"engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs"},"region":{"startLine":5356}}}],"partialFingerprints":{"codehealthFindingId/v1":"eddf718381d645803e3a5b6fa3bad57725ca7e77160f3530625490a864a07b97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201326 lines \u00D7 2): engine/src/CodeHealth.Core/CodeShape/RoslynDuplicationDetector.cs:589-614 | engine/src/CodeHealth.Core/Cohesion/Lcom4Calculator.cs:50-70 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Core/CodeShape/RoslynDuplicationDetector.cs:589\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/CodeShape/RoslynDuplicationDetector.cs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"08d31706ca7f2865b6e9efc6bb60596e93954cc8af9e17074121dc23f9329f7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201326 lines \u00D7 2): engine/src/CodeHealth.Core/Frontend/FrontendDeclaredPackageRefs.cs:510-534 | engine/src/CodeHealth.Core/Frontend/FrontendDeclaredPackageRefs.cs:573-598 \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 \u0060engine/src/CodeHealth.Core/Frontend/FrontendDeclaredPackageRefs.cs:510\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"engine/src/CodeHealth.Core/Frontend/FrontendDeclaredPackageRefs.cs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"c869f1161fe6079422fa749dd8a709090c5b206ab7d6e92bcee8756e37d3be77"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201326 lines \u00D7 2): engine/src/CodeHealth.Core/Frontend/JsScopeBindings.cs:295-319 | engine/src/CodeHealth.Dimensions.Security/Scanners/JsDeadFieldRoundTripRecheck.cs:87-112 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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. 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":"engine/src/CodeHealth.Core/Frontend/JsScopeBindings.cs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd4d5baef0c1534cadc844e40354f02fcce75a85105ae7236f12e718a59b6cae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs:6026-6051 | engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs:6095-6120 \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 \u0060engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs:6026\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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060root\u0060 to \u0060string\u0060 in one and \u0060int Files) CountProgrammaticDomFactoryCalls(string\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs"},"region":{"startLine":6026}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a702c0a7439dc2b998541028b2d0f330e11825813b2e3cbd589f18cba776238"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201326 lines \u00D7 2): engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs:1989-2003 | engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs:9277-9302 \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 \u0060engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs:1989\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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":1989}}}],"partialFingerprints":{"codehealthFindingId/v1":"788ab079e4079aa4fed7a846d63588a71ec3cb8790334604e664c519d0125b96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 5): engine/src/CodeHealth.Dimensions.Dependencies/DependencyHygieneAnalyzer.cs:1768-1793 | engine/src/CodeHealth.Dimensions.Dependencies/DependencyHygieneAnalyzer.cs:1895-1919 | engine/src/CodeHealth.Dimensions.Dependencies/DependencyHygieneAnalyzer.cs:1977-2003 | engine/src/CodeHealth.Dimensions.Dependencies/DependencyHygieneAnalyzer.cs:2053-2079 | engine/src/CodeHealth.Dimensions.Dependencies/DependencyHygieneAnalyzer.cs:2276-2303 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Dimensions.Dependencies/DependencyHygieneAnalyzer.cs:1768\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Dependencies/DependencyHygieneAnalyzer.cs"},"region":{"startLine":1768}}}],"partialFingerprints":{"codehealthFindingId/v1":"078f51827e423c141371c8298ea0a77125b6173e33b0af92e70710ae2b6ca3b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 4): engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.TemplateLanguageBlindness.cs:429-453 | engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs:5978-6002 | engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs:6221-6245 | engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs:9933-9957 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.TemplateLanguageBlindness.cs:429\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":"engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.TemplateLanguageBlindness.cs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fbce0e0837084d5624620458d87ce2c212089e21413be4b20fb72f2d32d8a5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs:826-850 | engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs:2350-2374 \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 \u0060engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs:826\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. 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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060types\u0060 to \u0060IReadOnlyList\u003CINamedTypeSymbol\u003E\u0060 in one and \u0060IReadOnlyList\u003CNm.ICodeType\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"c62127805deb28ff209b005ef7bbacac6261c7f669c6a4a8e9d689d33c74f3ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs:1688-1712 | engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs:5146-5170 \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 \u0060engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs:1688\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs"},"region":{"startLine":1688}}}],"partialFingerprints":{"codehealthFindingId/v1":"b083afb380315108ae96d6b7da6ab41eb45402843e1b27fa2d6bc1b2ac8fede0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201325 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs:3863-3873 | engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs:4348-4372 \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 \u0060engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs:3863\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 \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":"engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs"},"region":{"startLine":3863}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8dd0b084db1f3c111d7b3cbddb0340eb64a8e35f11491722028656a47195759"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201325 lines \u00D7 2): engine/src/CodeHealth.Dimensions.CodeQuality/Complexity/CognitiveComplexityAnalyzer.cs:24-48 | engine/src/CodeHealth.Dimensions.CodeQuality/Complexity/CyclomaticComplexityAnalyzer.cs:25-46 \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 \u0060engine/src/CodeHealth.Dimensions.CodeQuality/Complexity/CognitiveComplexityAnalyzer.cs:24\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":"engine/src/CodeHealth.Dimensions.CodeQuality/Complexity/CognitiveComplexityAnalyzer.cs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebf6c915a94693faf6e2cca9e00b0dc0fb88c55b151b9169cbd063688bdb40f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201324 lines \u00D7 2): engine/src/CodeHealth.Core/Complexity/ControlFlowComplexity.cs:221-244 | engine/src/CodeHealth.Core/Complexity/ControlFlowComplexity.cs:399-410 \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 \u0060engine/src/CodeHealth.Core/Complexity/ControlFlowComplexity.cs:221\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"engine/src/CodeHealth.Core/Complexity/ControlFlowComplexity.cs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"56483363821e05586f8a71bd32a02cc2880fa6564fa2ee3fac9d4f3d839b8f1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): engine/src/CodeHealth.Core/Frontend/FrontendManifestEntryPoints.cs:297-320 | engine/src/CodeHealth.Core/Frontend/FrontendManifestEntryPoints.cs:551-574 \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 \u0060engine/src/CodeHealth.Core/Frontend/FrontendManifestEntryPoints.cs:297\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"engine/src/CodeHealth.Core/Frontend/FrontendManifestEntryPoints.cs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"c79cd53e42816a7de0c3738f7030a66d1b739c3ba4d7ad081f3640ba5767b904"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201324 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs:706-729 | engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs:2067-2088 \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 \u0060engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs:706\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"7225cfc9191c7732ab98a124d5135401f71fe240f89b1bea3de78de747482f61"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201324 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/RepoProfiler.cs:172-195 | engine/src/CodeHealth.Core/ModelAware/RepoProfiler.cs:345-364 \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 \u0060engine/src/CodeHealth.Core/ModelAware/RepoProfiler.cs:172\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060types\u0060 to \u0060IReadOnlyList\u003CINamedTypeSymbol\u003E\u0060 in one and \u0060IReadOnlyList\u003CNm.ICodeType\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/RepoProfiler.cs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"06323e2502d58326c2dd7792d1d0b7bb7c4e39b25a7ac701bfd6be68b8484d96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201324 lines \u00D7 2): engine/src/CodeHealth.Dimensions.Architecture/BoundaryCouplingAnalyzer.cs:332-349 | engine/src/CodeHealth.Dimensions.Architecture/CohesionAnalyzer.cs:87-110 \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 \u0060engine/src/CodeHealth.Dimensions.Architecture/BoundaryCouplingAnalyzer.cs:332\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. 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":"engine/src/CodeHealth.Dimensions.Architecture/BoundaryCouplingAnalyzer.cs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"79f6fc045520681e700896f225b57c719e6474d59c25ece2782fd0ac7db20334"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): engine/src/CodeHealth.Dimensions.Security/Scanners/ComposeHostNamespaceScan.cs:128-151 | engine/src/CodeHealth.Dimensions.Security/Scanners/ComposeMutableServiceImageScan.cs:141-164 \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 \u0060engine/src/CodeHealth.Dimensions.Security/Scanners/ComposeHostNamespaceScan.cs:128\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":"engine/src/CodeHealth.Dimensions.Security/Scanners/ComposeHostNamespaceScan.cs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"87ee814c849a1069239ec1aacd4bb4ab77240d82e0ad40ce1d682b3c50037f9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): engine/src/CodeHealth.Dimensions.Security/Scanners/SecretNoiseFilter.cs:1323-1346 | engine/src/CodeHealth.Dimensions.Security/Scanners/SecretNoiseFilter.cs:1358-1381 \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 \u0060engine/src/CodeHealth.Dimensions.Security/Scanners/SecretNoiseFilter.cs:1323\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. 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/SecretNoiseFilter.cs"},"region":{"startLine":1323}}}],"partialFingerprints":{"codehealthFindingId/v1":"35ee7f7c155a8bf9be933ee757f2fc03409d373d802cc3c42bb0d5ba8a1975ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201324 lines \u00D7 2): engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs:7314-7336 | engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs:7422-7445 \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 \u0060engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs:7314\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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":7314}}}],"partialFingerprints":{"codehealthFindingId/v1":"52e4ac9ae9b6f2027006fae4cdfa8a20c6cd028eb16989fadce015ba5ac77e5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): engine/src/CodeHealth.Dimensions.GitMining/ChangeCouplingAnalyzer.cs:3841-3864 | engine/src/CodeHealth.Dimensions.GitMining/ChangeCouplingAnalyzer.cs:3888-3911 \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 \u0060engine/src/CodeHealth.Dimensions.GitMining/ChangeCouplingAnalyzer.cs:3841\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":"engine/src/CodeHealth.Dimensions.GitMining/ChangeCouplingAnalyzer.cs"},"region":{"startLine":3841}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f7025a97c9e63bb1fa83a3ebfcf455f0fdb3fb36c172fa052cacf8ff88c382f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201323 lines \u00D7 3): engine/src/CodeHealth.Core/Dependencies/GoModuleHygiene.cs:286-307 | engine/src/CodeHealth.Core/Dependencies/MixManifestHygiene.cs:227-249 | engine/src/CodeHealth.Core/Dependencies/SwiftPackageHygiene.cs:243-262 \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 \u0060engine/src/CodeHealth.Core/Dependencies/GoModuleHygiene.cs:286\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. 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":"engine/src/CodeHealth.Core/Dependencies/GoModuleHygiene.cs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"a028b2ae4379f7f29daae27f23063b86af083c864adb697078f0b263134f2b8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201323 lines \u00D7 3): engine/src/CodeHealth.Core/ModelAware/RuntimeBoot/DevServerDetector.cs:95-107 | engine/src/CodeHealth.Core/ModelAware/RuntimeBoot/TestFrameworkDetector.cs:150-172 | engine/src/CodeHealth.Core/ModelAware/SupplyChainHygieneAnalyzer.cs:372-390 \u2014 before extracting anything, compare \u0060engine/src/CodeHealth.Core/ModelAware/RuntimeBoot/DevServerDetector.cs\u0060 and \u0060engine/src/CodeHealth.Core/ModelAware/RuntimeBoot/TestFrameworkDetector.cs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 58 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Core/ModelAware/RuntimeBoot/DevServerDetector.cs:95\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. 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":"engine/src/CodeHealth.Core/ModelAware/RuntimeBoot/DevServerDetector.cs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"e30a0bf0af77459388bdb197bf0166fb60ab31f0e1ed6cc09d36fa28f3b866da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 3): engine/src/CodeHealth.Dimensions.Security/Scanners/UnverifiedAppVeyorInstallerRecheck.cs:145-167 | engine/src/CodeHealth.Dimensions.Security/Scanners/UnverifiedPowerShellInstallerRecheck.cs:100-122 | engine/src/CodeHealth.Dimensions.Security/Scanners/UnverifiedShellInstallerRecheck.cs:97-119 \u2014 before extracting anything, compare \u0060engine/src/CodeHealth.Dimensions.Security/Scanners/UnverifiedAppVeyorInstallerRecheck.cs\u0060 and \u0060engine/src/CodeHealth.Dimensions.Security/Scanners/UnverifiedPowerShellInstallerRecheck.cs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 69 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Dimensions.Security/Scanners/UnverifiedAppVeyorInstallerRecheck.cs:145\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. 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/UnverifiedAppVeyorInstallerRecheck.cs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"5314f963424dd60c41c7c8351eda884b600a7c5fcad724c1b7d343cb88cd0bf8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201323 lines \u00D7 2): engine/src/CodeHealth.Dimensions.Dependencies/DependencyHygieneAnalyzer.cs:2140-2156 | engine/src/CodeHealth.Dimensions.Dependencies/DependencyHygieneAnalyzer.cs:2200-2222 \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 \u0060engine/src/CodeHealth.Dimensions.Dependencies/DependencyHygieneAnalyzer.cs:2140\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":"engine/src/CodeHealth.Dimensions.Dependencies/DependencyHygieneAnalyzer.cs"},"region":{"startLine":2140}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a9425bcba613ae9795ca563d833b5c5975e16930da2c33e6529040f641ddfb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): engine/src/CodeHealth.Core/ExplicitDebt/RoslynExplicitDebtCollector.cs:3661-3683 | engine/src/CodeHealth.Core/ExplicitDebt/RoslynExplicitDebtCollector.cs:3818-3840 \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 \u0060engine/src/CodeHealth.Core/ExplicitDebt/RoslynExplicitDebtCollector.cs:3661\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. 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":"engine/src/CodeHealth.Core/ExplicitDebt/RoslynExplicitDebtCollector.cs"},"region":{"startLine":3661}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d6195edf9a33b9647ab360902a01dc3651ab7ddfb4a5b8b11afaaa3354bf1ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201323 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/DomainConventions.cs:307-329 | engine/src/CodeHealth.Core/ModelAware/DomainConventions.cs:1689-1707 \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 \u0060engine/src/CodeHealth.Core/ModelAware/DomainConventions.cs:307\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/DomainConventions.cs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaa763c0a441bfc283043978018ededfdb01f4b9d57c845e7fb4083ca0e759d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201323 lines \u00D7 2): engine/src/CodeHealth.Core/Scoring/DeclaredScriptExecutables.cs:175-197 | engine/src/CodeHealth.Core/Scoring/DiskSourceFiles.cs:127-144 \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 \u0060engine/src/CodeHealth.Core/Scoring/DeclaredScriptExecutables.cs:175\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":"engine/src/CodeHealth.Core/Scoring/DeclaredScriptExecutables.cs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"51162aebc328f22e7dda48c53bb0f81d7831af9832b48fc611b7c4366dd2142a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): engine/src/CodeHealth.Core/Testing/CommittedCoverageReader.cs:592-614 | engine/src/CodeHealth.Core/Testing/CommittedCoverageReader.cs:727-749 \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 \u0060engine/src/CodeHealth.Core/Testing/CommittedCoverageReader.cs:592\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. 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":"engine/src/CodeHealth.Core/Testing/CommittedCoverageReader.cs"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e592a021df49f6485307c46c62c1215956a67a30c1d0fb3f2d4198a3c37e393"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201323 lines \u00D7 2): engine/src/CodeHealth.Dimensions.Security/Scanners/DependencyUpdateCooldownCollapse.cs:53-74 | engine/src/CodeHealth.Dimensions.Security/Scanners/KsvSecurityContextAggregator.cs:74-96 \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 \u0060engine/src/CodeHealth.Dimensions.Security/Scanners/DependencyUpdateCooldownCollapse.cs:53\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/DependencyUpdateCooldownCollapse.cs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"7586bfbb7c279aca8ad27f18f1aba9ff542f5df5ab38d00196323b6730324072"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201323 lines \u00D7 2): engine/src/CodeHealth.Dimensions.Security/Scanners/RecursiveOwnershipRootRecheck.cs:84-105 | engine/src/CodeHealth.Dimensions.Security/Scanners/ShellCommandPrefixRecheck.cs:95-117 \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 \u0060engine/src/CodeHealth.Dimensions.Security/Scanners/RecursiveOwnershipRootRecheck.cs:84\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":"engine/src/CodeHealth.Dimensions.Security/Scanners/RecursiveOwnershipRootRecheck.cs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a3c1d4e64769294c71f89aef7ded98495c7a4658a69e7b3dad8bf0c62fcd397"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201322 lines \u00D7 7): engine/src/CodeHealth.Core/Compliance/HostedHttpSurfaceScan.cs:443-464 | engine/src/CodeHealth.Core/Scoring/DiskSourceFiles.cs:1497-1514 | engine/src/CodeHealth.Core/Scoring/DiskSourceFiles.cs:1567-1584 | engine/src/CodeHealth.Core/Testing/DiskTestScanner.cs:1200-1214 | engine/src/CodeHealth.Core/Testing/GoTestCensus.cs:513-527 | engine/src/CodeHealth.Core/Testing/PythonTestCensus.cs:383-397 | engine/src/CodeHealth.Core/Testing/RustTestCensus.cs:428-442 \u2014 there are 7 copies across 6 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 7 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Core/Compliance/HostedHttpSurfaceScan.cs:443\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060engine/src/CodeHealth.Core/Testing/RustTestCensus.cs:426\u0060 calls \u0060RustFiles\u0060 and \u0060engine/src/CodeHealth.Core/Scoring/DiskSourceFiles.cs:1495\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":"engine/src/CodeHealth.Core/Compliance/HostedHttpSurfaceScan.cs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"c46c9d879ef051f7216a63d517c6499d4a0f347948c5b18bca1fe00f73ad0634"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201322 lines \u00D7 6): engine/src/CodeHealth.Cli/Commands/JvmSidecar.cs:1372-1387 | engine/src/CodeHealth.Cli/Commands/JvmSidecar.cs:1437-1452 | engine/src/CodeHealth.Cli/Commands/JvmSidecar.cs:1502-1517 | engine/src/CodeHealth.Cli/Commands/JvmSidecar.cs:1555-1576 | engine/src/CodeHealth.Cli/Commands/JvmSidecar.cs:1602-1617 | engine/src/CodeHealth.Cli/Commands/JvmSidecar.cs:1848-1863 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Cli/Commands/JvmSidecar.cs:1372\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":"engine/src/CodeHealth.Cli/Commands/JvmSidecar.cs"},"region":{"startLine":1372}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0c926ec606c980a27ed8f4fc7619e9b3e5a94a70992f85659a40cd209e5653b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 3): engine/src/CodeHealth.Core/Frontend/DirectoryForkDetector.cs:427-450 | engine/src/CodeHealth.Core/Frontend/FrontendTestSuiteMasking.cs:171-192 | engine/src/CodeHealth.Core/Frontend/FrontendWorkspaceWalk.cs:478-502 \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 \u0060engine/src/CodeHealth.Core/Frontend/DirectoryForkDetector.cs:427\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":"engine/src/CodeHealth.Core/Frontend/DirectoryForkDetector.cs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f3c64dfe5b802aa0da5b9c6363075762ec5c98eaac5e64a327e56ca84925995"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201322 lines \u00D7 3): engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs:2054-2068 | engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs:2115-2129 | engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs:2176-2197 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs:2054\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. 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":"engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs"},"region":{"startLine":2054}}}],"partialFingerprints":{"codehealthFindingId/v1":"4220f7cd5de8e57d5aa6aff5cb96eb3452424a9575fdf3f4e407aa1ddc63e5a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 3): engine/src/CodeHealth.Core/ModelAware/PhpDomainConventions.cs:70-91 | engine/src/CodeHealth.Core/ModelAware/PythonDomainConventions.cs:63-84 | engine/src/CodeHealth.Core/ModelAware/RubyDomainConventions.cs:68-89 \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":"engine/src/CodeHealth.Core/ModelAware/PhpDomainConventions.cs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3d9a2b8b018af85cc070fc3770a611df9ae49f215fcf01cd5e3c735c1350e80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): engine/src/CodeHealth.Core/Frontend/EntryPointCatalog.cs:1924-1945 | engine/src/CodeHealth.Core/Frontend/FrontendTestAndDocRefs.cs:305-326 \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 \u0060engine/src/CodeHealth.Core/Frontend/EntryPointCatalog.cs:1924\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. 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":"engine/src/CodeHealth.Core/Frontend/EntryPointCatalog.cs"},"region":{"startLine":1924}}}],"partialFingerprints":{"codehealthFindingId/v1":"98c555b8bb9ab5a622b46cd1bea10732c2e58599a1ba138328a23369664516e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): engine/src/CodeHealth.Core/Frontend/FrontendTestSuiteMasking.cs:817-838 | engine/src/CodeHealth.Core/Frontend/FrontendToolAndRuntimeRefs.cs:122-143 \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":"engine/src/CodeHealth.Core/Frontend/FrontendTestSuiteMasking.cs"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee8f3bbdf6c4664a2b465880bf9123507371b851ea17b967e38da2bb15584f29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs:3531-3552 | engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs:3766-3787 \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 \u0060engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs:3531\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":"engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs"},"region":{"startLine":3531}}}],"partialFingerprints":{"codehealthFindingId/v1":"349c9a82c134f0add190468a487cb122e21de029e1349d163f3a5ce0c4f14c7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201322 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/DartDomainConventions.cs:617-636 | engine/src/CodeHealth.Core/ModelAware/SwiftDomainConventions.cs:1149-1170 \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":"engine/src/CodeHealth.Core/ModelAware/DartDomainConventions.cs"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"24445fbfe1064d22a16edb8490c1fd78a81c943ffc71cd82fc0c5d968c18156b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201322 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/HeadingLabelQualityAnalyzer.cs:26-44 | engine/src/CodeHealth.Core/ModelAware/LinkTextQualityAnalyzer.cs:26-47 \u2014 before extracting anything, compare \u0060engine/src/CodeHealth.Core/ModelAware/HeadingLabelQualityAnalyzer.cs\u0060 and \u0060engine/src/CodeHealth.Core/ModelAware/LinkTextQualityAnalyzer.cs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 119 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Core/ModelAware/HeadingLabelQualityAnalyzer.cs:26\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":"engine/src/CodeHealth.Core/ModelAware/HeadingLabelQualityAnalyzer.cs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"2298e4a4d3495ad4031f3dc1f6647b511c13ad328662699442a1408f4ec83b0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): engine/src/CodeHealth.Dimensions.Security/Scanners/RecursiveOwnershipRootRecheck.cs:147-168 | engine/src/CodeHealth.Dimensions.Security/Scanners/ShellCommandPrefixRecheck.cs:168-189 \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":"engine/src/CodeHealth.Dimensions.Security/Scanners/RecursiveOwnershipRootRecheck.cs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"b171c2c7bd82d3b23a7e43602c307b013d070bfac1fbed803d559dab5bbf428b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201322 lines \u00D7 2): engine/src/CodeHealth.Llm.ClaudeCli/ClaudeCliLlmProvider.cs:40-61 | engine/src/CodeHealth.Llm.CopilotCli/CopilotCliLlmProvider.cs:39-59 \u2014 before extracting anything, compare \u0060engine/src/CodeHealth.Llm.ClaudeCli/ClaudeCliLlmProvider.cs\u0060 and \u0060engine/src/CodeHealth.Llm.CopilotCli/CopilotCliLlmProvider.cs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Llm.ClaudeCli/ClaudeCliLlmProvider.cs:40\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":"engine/src/CodeHealth.Llm.ClaudeCli/ClaudeCliLlmProvider.cs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb23eb1385428e512fafc9bf01544743edd6a6d2f9c0e3e8da46d8ada1eaf647"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 6): engine/src/CodeHealth.Core/Markup/MarkupParser.cs:1457-1477 | engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.TemplateLanguageBlindness.cs:427-447 | engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs:5832-5852 | engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs:5976-5996 | engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs:6219-6239 | engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs:9931-9951 \u2014 there are 6 copies across 3 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 6 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Core/Markup/MarkupParser.cs:1457\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.TemplateLanguageBlindness.cs:450\u0060 calls \u0060Sort\u0060 and \u0060engine/src/CodeHealth.Core/Markup/MarkupParser.cs:1480\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":"engine/src/CodeHealth.Core/Markup/MarkupParser.cs"},"region":{"startLine":1457}}}],"partialFingerprints":{"codehealthFindingId/v1":"082e319a8af61d37c29789e5f7f09fb67471618e5cc712f5106430ce24891d95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 5): engine/src/CodeHealth.Core/Frontend/FrontendDeadCode.cs:947-967 | engine/src/CodeHealth.Core/Frontend/FrontendEngine.cs:389-409 | engine/src/CodeHealth.Core/Frontend/FrontendTestSuiteMasking.cs:819-839 | engine/src/CodeHealth.Core/Frontend/FrontendToolAndRuntimeRefs.cs:124-144 | engine/src/CodeHealth.Core/Frontend/NonProductionTreeReadmission.cs:178-198 \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 5 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Core/Frontend/FrontendDeadCode.cs:947\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. 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":"engine/src/CodeHealth.Core/Frontend/FrontendDeadCode.cs"},"region":{"startLine":947}}}],"partialFingerprints":{"codehealthFindingId/v1":"3497588bf918ce83b76b819e5072e94fd7e382836cddfebcaaa5b310afd6d10a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): engine/src/CodeHealth.Core/Architecture/Topology/Extractors/CrossplaneExtractor.cs:139-159 | engine/src/CodeHealth.Core/Architecture/Topology/Extractors/KubernetesExtractor.cs:83-103 \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":"engine/src/CodeHealth.Core/Architecture/Topology/Extractors/CrossplaneExtractor.cs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"2652931d0465199772b72efb80553801e307f9a19570089f5779aaaae9187a69"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201321 lines \u00D7 2): engine/src/CodeHealth.Core/Frontend/FrontendDependencyHygiene.cs:1306-1326 | engine/src/CodeHealth.Core/Frontend/FrontendDependencyHygiene.cs:1392-1410 \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 \u0060engine/src/CodeHealth.Core/Frontend/FrontendDependencyHygiene.cs:1306\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":"engine/src/CodeHealth.Core/Frontend/FrontendDependencyHygiene.cs"},"region":{"startLine":1306}}}],"partialFingerprints":{"codehealthFindingId/v1":"9da44268f6b1b7d4b5b85817cd2dea6dbd4a9c7d57808e7010b6ee21c8f8fcb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs:7704-7724 | engine/src/CodeHealth.Dimensions.GitMining/ChangeCouplingAnalyzer.cs:5310-5330 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs:7704\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. 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":"engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs"},"region":{"startLine":7704}}}],"partialFingerprints":{"codehealthFindingId/v1":"b79117c26038d221a6cfb740d728aff3e2da859663f774c5daacc1b1431c48a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/CoherenceSmellAnalyzer.cs:46-66 | engine/src/CodeHealth.Core/ModelAware/StringContractSmellAnalyzer.cs:67-87 \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 \u0060engine/src/CodeHealth.Core/ModelAware/CoherenceSmellAnalyzer.cs:46\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":"engine/src/CodeHealth.Core/ModelAware/CoherenceSmellAnalyzer.cs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"f662992613fd4b0be4de6e51a4e2ccff46b2be10aa47d6d1b503d2798ecb3191"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs:2139-2159 | engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs:2207-2227 \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 \u0060engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs:2139\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. 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":"engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs"},"region":{"startLine":2139}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ecdc470fa832c94884ec33f7a75d036dfc18a343cefa9bbf73b4123e4a4d777"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/HeadingLabelQualityAnalyzer.cs:121-141 | engine/src/CodeHealth.Core/ModelAware/LinkTextQualityAnalyzer.cs:124-144 \u2014 before extracting anything, compare \u0060engine/src/CodeHealth.Core/ModelAware/HeadingLabelQualityAnalyzer.cs\u0060 and \u0060engine/src/CodeHealth.Core/ModelAware/LinkTextQualityAnalyzer.cs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 119 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Core/ModelAware/HeadingLabelQualityAnalyzer.cs:121\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/HeadingLabelQualityAnalyzer.cs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b9c702fad7de835aefc9afb6ee6764a6f4c0e5e2b65c53cb43debdf7b36de7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201321 lines \u00D7 2): engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs:373-390 | engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs:728-748 \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 \u0060engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs:373\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":"engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdb8982a0a68d0e11b4a618083f40ed88b4ac05e011a22203dc6a1ec12650579"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): engine/src/CodeHealth.Core/Scoring/CodebaseSize.cs:243-263 | engine/src/CodeHealth.Core/Scoring/DiskSourceFiles.cs:670-690 \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 \u0060engine/src/CodeHealth.Core/Scoring/CodebaseSize.cs:243\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060engine/src/CodeHealth.Core/Scoring/DiskSourceFiles.cs:692\u0060 calls \u0060IsFrontendFamilyExtension\u0060, \u0060GetExtension\u0060 and \u0060engine/src/CodeHealth.Core/Scoring/CodebaseSize.cs:265\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":"engine/src/CodeHealth.Core/Scoring/CodebaseSize.cs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"46d3b6f4bb6d55d01f2293309856da1c0b6c4aa852ecc17bf349646351276f1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): engine/src/CodeHealth.Core/Testing/CommittedCoverageReader.cs:764-784 | engine/src/CodeHealth.Core/Testing/CommittedCoverageReader.cs:1322-1341 \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 \u0060engine/src/CodeHealth.Core/Testing/CommittedCoverageReader.cs:764\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":"engine/src/CodeHealth.Core/Testing/CommittedCoverageReader.cs"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"848a0b0a4b5d65cad6e44f7f94b024ca21d7d9f43611a85e6c2ed69c20f419b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): engine/src/CodeHealth.Dimensions.Security/Scanners/DockerfileShapeRuleFilter.cs:906-925 | engine/src/CodeHealth.Dimensions.Security/Scanners/DockerfileShapeRuleFilter.cs:951-971 \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 \u0060engine/src/CodeHealth.Dimensions.Security/Scanners/DockerfileShapeRuleFilter.cs:906\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":"engine/src/CodeHealth.Dimensions.Security/Scanners/DockerfileShapeRuleFilter.cs"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ea54d84874fedcdc080bb266b82a83dc298c25aa9a83d680ed063a43a034b9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201321 lines \u00D7 2): engine/src/CodeHealth.Dimensions.Security/Scanners/RubyRescueDiscardsCaughtErrorScan.cs:346-364 | engine/src/CodeHealth.Dimensions.Security/Scanners/RubyUnreachableRescueClauseScan.cs:290-310 \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":"engine/src/CodeHealth.Dimensions.Security/Scanners/RubyRescueDiscardsCaughtErrorScan.cs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5e4006086538b465d5bcc9c9e3f6d0c0dbce0a990b155659660f439c01f61ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 3): engine/src/CodeHealth.Core/Frontend/FrontendBoundaries.cs:1514-1533 | engine/src/CodeHealth.Core/Frontend/FrontendModuleGraph.cs:520-539 | engine/src/CodeHealth.Core/Frontend/ModuleGlobPattern.cs:66-85 \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 \u0060engine/src/CodeHealth.Core/Frontend/FrontendBoundaries.cs:1514\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. 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. 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":"engine/src/CodeHealth.Core/Frontend/FrontendBoundaries.cs"},"region":{"startLine":1514}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c0659a17fe9784af3f4690ae151202e74473f6bd881ea29354ba65975fe98d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 3): engine/src/CodeHealth.Cli/Commands/JvmSidecar.cs:1240-1259 | engine/src/CodeHealth.Cli/Commands/JvmSidecar.cs:1284-1303 | engine/src/CodeHealth.Cli/Commands/JvmSidecar.cs:1328-1347 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Cli/Commands/JvmSidecar.cs:1240\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":"engine/src/CodeHealth.Cli/Commands/JvmSidecar.cs"},"region":{"startLine":1240}}}],"partialFingerprints":{"codehealthFindingId/v1":"69a7c2dcdebcb046ff94da234fbdd3ac2c7ab64bf41227cf3c27c4c5c8635503"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): engine/src/CodeHealth.Core/CodeShape/MemberFamilyRollup.cs:504-523 | engine/src/CodeHealth.Core/CodeShape/MemberPairRollup.cs:238-257 \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":"engine/src/CodeHealth.Core/CodeShape/MemberFamilyRollup.cs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"902e69b6356379c0088d75c21cee52582868995b966dbc898759c5b2742ec6ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): engine/src/CodeHealth.Core/Frontend/FrontendBoundaries.cs:781-800 | engine/src/CodeHealth.Core/Frontend/FrontendBoundaries.cs:865-884 \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 \u0060engine/src/CodeHealth.Core/Frontend/FrontendBoundaries.cs:781\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":"engine/src/CodeHealth.Core/Frontend/FrontendBoundaries.cs"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f708e30f0abc4caec3e1035f446f1a2929a093357c816a115f32826821a4e6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201320 lines \u00D7 2): engine/src/CodeHealth.Core/Frontend/FrontendDeclaredPackageRefs.cs:566-583 | engine/src/CodeHealth.Core/Frontend/FrontendSpecifierScanning.cs:28-47 \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 \u0060engine/src/CodeHealth.Core/Frontend/FrontendDeclaredPackageRefs.cs:566\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":"engine/src/CodeHealth.Core/Frontend/FrontendDeclaredPackageRefs.cs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"c41f9d00d7c72b738d6ba9c2d1eff1c926466b781f83367f44ba5347ae1e9b3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs:3838-3856 | engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs:6303-6322 \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 \u0060engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs:3838\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":"engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs"},"region":{"startLine":3838}}}],"partialFingerprints":{"codehealthFindingId/v1":"795d62ebfaa727672efda7ad7683fbd6934205abb49a74d15cc28901781b7cb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201320 lines \u00D7 2): engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs:4252-4271 | engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs:5477-5493 \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 \u0060engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs:4252\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs"},"region":{"startLine":4252}}}],"partialFingerprints":{"codehealthFindingId/v1":"528605412c53bcb545427224bf525f97e7fad06731cd4112931ccaf719a30b37"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs:1159-1178 | engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs:3519-3538 \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 \u0060engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs:1159\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. 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":"engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs"},"region":{"startLine":1159}}}],"partialFingerprints":{"codehealthFindingId/v1":"20b7a68b33afb12d786d9f170198a2fea1f6789ae785a4ca657636758e938648"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs:1023-1045 | engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs:2317-2336 \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 \u0060engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs:1023\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs:2338\u0060 calls \u0060DeclaredConstantsByType\u0060, \u0060Select\u0060 and \u0060engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs:1047\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":"engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs"},"region":{"startLine":1023}}}],"partialFingerprints":{"codehealthFindingId/v1":"2098878184dc22949709a3f2850297533b92b03f49e2684480eff3a1aeb63290"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs:1358-1377 | engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs:1448-1467 \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 \u0060engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs:1358\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":"engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs"},"region":{"startLine":1358}}}],"partialFingerprints":{"codehealthFindingId/v1":"359194ed68d8159756901749b003293f266065f9231e70484ed141aa5e6a5193"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/EventSourcingAnalyzer.cs:273-292 | engine/src/CodeHealth.Core/ModelAware/EventSourcingAnalyzer.cs:687-705 \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 \u0060engine/src/CodeHealth.Core/ModelAware/EventSourcingAnalyzer.cs:273\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. 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":"engine/src/CodeHealth.Core/ModelAware/EventSourcingAnalyzer.cs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d5b0f06e5bb26288060841f11ceed1f18e06e593a6af74a111e8ae4fb620177"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): engine/src/CodeHealth.Core/Security/NativeSecretScanner.cs:2186-2205 | engine/src/CodeHealth.Dimensions.Security/Scanners/ConfigCredentialBindingScan.cs:518-537 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Dimensions.Security/Scanners/ConfigCredentialBindingScan.cs:518\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. 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":"engine/src/CodeHealth.Core/Security/NativeSecretScanner.cs"},"region":{"startLine":2186}}}],"partialFingerprints":{"codehealthFindingId/v1":"08ba923671bd0b2561d36b58b27067d2619112e3031a973dc779b628f0ca1f2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201320 lines \u00D7 2): engine/src/CodeHealth.Dimensions.CodeQuality/Complexity/CognitiveComplexityAnalyzer.cs:36-55 | engine/src/CodeHealth.Dimensions.CodeQuality/Complexity/CyclomaticComplexityAnalyzer.cs:73-83 \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":"engine/src/CodeHealth.Dimensions.CodeQuality/Complexity/CognitiveComplexityAnalyzer.cs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad55c2460d5e43b3dd82eef83f21c57de510ec09e0179b045f09726ad3d5b042"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): engine/src/CodeHealth.Dimensions.Security/Scanners/DuplicateResourceCopyAggregator.cs:259-278 | engine/src/CodeHealth.Dimensions.Security/Scanners/NamespaceScopedRuleAggregator.cs:314-333 \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":"engine/src/CodeHealth.Dimensions.Security/Scanners/DuplicateResourceCopyAggregator.cs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"a09af14d5b9a27506bca8494015506d212ab6f1723d3e07f6a0c60edddf28e2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): engine/src/CodeHealth.Dimensions.Security/Scanners/RubyUnreachableRescueClauseScan.cs:196-215 | engine/src/CodeHealth.Dimensions.Security/Scanners/RubyUnreachableRescueClauseScan.cs:530-549 \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 \u0060engine/src/CodeHealth.Dimensions.Security/Scanners/RubyUnreachableRescueClauseScan.cs:196\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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060lines\u0060 to \u0060IReadOnlyList\u003Cstring\u003E\u0060 in one and \u0060int JudgeableClauses) GroupingAxes(IReadOnlyList\u003Cstring\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/RubyUnreachableRescueClauseScan.cs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c1ff14343987bcab270ee390db2c29b831376e7bd640078fa523efdb7633dd4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3): engine/src/CodeHealth.Core/Dart/DartDeadLibraryField.cs:509-527 | engine/src/CodeHealth.Core/Testing/JsTestQualityCensus.cs:219-237 | engine/src/CodeHealth.Dimensions.Security/Scanners/MarkupEscapingRecheck.cs:253-271 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. 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":"engine/src/CodeHealth.Core/Dart/DartDeadLibraryField.cs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"b20442518d27292e891fcd008af4a483fc0c3dfaacfbe0cc852a265cf5e92130"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3): engine/src/CodeHealth.Core/ModelAware/PhpDomainConventions.cs:471-489 | engine/src/CodeHealth.Core/ModelAware/PythonDomainConventions.cs:465-483 | engine/src/CodeHealth.Core/ModelAware/RubyDomainConventions.cs:645-663 \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":"engine/src/CodeHealth.Core/ModelAware/PhpDomainConventions.cs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"33d6d212e54b27f63fc3c0c08df729f2baae4b3ec5bc63e0749f964ca5701bb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): engine/src/CodeHealth.Core/CodeModel/Roslyn/CSharpCloneTokenizer.cs:95-113 | engine/src/CodeHealth.Core/CodeModel/Roslyn/VbCloneTokenizer.cs:109-127 \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":"engine/src/CodeHealth.Core/CodeModel/Roslyn/CSharpCloneTokenizer.cs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4eb10ee692adbc296e7d991f37960bd395c06dbd95e8f65b6ea032d96dbee74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): engine/src/CodeHealth.Core/CodeShape/Subsumption.cs:74-91 | engine/src/CodeHealth.Core/ModelAware/CoherenceSmellAnalyzer.cs:359-377 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Core/CodeShape/Subsumption.cs:74\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060strong\u0060 to \u0060SubsumptionOperand\u0060 in one and \u0060Pred\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/CodeShape/Subsumption.cs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"d71231cb8bf73dd7de2dd404640b8db6b5fa1ec78bfd25a88f588af34d41a3be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201319 lines \u00D7 2): engine/src/CodeHealth.Core/Markup/MarkupParser.cs:1402-1420 | engine/src/CodeHealth.Core/Testing/TestProjectDetection.cs:349-364 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Core/Markup/MarkupParser.cs:1402\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":"engine/src/CodeHealth.Core/Markup/MarkupParser.cs"},"region":{"startLine":1402}}}],"partialFingerprints":{"codehealthFindingId/v1":"82805ff8f7f0b8ce528b5e4ad0d04bef42f78f0818469e69f063834f4df1a628"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/BodyModelLookup.cs:16-34 | engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs:511-529 \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":"engine/src/CodeHealth.Core/ModelAware/BodyModelLookup.cs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9e468674502372b8bb38830e8dd4b380c2511d076ce7e8675752d5ab42478c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201319 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/DomainConventions.cs:238-256 | engine/src/CodeHealth.Core/ModelAware/DomainConventions.cs:1599-1615 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060type\u0060 to \u0060INamedTypeSymbol\u0060 in one and \u0060Nm.ICodeType\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/DomainConventions.cs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"df19967cd97b1d4a9a64856c1d77a5b775bc1d0ba831d0128d2104b62a52dca1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201319 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs:233-251 | engine/src/CodeHealth.Core/ModelAware/EventSourcingAnalyzer.cs:194-210 \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 \u0060engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs:233\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":"engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"485c87dae80fd9468e6187d4aeae4a15a7550c87f136223e4c168236c848b4ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs:1643-1660 | engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs:5121-5139 \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 \u0060engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs:1643\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":"engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs"},"region":{"startLine":1643}}}],"partialFingerprints":{"codehealthFindingId/v1":"76a199c986a6138ea1776b3ad265096384dfbce27b538d20cd449ff303f7dff7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/EventSourcingAnalyzer.cs:393-411 | engine/src/CodeHealth.Core/ModelAware/EventSourcingAnalyzer.cs:1080-1097 \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 \u0060engine/src/CodeHealth.Core/ModelAware/EventSourcingAnalyzer.cs:393\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060types\u0060 to \u0060IReadOnlyList\u003CINamedTypeSymbol\u003E\u0060 in one and \u0060IReadOnlyList\u003CNm.ICodeType\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/EventSourcingAnalyzer.cs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"daa52c0bebb4b3239bf95a562bf27cf9f47322914a9809b3b614b2141f2570fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201319 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/RepoProfiler.cs:144-162 | engine/src/CodeHealth.Core/ModelAware/RepoProfiler.cs:309-321 \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 \u0060engine/src/CodeHealth.Core/ModelAware/RepoProfiler.cs:144\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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060types\u0060 to \u0060IReadOnlyList\u003CINamedTypeSymbol\u003E\u0060 in one and \u0060IReadOnlyList\u003CNm.ICodeType\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/RepoProfiler.cs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"5597a003b7e3df14410c973ea6c7123f4d4ab5c7545a90eccabd826d43ef16f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201319 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/RepoProfiler.cs:216-231 | engine/src/CodeHealth.Core/ModelAware/RepoProfiler.cs:564-582 \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 \u0060engine/src/CodeHealth.Core/ModelAware/RepoProfiler.cs:216\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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060types\u0060 to \u0060IReadOnlyList\u003CINamedTypeSymbol\u003E\u0060 in one and \u0060IReadOnlyList\u003CNm.ICodeType\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/RepoProfiler.cs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcd0bb8c667748e81cbb98c1a9569df70a69c92bfb413589d331b4766f8ad19b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs:7664-7681 | engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs:8235-8253 \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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":7664}}}],"partialFingerprints":{"codehealthFindingId/v1":"f445a1ddc3d585d25034cce94afef572043d12520a9fae32d074f4543bc49c29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): engine/src/CodeHealth.Dimensions.GitMining/ChangeCouplingAnalyzer.cs:2458-2476 | engine/src/CodeHealth.Dimensions.GitMining/ChangeCouplingAnalyzer.cs:2691-2709 \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 \u0060engine/src/CodeHealth.Dimensions.GitMining/ChangeCouplingAnalyzer.cs:2458\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":"engine/src/CodeHealth.Dimensions.GitMining/ChangeCouplingAnalyzer.cs"},"region":{"startLine":2458}}}],"partialFingerprints":{"codehealthFindingId/v1":"daf7773e4b96d4f9e3a26a74cf33f457bbf85fd091faca56a6a522cb9ef7041b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201318 lines \u00D7 8): src/Kennel.Watchdog.Core/Agents/Ui/RepoDiagnosis.razor:110-124 | src/Kennel.Watchdog.Core/Agents/Ui/RepoFindings.razor:689-703 | src/Kennel.Watchdog.Core/Architecture/Ui/RepoArchitecture.razor:168-182 | src/Kennel.Watchdog.Core/Architecture/Ui/RepoDependencyMatrix.razor:125-139 | src/Kennel.Watchdog.Core/Calibration/Ui/RepoIntegrations.razor:172-186 | src/Kennel.Watchdog.Core/Gallery/Ui/RepoCommunityTags.razor:157-174 | src/Kennel.Watchdog.Core/Reporting/Ui/RepoChangelog.razor:261-275 | src/Kennel.Watchdog.Core/Reporting/Ui/RepoSystemOverview.razor:108-122 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 8 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 8 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Kennel.Watchdog.Core/Agents/Ui/RepoDiagnosis.razor:110\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":"src/Kennel.Watchdog.Core/Agents/Ui/RepoDiagnosis.razor"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"3df8a48718233ae42647e096c899609666c7a90a88d6563846cd2e905f95ce55"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 4): engine/src/CodeHealth.Dimensions.Security/Scanners/BrowserSandboxDisabledScan.cs:112-129 | engine/src/CodeHealth.Dimensions.Security/Scanners/GitOwnershipCheckDisabledScan.cs:82-99 | engine/src/CodeHealth.Dimensions.Security/Scanners/SetuidBinaryGrantScan.cs:58-75 | engine/src/CodeHealth.Dimensions.Security/Scanners/WorldWritableOwnedPathScan.cs:91-108 \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 4 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Dimensions.Security/Scanners/BrowserSandboxDisabledScan.cs:112\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":"engine/src/CodeHealth.Dimensions.Security/Scanners/BrowserSandboxDisabledScan.cs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f0bed9b91d7551f9a4d35578a2f4b10b30596eb11aa716a1df5b6b3d4956387"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201318 lines \u00D7 3): engine/src/CodeHealth.Core/ModelAware/CSharpCorrectnessAnalyzer.cs:224-241 | engine/src/CodeHealth.Core/ModelAware/LogicDefectAnalyzer.cs:161-174 | engine/src/CodeHealth.Core/ModelAware/SecurityDefectAnalyzer.cs:199-212 \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 \u0060engine/src/CodeHealth.Core/ModelAware/LogicDefectAnalyzer.cs:161\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":"engine/src/CodeHealth.Core/ModelAware/CSharpCorrectnessAnalyzer.cs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"14228a9d29d9843a96f4650bb6a4a5faa62339a69f52f25245c27ac0f7b711e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201318 lines \u00D7 3): engine/src/CodeHealth.Core/ModelAware/IncompletenessAnalyzer.cs:3252-3269 | engine/src/CodeHealth.Core/ModelAware/MutationIdempotencyAnalyzer.cs:1523-1538 | engine/src/CodeHealth.Dimensions.Security/Scanners/RubyDuplicateMethodDefinitionScan.cs:293-308 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Core/ModelAware/IncompletenessAnalyzer.cs:3252\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. 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060engine/src/CodeHealth.Core/ModelAware/IncompletenessAnalyzer.cs:3249\u0060 calls \u0060ContainsAwaitWord\u0060 and \u0060engine/src/CodeHealth.Core/ModelAware/MutationIdempotencyAnalyzer.cs:1521\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":"engine/src/CodeHealth.Core/ModelAware/IncompletenessAnalyzer.cs"},"region":{"startLine":3252}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a9b27f6e972b9cd7a0b15ace2fda24791aa4abd790a2066a11e6bcf8d1872c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3): src/Kennel.Assay.Core/Billing/Ui/PlanChange.razor:117-134 | src/Kennel.Core/Billing/Ui/OrgBranding.razor:107-124 | src/Kennel.Watchdog.Core/Billing/Ui/PlanChange.razor:186-203 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Kennel.Assay.Core/Billing/Ui/PlanChange.razor"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"885b8d7ba575b84b80105302d3f973149ce022d376ac89dde010cc7b6f23d4db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): engine/src/CodeHealth.Core/CodeModel/Roslyn/CSharpCloneTokenizer.cs:56-73 | engine/src/CodeHealth.Core/CodeModel/Roslyn/VbCloneTokenizer.cs:50-67 \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 \u0060engine/src/CodeHealth.Core/CodeModel/Roslyn/CSharpCloneTokenizer.cs:56\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060engine/src/CodeHealth.Core/CodeModel/Roslyn/CSharpCloneTokenizer.cs:77\u0060 calls \u0060Append\u0060 and \u0060engine/src/CodeHealth.Core/CodeModel/Roslyn/VbCloneTokenizer.cs:69\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":"engine/src/CodeHealth.Core/CodeModel/Roslyn/CSharpCloneTokenizer.cs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"708e87a76a8b86791b6242d94c7dd359e2811e4fc4cdca7a76ff29025b459063"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): engine/src/CodeHealth.Core/CodeModel/Roslyn/CSharpCloneTokenizer.cs:125-142 | engine/src/CodeHealth.Core/CodeModel/Roslyn/VbCloneTokenizer.cs:135-152 \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 \u0060engine/src/CodeHealth.Core/CodeModel/Roslyn/CSharpCloneTokenizer.cs:125\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. 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":"engine/src/CodeHealth.Core/CodeModel/Roslyn/CSharpCloneTokenizer.cs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"b57c5522fd1f224b86099b12f2c9a287302758a2ab46f26e8ccf9b7a563aa9b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs:1980-1996 | engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs:3432-3449 \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. 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":"engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs"},"region":{"startLine":1980}}}],"partialFingerprints":{"codehealthFindingId/v1":"a404fa93f633f58060723e840aa248c8900e04a679637391dbba7d4f126699f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): engine/src/CodeHealth.Core/Dependencies/GoModuleHygiene.cs:126-143 | engine/src/CodeHealth.Core/Dependencies/MixManifestHygiene.cs:76-93 \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 \u0060engine/src/CodeHealth.Core/Dependencies/GoModuleHygiene.cs:126\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":"engine/src/CodeHealth.Core/Dependencies/GoModuleHygiene.cs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"48c3d10b41f488f20556a595709c9c07807831e8faa201704ad702683ec3ace6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): engine/src/CodeHealth.Core/Frontend/BuildOutputSources.cs:100-118 | engine/src/CodeHealth.Core/Frontend/BuildOutputSources.cs:200-217 \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 \u0060engine/src/CodeHealth.Core/Frontend/BuildOutputSources.cs:100\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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. 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":"engine/src/CodeHealth.Core/Frontend/BuildOutputSources.cs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ac86533d965c5387638890db02c85c52ab7225db011aea7df9b04e79b9ee354"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): engine/src/CodeHealth.Core/Frontend/JsConstantOnlyField.cs:453-470 | engine/src/CodeHealth.Core/Frontend/JsScopeBindings.cs:982-999 \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 \u0060engine/src/CodeHealth.Core/Frontend/JsConstantOnlyField.cs:453\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":"engine/src/CodeHealth.Core/Frontend/JsConstantOnlyField.cs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"f17ee65ea3cc25711639f2f1e11b7d79191ce6446091196fdc2c2663f2c3bba3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): engine/src/CodeHealth.Core/Markup/TemplMarkupProducer.cs:276-293 | engine/src/CodeHealth.Core/Markup/TemplateLanguageMarkupProducer.cs:389-406 \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 \u0060engine/src/CodeHealth.Core/Markup/TemplMarkupProducer.cs:276\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":"engine/src/CodeHealth.Core/Markup/TemplMarkupProducer.cs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec92b850bcc36e533f2ee8604b8bdb032544813c19635eecdf0afdbd19e473ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/PhpDomainConventions.cs:539-556 | engine/src/CodeHealth.Core/ModelAware/RubyDomainConventions.cs:721-738 \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":"engine/src/CodeHealth.Core/ModelAware/PhpDomainConventions.cs"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce6188a33709d78b59307baff2985752d7b34e3816dbd4b251b45dc4057b7734"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): engine/src/CodeHealth.Core/Testing/CommittedCoverageReader.cs:350-368 | engine/src/CodeHealth.Core/Testing/CommittedCoverageReader.cs:1119-1136 \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 \u0060engine/src/CodeHealth.Core/Testing/CommittedCoverageReader.cs:350\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":"engine/src/CodeHealth.Core/Testing/CommittedCoverageReader.cs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3d91a04312894ccbaae63443d3d89344d6c68e11f7c845b4bd641c2c8dc9209"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): engine/src/CodeHealth.Core/Testing/CommittedCoverageReader.cs:412-429 | engine/src/CodeHealth.Core/Testing/CoverageReportAdvice.cs:420-437 \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":"engine/src/CodeHealth.Core/Testing/CommittedCoverageReader.cs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2bdce2546c0e5558f0f46ccf08c3914657a8090047fe82ff3819c3664831a60"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): engine/src/CodeHealth.Core/Testing/CommittedCoverageReader.cs:1180-1197 | engine/src/CodeHealth.Core/Testing/CommittedCoverageReader.cs:1300-1317 \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 \u0060engine/src/CodeHealth.Core/Testing/CommittedCoverageReader.cs:1180\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. 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":"engine/src/CodeHealth.Core/Testing/CommittedCoverageReader.cs"},"region":{"startLine":1180}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed0fc8e9bc84e01330bc6f4c411b5fc5bd5eef93870755881d5190e988b282fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201318 lines \u00D7 2): engine/src/CodeHealth.History/RunSidecar.cs:92-105 | engine/src/CodeHealth.Reporting/RunReport.cs:222-239 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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":"engine/src/CodeHealth.History/RunSidecar.cs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"a37ea1d513962e9f6c39560687439350c78c39a6c20b7f6f654d939ac524f244"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): engine/src/CodeHealth.Dimensions.Security/Scanners/JsDeadFieldRoundTripRecheck.cs:57-73 | engine/src/CodeHealth.Dimensions.Security/Scanners/JsRedundantReDefaultRecheck.cs:56-73 \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 \u0060engine/src/CodeHealth.Dimensions.Security/Scanners/JsDeadFieldRoundTripRecheck.cs:57\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/JsDeadFieldRoundTripRecheck.cs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"dabee7f155f9ec4b74bc0eceeedb76c19f069cf47b9b7507fbc8b39a8a8bf635"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): engine/src/CodeHealth.Core/Architecture/ProjectSizeAnalyzer.cs:202-218 | engine/src/CodeHealth.Dimensions.Docs/AdrConformanceAnalyzer.cs:189-205 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Architecture/ProjectSizeAnalyzer.cs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"994793dd2875186285ec50172a4960c73cf32ba256d89224b7b96953cba22f13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): engine/src/CodeHealth.Core/CodeShape/RoslynDuplicationDetector.cs:3723-3739 | engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs:6503-6519 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/CodeShape/RoslynDuplicationDetector.cs"},"region":{"startLine":3723}}}],"partialFingerprints":{"codehealthFindingId/v1":"76c243321756a4b3683625297473f812d5b091d59663f43e92629a3f7043afc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): engine/src/CodeHealth.Core/Dependencies/UnityLockfileReader.cs:129-145 | engine/src/CodeHealth.Core/Dependencies/UnityPackageHygiene.cs:136-152 \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 \u0060engine/src/CodeHealth.Core/Dependencies/UnityLockfileReader.cs:129\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":"engine/src/CodeHealth.Core/Dependencies/UnityLockfileReader.cs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"727ace2f080e605bb79d0d63d67f74f8218efc289d94f63daf228a457de59e7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): engine/src/CodeHealth.Core/Discovery/UnityProjectPresence.cs:170-187 | engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs:1543-1559 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Core/Discovery/UnityProjectPresence.cs:170\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Discovery/UnityProjectPresence.cs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"decdc84f71a69005150fe2fadf33e46a92ff67029a43495761fb44742481ce73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): engine/src/CodeHealth.Core/Frontend/FrontendTestSuiteMasking.cs:653-669 | engine/src/CodeHealth.Dimensions.Security/Scanners/JsValueFlow.cs:122-138 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Core/Frontend/FrontendTestSuiteMasking.cs:653\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":"engine/src/CodeHealth.Core/Frontend/FrontendTestSuiteMasking.cs"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e94b5ff78a6cb69a8f82918eacb4aace14fdd9e9af1ee2d6a1f7fa50b131724"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs:1590-1613 | engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs:5002-5018 \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 \u0060engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs:1590\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs:1614\u0060 calls \u0060Add\u0060, \u0060RepositoryTypeKey\u0060 and \u0060engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs:5019\u0060 does not \u2014 after which the two agree again for 3 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":"engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs"},"region":{"startLine":1590}}}],"partialFingerprints":{"codehealthFindingId/v1":"899ebf2667d4c006057e68b5822934e35260761de1226c606b7e37e52aee1671"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/JavaDomainConventions.cs:547-563 | engine/src/CodeHealth.Core/ModelAware/PythonDomainConventions.cs:355-371 \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 \u0060engine/src/CodeHealth.Core/ModelAware/JavaDomainConventions.cs:547\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":"engine/src/CodeHealth.Core/ModelAware/JavaDomainConventions.cs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a910fb43469085f939815f4920268210db715b49ddd79829d3139d35bad5f29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/RuntimeAccessibility/BootedAppRenderer.cs:162-178 | engine/src/CodeHealth.Core/ModelAware/RuntimeAccessibility/BootedAppRenderer.cs:246-260 \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 \u0060engine/src/CodeHealth.Core/ModelAware/RuntimeAccessibility/BootedAppRenderer.cs:162\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":"engine/src/CodeHealth.Core/ModelAware/RuntimeAccessibility/BootedAppRenderer.cs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ac27353b98f406f8a8a9b683b13c34bac17ccf3933c013425f6c8ab562b63ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): engine/src/CodeHealth.Core/Readiness/CiRerunUntilGreenGate.cs:379-395 | engine/src/CodeHealth.Dimensions.Security/Scanners/NginxDirectiveRecheck.cs:337-353 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Core/Readiness/CiRerunUntilGreenGate.cs:379\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":"engine/src/CodeHealth.Core/Readiness/CiRerunUntilGreenGate.cs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"306858255159bf9e942157fa6533866fe696805250c28a9d1ed0834e0affb977"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): engine/src/CodeHealth.Toolchain/Git/GitTrackedPaths.cs:30-46 | engine/src/CodeHealth.Toolchain/Git/GitTrackedPaths.cs:58-74 \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 \u0060engine/src/CodeHealth.Toolchain/Git/GitTrackedPaths.cs:30\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":"engine/src/CodeHealth.Toolchain/Git/GitTrackedPaths.cs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a720bd47582e3c5b56be3770925601b3fbbd421ed5b3f593a909d80b79dd6f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): engine/src/CodeHealth.Dimensions.Docs/Llm/LlmAdrConformanceChecker.cs:55-71 | engine/src/CodeHealth.Dimensions.Docs/Llm/LlmAdrEvaluator.cs:73-89 \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 \u0060engine/src/CodeHealth.Dimensions.Docs/Llm/LlmAdrConformanceChecker.cs:55\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060engine/src/CodeHealth.Dimensions.Docs/Llm/LlmAdrEvaluator.cs:73\u0060 calls \u0060Increment\u0060 and \u0060engine/src/CodeHealth.Dimensions.Docs/Llm/LlmAdrConformanceChecker.cs:55\u0060 does not \u2014 after which the two agree again for 5 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":"engine/src/CodeHealth.Dimensions.Docs/Llm/LlmAdrConformanceChecker.cs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ea37bc8a3b33bf801228c737cf77f6bbfee1dca1a0acb17a71dad09746bd782"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): engine/src/CodeHealth.Llm.ClaudeCli/ClaudeCliLlmProvider.cs:90-106 | engine/src/CodeHealth.Llm.CopilotCli/CopilotCliLlmProvider.cs:103-119 \u2014 before extracting anything, compare \u0060engine/src/CodeHealth.Llm.ClaudeCli/ClaudeCliLlmProvider.cs\u0060 and \u0060engine/src/CodeHealth.Llm.CopilotCli/CopilotCliLlmProvider.cs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060engine/src/CodeHealth.Llm.CopilotCli/CopilotCliLlmProvider.cs:99\u0060 calls \u0060Fail\u0060 and \u0060engine/src/CodeHealth.Llm.ClaudeCli/ClaudeCliLlmProvider.cs:86\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":"engine/src/CodeHealth.Llm.ClaudeCli/ClaudeCliLlmProvider.cs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"09a3255d822dec8fc729921dab6473b6d55aa99f48f2437637d9efd79a5a8a8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 6): engine/src/CodeHealth.Core/Scoring/DiskSourceFiles.cs:1512-1530 | engine/src/CodeHealth.Core/Scoring/DiskSourceFiles.cs:1582-1600 | engine/src/CodeHealth.Core/Testing/DiskTestScanner.cs:468-483 | engine/src/CodeHealth.Core/Testing/DiskTestScanner.cs:607-622 | engine/src/CodeHealth.Core/Testing/DiskTestScanner.cs:946-961 | engine/src/CodeHealth.Core/Testing/DiskTestScanner.cs:1212-1227 \u2014 there are 6 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 6 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Core/Scoring/DiskSourceFiles.cs:1512\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060engine/src/CodeHealth.Core/Testing/DiskTestScanner.cs:944\u0060 calls \u0060IsTestsDir\u0060, \u0060HasConventionalTestDirSegment\u0060 and \u0060engine/src/CodeHealth.Core/Scoring/DiskSourceFiles.cs:1510\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":"engine/src/CodeHealth.Core/Scoring/DiskSourceFiles.cs"},"region":{"startLine":1512}}}],"partialFingerprints":{"codehealthFindingId/v1":"a589dc353e3d3e78bb8cc421afea964196d1fca6ff3c4107f32e8629441d0af7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): engine/src/CodeHealth.Core/Dependencies/OsvAdvisoryClient.cs:252-267 | engine/src/CodeHealth.Core/Frontend/FrontendManifestParsing.cs:149-164 | engine/src/CodeHealth.Dimensions.Security/Scanners/ScanParsers.cs:2022-2037 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Dimensions.Security/Scanners/ScanParsers.cs:2022\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. 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":"engine/src/CodeHealth.Core/Dependencies/OsvAdvisoryClient.cs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"1713e8ac4ed4412a61b6a68f17ccdd043231d99af4b27547cafa34fb35b1ca14"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): engine/src/CodeHealth.Core/Testing/JsTestQualityCensus.cs:704-719 | engine/src/CodeHealth.Dimensions.CodeQuality/CodeShape/DuplicationAnalyzer.cs:3403-3418 | engine/src/CodeHealth.Dimensions.Security/Scanners/SemgrepUnsafeAdvice.cs:277-292 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. 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":"engine/src/CodeHealth.Core/Testing/JsTestQualityCensus.cs"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"61fb6cb11eeae1a2b27c6a45cf3bacd84c312bb247e1a49f0866a9d40c6a78ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 3): engine/src/CodeHealth.Dimensions.Security/Scanners/MutableGitCloneScan.cs:173-188 | engine/src/CodeHealth.Dimensions.Security/Scanners/MutableGitCloneScan.cs:251-265 | engine/src/CodeHealth.Dimensions.Security/Scanners/MutableGitCloneScan.cs:300-314 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Dimensions.Security/Scanners/MutableGitCloneScan.cs:173\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/MutableGitCloneScan.cs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc1df2dacdc66b021709d36d52707074f0a0c0ab8baf14519505fa1b48ad2fb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): engine/src/CodeHealth.Core/CodeModel/Roslyn/CSharpBranchExtractor.cs:288-303 | engine/src/CodeHealth.Core/Complexity/CognitiveComplexityCalculator.cs:97-112 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Core/CodeModel/Roslyn/CSharpBranchExtractor.cs:288\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":"engine/src/CodeHealth.Core/CodeModel/Roslyn/CSharpBranchExtractor.cs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bda0b87ea483380c9304f172c525bd9c32fd8060a63faeec49d2408b5b1e6f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201316 lines \u00D7 2): engine/src/CodeHealth.Core/Dependencies/HexVersion.cs:193-208 | engine/src/CodeHealth.Core/Dependencies/NpmVersion.cs:93-101 \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 \u0060engine/src/CodeHealth.Core/Dependencies/HexVersion.cs:193\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. 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":"engine/src/CodeHealth.Core/Dependencies/HexVersion.cs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d13f798eee7278f4808a4fca2f78757794d93aee69e1ac95e77e75175aa5717"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): engine/src/CodeHealth.Core/ExplicitDebt/RoslynExplicitDebtCollector.cs:5815-5830 | engine/src/CodeHealth.Core/ExplicitDebt/RoslynExplicitDebtCollector.cs:5864-5879 \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 \u0060engine/src/CodeHealth.Core/ExplicitDebt/RoslynExplicitDebtCollector.cs:5815\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":"engine/src/CodeHealth.Core/ExplicitDebt/RoslynExplicitDebtCollector.cs"},"region":{"startLine":5815}}}],"partialFingerprints":{"codehealthFindingId/v1":"80b8ec0b9d440c692f96eb08070ab4a4dddb44eb789af09c8abb1f6ca7c04351"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): engine/src/CodeHealth.Core/Frontend/ModuleResolver.cs:748-761 | engine/src/CodeHealth.Core/Frontend/ModuleResolver.cs:768-783 \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":"engine/src/CodeHealth.Core/Frontend/ModuleResolver.cs"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e21370a7796b4f3a4fef81ea91e43b51a4efd162ad87cf95a2596183dad9cec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): engine/src/CodeHealth.Core/Maturity/MaturityAnalyzer.cs:2158-2173 | engine/src/CodeHealth.Core/Testing/DiskTestScanner.cs:753-768 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Core/Maturity/MaturityAnalyzer.cs:2158\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":"engine/src/CodeHealth.Core/Maturity/MaturityAnalyzer.cs"},"region":{"startLine":2158}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d63d32c486b3e0026cf6f93b98f220724731f0320e8652043024516a097c712"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs:8296-8310 | engine/src/CodeHealth.Dimensions.Security/Scanners/MarkupEscapingRecheck.cs:747-762 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs:8296\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":"engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs"},"region":{"startLine":8296}}}],"partialFingerprints":{"codehealthFindingId/v1":"e404e7d9cff1034a57327e9919b69427921b13efc13419ad8cdf37a5791eb6c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/JavaDomainConventions.cs:541-555 | engine/src/CodeHealth.Core/ModelAware/PhpDomainConventions.cs:173-188 \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 \u0060engine/src/CodeHealth.Core/ModelAware/JavaDomainConventions.cs:541\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/JavaDomainConventions.cs"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"625209b97e4b9b3e2cd4d549e87be4fde3f2aaabd54e4ce675887e1ae4147351"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): engine/src/CodeHealth.Core/Scoring/DeclaredScriptExecutables.cs:317-332 | engine/src/CodeHealth.Core/Scoring/DeclaredScriptExecutables.cs:428-443 \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 \u0060engine/src/CodeHealth.Core/Scoring/DeclaredScriptExecutables.cs:317\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":"engine/src/CodeHealth.Core/Scoring/DeclaredScriptExecutables.cs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"edb116ea8d414217e53eff461a296802097caa5fa908af30f0305fa656b40bb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201316 lines \u00D7 2): engine/src/CodeHealth.Cli/Commands/AnalyzeCommand.cs:4798-4813 | engine/src/CodeHealth.Cli/Commands/AnalyzeCommand.cs:4898-4907 \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 \u0060engine/src/CodeHealth.Cli/Commands/AnalyzeCommand.cs:4798\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"engine/src/CodeHealth.Cli/Commands/AnalyzeCommand.cs"},"region":{"startLine":4798}}}],"partialFingerprints":{"codehealthFindingId/v1":"7536fe7ea4986c98ed979af46604dacf5b56ce8c3e831a0fd7081883e795e56b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): engine/src/CodeHealth.Reporting/Findings/FindingsSummaryBuilder.cs:136-151 | engine/src/CodeHealth.Reporting/Templates/ReportViewModelFactory.cs:1683-1698 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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":"engine/src/CodeHealth.Reporting/Findings/FindingsSummaryBuilder.cs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"f67d3cdc875296db7785f102f5436d5db69253fe3317cd58eec442f07f5bbb29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): engine/src/CodeHealth.Reporting/Security/SecurityWatchRenderer.cs:123-138 | engine/src/CodeHealth.Reporting/Security/SecurityWatchRenderer.cs:155-170 \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 \u0060engine/src/CodeHealth.Reporting/Security/SecurityWatchRenderer.cs:123\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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060current\u0060 to \u0060RunSidecar\u0060 in one and \u0060IReadOnlyList\u003Cstring\u003E Cleared) NewAndClearedLabels(RunSidecar\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Reporting/Security/SecurityWatchRenderer.cs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b11aca4852625a2ce4a6612b974e96bf1fdd65351a88ac0a6592793e8b3a40e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): engine/src/CodeHealth.Dimensions.Security/Scanners/DockerfileHardeningAdvice.cs:63-78 | engine/src/CodeHealth.Dimensions.Security/Scanners/DockerfileHardeningAdvice.cs:320-334 \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 \u0060engine/src/CodeHealth.Dimensions.Security/Scanners/DockerfileHardeningAdvice.cs:63\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/DockerfileHardeningAdvice.cs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d94f1ed1cbcf704262d4967feef9abc3bb4f1a473fe9daecd1d423351cba4c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): engine/src/CodeHealth.Dimensions.Security/Scanners/SecretNoiseFilter.cs:2568-2582 | engine/src/CodeHealth.Dimensions.Security/Scanners/SecretNoiseFilter.cs:2648-2663 \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 \u0060engine/src/CodeHealth.Dimensions.Security/Scanners/SecretNoiseFilter.cs:2568\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":"engine/src/CodeHealth.Dimensions.Security/Scanners/SecretNoiseFilter.cs"},"region":{"startLine":2568}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bd8c0acff16b47b20574e4168b640f2c6c4c08d7b6ed0027d6a5e5e48dece7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): engine/src/CodeHealth.Dimensions.Security/SecretsHistoryAnalyzer.cs:696-711 | engine/src/CodeHealth.Dimensions.Security/SecretsHistoryAnalyzer.cs:755-770 \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 \u0060engine/src/CodeHealth.Dimensions.Security/SecretsHistoryAnalyzer.cs:696\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":"engine/src/CodeHealth.Dimensions.Security/SecretsHistoryAnalyzer.cs"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fbde0f24b5e1ff6de3945c931a1b78dc6a04ef4ab77dd2930d9bd0a7e04e95c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): engine/src/CodeHealth.Dimensions.GitMining/ChangeCouplingAnalyzer.cs:5362-5377 | engine/src/CodeHealth.Dimensions.GitMining/ChangeCouplingAnalyzer.cs:5730-5745 \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 \u0060engine/src/CodeHealth.Dimensions.GitMining/ChangeCouplingAnalyzer.cs:5362\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060engine/src/CodeHealth.Dimensions.GitMining/ChangeCouplingAnalyzer.cs:5729\u0060 calls \u0060FullPath\u0060 and \u0060engine/src/CodeHealth.Dimensions.GitMining/ChangeCouplingAnalyzer.cs:5361\u0060 does not \u2014 after which the two agree again for 3 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":"engine/src/CodeHealth.Dimensions.GitMining/ChangeCouplingAnalyzer.cs"},"region":{"startLine":5362}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eb2757fddad60336a16d2fd2df74c7d7953470f916218b7bc457354dbb49596"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/Kennel.Watchdog.Core/Agents/Ui/RepoAutomation.razor:233-248 | src/Kennel.Watchdog.Core/Security/Ui/RepoThreatModel.razor:267-282 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Kennel.Watchdog.Core/Agents/Ui/RepoAutomation.razor:233\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":"src/Kennel.Watchdog.Core/Agents/Ui/RepoAutomation.razor"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"1279e4fb5ad2162b626807173d64f02612e2e3dd8bed05c8f5b3b61f0afb0c02"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/Kennel.Core/Questionnaires/Ui/ExamRunner.razor:281-296 | src/Kennel.Core/Questionnaires/Ui/ReviewRunner.razor:545-560 \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 \u0060src/Kennel.Core/Questionnaires/Ui/ExamRunner.razor:281\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":"src/Kennel.Core/Questionnaires/Ui/ExamRunner.razor"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"05780cc0fbd223a3f0f6112656b7e4b790ebb7b231fe83fd19842afc102bea02"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201315 lines \u00D7 5): engine/src/CodeHealth.Core/ModelAware/CoherenceSmellAnalyzer.cs:45-58 | engine/src/CodeHealth.Core/ModelAware/LogicDefectAnalyzer.cs:140-154 | engine/src/CodeHealth.Core/ModelAware/MarkupTaintPass.cs:344-354 | engine/src/CodeHealth.Core/ModelAware/SecurityDefectAnalyzer.cs:178-192 | engine/src/CodeHealth.Core/ModelAware/StringContractSmellAnalyzer.cs:66-79 \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 5 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Core/ModelAware/CoherenceSmellAnalyzer.cs:45\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":"engine/src/CodeHealth.Core/ModelAware/CoherenceSmellAnalyzer.cs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"e33a3e880a21627dbbd8f96669452a96dd4b6ca989b1044cc1fe670c5a900def"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 4): engine/src/CodeHealth.Dimensions.Security/Scanners/ComposeRuntimeSocketMountScan.cs:195-209 | engine/src/CodeHealth.Dimensions.Security/Scanners/ComposeServiceSurface.cs:300-314 | engine/src/CodeHealth.Dimensions.Security/Scanners/DockerfileSyntax.cs:619-633 | engine/src/CodeHealth.Dimensions.Security/Scanners/WranglerPlaintextVarScan.cs:395-409 \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 4 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Dimensions.Security/Scanners/ComposeRuntimeSocketMountScan.cs:195\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":"engine/src/CodeHealth.Dimensions.Security/Scanners/ComposeRuntimeSocketMountScan.cs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0a04c748060648347f43e2815b7147eb3a1aa87e3a867e4670de399212e32e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs:3532-3546 | engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs:3593-3607 | engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs:3767-3781 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs:3532\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":"engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs"},"region":{"startLine":3532}}}],"partialFingerprints":{"codehealthFindingId/v1":"1864a6fd340a6d405b8bb0e99dfa7be10ae70f4bb1b28d221a983cd6c364edfa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs:1871-1885 | engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs:1897-1911 | engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs:1924-1938 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs:1871\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":"engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs"},"region":{"startLine":1871}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad0cf3798d5dcf3656a4b02775ed2728bc673de63f2553d2fc0b49391f0ec9b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): engine/src/CodeHealth.Core/Architecture/Topology/Extractors/BicepExtractor.cs:144-158 | engine/src/CodeHealth.Core/Architecture/Topology/Extractors/TerraformExtractor.cs:159-173 \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 \u0060engine/src/CodeHealth.Core/Architecture/Topology/Extractors/BicepExtractor.cs:144\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. 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":"engine/src/CodeHealth.Core/Architecture/Topology/Extractors/BicepExtractor.cs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"13d2e280ca2505df86a4703a244b1016e2595cde2af55de2a824959513670060"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): engine/src/CodeHealth.Core/CodeModel/Roslyn/RoslynMethodBody.cs:120-134 | engine/src/CodeHealth.Core/CodeModel/Roslyn/RoslynVbMethodBody.cs:124-138 \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 \u0060engine/src/CodeHealth.Core/CodeModel/Roslyn/RoslynMethodBody.cs:120\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":"engine/src/CodeHealth.Core/CodeModel/Roslyn/RoslynMethodBody.cs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab33ae4824e14f51c05737f7457cf6772888cae1c375e78adf0a60d877904fca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): engine/src/CodeHealth.Core/CodeModel/Roslyn/RoslynMethodBody.cs:225-239 | engine/src/CodeHealth.Core/CodeModel/Roslyn/RoslynVbMethodBody.cs:194-208 \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, \u0060engine/src/CodeHealth.Core/CodeModel/Roslyn/RoslynMethodBody.cs:218\u0060 calls \u0060RoslynTypeRef\u0060 and \u0060engine/src/CodeHealth.Core/CodeModel/Roslyn/RoslynVbMethodBody.cs:188\u0060 does not \u2014 after which the two agree again for 3 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":"engine/src/CodeHealth.Core/CodeModel/Roslyn/RoslynMethodBody.cs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"70b1af766bc6a090e8ba64eee94b8ea1d8cf9eee79bede9865334fb2ec0ce001"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): engine/src/CodeHealth.Core/CodeShape/RoslynDuplicationDetector.cs:2236-2250 | engine/src/CodeHealth.Core/CodeShape/RoslynDuplicationDetector.cs:2603-2617 \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. 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060engine/src/CodeHealth.Core/CodeShape/RoslynDuplicationDetector.cs:2600\u0060 calls \u0060Exists\u0060 and \u0060engine/src/CodeHealth.Core/CodeShape/RoslynDuplicationDetector.cs:2234\u0060 does not \u2014 after which the two agree again for 4 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":"engine/src/CodeHealth.Core/CodeShape/RoslynDuplicationDetector.cs"},"region":{"startLine":2236}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9f927c5896487733aab2f0f3698ffdf7457c7beae2a2c144cb42decf366c5fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): engine/src/CodeHealth.Core/Discovery/FrontendSourcePresence.cs:60-74 | engine/src/CodeHealth.Core/Discovery/FrontendSourcePresence.cs:126-140 \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 \u0060engine/src/CodeHealth.Core/Discovery/FrontendSourcePresence.cs:60\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":"engine/src/CodeHealth.Core/Discovery/FrontendSourcePresence.cs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fbbfe6fa6923c0bf038df9373536e8df3a30f6140eb370f3fe0fd4a142e88f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): engine/src/CodeHealth.Core/Discovery/UnreadManifestDisclosure.cs:320-334 | engine/src/CodeHealth.Core/Discovery/UnreadManifestDisclosure.cs:370-384 \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 \u0060engine/src/CodeHealth.Core/Discovery/UnreadManifestDisclosure.cs:320\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":"engine/src/CodeHealth.Core/Discovery/UnreadManifestDisclosure.cs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"28f08d78fdc12983d3aae726dbafb29bdd30cdef73127820f81a6aa4a127a15f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): engine/src/CodeHealth.Core/ExplicitDebt/RoslynExplicitDebtCollector.cs:1856-1891 | engine/src/CodeHealth.Core/ExplicitDebt/RoslynExplicitDebtCollector.cs:1905-1919 \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. 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":"engine/src/CodeHealth.Core/ExplicitDebt/RoslynExplicitDebtCollector.cs"},"region":{"startLine":1856}}}],"partialFingerprints":{"codehealthFindingId/v1":"83e69bd62f698dc0683dce37234bef88c508b3732306b25195a05cf41d5b27fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): engine/src/CodeHealth.Core/Frontend/FrontendScriptCommandRefs.cs:973-987 | engine/src/CodeHealth.Core/Frontend/FrontendWorkspaceWalk.cs:84-96 \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 \u0060engine/src/CodeHealth.Core/Frontend/FrontendScriptCommandRefs.cs:973\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":"engine/src/CodeHealth.Core/Frontend/FrontendScriptCommandRefs.cs"},"region":{"startLine":973}}}],"partialFingerprints":{"codehealthFindingId/v1":"20c1f9c10bdcc54449a8b0cade1d516374758724aeea724bd1762f1a82a67165"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): engine/src/CodeHealth.Core/Frontend/FrontendSpecifierScanning.cs:267-281 | engine/src/CodeHealth.Core/Frontend/FrontendSpecifierScanning.cs:441-455 \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 \u0060engine/src/CodeHealth.Core/Frontend/FrontendSpecifierScanning.cs:267\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. 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":"engine/src/CodeHealth.Core/Frontend/FrontendSpecifierScanning.cs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"b66a27700a284d4a01ec60c3582d379578afca9c086531e05a9d1cf51dc563cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs:4453-4467 | engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs:5657-5670 \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 \u0060engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs:5657\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":"engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs"},"region":{"startLine":4453}}}],"partialFingerprints":{"codehealthFindingId/v1":"534046e848a353c4e8634ad757ad9953d2910da1697e237ccf62568442dbc802"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): engine/src/CodeHealth.Core/Markup/MarkupParser.cs:1641-1655 | engine/src/CodeHealth.Dimensions.Security/Scanners/PrimaryConstructorShadow.cs:299-313 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Core/Markup/MarkupParser.cs:1641\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":"engine/src/CodeHealth.Core/Markup/MarkupParser.cs"},"region":{"startLine":1641}}}],"partialFingerprints":{"codehealthFindingId/v1":"23d8568a9de65b0628d697ecae72a2242c8dacb3b5c4260f4106002ec2f5f72a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): engine/src/CodeHealth.Core/Maturity/MaturityAnalyzer.cs:392-404 | engine/src/CodeHealth.Core/Maturity/MaturityAnalyzer.cs:4028-4042 \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 \u0060engine/src/CodeHealth.Core/Maturity/MaturityAnalyzer.cs:392\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":"engine/src/CodeHealth.Core/Maturity/MaturityAnalyzer.cs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"85878cf2317e4ae0933ec179fea3d2af3d427b34942bea3eef61bb37b9809046"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/ArchitectureModelAnalyzer.cs:642-656 | engine/src/CodeHealth.Core/ModelAware/ArchitectureModelAnalyzer.cs:2203-2217 \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 \u0060engine/src/CodeHealth.Core/ModelAware/ArchitectureModelAnalyzer.cs:642\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. 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":"engine/src/CodeHealth.Core/ModelAware/ArchitectureModelAnalyzer.cs"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ea4df261d6064411777a8c1efc385d722045e3f30ce3dfd9acafe13cd4d3f1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/ElixirDomainConventions.cs:174-188 | engine/src/CodeHealth.Core/ModelAware/PhpDomainConventions.cs:371-385 \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 \u0060engine/src/CodeHealth.Core/ModelAware/ElixirDomainConventions.cs:174\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":"engine/src/CodeHealth.Core/ModelAware/ElixirDomainConventions.cs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"642e9b7d28a66ff1b6a05199800c2d13dcd03bde17260938169eafb8fb7a1cf6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/JavaDomainConventions.cs:262-276 | engine/src/CodeHealth.Core/ModelAware/PythonDomainConventions.cs:511-525 \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 \u0060engine/src/CodeHealth.Core/ModelAware/JavaDomainConventions.cs:262\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":"engine/src/CodeHealth.Core/ModelAware/JavaDomainConventions.cs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f55c28763aedea88b42c15648fd9108c55f7187e391e26b3718be07ace941d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/JavaDomainConventions.cs:519-533 | engine/src/CodeHealth.Core/ModelAware/PythonDomainConventions.cs:332-346 \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 \u0060engine/src/CodeHealth.Core/ModelAware/JavaDomainConventions.cs:519\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":"engine/src/CodeHealth.Core/ModelAware/JavaDomainConventions.cs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cf6bc1e7444d3e4a6dafc2c71cf0709c034f5837e3032e964ac70d7d083d723"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/WcagCoverage.cs:51-65 | engine/src/CodeHealth.Core/ModelAware/WcagCoverage.cs:90-104 \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 \u0060engine/src/CodeHealth.Core/ModelAware/WcagCoverage.cs:51\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. 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":"engine/src/CodeHealth.Core/ModelAware/WcagCoverage.cs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"62168cbe2f3683b582644dfe5591a548ea302dbad80bd59ae987b9ffce5a79d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs:5202-5216 | engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs:5266-5280 \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 \u0060engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs:5202\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":"engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs"},"region":{"startLine":5202}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b4ff1e9939126736ad3dce255cb193706ad424791e7f80bf437e5b2a3e82a71"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201315 lines \u00D7 2): engine/src/CodeHealth.Dimensions.Security/DependencyVulnerabilityUnion.cs:180-194 | engine/src/CodeHealth.Dimensions.Security/DependencyVulnerabilityUnion.cs:306-317 \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 \u0060engine/src/CodeHealth.Dimensions.Security/DependencyVulnerabilityUnion.cs:180\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/DependencyVulnerabilityUnion.cs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6e7663117a575a736531b4c2e7ab28201f964bb45fbbf5c9a2e411a1c40c14d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): engine/src/CodeHealth.Dimensions.Security/Scanners/EndOfLifeBaseImageScan.cs:184-198 | engine/src/CodeHealth.Dimensions.Security/Scanners/MutableBaseImageScan.cs:109-124 \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 \u0060engine/src/CodeHealth.Dimensions.Security/Scanners/EndOfLifeBaseImageScan.cs:184\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060engine/src/CodeHealth.Dimensions.Security/Scanners/MutableBaseImageScan.cs:109\u0060 calls \u0060IsVendorReadableDockerfileName\u0060 and \u0060engine/src/CodeHealth.Dimensions.Security/Scanners/EndOfLifeBaseImageScan.cs:184\u0060 does not \u2014 after which the two agree again for 5 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/EndOfLifeBaseImageScan.cs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"132dac8a28c14d1394db73cad6cc4b95fbbca01361432849042500a6c359f32e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): engine/src/CodeHealth.Dimensions.Security/Scanners/ScanParsers.cs:430-444 | engine/src/CodeHealth.Dimensions.Security/Scanners/ScanParsers.cs:533-547 \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 \u0060engine/src/CodeHealth.Dimensions.Security/Scanners/ScanParsers.cs:430\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":"engine/src/CodeHealth.Dimensions.Security/Scanners/ScanParsers.cs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c2f79d697330032fb0e5ecacc585aee0ebc92469ee20e7163cbd11087fb6a0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): engine/src/CodeHealth.Dimensions.Security/Scanners/SocketAndUpgradeRecheck.cs:162-176 | engine/src/CodeHealth.Dimensions.Security/Scanners/SocketAndUpgradeRecheck.cs:271-285 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Dimensions.Security/Scanners/SocketAndUpgradeRecheck.cs:162\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":"engine/src/CodeHealth.Dimensions.Security/Scanners/SocketAndUpgradeRecheck.cs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4b788d723b543ecd009850db490df70b178f1cb08c1e6d8d59778f117eeccaa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs:5132-5146 | engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs:5205-5219 \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 \u0060engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs:5132\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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060root\u0060 to \u0060bool checksums) ScanGoReleaserManifest(string\u0060 in one and \u0060string\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":5132}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2c3e50c1ad7639acbaf865635afa700af3a37ade652575029a80a60a7d658b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs:7820-7834 | engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs:7943-7957 \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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":7820}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc31df65ad26d624df72bd63ef9beb8e4d7a9151667f0f8e6faf39caa8ec5865"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 5): engine/src/CodeHealth.Core/Dart/DartDeadLibraryField.cs:508-521 | engine/src/CodeHealth.Core/Markup/MarkupParser.cs:1640-1653 | engine/src/CodeHealth.Core/Testing/JsTestQualityCensus.cs:218-231 | engine/src/CodeHealth.Dimensions.Security/Scanners/MarkupEscapingRecheck.cs:252-265 | engine/src/CodeHealth.Dimensions.Security/Scanners/PrimaryConstructorShadow.cs:298-311 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 5 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 5 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Core/Dart/DartDeadLibraryField.cs:508\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. 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":"engine/src/CodeHealth.Core/Dart/DartDeadLibraryField.cs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6a126dbe23faf2091e9f11cf79c391611fdc662bce07ab2f2f1313aeecd55e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 5): engine/src/CodeHealth.Cli/Commands/AnalyzeCommand.cs:4170-4183 | engine/src/CodeHealth.Cli/Commands/AnalyzeCommand.cs:4192-4205 | engine/src/CodeHealth.Cli/Commands/AnalyzeCommand.cs:4258-4271 | engine/src/CodeHealth.Cli/Commands/AnalyzeCommand.cs:4283-4296 | engine/src/CodeHealth.Cli/Commands/AnalyzeCommand.cs:4367-4381 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. 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. 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060engine/src/CodeHealth.Cli/Commands/AnalyzeCommand.cs:4384\u0060 calls \u0060FindSwiftSourceFiles\u0060 and \u0060engine/src/CodeHealth.Cli/Commands/AnalyzeCommand.cs:4274\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":"engine/src/CodeHealth.Cli/Commands/AnalyzeCommand.cs"},"region":{"startLine":4170}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d488ce693469da3810315258cfff548552ff6f0b82f2804b4924e156d4e32de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 4): engine/src/CodeHealth.Core/ModelAware/JavaDomainConventions.cs:572-585 | engine/src/CodeHealth.Core/ModelAware/PhpDomainConventions.cs:544-557 | engine/src/CodeHealth.Core/ModelAware/PythonDomainConventions.cs:555-568 | engine/src/CodeHealth.Core/ModelAware/RubyDomainConventions.cs:726-739 \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 4 call sites, so a change lands once. 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060engine/src/CodeHealth.Core/ModelAware/PythonDomainConventions.cs:572\u0060 calls \u0060IsDunder\u0060, \u0060StartsWith\u0060, \u0060EndsWith\u0060 and \u0060engine/src/CodeHealth.Core/ModelAware/JavaDomainConventions.cs:589\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":"engine/src/CodeHealth.Core/ModelAware/JavaDomainConventions.cs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d95813069fc7c8b2a2a4c4e0de102eb53247c885d9dcab608737051782c0321"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): engine/src/CodeHealth.Core/ModelAware/EventSourcingAnalyzer.cs:839-852 | engine/src/CodeHealth.Core/ModelAware/EventSourcingAnalyzer.cs:899-912 | engine/src/CodeHealth.Core/ModelAware/EventSourcingAnalyzer.cs:960-973 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Core/ModelAware/EventSourcingAnalyzer.cs:839\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. 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":"engine/src/CodeHealth.Core/ModelAware/EventSourcingAnalyzer.cs"},"region":{"startLine":839}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b08e799f48995a1cb69778177303e5a478fd8aedbaa7a6de686f398d0829dd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): engine/src/CodeHealth.Core/Architecture/ContainerDetector.cs:272-285 | engine/src/CodeHealth.Core/ModelAware/AppKindDetector.cs:350-363 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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":"engine/src/CodeHealth.Core/Architecture/ContainerDetector.cs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"89b45431c8b1b649280b367eeba1d27b947596baf0c263ecb3db8c7589d565b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs:2187-2200 | engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs:2536-2549 \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. 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":"engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs"},"region":{"startLine":2187}}}],"partialFingerprints":{"codehealthFindingId/v1":"f14d620f50e9461f26ee15d1bccebd8b821cb623b0b21ebe2da14e1ef29f72fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): engine/src/CodeHealth.Core/ExplicitDebt/RazorMarkupReferenceScanner.cs:42-55 | engine/src/CodeHealth.Core/ExplicitDebt/RazorMarkupReferenceScanner.cs:88-101 \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 \u0060engine/src/CodeHealth.Core/ExplicitDebt/RazorMarkupReferenceScanner.cs:42\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":"engine/src/CodeHealth.Core/ExplicitDebt/RazorMarkupReferenceScanner.cs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7b9b9df863032d750354a3956d07dca38f58135b370d373b47d9cc2b997baf2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): engine/src/CodeHealth.Core/ExplicitDebt/RoslynExplicitDebtCollector.cs:5352-5365 | engine/src/CodeHealth.Core/ExplicitDebt/RoslynExplicitDebtCollector.cs:5761-5773 \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":"engine/src/CodeHealth.Core/ExplicitDebt/RoslynExplicitDebtCollector.cs"},"region":{"startLine":5352}}}],"partialFingerprints":{"codehealthFindingId/v1":"94ceb06de47b28fbbfee0cd1b79da58c492ca6115e50833e4dad59dc96005834"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): engine/src/CodeHealth.Core/Frontend/FrontendBoundaries.cs:290-303 | engine/src/CodeHealth.Core/Frontend/FrontendBoundaries.cs:532-545 \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 \u0060engine/src/CodeHealth.Core/Frontend/FrontendBoundaries.cs:290\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":"engine/src/CodeHealth.Core/Frontend/FrontendBoundaries.cs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c147256d4422155e238571936f3e9f9749896a0a1d2506132d34b876ebe214f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): engine/src/CodeHealth.Core/Frontend/FrontendDeadCode.cs:664-677 | engine/src/CodeHealth.Core/Frontend/FrontendDeadCode.cs:703-716 \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 \u0060engine/src/CodeHealth.Core/Frontend/FrontendDeadCode.cs:664\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060engine/src/CodeHealth.Core/Frontend/FrontendDeadCode.cs:718\u0060 calls \u0060Split\u0060 and \u0060engine/src/CodeHealth.Core/Frontend/FrontendDeadCode.cs:680\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":"engine/src/CodeHealth.Core/Frontend/FrontendDeadCode.cs"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa939521219bb54d4b354267f638d8ddf5b24ee13d2eb16a5b45709792731bf3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): engine/src/CodeHealth.Core/Frontend/FrontendManifestParsing.cs:328-341 | engine/src/CodeHealth.Core/Frontend/FrontendManifestParsing.cs:406-421 \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 \u0060engine/src/CodeHealth.Core/Frontend/FrontendManifestParsing.cs:328\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":"engine/src/CodeHealth.Core/Frontend/FrontendManifestParsing.cs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"4863b2fb4ca35572fe3837e8c644cff62490e00f7bd4b7816d003e2accb75c45"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): engine/src/CodeHealth.Core/Markup/TaggedTemplateMarkupProducer.cs:220-233 | engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.TaggedTemplateBlindness.cs:302-315 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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":"engine/src/CodeHealth.Core/Markup/TaggedTemplateMarkupProducer.cs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"4412d3cca996b5435f757bd6006a41dc2845a31420198a1d26eeef2d02a100ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): engine/src/CodeHealth.Core/Maturity/MaturityAnalyzer.cs:3272-3285 | engine/src/CodeHealth.Core/Maturity/MaturityAnalyzer.cs:3386-3399 \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 \u0060engine/src/CodeHealth.Core/Maturity/MaturityAnalyzer.cs:3272\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":"engine/src/CodeHealth.Core/Maturity/MaturityAnalyzer.cs"},"region":{"startLine":3272}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab594b381159447db277c52d4ef2a3feeff72e4e9a0bd8cfcae64e09462eff0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs:4993-5006 | engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs:5121-5134 \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 \u0060engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs:4993\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":"engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs"},"region":{"startLine":4993}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4394bcb400689e75ea0d55f0b26d27366bca255eaf31d002a0404bf1e7f09a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs:9097-9110 | engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs:9307-9320 \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 \u0060engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs:9097\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":"engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs"},"region":{"startLine":9097}}}],"partialFingerprints":{"codehealthFindingId/v1":"20521062b5d0e95d19fdedd782df017ed186cad3f0ada8a6a2fc976c37bcbfd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/ArchitectureModelAnalyzer.cs:548-561 | engine/src/CodeHealth.Core/ModelAware/ArchitectureModelAnalyzer.cs:2080-2091 \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 \u0060engine/src/CodeHealth.Core/ModelAware/ArchitectureModelAnalyzer.cs:548\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":"engine/src/CodeHealth.Core/ModelAware/ArchitectureModelAnalyzer.cs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"f574986b0c7334d7cee06a4cb9b9077745ad978215e51c07c6160dce2f33be94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/ArchitectureModelAnalyzer.cs:614-627 | engine/src/CodeHealth.Core/ModelAware/ArchitectureModelAnalyzer.cs:663-676 \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 \u0060engine/src/CodeHealth.Core/ModelAware/ArchitectureModelAnalyzer.cs:614\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":"engine/src/CodeHealth.Core/ModelAware/ArchitectureModelAnalyzer.cs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b5f42514f8a549c7643084866e713557df16ef6106487ba597868c5f062dd6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): engine/src/CodeHealth.Core/Readiness/VacuousFormatGate.cs:302-316 | engine/src/CodeHealth.Core/Readiness/VacuousFormatGate.cs:329-342 \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 \u0060engine/src/CodeHealth.Core/Readiness/VacuousFormatGate.cs:302\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":"engine/src/CodeHealth.Core/Readiness/VacuousFormatGate.cs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"67e4da3c5844cc6296d93784c9ee0fcb98f34cb79118c57adc7c64803209c8d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): engine/src/CodeHealth.Core/Scoring/CaiScoring.cs:112-125 | engine/src/CodeHealth.Reporting/Scorecard/ScorecardJsonRenderer.cs:30-43 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Scoring/CaiScoring.cs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6877f3fd3ca7d66f3628630383a8449af33fad42e7150d0d2e29ec1d096e461"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): engine/src/CodeHealth.Reporting/Changelog/ChangelogDraftRenderer.cs:82-95 | engine/src/CodeHealth.Reporting/Changelog/ChangelogDraftRenderer.cs:137-150 \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 \u0060engine/src/CodeHealth.Reporting/Changelog/ChangelogDraftRenderer.cs:82\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Reporting/Changelog/ChangelogDraftRenderer.cs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"76ee6134c7bba63462152a85b9648f84ff84818088497c69b0e21aec2684beb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): engine/src/CodeHealth.Dimensions.Security/Scanners/AutomountedServiceAccountTokenScan.cs:212-225 | engine/src/CodeHealth.Dimensions.Security/Scanners/HostPathPersistentVolumeScan.cs:167-180 \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 \u0060engine/src/CodeHealth.Dimensions.Security/Scanners/AutomountedServiceAccountTokenScan.cs:212\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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060lines\u0060 to \u0060int End)? PodSpec(IReadOnlyList\u003Cstring\u003E\u0060 in one and \u0060string Path)? HostPathBacking(IReadOnlyList\u003Cstring\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/AutomountedServiceAccountTokenScan.cs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"74fdd62daeeb402caec973365edb16a09da3c916ca9279b56330a9c7345a56fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): engine/src/CodeHealth.Dimensions.Security/Scanners/GitOwnershipCheckDisabledScan.cs:103-115 | engine/src/CodeHealth.Dimensions.Security/Scanners/PythonInstallGuardDisabledScan.cs:194-207 \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 \u0060engine/src/CodeHealth.Dimensions.Security/Scanners/GitOwnershipCheckDisabledScan.cs:103\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":"engine/src/CodeHealth.Dimensions.Security/Scanners/GitOwnershipCheckDisabledScan.cs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"11d222678af3f39b186ebef398951a9c24a3597db553479ba7da2e30e3ad4a02"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): engine/src/CodeHealth.Dimensions.Security/Scanners/MutableGitCloneScan.cs:88-101 | engine/src/CodeHealth.Dimensions.Security/Scanners/NoOpToolShimScan.cs:105-118 \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":"engine/src/CodeHealth.Dimensions.Security/Scanners/MutableGitCloneScan.cs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"26f6cce869ae3d3a1497d2ad4ef4bd478eedf6196e46618e9fdd16ec44e1764d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): engine/src/CodeHealth.Dimensions.Security/Scanners/MutableGitCloneScan.cs:136-149 | engine/src/CodeHealth.Dimensions.Security/Scanners/NoOpToolShimScan.cs:143-156 \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 \u0060engine/src/CodeHealth.Dimensions.Security/Scanners/MutableGitCloneScan.cs:136\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/MutableGitCloneScan.cs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a5a9cb7e225be3b3d51c4e781f0ca7510d6fe0f8e8adb0b6f44a6e58b2ebe4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): engine/src/CodeHealth.Dimensions.Security/Scanners/PathCombineProvenanceRecheck.cs:76-88 | engine/src/CodeHealth.Dimensions.Security/Scanners/PathCombineProvenanceRecheck.cs:197-210 \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 \u0060engine/src/CodeHealth.Dimensions.Security/Scanners/PathCombineProvenanceRecheck.cs:76\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":"engine/src/CodeHealth.Dimensions.Security/Scanners/PathCombineProvenanceRecheck.cs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"9add7b3ef72c4e4152624d65082f29fe627ff638078e2e42a0e862a5c6142db8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): engine/src/CodeHealth.Dimensions.Security/Scanners/ScanParsers.cs:1158-1171 | engine/src/CodeHealth.Dimensions.Security/Scanners/ScanParsers.cs:1219-1232 \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 \u0060engine/src/CodeHealth.Dimensions.Security/Scanners/ScanParsers.cs:1158\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":"engine/src/CodeHealth.Dimensions.Security/Scanners/ScanParsers.cs"},"region":{"startLine":1158}}}],"partialFingerprints":{"codehealthFindingId/v1":"58932f14d6047eefce67d5bdd44bf43444fea8d60ff02006fc80420ea4b50b53"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): engine/src/CodeHealth.Dimensions.Security/Scanners/SetuidBinaryGrantScan.cs:106-119 | engine/src/CodeHealth.Dimensions.Security/Scanners/WorldWritableOwnedPathScan.cs:282-295 \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 \u0060engine/src/CodeHealth.Dimensions.Security/Scanners/SetuidBinaryGrantScan.cs:106\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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060command\u0060 to \u0060IReadOnlyList\u003Cstring\u003E Paths)? SetuidPaths(string\u0060 in one and \u0060IReadOnlyList\u003Cstring\u003E Paths)? WorldWritablePaths(string\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/SetuidBinaryGrantScan.cs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a33f97191524a7c9e309df7e26cd2443b77031121ff755196f7d8684d1e9b73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/Kennel.Assay.Core/Governance/Ui/RepoVerdict.razor:150-163 | src/Kennel.Core/Repositories/Ui/RepoHub.razor:706-719 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Kennel.Assay.Core/Governance/Ui/RepoVerdict.razor"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f398c1af9c9565d3d94ce2234b9b219ca3901d5145bd47b161249fc448f87fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4): engine/src/CodeHealth.Core/ModelAware/CSharpCorrectnessAnalyzer.cs:224-240 | engine/src/CodeHealth.Core/ModelAware/LogicDefectAnalyzer.cs:161-173 | engine/src/CodeHealth.Core/ModelAware/MarkupTaintPass.cs:358-372 | engine/src/CodeHealth.Core/ModelAware/SecurityDefectAnalyzer.cs:199-211 \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 4 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Core/ModelAware/LogicDefectAnalyzer.cs:161\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":"engine/src/CodeHealth.Core/ModelAware/CSharpCorrectnessAnalyzer.cs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a903a9d416baf74120912cf4efdf33327bdf4d79e2ebf397554326ab390406f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4): engine/src/CodeHealth.Dimensions.Security/Scanners/DartDeadPrivateFieldRecheck.cs:55-67 | engine/src/CodeHealth.Dimensions.Security/Scanners/JsDeadFieldRoundTripRecheck.cs:55-67 | engine/src/CodeHealth.Dimensions.Security/Scanners/JsRedundantReDefaultRecheck.cs:54-66 | engine/src/CodeHealth.Dimensions.Security/Scanners/JsRegexCaptureGroupRecheck.cs:50-62 \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 4 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Dimensions.Security/Scanners/DartDeadPrivateFieldRecheck.cs:55\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":"engine/src/CodeHealth.Dimensions.Security/Scanners/DartDeadPrivateFieldRecheck.cs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"a59fb4e92dfa364423ff00905a373dbf60aa8b9e161a32b80fa430b5ed370acf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 3): engine/src/CodeHealth.Core/CodeShape/RoslynDuplicationDetector.cs:1457-1469 | engine/src/CodeHealth.Core/CodeShape/RoslynDuplicationDetector.cs:2630-2642 | engine/src/CodeHealth.Core/CodeShape/RoslynDuplicationDetector.cs:4298-4309 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/CodeShape/RoslynDuplicationDetector.cs"},"region":{"startLine":1457}}}],"partialFingerprints":{"codehealthFindingId/v1":"d648fda276475c5e4cc2d72a4788da532f14a6ec06fb3f7f774bb96a81a127e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): engine/src/CodeHealth.Core/ModelAware/CqsAnalyzer.cs:149-161 | engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs:241-253 | engine/src/CodeHealth.Core/ModelAware/MutationIdempotencyAnalyzer.cs:671-683 \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":"engine/src/CodeHealth.Core/ModelAware/CqsAnalyzer.cs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5e48d324d3b110046454aba1c03c74b35b4cfd7423ce328bf1a477c7596f429"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): engine/src/CodeHealth.Dimensions.GitMining/ChangeCouplingAnalyzer.cs:4714-4726 | engine/src/CodeHealth.Dimensions.Security/Scanners/ComposeServiceSurface.cs:432-444 | engine/src/CodeHealth.Dimensions.Security/Scanners/UnscopedBuildContextCopyScan.cs:299-311 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Dimensions.GitMining/ChangeCouplingAnalyzer.cs:4714\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":"engine/src/CodeHealth.Dimensions.GitMining/ChangeCouplingAnalyzer.cs"},"region":{"startLine":4714}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b365ea37a7d4b5019c6d76d7c1692814408ca8173de95d4eefcea2c536cf562"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs:8280-8292 | engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs:8367-8379 | engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs:8639-8651 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs:8280\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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":8280}}}],"partialFingerprints":{"codehealthFindingId/v1":"28fb91f5156da4329d9c4ca31c328f2e72ef834cadb93fcace1173b74e68149b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): engine/src/CodeHealth.Core/Architecture/BoundaryCouplingDetector.cs:92-104 | engine/src/CodeHealth.Core/Architecture/SliceLocalityDetector.cs:159-172 \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 \u0060engine/src/CodeHealth.Core/Architecture/BoundaryCouplingDetector.cs:92\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060engine/src/CodeHealth.Core/Architecture/BoundaryCouplingDetector.cs:90\u0060 calls \u0060ThrowIfNull\u0060 and \u0060engine/src/CodeHealth.Core/Architecture/SliceLocalityDetector.cs:159\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":"engine/src/CodeHealth.Core/Architecture/BoundaryCouplingDetector.cs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aa33e9220c28cfcc15bfaa7b1e898f9de55b608bbfa06c056434d8d23c1bbd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): engine/src/CodeHealth.Core/CodeModel/Roslyn/CSharpCloneTokenizer.cs:537-549 | engine/src/CodeHealth.Core/CodeModel/Roslyn/VbCloneTokenizer.cs:244-256 \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":"engine/src/CodeHealth.Core/CodeModel/Roslyn/CSharpCloneTokenizer.cs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"caf1e7cccecabcb05f0a69a76071657aa96166ae7ea9c7b33c16e23909c5515e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): engine/src/CodeHealth.Core/CodeShape/LineBasedGodClassDetector.cs:553-565 | engine/src/CodeHealth.Core/FileQuality/GeneratedRegionScan.cs:235-247 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Core/CodeShape/LineBasedGodClassDetector.cs:553\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. 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":"engine/src/CodeHealth.Core/CodeShape/LineBasedGodClassDetector.cs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa3886f52e11d7a2e3f113992993eb232b5b239356c2d522175e83a2f1e146d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): engine/src/CodeHealth.Core/CodeShape/NeutralFileLengthScanner.cs:1319-1331 | engine/src/CodeHealth.Core/CodeShape/NeutralFileLengthScanner.cs:1363-1375 \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. 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":"engine/src/CodeHealth.Core/CodeShape/NeutralFileLengthScanner.cs"},"region":{"startLine":1319}}}],"partialFingerprints":{"codehealthFindingId/v1":"4625761857b37bd4f220ac92b038eb4becdc5505c8d4e9e1bfd9ee9ed371cafe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): engine/src/CodeHealth.Core/CodeShape/NeutralMethodLengthScanner.cs:72-86 | engine/src/CodeHealth.Core/CodeShape/NeutralTypeLengthScanner.cs:67-79 \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 \u0060engine/src/CodeHealth.Core/CodeShape/NeutralMethodLengthScanner.cs:72\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":"engine/src/CodeHealth.Core/CodeShape/NeutralMethodLengthScanner.cs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e3a0cc285fbd01ed228790b11388fcf6243b8db0748577e10703876f315d7e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs:3979-3989 | engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs:4005-4017 \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 \u0060engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs:3979\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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060sites\u0060 to \u0060List\u003C(string Type, string FilePath, int Line)\u003E\u0060 in one and \u0060List\u003C(string Setting, string Member, string FilePath, int Line)\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs"},"region":{"startLine":3979}}}],"partialFingerprints":{"codehealthFindingId/v1":"88fdbf4b3f44368815f7174129ce3f305201d6bcba5d2eed85cb6bd765d47bb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): engine/src/CodeHealth.Core/ExplicitDebt/RazorMarkupReferenceScanner.cs:120-132 | engine/src/CodeHealth.Core/ExplicitDebt/XamlMarkupReferenceScanner.cs:117-128 \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 \u0060engine/src/CodeHealth.Core/ExplicitDebt/RazorMarkupReferenceScanner.cs:120\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":"engine/src/CodeHealth.Core/ExplicitDebt/RazorMarkupReferenceScanner.cs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"2258a40c45f31b43fd52ce7b6ad25ef23d3e4bc39ff067f544744fc79e810f0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): engine/src/CodeHealth.Core/Frontend/EntryPointCatalog.cs:2582-2594 | engine/src/CodeHealth.Core/Frontend/FrontendDeclaredPackageRefs.cs:191-203 \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 \u0060engine/src/CodeHealth.Core/Frontend/EntryPointCatalog.cs:2582\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. 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":"engine/src/CodeHealth.Core/Frontend/EntryPointCatalog.cs"},"region":{"startLine":2582}}}],"partialFingerprints":{"codehealthFindingId/v1":"a07611fafce15b0799f7187593a583c9ee30c863950cc73058c48ccc759055da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): engine/src/CodeHealth.Core/Frontend/FrontendBoundaries.cs:479-491 | engine/src/CodeHealth.Core/Frontend/FrontendModuleGraph.cs:710-722 \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 \u0060engine/src/CodeHealth.Core/Frontend/FrontendBoundaries.cs:479\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":"engine/src/CodeHealth.Core/Frontend/FrontendBoundaries.cs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fd714574bea4307e35e8a8cc0d8a31313a55e092b942098cc8d971845ed16de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): engine/src/CodeHealth.Core/Frontend/FrontendBoundaries.cs:1509-1521 | engine/src/CodeHealth.Core/Frontend/FrontendTestAndDocRefs.cs:302-314 \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 \u0060engine/src/CodeHealth.Core/Frontend/FrontendBoundaries.cs:1509\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/FrontendBoundaries.cs"},"region":{"startLine":1509}}}],"partialFingerprints":{"codehealthFindingId/v1":"62b4a5245676d9c141e808340ff8a03592f14cc3d60f746857fc79eca90d5510"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): engine/src/CodeHealth.Core/Frontend/FrontendBundlerConfigRefs.cs:860-889 | engine/src/CodeHealth.Core/Frontend/FrontendTestAndDocRefs.cs:80-92 \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. 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":"engine/src/CodeHealth.Core/Frontend/FrontendBundlerConfigRefs.cs"},"region":{"startLine":860}}}],"partialFingerprints":{"codehealthFindingId/v1":"67fb0520c5f361cfd327cada9c2c22c2d4638a3fd6add0175953b2b99cefb41c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): engine/src/CodeHealth.Core/Frontend/FrontendEmittedTemplateRefs.cs:41-53 | engine/src/CodeHealth.Core/Frontend/FrontendEmittedTemplateRefs.cs:398-410 \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":"engine/src/CodeHealth.Core/Frontend/FrontendEmittedTemplateRefs.cs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"f80da157a6ac1504f3fc2e145226f9027ed5ab64f83cea04779e4b7d58ff5a4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): engine/src/CodeHealth.Core/Frontend/FrontendManifestParsing.cs:227-239 | engine/src/CodeHealth.Core/Frontend/FrontendManifestParsing.cs:303-315 \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 \u0060engine/src/CodeHealth.Core/Frontend/FrontendManifestParsing.cs:227\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. 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":"engine/src/CodeHealth.Core/Frontend/FrontendManifestParsing.cs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"effed09a0b0b9fe2d693725f3a255b07652c171ba7100ddad742181586104d0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): engine/src/CodeHealth.Core/Frontend/JsComplexity.cs:681-693 | engine/src/CodeHealth.Core/Frontend/JsFunctionScanner.cs:1045-1057 \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 \u0060engine/src/CodeHealth.Core/Frontend/JsComplexity.cs:681\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":"engine/src/CodeHealth.Core/Frontend/JsComplexity.cs"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"45a2fd2a1086f0171d19086043c6a43a8b05909258a5b5b3c8e3e0c2fe931f72"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): engine/src/CodeHealth.Core/Frontend/ModuleSyntaxScanner.cs:1017-1029 | engine/src/CodeHealth.Core/Frontend/ModuleSyntaxScanner.cs:1034-1046 \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 \u0060engine/src/CodeHealth.Core/Frontend/ModuleSyntaxScanner.cs:1017\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":"engine/src/CodeHealth.Core/Frontend/ModuleSyntaxScanner.cs"},"region":{"startLine":1017}}}],"partialFingerprints":{"codehealthFindingId/v1":"16a02427c515e36569613accb3fe0a0bd961b3acf0c012319126c23623fb2f08"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): engine/src/CodeHealth.Core/Frontend/ModuleSyntaxScanner.cs:1046-1058 | engine/src/CodeHealth.Core/Frontend/ModuleSyntaxScanner.cs:1070-1082 \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. 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":"engine/src/CodeHealth.Core/Frontend/ModuleSyntaxScanner.cs"},"region":{"startLine":1046}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1d3fef8510853801834967423e89af61fefd4307fd41079a9c086949f703583"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs:5471-5483 | engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs:5557-5569 \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 \u0060engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs:5471\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":"engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs"},"region":{"startLine":5471}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fbdc743c91d512330ce7db4ae8afb74bf53c04af08486df1e19aca36a0f248a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/DomainConventions.cs:361-373 | engine/src/CodeHealth.Core/ModelAware/DomainConventions.cs:1731-1743 \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 \u0060engine/src/CodeHealth.Core/ModelAware/DomainConventions.cs:361\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060type\u0060 to \u0060INamedTypeSymbol\u0060 in one and \u0060Nm.ICodeType\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/DomainConventions.cs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"c63f3ee9a1c6ce61f991bf858e61e39b90402622af0040170d7c7b322c20336e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs:1115-1128 | engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs:3423-3435 \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 \u0060engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs:1115\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":"engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs"},"region":{"startLine":1115}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c0f9bff0173b03c196fff1150db63751f981c1b814d989ce4839008c86ccdb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): engine/src/CodeHealth.Core/Scoring/DiskSourceFiles.cs:523-535 | engine/src/CodeHealth.Core/Scoring/DiskSourceFiles.cs:582-594 \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":"engine/src/CodeHealth.Core/Scoring/DiskSourceFiles.cs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aa4d1078e2947bce1cdca953f40b6b683f142afff1d85ea9a324138f65b760e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201313 lines \u00D7 2): engine/src/CodeHealth.Dimensions.Architecture/CouplingAnalyzer.cs:332-344 | engine/src/CodeHealth.Dimensions.Architecture/CouplingAnalyzer.cs:359-366 \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 \u0060engine/src/CodeHealth.Dimensions.Architecture/CouplingAnalyzer.cs:332\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"engine/src/CodeHealth.Dimensions.Architecture/CouplingAnalyzer.cs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eae513b075e9e0c6e6a3ad6c8b0ca8a46d009c108fa00fcc867708c79e7a717"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): engine/src/CodeHealth.Dimensions.Architecture/NavigabilityAnalyzer.cs:164-176 | engine/src/CodeHealth.Dimensions.Architecture/NavigabilityAnalyzer.cs:187-201 \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. 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. 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":"engine/src/CodeHealth.Dimensions.Architecture/NavigabilityAnalyzer.cs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"992decea2aa6bf7bbf7ead4ffbe123f203f132e41cd0feb745d7fa8c78d7dbd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs:7279-7291 | engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs:8585-8597 \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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":7279}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0c98f31025c8d0f95612e61f1c44fac60c8a3c14752e7c9b06c420661e113fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): engine/src/CodeHealth.CodeModel.Jvm/JvmProvider.cs:698-710 | engine/src/CodeHealth.CodeModel.Jvm/JvmProvider.cs:724-736 \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 \u0060engine/src/CodeHealth.CodeModel.Jvm/JvmProvider.cs:698\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":"engine/src/CodeHealth.CodeModel.Jvm/JvmProvider.cs"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"f188fe08290af4f06b7429992580a6b64341b5bc589c7084f8d4eb49c960864b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 5): engine/src/CodeHealth.Core/ModelAware/CqsAnalyzer.cs:148-159 | engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs:240-251 | engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs:231-242 | engine/src/CodeHealth.Core/ModelAware/EventSourcingAnalyzer.cs:199-210 | engine/src/CodeHealth.Core/ModelAware/MutationIdempotencyAnalyzer.cs:670-681 \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 5 call sites, so a change lands once. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs:253\u0060 calls \u0060BodyModelLookup\u0060 and \u0060engine/src/CodeHealth.Core/ModelAware/EventSourcingAnalyzer.cs:212\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":"engine/src/CodeHealth.Core/ModelAware/CqsAnalyzer.cs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"21b4d8bf8f7024d5032e0d44189d8388b680951e3275ccc7071c68e87dd8affa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 5): engine/src/CodeHealth.Dimensions.Security/Scanners/PowerShellFetchExecScriptRecheck.cs:43-54 | engine/src/CodeHealth.Dimensions.Security/Scanners/RecursiveOwnershipRootRecheck.cs:88-99 | engine/src/CodeHealth.Dimensions.Security/Scanners/ShellCommandPrefixRecheck.cs:99-111 | engine/src/CodeHealth.Dimensions.Security/Scanners/UnverifiedAppVeyorInstallerRecheck.cs:142-153 | engine/src/CodeHealth.Dimensions.Security/Scanners/UnverifiedPowerShellInstallerRecheck.cs:97-108 \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 5 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Dimensions.Security/Scanners/PowerShellFetchExecScriptRecheck.cs:43\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":"engine/src/CodeHealth.Dimensions.Security/Scanners/PowerShellFetchExecScriptRecheck.cs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"4043df54a0511d0836330b8df1030002f7b0817c541b5c52272efaa4165dc925"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 4): engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs:2080-2091 | engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs:2182-2193 | engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs:2421-2432 | engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs:2534-2542 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs:2080\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":"engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs"},"region":{"startLine":2080}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce5eeaac1859684a05ec34f2d4f12dc65adaa92c6a06c411af58627309f6415b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): engine/src/CodeHealth.Cli/Commands/JvmSidecar.cs:1667-1678 | engine/src/CodeHealth.Cli/Commands/JvmSidecar.cs:1716-1727 | engine/src/CodeHealth.Cli/Commands/JvmSidecar.cs:1775-1787 | engine/src/CodeHealth.Cli/Commands/JvmSidecar.cs:1811-1822 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Cli/Commands/JvmSidecar.cs:1667\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":"engine/src/CodeHealth.Cli/Commands/JvmSidecar.cs"},"region":{"startLine":1667}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b4f3e8c1bf352db8d02a6de4415bcc3849fbe0e47ad538cb7b9238ebb4a263c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): engine/src/CodeHealth.Core/CodeShape/ChainedCorrespondence.cs:94-108 | engine/src/CodeHealth.Core/CodeShape/MemberFamilyRollup.cs:187-198 | engine/src/CodeHealth.Core/CodeShape/MemberPairRollup.cs:86-97 \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. 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060engine/src/CodeHealth.Core/CodeShape/ChainedCorrespondence.cs:91\u0060 calls \u0060CommonDirectoryPrefixLength\u0060 and \u0060engine/src/CodeHealth.Core/CodeShape/MemberPairRollup.cs:81\u0060 does not \u2014 after which the two agree again for 3 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":"engine/src/CodeHealth.Core/CodeShape/ChainedCorrespondence.cs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"2462d9fc20bccef957411154186660cfb488e01d81b5ab4dcf5cec297662ef3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): engine/src/CodeHealth.Core/Maturity/MaturityAnalyzer.cs:3244-3255 | engine/src/CodeHealth.Core/Maturity/MaturityAnalyzer.cs:3274-3285 | engine/src/CodeHealth.Core/Maturity/MaturityAnalyzer.cs:3388-3399 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Core/Maturity/MaturityAnalyzer.cs:3244\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":"engine/src/CodeHealth.Core/Maturity/MaturityAnalyzer.cs"},"region":{"startLine":3244}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa40285ee243688e58367451cc2b851ce1fa18d35871855e78177e2061b0cdd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): engine/src/CodeHealth.Core/ModelAware/RuntimeBoot/BootMechanismDetector.cs:46-63 | engine/src/CodeHealth.Core/ModelAware/RuntimeBoot/DevServerDetector.cs:93-104 | engine/src/CodeHealth.Core/ModelAware/RuntimeBoot/TestFrameworkDetector.cs:148-165 \u2014 before extracting anything, compare \u0060engine/src/CodeHealth.Core/ModelAware/RuntimeBoot/DevServerDetector.cs\u0060 and \u0060engine/src/CodeHealth.Core/ModelAware/RuntimeBoot/TestFrameworkDetector.cs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 58 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Core/ModelAware/RuntimeBoot/BootMechanismDetector.cs:46\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":"engine/src/CodeHealth.Core/ModelAware/RuntimeBoot/BootMechanismDetector.cs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"0982468ced35d165b448f3987765427a1b84eded5ad05a0bbcd77658a2aa3cdc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): engine/src/CodeHealth.Dimensions.Security/Scanners/BuildTimeKeyMaterialScan.cs:349-360 | engine/src/CodeHealth.Dimensions.Security/Scanners/BuildTimeKeyMaterialScan.cs:381-392 | engine/src/CodeHealth.Dimensions.Security/Scanners/UnverifiedRemoteInstallerScan.cs:1376-1387 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Dimensions.Security/Scanners/BuildTimeKeyMaterialScan.cs:349\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":"engine/src/CodeHealth.Dimensions.Security/Scanners/BuildTimeKeyMaterialScan.cs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f2cd7c67a8a66c1ca19c3ec250e8ba156d10d388bf171b36c54f904e0e6e5fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): engine/src/CodeHealth.Core/Architecture/Topology/Extractors/CdkExtractor.cs:64-75 | engine/src/CodeHealth.Core/Architecture/Topology/Extractors/PulumiExtractor.cs:38-49 \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 \u0060engine/src/CodeHealth.Core/Architecture/Topology/Extractors/CdkExtractor.cs:64\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":"engine/src/CodeHealth.Core/Architecture/Topology/Extractors/CdkExtractor.cs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"c85e5381e7ac0bb6e38cd7f6591cd936ed9f4ef856761a04b0fc007931e03463"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): engine/src/CodeHealth.Core/CodeModel/Roslyn/RoslynMethodBody.cs:242-253 | engine/src/CodeHealth.Core/CodeModel/Roslyn/RoslynVbMethodBody.cs:211-222 \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":"engine/src/CodeHealth.Core/CodeModel/Roslyn/RoslynMethodBody.cs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"68fdd1e8d98b54d993995e41d456c0e9e978b5dd3e482a1a2fc59265dcb53e6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): engine/src/CodeHealth.Core/Dependencies/MixManifestHygiene.cs:402-411 | engine/src/CodeHealth.Dimensions.Security/Scanners/OsvScannerIgnores.cs:386-397 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Core/Dependencies/MixManifestHygiene.cs:402\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":"engine/src/CodeHealth.Core/Dependencies/MixManifestHygiene.cs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e519ffeeda83753eb01720af7ffb74211ab0d75d3b5ad8324279a9232bcdb2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): engine/src/CodeHealth.Core/Frontend/FrontendBoundaries.cs:453-464 | engine/src/CodeHealth.Core/Frontend/FrontendModuleGraph.cs:682-693 \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 \u0060engine/src/CodeHealth.Core/Frontend/FrontendBoundaries.cs:453\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060engine/src/CodeHealth.Core/Frontend/FrontendBoundaries.cs:449\u0060 calls \u0060Push\u0060, \u0060SliceFrame\u0060 and \u0060engine/src/CodeHealth.Core/Frontend/FrontendModuleGraph.cs:678\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":"engine/src/CodeHealth.Core/Frontend/FrontendBoundaries.cs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"02b9cd9c4be5e2c913d36f2d1eca15e957019659dcbd50e9086c14a36ab7d389"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): engine/src/CodeHealth.Core/Frontend/JsComplexity.cs:231-242 | engine/src/CodeHealth.Core/Frontend/JsComplexity.cs:360-371 \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 \u0060engine/src/CodeHealth.Core/Frontend/JsComplexity.cs:231\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":"engine/src/CodeHealth.Core/Frontend/JsComplexity.cs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"14af906524712feee5b49e9c751084d7a463a5182ef8fc76d6eaf88c820f6b3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs:4402-4413 | engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs:5606-5617 \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":"engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs"},"region":{"startLine":4402}}}],"partialFingerprints":{"codehealthFindingId/v1":"15fca211c42fd0ce2758fa83b1efd35dc4030d0bd27e9df111c6c1507444d201"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): engine/src/CodeHealth.Core/Frontend/ModuleSyntaxScanner.cs:999-1010 | engine/src/CodeHealth.Core/Frontend/ModuleSyntaxScanner.cs:1070-1082 \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. 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":"engine/src/CodeHealth.Core/Frontend/ModuleSyntaxScanner.cs"},"region":{"startLine":999}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fa814e0d56fc67ed3f75204d78c0ab3a0cfa85b5bd46961e751436f0ddb4f8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs:7889-7900 | engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs:8231-8242 \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 \u0060engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs:7889\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":"engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs"},"region":{"startLine":7889}}}],"partialFingerprints":{"codehealthFindingId/v1":"d481dedab91628d1338fdcdb618a31000c5a91d00c0d4ea6836622c101362153"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/DartDomainConventions.cs:685-696 | engine/src/CodeHealth.Core/ModelAware/DartDomainConventions.cs:832-843 \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 \u0060engine/src/CodeHealth.Core/ModelAware/DartDomainConventions.cs:685\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":"engine/src/CodeHealth.Core/ModelAware/DartDomainConventions.cs"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"b10ebdd68b654811765e859f6b5d14cae282b8b60669dd5bf3de04518e87b5ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs:517-528 | engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs:5288-5298 \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 \u0060engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs:517\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. 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":"engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a859afc9bc14f058e53c75210e2fa02912185af86df244bc528d29ad191501d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs:1679-1690 | engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs:5099-5120 \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 \u0060engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs:1679\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs"},"region":{"startLine":1679}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb335f349ad5e97cbfe25158cf99db1f927ed483fb145125c52a9bbbd8310cf2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/IncompletenessAnalyzer.cs:644-655 | engine/src/CodeHealth.Core/ModelAware/JsInteropContractAnalyzer.cs:50-61 \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 \u0060engine/src/CodeHealth.Core/ModelAware/IncompletenessAnalyzer.cs:644\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":"engine/src/CodeHealth.Core/ModelAware/IncompletenessAnalyzer.cs"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"41706f4fa1149fe1eb130b88e37d2619ce113567e51668ae3ad11d3cf959d3a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/PythonDomainConventions.cs:384-397 | engine/src/CodeHealth.Core/ModelAware/RubyDomainConventions.cs:455-466 \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":"engine/src/CodeHealth.Core/ModelAware/PythonDomainConventions.cs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fff7c0350b6424f2cf1a9141f44979e95318366610c27f758407943cdce590b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/RepoProfiler.cs:111-122 | engine/src/CodeHealth.Core/ModelAware/RepoProfiler.cs:130-141 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Core/ModelAware/RepoProfiler.cs:111\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. 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":"engine/src/CodeHealth.Core/ModelAware/RepoProfiler.cs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"a55f9c74d6c680ad60dcc174fb75ac8e533b0e99a09f9eed2d313259e99eec41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): engine/src/CodeHealth.Core/Scoring/CompileRemovedPaths.cs:200-211 | engine/src/CodeHealth.Core/Testing/CompileExcludedTestFiles.cs:178-189 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Core/Scoring/CompileRemovedPaths.cs:200\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060engine/src/CodeHealth.Core/Scoring/CompileRemovedPaths.cs:199\u0060 calls \u0060Replace\u0060, \u0060Trim\u0060 and \u0060engine/src/CodeHealth.Core/Testing/CompileExcludedTestFiles.cs:177\u0060 does not \u2014 after which the two agree again for 4 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":"engine/src/CodeHealth.Core/Scoring/CompileRemovedPaths.cs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"2846a6b20ed859e9901a355db77750fd8791bad7d2f4bbeb8983a6725810d32a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): engine/src/CodeHealth.Core/Scoring/DeclaredScriptExecutables.cs:333-344 | engine/src/CodeHealth.Core/Scoring/DeclaredScriptExecutables.cs:444-455 \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 \u0060engine/src/CodeHealth.Core/Scoring/DeclaredScriptExecutables.cs:333\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Scoring/DeclaredScriptExecutables.cs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"281a14224e751d5f5dfddae8271e1dad21f5a92363a094e2fc2b71ed3c7fcff7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): engine/src/CodeHealth.Cli/Commands/AnalyzeCommand.cs:1426-1437 | engine/src/CodeHealth.Cli/Commands/AnalyzeCommand.cs:1458-1469 \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 \u0060engine/src/CodeHealth.Cli/Commands/AnalyzeCommand.cs:1426\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Cli/Commands/AnalyzeCommand.cs"},"region":{"startLine":1426}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a7b8ad390cad0836fef9ab7af7dd8888a66dcb35d2562d7ab2aba63e767aa2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): engine/src/CodeHealth.Dimensions.Security/Scanners/BrowserSandboxDisabledScan.cs:429-440 | engine/src/CodeHealth.Dimensions.Security/Scanners/DockerfileSyntax.cs:348-359 \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 \u0060engine/src/CodeHealth.Dimensions.Security/Scanners/BrowserSandboxDisabledScan.cs:429\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. 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. 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/BrowserSandboxDisabledScan.cs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"b01e5eac52aeccebcb9147ac6d9755464c64a3d1cf13ac14a828181bca7192f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): engine/src/CodeHealth.Dimensions.Security/Scanners/SetuidBinaryGrantScan.cs:146-157 | engine/src/CodeHealth.Dimensions.Security/Scanners/WorldWritableOwnedPathScan.cs:321-332 \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 \u0060engine/src/CodeHealth.Dimensions.Security/Scanners/SetuidBinaryGrantScan.cs:146\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":"engine/src/CodeHealth.Dimensions.Security/Scanners/SetuidBinaryGrantScan.cs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"77e4d790c715243de86680f3f7ac6ca6577b7c64b70cfe4bc4fd5e36a4434653"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): engine/src/CodeHealth.Dimensions.Security/SecretsHistoryAnalyzer.cs:937-951 | engine/src/CodeHealth.Dimensions.Security/SecretsHistoryAnalyzer.cs:963-974 \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 \u0060engine/src/CodeHealth.Dimensions.Security/SecretsHistoryAnalyzer.cs:937\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/SecretsHistoryAnalyzer.cs"},"region":{"startLine":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"c71f2fcf16e8d4e4133cb2b03d37cec35bce57c4d4510b4acf3ce834128417ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): src/Kennel.Core/Accounts/Ui/Settings.razor:267-278 | src/Kennel.Core/Onboarding/Ui/Welcome.razor:111-121 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Kennel.Core/Accounts/Ui/Settings.razor"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"c09f1b34c2b3c264bee90033ae508f296c8802a240eaeb1f4ff9ee7fe82ec54f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u201311 lines \u00D7 11): engine/src/CodeHealth.Core/ModelAware/CSharpCorrectnessAnalyzer.cs:72-78 | engine/src/CodeHealth.Core/ModelAware/CoherenceSmellAnalyzer.cs:43-52 | engine/src/CodeHealth.Core/ModelAware/DataShapeSmellAnalyzer.cs:35-41 | engine/src/CodeHealth.Core/ModelAware/GdprPersonalDataAnalyzer.cs:77-82 | engine/src/CodeHealth.Core/ModelAware/JsInteropContractAnalyzer.cs:48-53 | engine/src/CodeHealth.Core/ModelAware/LogicDefectAnalyzer.cs:138-148 | engine/src/CodeHealth.Core/ModelAware/MarkupTaintPass.cs:342-348 | engine/src/CodeHealth.Core/ModelAware/OperabilityExtrasAnalyzer.cs:33-39 | engine/src/CodeHealth.Core/ModelAware/RepoProfiler.cs:98-103 | engine/src/CodeHealth.Core/ModelAware/SecurityDefectAnalyzer.cs:176-186 | engine/src/CodeHealth.Core/ModelAware/StringContractSmellAnalyzer.cs:64-73 \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 11 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Core/ModelAware/CSharpCorrectnessAnalyzer.cs:72\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060engine/src/CodeHealth.Core/ModelAware/RepoProfiler.cs:93\u0060 calls \u0060DetectAsync\u0060, \u0060ConfigureAwait\u0060 and \u0060engine/src/CodeHealth.Core/ModelAware/GdprPersonalDataAnalyzer.cs:75\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":"engine/src/CodeHealth.Core/ModelAware/CSharpCorrectnessAnalyzer.cs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c464d5cbcfc7a7282ed9d0a87ed2e1245c28708102e59baf5f6f545d9041ae2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 8): engine/src/CodeHealth.Core/Compliance/HostedHttpSurfaceScan.cs:443-457 | engine/src/CodeHealth.Core/Scoring/DiskSourceFiles.cs:1497-1510 | engine/src/CodeHealth.Core/Scoring/DiskSourceFiles.cs:1567-1580 | engine/src/CodeHealth.Core/Testing/DiskTestScanner.cs:932-942 | engine/src/CodeHealth.Core/Testing/DiskTestScanner.cs:1200-1210 | engine/src/CodeHealth.Core/Testing/GoTestCensus.cs:513-523 | engine/src/CodeHealth.Core/Testing/PythonTestCensus.cs:383-393 | engine/src/CodeHealth.Core/Testing/RustTestCensus.cs:428-438 \u2014 there are 8 copies across 6 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 8 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Core/Compliance/HostedHttpSurfaceScan.cs:443\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060engine/src/CodeHealth.Core/Testing/DiskTestScanner.cs:944\u0060 calls \u0060IsTestsDir\u0060, \u0060HasConventionalTestDirSegment\u0060 and \u0060engine/src/CodeHealth.Core/Compliance/HostedHttpSurfaceScan.cs:460\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":"engine/src/CodeHealth.Core/Compliance/HostedHttpSurfaceScan.cs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"f70d66da8a4ae727774a2ec439b5573b97f389b2f85eacece6aaf190d086e401"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs:1812-1822 | engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs:1869-1879 | engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs:1895-1905 | engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs:1922-1932 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs:1812\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":"engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs"},"region":{"startLine":1812}}}],"partialFingerprints":{"codehealthFindingId/v1":"737b71368c69b432315ad66f6ba131f13b154e0c5d14de50b16160123e2a7193"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): engine/src/CodeHealth.Core/ModelAware/RuntimeBoot/BootMechanismDetector.cs:48-64 | engine/src/CodeHealth.Core/ModelAware/RuntimeBoot/DevServerDetector.cs:95-105 | engine/src/CodeHealth.Core/ModelAware/RuntimeBoot/TestFrameworkDetector.cs:150-166 | engine/src/CodeHealth.Core/ModelAware/SupplyChainHygieneAnalyzer.cs:372-388 \u2014 before extracting anything, compare \u0060engine/src/CodeHealth.Core/ModelAware/RuntimeBoot/DevServerDetector.cs\u0060 and \u0060engine/src/CodeHealth.Core/ModelAware/RuntimeBoot/TestFrameworkDetector.cs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 58 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Core/ModelAware/RuntimeBoot/BootMechanismDetector.cs:48\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":"engine/src/CodeHealth.Core/ModelAware/RuntimeBoot/BootMechanismDetector.cs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a3a532834710d386ad7f15bac410b24d619c2b0b26ebdd7287a533b75b4af70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): engine/src/CodeHealth.Cli/Commands/JvmSidecar.cs:1412-1422 | engine/src/CodeHealth.Cli/Commands/JvmSidecar.cs:1477-1487 | engine/src/CodeHealth.Cli/Commands/JvmSidecar.cs:1642-1652 | engine/src/CodeHealth.Cli/Commands/JvmSidecar.cs:1750-1760 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Cli/Commands/JvmSidecar.cs:1412\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":"engine/src/CodeHealth.Cli/Commands/JvmSidecar.cs"},"region":{"startLine":1412}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c49c7449c4f6215ce7e4eb6d75d4b936b31a10ca0a543b8b63a5ef101b96a37"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): engine/src/CodeHealth.Dimensions.Security/SecretsHistoryAnalyzer.cs:613-623 | engine/src/CodeHealth.Dimensions.Security/SecretsHistoryAnalyzer.cs:690-700 | engine/src/CodeHealth.Dimensions.Security/SecretsHistoryAnalyzer.cs:749-759 | engine/src/CodeHealth.Dimensions.Security/SecretsHistoryAnalyzer.cs:1783-1793 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Dimensions.Security/SecretsHistoryAnalyzer.cs:613\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":"engine/src/CodeHealth.Dimensions.Security/SecretsHistoryAnalyzer.cs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"584a9f0ef8f19652b6b3bea63875297bb981f552f0a7205e730ed9c7c931f1c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): engine/src/CodeHealth.Core/CodeModel/Roslyn/RoslynMethodBody.cs:265-275 | engine/src/CodeHealth.Core/CodeModel/Roslyn/RoslynVbMethodBody.cs:249-259 | engine/src/CodeHealth.Core/ModelAware/InvocationMatching.cs:406-416 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060engine/src/CodeHealth.Core/CodeModel/Roslyn/RoslynVbMethodBody.cs:261\u0060 calls \u0060foreach\u0060 and \u0060engine/src/CodeHealth.Core/CodeModel/Roslyn/RoslynMethodBody.cs:277\u0060 does not \u2014 after which the two agree again for 3 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":"engine/src/CodeHealth.Core/CodeModel/Roslyn/RoslynMethodBody.cs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"98d34583849ff93867c6f1636f1cd0b48bf43be3766eadc77b7b0c1b0287ecba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): engine/src/CodeHealth.Core/Dart/DartDeadLibraryField.cs:668-678 | engine/src/CodeHealth.Core/ModelAware/MutationIdempotencyAnalyzer.cs:1524-1534 | engine/src/CodeHealth.Dimensions.Security/Scanners/RubyDuplicateMethodDefinitionScan.cs:294-304 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Core/Dart/DartDeadLibraryField.cs:668\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060engine/src/CodeHealth.Dimensions.Security/Scanners/RubyDuplicateMethodDefinitionScan.cs:291\u0060 calls \u0060MentionsMethod\u0060 and \u0060engine/src/CodeHealth.Core/ModelAware/MutationIdempotencyAnalyzer.cs:1521\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":"engine/src/CodeHealth.Core/Dart/DartDeadLibraryField.cs"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"a26ea9d2bd564c2dc5efce4c34439203a21bac9a71bff8cd3ff6ce2e183c98d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): engine/src/CodeHealth.Core/Dependencies/HexRegistryClient.cs:138-148 | engine/src/CodeHealth.Core/Dependencies/RubyGemsRegistryClient.cs:283-293 | engine/src/CodeHealth.Core/Dependencies/UnityRegistryClient.cs:140-150 \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 \u0060engine/src/CodeHealth.Core/Dependencies/HexRegistryClient.cs:138\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":"engine/src/CodeHealth.Core/Dependencies/HexRegistryClient.cs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0b2860d4603e7644d887febd2b20705c852e12c116fa12b1f4e23f0914b3e48"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): engine/src/CodeHealth.Core/Frontend/EntryPointCatalog.cs:2582-2592 | engine/src/CodeHealth.Core/Frontend/FrontendDeclaredPackageRefs.cs:191-201 | engine/src/CodeHealth.Core/Frontend/FrontendModuleGraph.cs:517-527 \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 \u0060engine/src/CodeHealth.Core/Frontend/EntryPointCatalog.cs:2582\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":"engine/src/CodeHealth.Core/Frontend/EntryPointCatalog.cs"},"region":{"startLine":2582}}}],"partialFingerprints":{"codehealthFindingId/v1":"38380fa34f7442be69cdda2efd75f4731f0f8d5560cbe48adafa6f0578f01b5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): engine/src/CodeHealth.Core/ModelAware/GoDomainConventions.cs:595-605 | engine/src/CodeHealth.Core/ModelAware/JavaDomainConventions.cs:519-530 | engine/src/CodeHealth.Core/ModelAware/PythonDomainConventions.cs:332-343 \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 \u0060engine/src/CodeHealth.Core/ModelAware/GoDomainConventions.cs:595\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":"engine/src/CodeHealth.Core/ModelAware/GoDomainConventions.cs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8ba7f2b84da7f75f7211d25bcaa12cb4b441eb79cb78e62864b43a9fd05df8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): engine/src/CodeHealth.Dimensions.Architecture/CouplingAnalyzer.cs:34-57 | engine/src/CodeHealth.Dimensions.Architecture/ProjectCohesionAnalyzer.cs:43-56 | engine/src/CodeHealth.Dimensions.Docs/CommentValueAnalyzer.cs:35-45 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Dimensions.Architecture/CouplingAnalyzer.cs:34\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. 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":"engine/src/CodeHealth.Dimensions.Architecture/CouplingAnalyzer.cs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"374b56f241712be648bd4ac3ac91909d2b3526a20d58bedb1251e5431437e662"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): engine/src/CodeHealth.Dimensions.Security/Scanners/DependencyUpdateCooldownCollapse.cs:54-65 | engine/src/CodeHealth.Dimensions.Security/Scanners/EolActionMajorRepositoryFold.cs:132-142 | engine/src/CodeHealth.Dimensions.Security/Scanners/KsvSecurityContextAggregator.cs:75-87 \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 \u0060engine/src/CodeHealth.Dimensions.Security/Scanners/DependencyUpdateCooldownCollapse.cs:54\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060engine/src/CodeHealth.Dimensions.Security/Scanners/DependencyUpdateCooldownCollapse.cs:53\u0060 calls \u0060RuleName\u0060 and \u0060engine/src/CodeHealth.Dimensions.Security/Scanners/EolActionMajorRepositoryFold.cs:130\u0060 does not \u2014 after which the two agree again for 3 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/DependencyUpdateCooldownCollapse.cs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a18cf5cc4e00391f424f91593c9a3d99e5c4278a48f0c075a49a8bb2f1ba40c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): engine/src/CodeHealth.Dimensions.Security/Scanners/GitOwnershipCheckDisabledScan.cs:104-114 | engine/src/CodeHealth.Dimensions.Security/Scanners/PythonInstallGuardDisabledScan.cs:196-206 | engine/src/CodeHealth.Dimensions.Security/Scanners/WorldWritableOwnedPathScan.cs:118-128 \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 \u0060engine/src/CodeHealth.Dimensions.Security/Scanners/GitOwnershipCheckDisabledScan.cs:104\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":"engine/src/CodeHealth.Dimensions.Security/Scanners/GitOwnershipCheckDisabledScan.cs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"e44908271d23b60dea0548b773f9c87ac03b6429fe10f5068700ed1fb10ac902"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): engine/src/CodeHealth.Core/ExplicitDebt/RazorMarkupReferenceScanner.cs:122-132 | engine/src/CodeHealth.Core/ExplicitDebt/RazorMarkupReferenceScanner.cs:184-203 \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 \u0060engine/src/CodeHealth.Core/ExplicitDebt/RazorMarkupReferenceScanner.cs:122\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":"engine/src/CodeHealth.Core/ExplicitDebt/RazorMarkupReferenceScanner.cs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"6968ced8fde74107513830d35ec6c357d1959fbf6c0fcc988964ef659acbb341"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs:327-337 | engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs:1412-1422 \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 \u0060engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs:1412\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":"engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"1014e8850a17c28389c985e95466e6f611d71aa5f3ca80601037f973d461ea98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/ArchitectureModelAnalyzer.cs:475-485 | engine/src/CodeHealth.Core/ModelAware/ArchitectureModelAnalyzer.cs:2035-2045 \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 \u0060engine/src/CodeHealth.Core/ModelAware/ArchitectureModelAnalyzer.cs:475\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. 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":"engine/src/CodeHealth.Core/ModelAware/ArchitectureModelAnalyzer.cs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"99dc3853e437cfd5a2c6bfe522608ef7ba01cacba417da90f1141c3bdcb3440f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/CSharpCorrectnessAnalyzer.cs:873-883 | engine/src/CodeHealth.Core/ModelAware/CSharpCorrectnessAnalyzer.cs:1343-1353 \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":"engine/src/CodeHealth.Core/ModelAware/CSharpCorrectnessAnalyzer.cs"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"37c7aade7bc018cfcc83492f080ac3a13f36865df6e445e3aa06b07c6a213b2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/CSharpCorrectnessAnalyzer.cs:1963-1973 | engine/src/CodeHealth.Core/ModelAware/CSharpCorrectnessAnalyzer.cs:1982-1992 \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 \u0060engine/src/CodeHealth.Core/ModelAware/CSharpCorrectnessAnalyzer.cs:1963\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":"engine/src/CodeHealth.Core/ModelAware/CSharpCorrectnessAnalyzer.cs"},"region":{"startLine":1963}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2adf4b6a0ae2857e0f4de5684b4d1d94d88c7189d9721f0f3fee52dcdc711c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/EventSourcingAnalyzer.cs:744-754 | engine/src/CodeHealth.Core/ModelAware/EventSourcingAnalyzer.cs:780-790 \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 \u0060engine/src/CodeHealth.Core/ModelAware/EventSourcingAnalyzer.cs:744\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. 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":"engine/src/CodeHealth.Core/ModelAware/EventSourcingAnalyzer.cs"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4f1aa072cb7d4715c6281f5b65037626813134078f47ae6574e0229319df3af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/IncompletenessAnalyzer.cs:321-331 | engine/src/CodeHealth.Core/ModelAware/IncompletenessAnalyzer.cs:385-395 \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 \u0060engine/src/CodeHealth.Core/ModelAware/IncompletenessAnalyzer.cs:321\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. 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":"engine/src/CodeHealth.Core/ModelAware/IncompletenessAnalyzer.cs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"89af8a7827efec08d238321531b6c853989df43888d2b92a35fa57f9e8764722"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/PhpDomainConventions.cs:345-355 | engine/src/CodeHealth.Core/ModelAware/RubyDomainConventions.cs:529-540 \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 \u0060engine/src/CodeHealth.Core/ModelAware/PhpDomainConventions.cs:345\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. 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060engine/src/CodeHealth.Core/ModelAware/RubyDomainConventions.cs:526\u0060 calls \u0060Equals\u0060 and \u0060engine/src/CodeHealth.Core/ModelAware/PhpDomainConventions.cs:342\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":"engine/src/CodeHealth.Core/ModelAware/PhpDomainConventions.cs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"592049a96286c66c589162e74d4af3d831f42fafa6f11f5cc447622089606cfa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/RuntimeAccessibility/BootedAppRenderer.cs:101-112 | engine/src/CodeHealth.Core/ModelAware/RuntimeAccessibility/BootedAppRenderer.cs:201-211 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Core/ModelAware/RuntimeAccessibility/BootedAppRenderer.cs:101\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. 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":"engine/src/CodeHealth.Core/ModelAware/RuntimeAccessibility/BootedAppRenderer.cs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d5aee44955ae51934eaef45b4f540963da88a14c14d44df072707e8bc36e838"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs:6272-6282 | engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs:6312-6322 \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 \u0060engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs:6272\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":"engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs"},"region":{"startLine":6272}}}],"partialFingerprints":{"codehealthFindingId/v1":"989027f8ae3e583c4724edca6d63882a3b3ca0a70bd7d36c8b1adcf13d57e384"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): engine/src/CodeHealth.Toolchain/MsBuild/DotnetSdkProvisioner.cs:241-250 | engine/src/CodeHealth.Toolchain/MsBuild/SdkPinReconciler.cs:147-157 \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 \u0060engine/src/CodeHealth.Toolchain/MsBuild/DotnetSdkProvisioner.cs: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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060engine/src/CodeHealth.Toolchain/MsBuild/DotnetSdkProvisioner.cs:240\u0060 calls \u0060ThrowIfNull\u0060 and \u0060engine/src/CodeHealth.Toolchain/MsBuild/SdkPinReconciler.cs:146\u0060 does not \u2014 after which the two agree again for 3 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":"engine/src/CodeHealth.Toolchain/MsBuild/DotnetSdkProvisioner.cs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"738c8b05599205e702c825ac78c73b15637724a6cb2f9a1c17c56eb3af8f52a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): engine/src/CodeHealth.Dimensions.Security/Scanners/CommittedKeyStoreScan.cs:77-87 | engine/src/CodeHealth.Dimensions.Security/Scanners/CommittedPrivateKeyBlobScan.cs:51-61 \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 \u0060engine/src/CodeHealth.Dimensions.Security/Scanners/CommittedKeyStoreScan.cs:77\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":"engine/src/CodeHealth.Dimensions.Security/Scanners/CommittedKeyStoreScan.cs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"301dad3971da9586b0a588639ce6251b0b902054b7d4429046e0a2e307fa15b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): engine/src/CodeHealth.Dimensions.Security/Scanners/MutableGitCloneScan.cs:113-123 | engine/src/CodeHealth.Dimensions.Security/Scanners/UnverifiedRemoteInstallerScan.cs:1331-1341 \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 \u0060engine/src/CodeHealth.Dimensions.Security/Scanners/MutableGitCloneScan.cs:113\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":"engine/src/CodeHealth.Dimensions.Security/Scanners/MutableGitCloneScan.cs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"376142c329224175652aaff2d36be9ce1dd08d16aeebb2a48b0860980c48d272"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): engine/src/CodeHealth.Dimensions.Security/SecretsHistoryAnalyzer.cs:559-569 | engine/src/CodeHealth.Dimensions.Security/SecretsHistoryAnalyzer.cs:792-802 \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 \u0060engine/src/CodeHealth.Dimensions.Security/SecretsHistoryAnalyzer.cs:559\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":"engine/src/CodeHealth.Dimensions.Security/SecretsHistoryAnalyzer.cs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"435ae7aa472aa874972a1850962cf49fcfd5816f2479cb90f1225160215fe608"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs:6407-6417 | engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs:6491-6501 \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 \u0060engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs:6407\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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":6407}}}],"partialFingerprints":{"codehealthFindingId/v1":"018c488376b05e9d59fccadf25da79e3a285af3e3d4c329002bfafa9f90ddb06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): src/Kennel.Core/Portfolios/Ui/Portfolio.razor:232-241 | src/Kennel.Core/Portfolios/Ui/Products.razor:268-278 \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 \u0060src/Kennel.Core/Portfolios/Ui/Portfolio.razor:232\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":"src/Kennel.Core/Portfolios/Ui/Portfolio.razor"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9be9b02bf0f6efad1a256b547938843113af3716867669d24c7d6fb7eec585a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 6): engine/src/CodeHealth.Dimensions.Security/Scanners/BuildTimeKeyMaterialScan.cs:349-358 | engine/src/CodeHealth.Dimensions.Security/Scanners/BuildTimeKeyMaterialScan.cs:381-390 | engine/src/CodeHealth.Dimensions.Security/Scanners/MutableGitCloneScan.cs:113-122 | engine/src/CodeHealth.Dimensions.Security/Scanners/UnverifiedRemoteInstallerScan.cs:882-891 | engine/src/CodeHealth.Dimensions.Security/Scanners/UnverifiedRemoteInstallerScan.cs:1331-1340 | engine/src/CodeHealth.Dimensions.Security/Scanners/UnverifiedRemoteInstallerScan.cs:1376-1385 \u2014 there are 6 copies across 3 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 6 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Dimensions.Security/Scanners/BuildTimeKeyMaterialScan.cs:349\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":"engine/src/CodeHealth.Dimensions.Security/Scanners/BuildTimeKeyMaterialScan.cs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a6ea5a9c60af600561aac10f2ad39b8ea055cf6ab22df9994a204f5e5ea7c9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 5): engine/src/CodeHealth.Core/Dependencies/GoProxyClient.cs:117-124 | engine/src/CodeHealth.Core/Dependencies/HexRegistryClient.cs:126-135 | engine/src/CodeHealth.Core/Dependencies/OsvAdvisoryClient.cs:144-151 | engine/src/CodeHealth.Core/Dependencies/RubyGemsRegistryClient.cs:271-280 | engine/src/CodeHealth.Core/Dependencies/UnityRegistryClient.cs:130-137 \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 5 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":"engine/src/CodeHealth.Core/Dependencies/GoProxyClient.cs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e9478987826d6b123ba22c118417fe9f317c5d74831314c7ac6dfe9af9f8e73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): engine/src/CodeHealth.Core/CodeShape/ChainedCorrespondence.cs:93-102 | engine/src/CodeHealth.Core/CodeShape/ChainedFamilyRollup.cs:106-115 | engine/src/CodeHealth.Core/CodeShape/MemberFamilyRollup.cs:186-195 | engine/src/CodeHealth.Core/CodeShape/MemberPairRollup.cs:85-94 \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 4 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Core/CodeShape/ChainedCorrespondence.cs:93\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060engine/src/CodeHealth.Core/CodeShape/ChainedCorrespondence.cs:91\u0060 calls \u0060CommonDirectoryPrefixLength\u0060 and \u0060engine/src/CodeHealth.Core/CodeShape/MemberPairRollup.cs:81\u0060 does not \u2014 after which the two agree again for 4 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":"engine/src/CodeHealth.Core/CodeShape/ChainedCorrespondence.cs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"57457297d505776bc8fb3e6dca42cfaa2420b226db0765665b32a3abba865b03"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): engine/src/CodeHealth.Core/Frontend/EntryPointCatalog.cs:2583-2592 | engine/src/CodeHealth.Core/Frontend/FrontendDeclaredPackageRefs.cs:192-201 | engine/src/CodeHealth.Core/Frontend/FrontendModuleGraph.cs:518-527 | engine/src/CodeHealth.Core/Frontend/ModuleGlobPattern.cs:64-73 \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 4 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Core/Frontend/EntryPointCatalog.cs:2583\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":"engine/src/CodeHealth.Core/Frontend/EntryPointCatalog.cs"},"region":{"startLine":2583}}}],"partialFingerprints":{"codehealthFindingId/v1":"e974c43c6ab4442cc76dfc20871ee92f377660d17c64d16425733d8c34d4457d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): engine/src/CodeHealth.Core/Diagnostics/ScanBudgets.cs:437-446 | engine/src/CodeHealth.Core/Diagnostics/ScanBudgets.cs:676-685 | engine/src/CodeHealth.Core/Diagnostics/ScanBudgets.cs:826-835 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Core/Diagnostics/ScanBudgets.cs:437\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":"engine/src/CodeHealth.Core/Diagnostics/ScanBudgets.cs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"1024b511133ce67be66e0207dd2333e450f3a9d3852cf142daf27671d5f726d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): engine/src/CodeHealth.Core/ModelAware/ArchitectureModelAnalyzer.cs:473-482 | engine/src/CodeHealth.Core/ModelAware/ArchitectureModelAnalyzer.cs:2020-2029 | engine/src/CodeHealth.Core/ModelAware/ArchitectureModelAnalyzer.cs:2033-2042 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/ArchitectureModelAnalyzer.cs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dd17f6b4a4abac799acc70c426a666784e102fd19f6e7ce31425c86e3c9807a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): engine/src/CodeHealth.Core/ModelAware/MutationIdempotencyAnalyzer.cs:496-506 | engine/src/CodeHealth.Core/ModelAware/MutationIdempotencyAnalyzer.cs:1403-1412 | engine/src/CodeHealth.Core/ModelAware/MutationIdempotencyAnalyzer.cs:1638-1647 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. 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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060method\u0060 to \u0060IMethodSymbol\u0060 in one and \u0060Nm.IMethod\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/MutationIdempotencyAnalyzer.cs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"76dee9ee2abcd416e651e63fc32bd78c9d3fda04e10d2d310f882a3fa39379a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): engine/src/CodeHealth.Core/ModelAware/SwiftDomainConventions.cs:847-856 | engine/src/CodeHealth.Core/ModelAware/SwiftDomainConventions.cs:1056-1065 | engine/src/CodeHealth.Core/ModelAware/SwiftDomainConventions.cs:1199-1208 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Core/ModelAware/SwiftDomainConventions.cs:847\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":"engine/src/CodeHealth.Core/ModelAware/SwiftDomainConventions.cs"},"region":{"startLine":847}}}],"partialFingerprints":{"codehealthFindingId/v1":"2faa72df44d696b39aa8cb73f4f80a544f00da056c1e00385f53dc75ad31baa3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): engine/src/CodeHealth.Dimensions.Security/Scanners/ScanParsers.cs:429-438 | engine/src/CodeHealth.Dimensions.Security/Scanners/ScanParsers.cs:495-504 | engine/src/CodeHealth.Dimensions.Security/Scanners/ScanParsers.cs:532-541 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Dimensions.Security/Scanners/ScanParsers.cs:429\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":"engine/src/CodeHealth.Dimensions.Security/Scanners/ScanParsers.cs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"97f27492c5607a18c667c4832f3baf92bcc3e6acfcbefaad030f15306794a4b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 3): engine/src/CodeHealth.Dimensions.GitMining/ChangeCouplingAnalyzer.cs:3843-3851 | engine/src/CodeHealth.Dimensions.GitMining/ChangeCouplingAnalyzer.cs:3890-3898 | engine/src/CodeHealth.Dimensions.GitMining/ChangeCouplingAnalyzer.cs:4403-4412 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Dimensions.GitMining/ChangeCouplingAnalyzer.cs:3843\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.GitMining/ChangeCouplingAnalyzer.cs"},"region":{"startLine":3843}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d7e5bf2d108d0caa6421be0516794838bc86bb654eb4b382b68254890ba922c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): engine/src/CodeHealth.Core/Architecture/Topology/Extractors/CrossplaneExtractor.cs:32-41 | engine/src/CodeHealth.Core/Architecture/Topology/Extractors/KubernetesExtractor.cs:31-40 \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 \u0060engine/src/CodeHealth.Core/Architecture/Topology/Extractors/CrossplaneExtractor.cs:32\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":"engine/src/CodeHealth.Core/Architecture/Topology/Extractors/CrossplaneExtractor.cs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"06b815628947dc520e7139511e2fd868244f18f77e53d25de182e0c3bab72b75"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): engine/src/CodeHealth.Core/ExplicitDebt/RazorMarkupReferenceScanner.cs:321-330 | engine/src/CodeHealth.Core/ExplicitDebt/XamlMarkupReferenceScanner.cs:244-253 \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 \u0060engine/src/CodeHealth.Core/ExplicitDebt/RazorMarkupReferenceScanner.cs:321\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ExplicitDebt/RazorMarkupReferenceScanner.cs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"52b369718d0be8a2056836ff536782d3717b2fd3224866fd24f2fe43a6e39722"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): engine/src/CodeHealth.Core/Frontend/FrontendScriptCommandRefs.cs:903-912 | engine/src/CodeHealth.Core/Frontend/FrontendWorkspaceWalk.cs:59-68 \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 \u0060engine/src/CodeHealth.Core/Frontend/FrontendScriptCommandRefs.cs:903\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":"engine/src/CodeHealth.Core/Frontend/FrontendScriptCommandRefs.cs"},"region":{"startLine":903}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9ba5a5e6fc57d6153e83707f83a007700a149b51a92b09b35d2ee1938e2989a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): engine/src/CodeHealth.Core/Frontend/FrontendToolAndRuntimeRefs.cs:318-327 | engine/src/CodeHealth.Core/Frontend/FrontendToolAndRuntimeRefs.cs:406-416 \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 \u0060engine/src/CodeHealth.Core/Frontend/FrontendToolAndRuntimeRefs.cs:318\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":"engine/src/CodeHealth.Core/Frontend/FrontendToolAndRuntimeRefs.cs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f0ff241b2e90db3b606a14919f0ef1ac81c5458c0372c6fc08b1e4e2f4ffafe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/CsprojReferenceGraph.cs:778-787 | engine/src/CodeHealth.Core/Statistics/XmlProjectGraphBuilder.cs:91-100 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Core/ModelAware/CsprojReferenceGraph.cs:778\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":"engine/src/CodeHealth.Core/ModelAware/CsprojReferenceGraph.cs"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"faa875672fc85cc00b9a30dfea0049c27a6fbe5a40fd6086286bf9935dbf0160"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs:908-919 | engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs:2629-2638 \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 \u0060engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs:908\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. 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":"engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbc4505704efa9b6a8c4adeed6fa0f92667976955c0eea068d96b98b19674698"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs:4902-4911 | engine/src/CodeHealth.Core/ModelAware/InvocationMatching.cs:160-169 \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":"engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs"},"region":{"startLine":4902}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dffb4e7edb7cd9b8351362585d7b87f87836831c2902d7780846c174b41143c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs:385-394 | engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs:689-698 \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 \u0060engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs:385\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs:685\u0060 calls \u0060HandlerDependsOnOutbox\u0060 and \u0060engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs:384\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":"engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"a71b33e018cd191721acc9542444ad779448c92972b5195cc19fb87ddd4bfda0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/PhpDomainConventions.cs:236-245 | engine/src/CodeHealth.Core/ModelAware/PythonDomainConventions.cs:418-427 \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 \u0060engine/src/CodeHealth.Core/ModelAware/PhpDomainConventions.cs:236\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":"engine/src/CodeHealth.Core/ModelAware/PhpDomainConventions.cs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbd982abd21334c96bf4c2f2a346ea1c6dd46154f8f17fc0c773918d0ffe8b89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): engine/src/CodeHealth.Dimensions.Architecture/InternalApiConsistencyAnalyzer.cs:151-165 | engine/src/CodeHealth.Dimensions.Docs/CommentValueAnalyzer.cs:45-54 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Dimensions.Architecture/InternalApiConsistencyAnalyzer.cs:151\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Architecture/InternalApiConsistencyAnalyzer.cs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"e29e7a5d4daefe00ba6c0b84c3248f9a930c6f13e59b16f3c788ffe4e3147399"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): engine/src/CodeHealth.Dimensions.Security/DependencyVulnerabilityUnion.cs:148-157 | engine/src/CodeHealth.Dimensions.Security/OsvScannerAnalyzer.cs:214-236 \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. 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":"engine/src/CodeHealth.Dimensions.Security/DependencyVulnerabilityUnion.cs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"41a3ff0ebc3b4fc738ef9576a44de5dfb3d8d6250ebc7e2abd7a695dfba8da0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/Kennel.Core/Billing/Ui/CohortTermsPage.razor:155-164 | src/Kennel.Core/Questionnaires/Ui/ReviewRunner.razor:740-749 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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":"src/Kennel.Core/Billing/Ui/CohortTermsPage.razor"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dae98b836bde25cbbd88f2958f16dff867051f60701fbbfcb550515f19f5208"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): src/Kennel.Core/Compliance/Ui/ComplianceActivation.razor:150-159 | src/Kennel.Core/Compliance/Ui/Declarations.razor:118-126 \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":"src/Kennel.Core/Compliance/Ui/ComplianceActivation.razor"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"02dfa124e12fee9c0b7519a37114263b08e456c2da88cab361a333e4509ec00e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/Kennel.Assay.Core/Governance/Ui/BarDetail.razor:234-243 | src/Kennel.Assay.Core/Governance/Ui/GovernanceBars.razor:199-208 \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":"src/Kennel.Assay.Core/Governance/Ui/BarDetail.razor"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"61aa4e20065a0bab5526566b2c9627b423eaaec7e600779296a404f3018881b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 7): engine/src/CodeHealth.Cli/Commands/AnalyzeCommand.cs:4127-4134 | engine/src/CodeHealth.Cli/Commands/AnalyzeCommand.cs:4221-4228 | engine/src/CodeHealth.Cli/Commands/AnalyzeCommand.cs:4315-4322 | engine/src/CodeHealth.Cli/Commands/AnalyzeCommand.cs:4560-4567 | engine/src/CodeHealth.Cli/Commands/AnalyzeCommand.cs:4606-4613 | engine/src/CodeHealth.Cli/Commands/AnalyzeCommand.cs:4646-4653 | engine/src/CodeHealth.Cli/Commands/AnalyzeCommand.cs:4687-4695 \u2014 all 7 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Cli/Commands/AnalyzeCommand.cs:4127\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060engine/src/CodeHealth.Cli/Commands/AnalyzeCommand.cs:4656\u0060 calls \u0060Contains\u0060 and \u0060engine/src/CodeHealth.Cli/Commands/AnalyzeCommand.cs:4137\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":"engine/src/CodeHealth.Cli/Commands/AnalyzeCommand.cs"},"region":{"startLine":4127}}}],"partialFingerprints":{"codehealthFindingId/v1":"52b2376841cf1d750a457c076ca73727955967012341a4c38d375eafcb1b9985"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): engine/src/CodeHealth.Dimensions.Security/Scanners/DockerfileShapeRuleFilter.cs:909-917 | engine/src/CodeHealth.Dimensions.Security/Scanners/DockerfileShapeRuleFilter.cs:954-963 | engine/src/CodeHealth.Dimensions.Security/Scanners/DockerfileShapeRuleFilter.cs:1020-1028 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060engine/src/CodeHealth.Dimensions.Security/Scanners/DockerfileShapeRuleFilter.cs:952\u0060 calls \u0060foreach\u0060 and \u0060engine/src/CodeHealth.Dimensions.Security/Scanners/DockerfileShapeRuleFilter.cs:1018\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":"engine/src/CodeHealth.Dimensions.Security/Scanners/DockerfileShapeRuleFilter.cs"},"region":{"startLine":909}}}],"partialFingerprints":{"codehealthFindingId/v1":"da10c44b87e91c8847d5612de4c7e209371abcf21baf05dde376043c6ae8a8fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): engine/src/CodeHealth.Dimensions.Security/Scanners/ScanParsers.cs:1157-1165 | engine/src/CodeHealth.Dimensions.Security/Scanners/ScanParsers.cs:1218-1226 | engine/src/CodeHealth.Dimensions.Security/Scanners/ScanParsers.cs:1623-1631 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Dimensions.Security/Scanners/ScanParsers.cs:1157\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":"engine/src/CodeHealth.Dimensions.Security/Scanners/ScanParsers.cs"},"region":{"startLine":1157}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1748be642453b934df3381527b204be3ca1a5b916fbc13b99aa29122ce4dab3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 3): engine/src/CodeHealth.Llm.ClaudeCli/ClaudeCliLlmProvider.cs:40-48 | engine/src/CodeHealth.Llm.CopilotCli/CopilotCliLlmProvider.cs:39-46 | engine/src/CodeHealth.Llm.OpenAiCompatible/OpenAiCompatibleLlmProvider.cs:123-131 \u2014 before extracting anything, compare \u0060engine/src/CodeHealth.Llm.ClaudeCli/ClaudeCliLlmProvider.cs\u0060 and \u0060engine/src/CodeHealth.Llm.CopilotCli/CopilotCliLlmProvider.cs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Llm.ClaudeCli/ClaudeCliLlmProvider.cs:40\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. 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. 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":"engine/src/CodeHealth.Llm.ClaudeCli/ClaudeCliLlmProvider.cs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"1625a1232588c267529f151f577ce95726ab512cd168d4126aa6a362b9699a23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): engine/src/CodeHealth.Core/CodeShape/LineBasedGodClassDetector.cs:328-336 | engine/src/CodeHealth.Core/Cohesion/Lcom4Calculator.cs:313-321 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Core/CodeShape/LineBasedGodClassDetector.cs:328\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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060codeModel\u0060 to \u0060CodeModel.ICodeModel\u0060 in one and \u0060ICodeModel\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/CodeShape/LineBasedGodClassDetector.cs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f1d2d79670c7cd7c4aef14a4d723596b977dd64f7d3a7a81593d5236b590c84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): engine/src/CodeHealth.Core/Dependencies/PnpmLockfileReader.cs:241-249 | engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs:10641-10649 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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":"engine/src/CodeHealth.Core/Dependencies/PnpmLockfileReader.cs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"5de79c724616e5f6940fb7da9663ad2d76a4cbc870b3d75a4d57ac962c4079e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs:2502-2510 | engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs:2537-2545 \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 \u0060engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs:2502\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":"engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs"},"region":{"startLine":2502}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ebfdd2cf96c62082e8f052fba1ddf630b65cfb8754c69088065d6c0ef654416"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/ArchitectureModelAnalyzer.cs:911-919 | engine/src/CodeHealth.Core/ModelAware/ArchitectureModelAnalyzer.cs:981-989 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060engine/src/CodeHealth.Core/ModelAware/ArchitectureModelAnalyzer.cs:938\u0060 calls \u0060IsUiThreadAffineViewType\u0060 and \u0060engine/src/CodeHealth.Core/ModelAware/ArchitectureModelAnalyzer.cs:990\u0060 does not \u2014 after which the two agree again for 3 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":"engine/src/CodeHealth.Core/ModelAware/ArchitectureModelAnalyzer.cs"},"region":{"startLine":911}}}],"partialFingerprints":{"codehealthFindingId/v1":"45807bb0116be85dea07f30a609864261a41d48b2feb14bc35b12b6f2c55f3ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/EventSourcingAnalyzer.cs:380-388 | engine/src/CodeHealth.Core/ModelAware/EventSourcingAnalyzer.cs:1039-1047 \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 \u0060engine/src/CodeHealth.Core/ModelAware/EventSourcingAnalyzer.cs:380\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"engine/src/CodeHealth.Core/ModelAware/EventSourcingAnalyzer.cs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"751693c05d471a7a6024e71367c38c7b47653bfb29a80b51fb61a58cc3500636"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/RustDomainConventions.cs:914-922 | engine/src/CodeHealth.Core/ModelAware/RustDomainConventions.cs:1003-1010 \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 \u0060engine/src/CodeHealth.Core/ModelAware/RustDomainConventions.cs:914\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/RustDomainConventions.cs"},"region":{"startLine":914}}}],"partialFingerprints":{"codehealthFindingId/v1":"15d8ecd3b1beccb322a061a1a8a37bd505fb65739add8100781fc0b96d7f9757"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): engine/src/CodeHealth.Core/Scoring/SourceTreeWalk.cs:162-170 | engine/src/CodeHealth.Core/Scoring/SourceTreeWalk.cs:276-284 \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 \u0060engine/src/CodeHealth.Core/Scoring/SourceTreeWalk.cs:162\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":"engine/src/CodeHealth.Core/Scoring/SourceTreeWalk.cs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"81e2c6637e6dd55104b68da6d40c62d9ed2cb78ea6d1a76754b469deb357a030"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): engine/src/CodeHealth.Reporting/Templates/ReportViewModelFactory.cs:1364-1372 | engine/src/CodeHealth.Reporting/Templates/ReportViewModelFactory.cs:1382-1390 \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":"engine/src/CodeHealth.Reporting/Templates/ReportViewModelFactory.cs"},"region":{"startLine":1364}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7de1668ae00cf2197e61ba23f0bfc34766a4d22ef2f22683682b3c8f696b683"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): engine/src/CodeHealth.Dimensions.ExplicitDebt/ExplicitDebtAnalyzer.cs:243-251 | engine/src/CodeHealth.Dimensions.ExplicitDebt/ExplicitDebtAnalyzer.cs:688-696 \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 \u0060engine/src/CodeHealth.Dimensions.ExplicitDebt/ExplicitDebtAnalyzer.cs:243\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.ExplicitDebt/ExplicitDebtAnalyzer.cs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"8acbf12421881a69437c32c9094cdd067916240c65189f5cf5e3fc6a36c2250e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): engine/src/CodeHealth.Dimensions.CodeQuality/CodeShape/DuplicationAnalyzer.cs:3952-3960 | engine/src/CodeHealth.Dimensions.CodeQuality/CodeShape/DuplicationAnalyzer.cs:3961-3969 \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":"engine/src/CodeHealth.Dimensions.CodeQuality/CodeShape/DuplicationAnalyzer.cs"},"region":{"startLine":3952}}}],"partialFingerprints":{"codehealthFindingId/v1":"de0785ab3cb18cc9a9ad20e45cbbf5ba3b2e34fa29ab73b028598e42b640004e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): engine/src/CodeHealth.Dimensions.Security/RuntimeEnforcementAnalyzer.cs:61-69 | engine/src/CodeHealth.Dimensions.Security/SyscallConfinementAnalyzer.cs:49-57 \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 \u0060engine/src/CodeHealth.Dimensions.Security/RuntimeEnforcementAnalyzer.cs:61\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":"engine/src/CodeHealth.Dimensions.Security/RuntimeEnforcementAnalyzer.cs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab02545b52bb907f5e76ab5db6750bfa707c5ad02106f1f8643f0a053ed3aa0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): engine/src/CodeHealth.Dimensions.Security/Scanners/AutomountedServiceAccountTokenScan.cs:345-353 | engine/src/CodeHealth.Dimensions.Security/Scanners/HostPathPersistentVolumeScan.cs:213-221 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060engine/src/CodeHealth.Dimensions.Security/Scanners/HostPathPersistentVolumeScan.cs:210\u0060 calls \u0060IsPlaceholder\u0060, \u0060IsMatch\u0060 and \u0060engine/src/CodeHealth.Dimensions.Security/Scanners/AutomountedServiceAccountTokenScan.cs:342\u0060 does not \u2014 after which the two agree again for 3 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/AutomountedServiceAccountTokenScan.cs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"6665373c0bcf870f1efeae3bf8ee453332966916a3aaab7158db76419f1f6310"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): engine/src/CodeHealth.Dimensions.Security/Scanners/CargoLockGraph.cs:454-462 | engine/src/CodeHealth.Dimensions.Security/Scanners/CargoLockGraph.cs:474-482 \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. 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/CargoLockGraph.cs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3744003a7ad6e5a15e5983e000908f644a521856151ae5a03c22c3259cba93c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): engine/src/CodeHealth.Dimensions.Security/Scanners/ScanParsers.cs:3358-3366 | engine/src/CodeHealth.Dimensions.Security/Scanners/ScanParsers.cs:3484-3492 \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 \u0060engine/src/CodeHealth.Dimensions.Security/Scanners/ScanParsers.cs:3358\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":"engine/src/CodeHealth.Dimensions.Security/Scanners/ScanParsers.cs"},"region":{"startLine":3358}}}],"partialFingerprints":{"codehealthFindingId/v1":"f54a459f791972256abd7d7b3ea04a67207f01a2cc91d54814a0edfd3305bfb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs:7297-7305 | engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs:8601-8609 \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 \u0060engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs:7297\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. 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. 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs:7296\u0060 calls \u0060LeadingSpaces\u0060 and \u0060engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs:8600\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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":7297}}}],"partialFingerprints":{"codehealthFindingId/v1":"76e62e21c3904e01deba645451d13305f46d7374f12414b5af48618bc2714d97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs:3533-3540 | engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs:3594-3601 | engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs:3651-3658 | engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs:3768-3775 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs:3533\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":"engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs"},"region":{"startLine":3533}}}],"partialFingerprints":{"codehealthFindingId/v1":"62695389d34102289878cd6f7f92679ef9866ef49a7b27f88a9dc796843fbd2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): engine/src/CodeHealth.Core/ModelAware/CoherenceSmellAnalyzer.cs:57-64 | engine/src/CodeHealth.Core/ModelAware/DataShapeSmellAnalyzer.cs:52-59 | engine/src/CodeHealth.Core/ModelAware/StringContractSmellAnalyzer.cs:78-85 \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 \u0060engine/src/CodeHealth.Core/ModelAware/CoherenceSmellAnalyzer.cs:57\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":"engine/src/CodeHealth.Core/ModelAware/CoherenceSmellAnalyzer.cs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f76f8e9edc0b70cd5a145d41f32e4b7622736f42885c81a2141fa46e5034262"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): engine/src/CodeHealth.Core/ModelAware/EventSourcingAnalyzer.cs:870-877 | engine/src/CodeHealth.Core/ModelAware/EventSourcingAnalyzer.cs:930-937 | engine/src/CodeHealth.Core/ModelAware/EventSourcingAnalyzer.cs:994-1001 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Core/ModelAware/EventSourcingAnalyzer.cs:870\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. 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":"engine/src/CodeHealth.Core/ModelAware/EventSourcingAnalyzer.cs"},"region":{"startLine":870}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb7c683550c09da6b24f7127422ff0831c897c98f7eaa666d6d43a710dec498f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs:6268-6276 | engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs:6308-6316 | engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs:6781-6788 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs:6268\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":"engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs"},"region":{"startLine":6268}}}],"partialFingerprints":{"codehealthFindingId/v1":"53f83b60bf0fe1e83be3741fb67d82fb9230e02a4c38fdf5080aad80b5288190"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): engine/src/CodeHealth.Cli/Commands/AnalyzeCommand.cs:4005-4012 | engine/src/CodeHealth.Cli/Commands/AnalyzeCommand.cs:4064-4071 | engine/src/CodeHealth.Cli/Commands/AnalyzeCommand.cs:4692-4699 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. 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. 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060engine/src/CodeHealth.Cli/Commands/AnalyzeCommand.cs:4005\u0060 calls \u0060GetFileName\u0060 and \u0060engine/src/CodeHealth.Cli/Commands/AnalyzeCommand.cs:4064\u0060 does not \u2014 after which the two agree again for 5 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":"engine/src/CodeHealth.Cli/Commands/AnalyzeCommand.cs"},"region":{"startLine":4005}}}],"partialFingerprints":{"codehealthFindingId/v1":"f93211a93a7bcdd3d8c3743a048604de536388f75d7595c66490301dec448666"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 3): engine/src/CodeHealth.Core/CodeModel/Roslyn/CSharpCloneTokenizer.cs:509-516 | engine/src/CodeHealth.Core/CodeModel/Roslyn/CloneMemberContract.cs:28-33 | engine/src/CodeHealth.Core/CodeModel/Roslyn/VbCloneTokenizer.cs:229-236 \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 \u0060engine/src/CodeHealth.Core/CodeModel/Roslyn/CloneMemberContract.cs:28\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":"engine/src/CodeHealth.Core/CodeModel/Roslyn/CSharpCloneTokenizer.cs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0a9e8f4d081abf511ebfbee1b0dbfd5f2741ae005c13e1da8d498e733c8b690"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/CqsAnalyzer.cs:603-610 | engine/src/CodeHealth.Core/ModelAware/GdprPersonalDataAnalyzer.cs:319-326 \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":"engine/src/CodeHealth.Core/ModelAware/CqsAnalyzer.cs"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"db62e6d2636434e3877004358656086f95b4dbbf50c65a206f29cb2e21f5ca4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/CSharpCorrectnessAnalyzer.cs:28-36 | engine/src/CodeHealth.Core/ModelAware/LogicDefectAnalyzer.cs:91-98 \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 \u0060engine/src/CodeHealth.Core/ModelAware/CSharpCorrectnessAnalyzer.cs:28\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":"engine/src/CodeHealth.Core/ModelAware/CSharpCorrectnessAnalyzer.cs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"c09d72fce55f1b3e3cf6d8a4ee192849522f8d1daf3dcd1785515afd419b19ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs:789-796 | engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs:1794-1801 \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 \u0060engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs:789\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":"engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"8131d745141457cc1f42f01e497af8b1a7f4fd095c0dd9f78049670a8ca0f2bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/RuntimeBoot/PlaywrightAuthSetupLocator.cs:18-25 | engine/src/CodeHealth.Core/ModelAware/RuntimeBoot/TestSuiteCommandBuilder.cs:29-36 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Core/ModelAware/RuntimeBoot/PlaywrightAuthSetupLocator.cs:18\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":"engine/src/CodeHealth.Core/ModelAware/RuntimeBoot/PlaywrightAuthSetupLocator.cs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"96086187f69b905392a671f07d251305d4bef737b7b1c8e2e38aa48c51edcc57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): engine/src/CodeHealth.Dimensions.Security/Scanners/CargoLockGraph.cs:350-357 | engine/src/CodeHealth.Dimensions.Security/Scanners/CargoLockGraph.cs:428-435 \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 \u0060engine/src/CodeHealth.Dimensions.Security/Scanners/CargoLockGraph.cs:350\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":"engine/src/CodeHealth.Dimensions.Security/Scanners/CargoLockGraph.cs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5d9ff39031389f8365bb10521e7f7a4f69a92ed902d9cc23cf1a310814077bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): engine/src/CodeHealth.Dimensions.Security/Scanners/CurlPipeShellSourceRecheck.cs:269-276 | engine/src/CodeHealth.Dimensions.Security/Scanners/LoopbackAddressRecheck.cs:28-35 \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 \u0060engine/src/CodeHealth.Dimensions.Security/Scanners/CurlPipeShellSourceRecheck.cs:269\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":"engine/src/CodeHealth.Dimensions.Security/Scanners/CurlPipeShellSourceRecheck.cs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"60f9d9defb9fde4cc2c3c0dfb98144f9961a58cbbe8d6895da6073c3b1dca401"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs:2982-2989 | engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs:3337-3347 \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 \u0060engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs:2982\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":2982}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9adaaf75297b10ecba56d10b70cafeff0f5159edd69883a5c8638e67af71384"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs:5181-5188 | engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs:5256-5263 \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. 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. 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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":5181}}}],"partialFingerprints":{"codehealthFindingId/v1":"f918b6df0bca5e18d7c3f417dd7f01e94cd05ffbb58d747fc01230ae76e13b0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs:9138-9145 | engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs:9154-9161 \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 \u0060engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs:9138\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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":9138}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbab9ddcd1a74d5ed6174fb5c733ad675651b43d01a26e44230a44666e0030a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs:10663-10670 | engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs:10684-10691 \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 \u0060engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs:10663\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. 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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":10663}}}],"partialFingerprints":{"codehealthFindingId/v1":"20447c359823e993a991a15ad8c70a9452dc32409bf77fe078768c9a33fe555d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 2): engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs:10673-10680 | engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs:10719-10724 \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 \u0060engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs:10673\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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":10673}}}],"partialFingerprints":{"codehealthFindingId/v1":"917545e012610c174c97a3e83b6390522770619e642c0878f3caa97be257337d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 2): src/Kennel.Core/Inbox/Ui/Inbox.razor:25-32 | src/Kennel.Core/Inbox/Ui/InboxArchived.razor:19-24 \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 \u0060src/Kennel.Core/Inbox/Ui/Inbox.razor:25\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":"src/Kennel.Core/Inbox/Ui/Inbox.razor"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"68a262d6977a4daa70f033d52a676be7acb95891d6a45abd0549857508e3cbdf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/Kennel.Core/Deliveries/Ui/RepoEvidence.razor:532-539 | src/Kennel.Core/Deliveries/Ui/SellerDeliveries.razor:258-265 \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 \u0060src/Kennel.Core/Deliveries/Ui/RepoEvidence.razor:532\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Kennel.Core/Deliveries/Ui/RepoEvidence.razor"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"f76a24561df8c8a18bf4edd9ed11587fdf3a3b5737b1f5c1eb584aeab7e2cb51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/Kennel.Assay.Core/Governance/Ui/BarDetail.razor:202-209 | src/Kennel.Assay.Core/Governance/Ui/GovernanceBars.razor:170-177 \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 \u0060src/Kennel.Assay.Core/Governance/Ui/BarDetail.razor:202\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":"src/Kennel.Assay.Core/Governance/Ui/BarDetail.razor"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c86c3f586b558a9d76edd108b3630df39838c5e322ed8ec30fb8d8ced31e5bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 6): engine/src/CodeHealth.Core/Dependencies/GoProxyClient.cs:214-220 | engine/src/CodeHealth.Core/Dependencies/HexRegistryClient.cs:179-185 | engine/src/CodeHealth.Core/Dependencies/OsvAdvisoryClient.cs:193-199 | engine/src/CodeHealth.Core/Dependencies/RubyGemsRegistryClient.cs:192-198 | engine/src/CodeHealth.Core/Dependencies/RubyGemsRegistryClient.cs:327-333 | engine/src/CodeHealth.Core/Dependencies/UnityRegistryClient.cs:184-190 \u2014 there are 6 copies across 5 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 6 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Core/Dependencies/GoProxyClient.cs:214\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. 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. 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":"engine/src/CodeHealth.Core/Dependencies/GoProxyClient.cs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e274611005ccb51ed984899fba63b72791c15e4242b3c6569858a24e6353772"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): engine/src/CodeHealth.Dimensions.Security/Scanners/PrivateKeyBlobHistoryScan.cs:532-538 | engine/src/CodeHealth.Dimensions.Security/SecretsHistoryAnalyzer.cs:2424-2430 | engine/src/CodeHealth.Toolchain/Git/GitDiffShapes.cs:479-485 | engine/src/CodeHealth.Toolchain/Git/GitLogHistoryExtractor.cs:254-260 | engine/src/CodeHealth.Toolchain/Git/LibGit2GitAccessor.cs:351-357 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 5 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 5 times. 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/PrivateKeyBlobHistoryScan.cs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"d52d59c81c0abfa15dc607b174b76013f43d3ab09ccb3dcd7c6362db14ba8873"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs:7234-7240 | engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs:7314-7320 | engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs:7422-7428 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs:7234\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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":7234}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9925a27d1865a08747368eee1e1da222c9fd0aa9e71bbef8caaa456d35c434c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): engine/src/CodeHealth.Core/ExplicitDebt/MarkdownSnippetReferenceScanner.cs:158-164 | engine/src/CodeHealth.Reporting/Architecture/DsmHtml.cs:357-363 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Core/ExplicitDebt/MarkdownSnippetReferenceScanner.cs:158\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":"engine/src/CodeHealth.Core/ExplicitDebt/MarkdownSnippetReferenceScanner.cs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa615ca6fa3bca0c80c7de3887a218b1c464e2f705fbc4e6eea11568d9018117"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/ArchitectureStyleDetector.cs:72-78 | engine/src/CodeHealth.Core/ModelAware/ArchitectureStyleDetector.cs:87-93 \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. 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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060types\u0060 to \u0060IReadOnlyList\u003CINamedTypeSymbol\u003E\u0060 in one and \u0060IReadOnlyList\u003CNm.ICodeType\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/ArchitectureStyleDetector.cs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f6565c91b202adeff8db2b2c603abd764925700f3e05c876e4fe943850dc38c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/IncompletenessAnalyzer.cs:214-220 | engine/src/CodeHealth.Core/ModelAware/IncompletenessAnalyzer.cs:4656-4669 \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 \u0060engine/src/CodeHealth.Core/ModelAware/IncompletenessAnalyzer.cs:214\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":"engine/src/CodeHealth.Core/ModelAware/IncompletenessAnalyzer.cs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"28f415ae2b319d1d24e7c24944a90e9f78416b5f057447f95e19968b1e7bfb0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/LogicDefectAnalyzer.cs:92-99 | engine/src/CodeHealth.Core/ModelAware/LogicDefectAnalyzer.cs:100-106 \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":"engine/src/CodeHealth.Core/ModelAware/LogicDefectAnalyzer.cs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"67b8361a8622992b98317024cb87cae50b13e7ca22fa1250b0f69fc2a2fdf606"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): engine/src/CodeHealth.Toolchain/Git/RenameAliases.cs:157-163 | engine/src/CodeHealth.Toolchain/Git/RenameAliases.cs:169-175 \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 \u0060engine/src/CodeHealth.Toolchain/Git/RenameAliases.cs:157\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":"engine/src/CodeHealth.Toolchain/Git/RenameAliases.cs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"978b676fe96434b6159e5c3ca5f258134b2083a0a1933aef48e25abef703c07d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs:2937-2943 | engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs:3291-3300 \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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":2937}}}],"partialFingerprints":{"codehealthFindingId/v1":"e193439691f2e84cb14e3a675b9db49e67691307093c18d1d1731ba7019600d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/Kennel.Admin.Core/Admin/Ui/LanguageTrainingNoise.razor:588-594 | src/Kennel.Admin.Core/Admin/Ui/LanguageTrainingNoise.razor:612-618 \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 \u0060src/Kennel.Admin.Core/Admin/Ui/LanguageTrainingNoise.razor:588\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/Kennel.Admin.Core/Admin/Ui/LanguageTrainingNoise.razor:596\u0060 calls \u0060Add\u0060 and \u0060src/Kennel.Admin.Core/Admin/Ui/LanguageTrainingNoise.razor:621\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":"src/Kennel.Admin.Core/Admin/Ui/LanguageTrainingNoise.razor"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f52859658e1cfee224f047ef5b9380f56b8264890b24554b0e0ff9018ac7567"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6): engine/src/CodeHealth.Dimensions.Architecture/BoundaryScopeJudge.cs:70-75 | engine/src/CodeHealth.Dimensions.Architecture/Llm/LlmApiConsistencyEvaluator.cs:81-86 | engine/src/CodeHealth.Dimensions.Architecture/Llm/LlmProjectCohesionEvaluator.cs:59-64 | engine/src/CodeHealth.Dimensions.Docs/Llm/PromptResource.cs:12-17 | engine/src/CodeHealth.Reporting/Changelog/ChangelogNarrator.cs:908-913 | engine/src/CodeHealth.Reporting/Prose/LlmReportProseGenerator.cs:255-260 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 6 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 6 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Dimensions.Architecture/BoundaryScopeJudge.cs:70\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":"engine/src/CodeHealth.Dimensions.Architecture/BoundaryScopeJudge.cs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfa01fc2ea14bbcfc1fb891e2e2eb98031ea4056bac81d87fdcf414f4bc3b336"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): engine/src/CodeHealth.Dimensions.Architecture/InternalApiConsistencyAnalyzer.cs:162-167 | engine/src/CodeHealth.Dimensions.Docs/AdrQualityAnalyzer.cs:155-160 | engine/src/CodeHealth.Dimensions.Docs/CommentValueAnalyzer.cs:51-56 | engine/src/CodeHealth.Dimensions.Docs/DocumentationQualityAnalyzer.cs:36-41 | engine/src/CodeHealth.Dimensions.Docs/NamingConsistencyAnalyzer.cs:35-40 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 5 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 5 times. 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":"engine/src/CodeHealth.Dimensions.Architecture/InternalApiConsistencyAnalyzer.cs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ee795e538753d4400e3414b9eff99c3347417f6dbd37a6d4758d5f76c4555d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): engine/src/CodeHealth.Core/ModelAware/JavaDomainConventions.cs:391-396 | engine/src/CodeHealth.Core/ModelAware/PhpDomainConventions.cs:520-525 | engine/src/CodeHealth.Core/ModelAware/PythonDomainConventions.cs:530-535 | engine/src/CodeHealth.Core/ModelAware/RubyDomainConventions.cs:702-707 \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 4 call sites, so a change lands once. 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":"engine/src/CodeHealth.Core/ModelAware/JavaDomainConventions.cs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d84feeca7cb138ad83f7a826dbea330eb4fab2230f84516a73c58faf7315c71"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs:6270-6276 | engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs:6310-6316 | engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs:6783-6788 | engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs:7757-7762 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs:6270\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":"engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs"},"region":{"startLine":6270}}}],"partialFingerprints":{"codehealthFindingId/v1":"a36a1892d6f497ee828b066499432cbbb866a803c1083fcfdd3d0f14e4087781"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): engine/src/CodeHealth.Core/CodeShape/RoslynDuplicationDetector.cs:1457-1462 | engine/src/CodeHealth.Core/CodeShape/RoslynDuplicationDetector.cs:2623-2628 | engine/src/CodeHealth.Core/CodeShape/RoslynDuplicationDetector.cs:2630-2635 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/CodeShape/RoslynDuplicationDetector.cs"},"region":{"startLine":1457}}}],"partialFingerprints":{"codehealthFindingId/v1":"e31edd2e8a253d1080636bb00ef7237411868d95e41489239189e1caf991488d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): engine/src/CodeHealth.Core/ModelAware/AltTextQualityAnalyzer.cs:157-162 | engine/src/CodeHealth.Core/ModelAware/HeadingLabelQualityAnalyzer.cs:160-165 | engine/src/CodeHealth.Core/ModelAware/LinkTextQualityAnalyzer.cs:165-170 \u2014 before extracting anything, compare \u0060engine/src/CodeHealth.Core/ModelAware/HeadingLabelQualityAnalyzer.cs\u0060 and \u0060engine/src/CodeHealth.Core/ModelAware/LinkTextQualityAnalyzer.cs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 119 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Core/ModelAware/AltTextQualityAnalyzer.cs:157\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":"engine/src/CodeHealth.Core/ModelAware/AltTextQualityAnalyzer.cs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"01ef4690aeed5f7f68af32ac3bb15b2ec0b61e2a2538fbaf70e5843e220ccb4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): engine/src/CodeHealth.Core/ModelAware/RustDomainConventions.cs:916-921 | engine/src/CodeHealth.Core/ModelAware/RustDomainConventions.cs:1004-1009 | engine/src/CodeHealth.Core/ModelAware/RustDomainConventions.cs:1070-1075 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Core/ModelAware/RustDomainConventions.cs:1070\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060engine/src/CodeHealth.Core/ModelAware/RustDomainConventions.cs:913\u0060 calls \u0060Where\u0060, \u0060IsNullOrEmpty\u0060, \u0060GroupBy\u0060 and \u0060engine/src/CodeHealth.Core/ModelAware/RustDomainConventions.cs:1068\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":"engine/src/CodeHealth.Core/ModelAware/RustDomainConventions.cs"},"region":{"startLine":916}}}],"partialFingerprints":{"codehealthFindingId/v1":"f65034ed2f5c13c0ef0d6098e9f9d2157dea5b244d44d2d3b89ab262f4b11616"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): engine/src/CodeHealth.Dimensions.Architecture/CohesionAnalyzer.cs:33-38 | engine/src/CodeHealth.Dimensions.CodeQuality/CodeShape/GodClassAnalyzer.cs:27-32 | engine/src/CodeHealth.Dimensions.GitMining/HotspotAnalyzer.cs:56-63 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060engine/src/CodeHealth.Dimensions.Architecture/CohesionAnalyzer.cs:33\u0060 calls \u0060Join\u0060, \u0060Select\u0060, \u0060TrimStart\u0060 and \u0060engine/src/CodeHealth.Dimensions.CodeQuality/CodeShape/GodClassAnalyzer.cs:27\u0060 does not \u2014 after which the two agree again for 5 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":"engine/src/CodeHealth.Dimensions.Architecture/CohesionAnalyzer.cs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"7acf80a8e50d114dcbce0b7ac9c6131b84e2f1ecbcc2f481d896ea070d88fc7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/Kennel.Core/Deliveries/Ui/RepoEvidence.razor:534-539 | src/Kennel.Core/Deliveries/Ui/SellerDeliveries.razor:260-265 | src/Kennel.Watchdog.Core/Customers/Ui/Customers.razor:241-246 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Kennel.Core/Deliveries/Ui/RepoEvidence.razor:534\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Kennel.Core/Deliveries/Ui/RepoEvidence.razor"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"24c33773fc4adc8c8927f0041023c117828095eea10ffadf0a6e60d39507020a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs:449-454 | engine/src/CodeHealth.Dimensions.Architecture/CouplingAnalyzer.cs:598-605 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs:449\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":"engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd11597aca0ec8f6460060aff1d996f1a4d9685b7c7d4dd9865ca86f3d66e737"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/src/CodeHealth.Core/Dart/DartDeadLibraryField.cs:667-672 | engine/src/CodeHealth.Core/Dart/DartDeadLibraryField.cs:719-724 \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 \u0060engine/src/CodeHealth.Core/Dart/DartDeadLibraryField.cs:667\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":"engine/src/CodeHealth.Core/Dart/DartDeadLibraryField.cs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9118074160dc7ed70bd167b4df9e5e81487d85b8a188f10369d1bf13939874d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/src/CodeHealth.Core/Frontend/FrontendPathLiteralRefs.cs:205-210 | engine/src/CodeHealth.Core/Frontend/FrontendPathLiteralRefs.cs:248-253 \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":"engine/src/CodeHealth.Core/Frontend/FrontendPathLiteralRefs.cs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"929cc35f5c613f9616d8616ad5c220d34b8a07c5fc627dab637190357d81c469"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/src/CodeHealth.Core/Frontend/FrontendScriptCommandRefs.cs:393-398 | engine/src/CodeHealth.Core/Frontend/FrontendSpecifierScanning.cs:45-50 \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 \u0060engine/src/CodeHealth.Core/Frontend/FrontendScriptCommandRefs.cs:393\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":"engine/src/CodeHealth.Core/Frontend/FrontendScriptCommandRefs.cs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"e076795082e427e0157d7bee9dab5d14dd75a9680348a8754f0434f71035c2af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/ArchitectureModelAnalyzer.cs:1394-1401 | engine/src/CodeHealth.Core/ModelAware/ArchitectureModelAnalyzer.cs:1405-1410 \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":"engine/src/CodeHealth.Core/ModelAware/ArchitectureModelAnalyzer.cs"},"region":{"startLine":1394}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc188e2f435ed84784cd7142fe97b02116922e495b84c5845eb22b1fb0d85e63"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/ArchitectureModelAnalyzer.cs:1681-1688 | engine/src/CodeHealth.Core/ModelAware/ArchitectureModelAnalyzer.cs:1716-1721 \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 \u0060engine/src/CodeHealth.Core/ModelAware/ArchitectureModelAnalyzer.cs:1681\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. 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":"engine/src/CodeHealth.Core/ModelAware/ArchitectureModelAnalyzer.cs"},"region":{"startLine":1681}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2877cf50952dc0c2609ec508ec42ad7c798c01e3fc7b9a0661208b143e017bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs:1506-1511 | engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs:4737-4742 \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 \u0060engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs:1506\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. 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":"engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs"},"region":{"startLine":1506}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cd663c26438055c454169b9538a45d36a96c325595980279e793dd796193066"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs:813-818 | engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs:1958-1963 \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 \u0060engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs:813\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. 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":"engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs"},"region":{"startLine":813}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2d2bcf4d886475e5ca3b1578b1e7a7ec23c729584408cf98eb32b14e6a10cfe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs:919-924 | engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs:1402-1407 \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 \u0060engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs:919\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. 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":"engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"2148956a007cda3274acf784232ef452096cab1ba219ebf6f04acfe8d16bea05"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs:1006-1015 | engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs:1672-1677 \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 \u0060engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs:1006\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. 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":"engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs"},"region":{"startLine":1006}}}],"partialFingerprints":{"codehealthFindingId/v1":"e84e4629e62e7c097c9f071fc44ddc6e205fbbe043492b903d6275e209bddb52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/src/CodeHealth.Toolchain/Git/GitHistory.cs:112-117 | engine/src/CodeHealth.Toolchain/Git/LibGit2GitAccessor.cs:73-78 \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":"engine/src/CodeHealth.Toolchain/Git/GitHistory.cs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"53fc016715f26c6c1bcf131ad4c8d98ffb1c3a7e7d0f7b27e135274d3dff128c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): engine/src/CodeHealth.Core/Frontend/FrontendDeadCode.cs:619-624 | engine/src/CodeHealth.Core/Frontend/FrontendDeadCode.cs:670-674 | engine/src/CodeHealth.Core/Frontend/FrontendDeadCode.cs:709-713 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. 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":"engine/src/CodeHealth.Core/Frontend/FrontendDeadCode.cs"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d6df01669c952399ccf3c558bb45fbca2fc2e97818f5d62ce03089c9f75f8e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs:3869-3873 | engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs:4305-4309 | engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs:4368-4372 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs:3869\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs"},"region":{"startLine":3869}}}],"partialFingerprints":{"codehealthFindingId/v1":"347def3ebbf4392cb9447f24b3bad38a5634e13fd0a448aa958b229955cb446a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): engine/src/CodeHealth.Reporting/Changelog/ChangelogRenderer.cs:219-223 | engine/src/CodeHealth.Reporting/Changelog/ChangelogRenderer.cs:317-321 | engine/src/CodeHealth.Reporting/Security/SecurityWatchRenderer.cs:190-194 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Reporting/Changelog/ChangelogRenderer.cs:219\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":"engine/src/CodeHealth.Reporting/Changelog/ChangelogRenderer.cs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3ad400e7e9795bf0ec0df5afac6617f5560515b7d498373f64074db2c1e3e19"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/DomainConventions.cs:141-145 | engine/src/CodeHealth.Core/ModelAware/DomainConventions.cs:1085-1091 \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 \u0060engine/src/CodeHealth.Core/ModelAware/DomainConventions.cs:1085\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060type\u0060 to \u0060INamedTypeSymbol\u0060 in one and \u0060Nm.ICodeType\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/DomainConventions.cs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"b212967ed038cb726fe284bec8fafce85e4038b99b2b7cd234b72a40b9ca50a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs:1665-1674 | engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs:5144-5148 \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 \u0060engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs:1665\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs"},"region":{"startLine":1665}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1e9994468c7821169bb4bce700d9511cf0376dae4d8667ff65d31763c923e81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): engine/src/CodeHealth.Reporting/Svg/ArchGraphSvg.cs:43-47 | engine/src/CodeHealth.Reporting/Svg/ArchGraphSvg.cs:146-150 \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":"engine/src/CodeHealth.Reporting/Svg/ArchGraphSvg.cs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"c72352b002655cb05d45084361dd89a9f428852591d2075e2ce49dee31558a71"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): engine/src/CodeHealth.Dimensions.CodeQuality/CodeShape/DuplicationAnalyzer.cs:3015-3020 | engine/src/CodeHealth.Dimensions.CodeQuality/CodeShape/DuplicationAnalyzer.cs:3356-3360 \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 \u0060engine/src/CodeHealth.Dimensions.CodeQuality/CodeShape/DuplicationAnalyzer.cs:3015\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":"engine/src/CodeHealth.Dimensions.CodeQuality/CodeShape/DuplicationAnalyzer.cs"},"region":{"startLine":3015}}}],"partialFingerprints":{"codehealthFindingId/v1":"236b9a15872080d7e376038277ece03f6a257a12cd766a274b20190ae45d611d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): engine/src/CodeHealth.Dimensions.Security/Scanners/ComposeServiceSurface.cs:374-378 | engine/src/CodeHealth.Dimensions.Security/Scanners/DockerfileShapeRuleFilter.cs:455-459 \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. 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/ComposeServiceSurface.cs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b213ae9e04736616dd7f3b7409ff64846be15b5ce107038912a8d131b4e2039"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs:2393-2397 | engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs:2447-2451 \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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":2393}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ec432814eda01f61da752a52d9c04bbd03a77ecae5bb4900ed96b72ad36b0a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs:6183-6187 | engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs:7588-7592 \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 \u0060engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs:6183\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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":6183}}}],"partialFingerprints":{"codehealthFindingId/v1":"25657873dc8a234f1f57b278d1f84afe94b49082b4d9c44972bb2d91d96bbc12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs:10415-10419 | engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs:10427-10431 \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 \u0060engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs:10415\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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":10415}}}],"partialFingerprints":{"codehealthFindingId/v1":"55e4fe3a1ae46e9af2f2100f81248e4b31fa76c63e5d638610fed7dcf7763a10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.PackagingReach.cs:71-77 | engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.PackagingReach.cs:155-159 \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 \u0060engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.PackagingReach.cs:71\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.PackagingReach.cs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cf0448459d232406ca62fb96c2bed00e155e989fa8f05e5be0f8ae98cec2fc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/Kennel.Admin.Core/Admin/Ui/Corpus.razor:149-169 | src/Kennel.Admin.Core/Admin/Ui/CorpusCoverage.razor:108-123 \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. 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":"src/Kennel.Admin.Core/Admin/Ui/Corpus.razor"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5026fea740fc49d11b7edb49afe21ce951a3c3828b97274cfff39ebaba06507"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): engine/src/CodeHealth.Core/Architecture/ArchitectureMapBuilder.cs:364-372 | engine/src/CodeHealth.Core/Architecture/ContainerDetector.cs:247-255 \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":"engine/src/CodeHealth.Core/Architecture/ArchitectureMapBuilder.cs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"8401d83f99b8f42400c01c8aee45961b4448540d2a309a241b217246fbdb20c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): engine/src/CodeHealth.Core/Architecture/ContainerDetector.cs:258-269 | engine/src/CodeHealth.Core/ModelAware/AppKindDetector.cs:336-347 | engine/src/CodeHealth.Core/ModelAware/PerformanceAnalyzer.cs:642-649 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. 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":"engine/src/CodeHealth.Core/Architecture/ContainerDetector.cs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"330cef9f3ae0507786c3a52f471105ddd10ab6cca2fe202e58a7a8370502e0d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): engine/src/CodeHealth.Core/Architecture/Topology/Extractors/ArmExtractor.cs:138-151 | engine/src/CodeHealth.Core/Architecture/Topology/Extractors/CloudFormationExtractor.cs:151-164 \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, \u0060engine/src/CodeHealth.Core/Architecture/Topology/Extractors/ArmExtractor.cs:135\u0060 calls \u0060Has\u0060, \u0060Any\u0060, \u0060Contains\u0060 and \u0060engine/src/CodeHealth.Core/Architecture/Topology/Extractors/CloudFormationExtractor.cs:148\u0060 does not \u2014 after which the two agree again for 3 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":"engine/src/CodeHealth.Core/Architecture/Topology/Extractors/ArmExtractor.cs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d618b428eda5c2155b0bdab431c5fe7550af61fde73824f2253bc74eb385c18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/src/CodeHealth.Core/CodeModel/Roslyn/RoslynMethodBody.cs:332-337 | engine/src/CodeHealth.Core/Testing/RoslynTestQualityCollector.cs:543-548 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/CodeModel/Roslyn/RoslynMethodBody.cs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"04c899339d71bac2bc7e49de6875ae5b6dad3e141010cffbae9b9c4983dfd3e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): engine/src/CodeHealth.Core/CodeModel/Roslyn/RoslynProvider.cs:315-325 | engine/src/CodeHealth.Core/ModelAware/SymbolHelpers.cs:186-196 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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":"engine/src/CodeHealth.Core/CodeModel/Roslyn/RoslynProvider.cs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"1087de8ba7f275d1fe1827c2e79587c8a3b2fdc5474e00e0e5a6d83f0ac1eac6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): engine/src/CodeHealth.Core/CodeShape/MemberFamilyRollup.cs:561-571 | engine/src/CodeHealth.Core/CodeShape/MemberPairRollup.cs:271-281 \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":"engine/src/CodeHealth.Core/CodeShape/MemberFamilyRollup.cs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"f73c1e8cf264ab27101ec16d1402b7ae7661f365f24b8489b1d67a7e29d57561"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): engine/src/CodeHealth.Core/CodeShape/NeutralFileLengthScanner.cs:423-431 | engine/src/CodeHealth.Core/CodeShape/NeutralMethodLengthScanner.cs:502-510 \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":"engine/src/CodeHealth.Core/CodeShape/NeutralFileLengthScanner.cs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f49c884114263b3c8eb8e066f224c3021a12a446d20d6905c225f6fda2f91c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): engine/src/CodeHealth.Core/CodeShape/NeutralMethodLengthScanner.cs:481-499 | engine/src/CodeHealth.Core/CodeShape/NeutralTypeLengthScanner.cs:150-168 \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, \u0060engine/src/CodeHealth.Core/CodeShape/NeutralMethodLengthScanner.cs:475\u0060 calls \u0060PathsMatch\u0060, \u0060Replace\u0060, \u0060Equals\u0060 and \u0060engine/src/CodeHealth.Core/CodeShape/NeutralTypeLengthScanner.cs:145\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":"engine/src/CodeHealth.Core/CodeShape/NeutralMethodLengthScanner.cs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3eb9cfa1f312d7a1e10c71852f1d135dfda06c7b44bbee9bfd831dd66c70b71"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 5): engine/src/CodeHealth.Core/CodeShape/PolyglotConditionScanner.cs:557-568 | engine/src/CodeHealth.Core/CodeShape/RazorCodeVirtualizer.cs:324-335 | engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs:6422-6432 | engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs:4883-4894 | engine/src/CodeHealth.Core/Testing/JsTestQualityCensus.cs:240-251 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 5 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 5 times. 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":"engine/src/CodeHealth.Core/CodeShape/PolyglotConditionScanner.cs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"11849c9bd2a813c1ae40995f2a54e528e1e25a184123257a9a248972fd289402"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): engine/src/CodeHealth.Core/CodeShape/PublishedSurfaceProbe.cs:251-255 | engine/src/CodeHealth.Core/Frontend/FrontendBoundaries.cs:1018-1022 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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":"engine/src/CodeHealth.Core/CodeShape/PublishedSurfaceProbe.cs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"58e73f4b587017f81d506ad579cbe3decce126b512db58d0467af1be45b8851f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs:6780-6791 | engine/src/CodeHealth.Core/ExplicitDebt/RazorMarkupReferenceScanner.cs:333-344 | engine/src/CodeHealth.Core/ExplicitDebt/XamlMarkupReferenceScanner.cs:256-267 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs"},"region":{"startLine":6780}}}],"partialFingerprints":{"codehealthFindingId/v1":"05ec08701119a50e860cb80538b8d2edec0539ccb3ea806ef42f91d86639e499"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): engine/src/CodeHealth.Core/Compliance/HostedHttpSurfaceScan.cs:528-532 | engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs:6128-6132 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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":"engine/src/CodeHealth.Core/Compliance/HostedHttpSurfaceScan.cs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"2af0b1f0fa42a01f4af67df8f5a8adad0064aa2300c855ed0e3c9cb6496a2299"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/src/CodeHealth.Core/Dependencies/HexRegistryClient.cs:69-74 | engine/src/CodeHealth.Core/Dependencies/UnityRegistryClient.cs:74-79 \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":"engine/src/CodeHealth.Core/Dependencies/HexRegistryClient.cs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e5daa1f560f0cf9d7187abb6e0e23e3ec09d6d86c961154dc8356e672e6ee27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): engine/src/CodeHealth.Core/Dependencies/SwiftPackageHygiene.cs:386-397 | engine/src/CodeHealth.Dimensions.Security/Scanners/NamespaceScopedRuleAggregator.cs:269-280 | engine/src/CodeHealth.Dimensions.Security/Scanners/UnappliableTerraformModuleScan.cs:196-207 | engine/src/CodeHealth.Dimensions.Security/SecretsHistoryAnalyzer.cs:1413-1418 | engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs:10306-10311 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 5 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 5 times. 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":"engine/src/CodeHealth.Core/Dependencies/SwiftPackageHygiene.cs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"68ce2aed6ebc24d6509161714afe7ea2534889939486293a5cda9ae83ca898a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): engine/src/CodeHealth.Core/Dependencies/UnityLockfileReader.cs:181-189 | engine/src/CodeHealth.Core/Dependencies/UnityPackageHygiene.cs:220-228 \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":"engine/src/CodeHealth.Core/Dependencies/UnityLockfileReader.cs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4be86912dfbc6c33c12e07e34b47ae287f59d1334ae158b4e8a77d05df95edd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): engine/src/CodeHealth.Core/Dimensions/DimensionResult.cs:252-256 | engine/src/CodeHealth.Core/Scoring/MetaDimension.cs:127-131 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Dimensions/DimensionResult.cs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"c35f138b870301adcb199f79ef4d0d3d503c0b6e0174c8fc2548baa1ac87030a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): engine/src/CodeHealth.Core/Docs/DocumentationConventions.cs:246-252 | engine/src/CodeHealth.Core/FileQuality/ReleaseEvidence.cs:145-151 | engine/src/CodeHealth.Core/Maturity/MaturityAnalyzer.cs:3494-3500 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. 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":"engine/src/CodeHealth.Core/Docs/DocumentationConventions.cs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8e5f6bbf2f2a1296649628b60dd7697da7275a18c6be0ff08332783f7662d4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): engine/src/CodeHealth.Core/ExplicitDebt/AttributeConsumptionScanner.cs:384-390 | engine/src/CodeHealth.Core/Testing/RoslynTestQualityCollector.cs:1828-1834 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ExplicitDebt/AttributeConsumptionScanner.cs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d96364b00cc25f059a7106cb3e8f05f98ee9d58e108cc7eab4e09d4c23f3611"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): engine/src/CodeHealth.Core/ExplicitDebt/MarkdownSnippetReferenceScanner.cs:266-277 | engine/src/CodeHealth.Core/ExplicitDebt/RazorGeneratedDocumentSynthesizer.cs:619-630 \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":"engine/src/CodeHealth.Core/ExplicitDebt/MarkdownSnippetReferenceScanner.cs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"0330c449d6dde537ae92c3a0a68416a608e44f2d90ddd0cf26fc709b9e312804"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): engine/src/CodeHealth.Core/ExplicitDebt/RoslynExplicitDebtCollector.cs:4742-4751 | engine/src/CodeHealth.Core/Testing/FSharpTestProjectScanner.cs:157-163 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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":"engine/src/CodeHealth.Core/ExplicitDebt/RoslynExplicitDebtCollector.cs"},"region":{"startLine":4742}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4d50b1d77122f1f6dbc6d508d8d121fb30bf8beaf247f12ab9397a777e380df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): engine/src/CodeHealth.Core/FileQuality/UpstreamAttribution.cs:1943-1951 | engine/src/CodeHealth.Core/Frontend/FrontendBundlerConfigRefs.cs:1249-1257 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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":"engine/src/CodeHealth.Core/FileQuality/UpstreamAttribution.cs"},"region":{"startLine":1943}}}],"partialFingerprints":{"codehealthFindingId/v1":"f09d4d7e84f5da06ce0d7475019c45fa947ca0a5ca9b308f8805ba232de12675"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): engine/src/CodeHealth.Core/Frontend/EntryPointCatalog.cs:2198-2202 | engine/src/CodeHealth.Core/Frontend/ModuleResolver.cs:591-595 \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":"engine/src/CodeHealth.Core/Frontend/EntryPointCatalog.cs"},"region":{"startLine":2198}}}],"partialFingerprints":{"codehealthFindingId/v1":"568fe5fe23ac4a281a1b41bfb241ea5dff85c6f3b73b3d693a4ae2f927d9a24f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): engine/src/CodeHealth.Core/Frontend/FrontendConfigResolution.cs:402-417 | engine/src/CodeHealth.Core/Frontend/FrontendEngine.cs:439-454 | engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs:5148-5157 | engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs:5551-5557 \u2014 there are 4 copies across 3 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. 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":"engine/src/CodeHealth.Core/Frontend/FrontendConfigResolution.cs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"99293bd0052fb4a955c894960fb947fdb0527f7becd1cba63c6148ef8366762e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): engine/src/CodeHealth.Core/Frontend/FrontendDeadCode.cs:1670-1678 | engine/src/CodeHealth.Core/Frontend/FrontendTestReachability.cs:1279-1287 \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":"engine/src/CodeHealth.Core/Frontend/FrontendDeadCode.cs"},"region":{"startLine":1670}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f97eb13e124fec026d3e4cd9911fcc8ef4500cff923b461591131dd5392178c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): engine/src/CodeHealth.Core/Frontend/FrontendDependencyHygiene.cs:3007-3023 | engine/src/CodeHealth.Core/Frontend/ModuleResolver.cs:1470-1486 \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":"engine/src/CodeHealth.Core/Frontend/FrontendDependencyHygiene.cs"},"region":{"startLine":3007}}}],"partialFingerprints":{"codehealthFindingId/v1":"77767ec30db0fd9aa539edfb4a8a5d7c7f2300f62659ec2fd79c5aa970eb4111"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): engine/src/CodeHealth.Core/Markup/AstroMarkupProducer.cs:111-121 | engine/src/CodeHealth.Core/Markup/TemplMarkupProducer.cs:103-113 \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":"engine/src/CodeHealth.Core/Markup/AstroMarkupProducer.cs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcc9f99ea4a18c9390fb071f447053003280cd150f77b48f438c44d6b7d9d014"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): engine/src/CodeHealth.Core/Markup/TemplMarkupProducer.cs:313-328 | engine/src/CodeHealth.Core/Markup/TemplateLanguageMarkupProducer.cs:426-441 \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":"engine/src/CodeHealth.Core/Markup/TemplMarkupProducer.cs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"18ccd248ee36994c5795f20b80f636c81da88398dd47912770621a4dc4d79f15"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/ArchitectureModelAnalyzer.cs:1488-1493 | engine/src/CodeHealth.Core/Testing/RoslynTestQualityCollector.cs:1851-1856 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/ArchitectureModelAnalyzer.cs"},"region":{"startLine":1488}}}],"partialFingerprints":{"codehealthFindingId/v1":"984366acb4a1de554d38281b375e95efcaea98940c21a80ece4ac5a19d862596"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/ArchitectureModelAnalyzer.cs:1527-1532 | engine/src/CodeHealth.Core/ModelAware/SecurityDefectAnalyzer.cs:834-839 \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":"engine/src/CodeHealth.Core/ModelAware/ArchitectureModelAnalyzer.cs"},"region":{"startLine":1527}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d908416ed88b1e74685d3244fc5f98580ea1a5fb2c4a654670a6366debbbb38"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/DartDomainConventions.cs:166-176 | engine/src/CodeHealth.Core/ModelAware/SwiftDomainConventions.cs:225-235 \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":"engine/src/CodeHealth.Core/ModelAware/DartDomainConventions.cs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"25eaa2d0bec7a39320421f726da7093c5a94de2ce57032e9c8f3c31f6baba8db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): engine/src/CodeHealth.Core/ModelAware/DomainConventions.cs:386-396 | engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs:2745-2755 | engine/src/CodeHealth.Core/ModelAware/GoDomainConventions.cs:3125-3135 \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":"engine/src/CodeHealth.Core/ModelAware/DomainConventions.cs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f008c0ea3b466a07f583fd3c825ba6f39486e15e81bbd0b582f7e598f075d3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs:1032-1038 | engine/src/CodeHealth.Core/ModelAware/InvocationMatching.cs:388-394 \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":"engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs"},"region":{"startLine":1032}}}],"partialFingerprints":{"codehealthFindingId/v1":"20694576a56f77010fc3bb4ea64b37ffd53fbdea7c9ca7f6bcf295770c1f459e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): engine/src/CodeHealth.Core/ModelAware/ElixirDomainConventions.cs:328-343 | engine/src/CodeHealth.Core/ModelAware/PhpDomainConventions.cs:563-578 | engine/src/CodeHealth.Core/ModelAware/RubyDomainConventions.cs:775-790 \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":"engine/src/CodeHealth.Core/ModelAware/ElixirDomainConventions.cs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c6dbb2ce49cc9c94f5aeaedacf572d9062a81c418b19202fd4e4de17162693f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/FSharpDomainConventions.cs:101-110 | engine/src/CodeHealth.Core/ModelAware/ScalaDomainConventions.cs:65-74 \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":"engine/src/CodeHealth.Core/ModelAware/FSharpDomainConventions.cs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"61cf65040bfcaff8f0fdb70c7cdff03ced52758e786d74819c40a1e763902263"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 5): engine/src/CodeHealth.Core/ModelAware/GoDomainConventions.cs:3112-3122 | engine/src/CodeHealth.Core/ModelAware/JavaDomainConventions.cs:608-618 | engine/src/CodeHealth.Core/ModelAware/PhpDomainConventions.cs:581-591 | engine/src/CodeHealth.Core/ModelAware/PythonDomainConventions.cs:594-604 | engine/src/CodeHealth.Core/ModelAware/RubyDomainConventions.cs:793-803 \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 5 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":"engine/src/CodeHealth.Core/ModelAware/GoDomainConventions.cs"},"region":{"startLine":3112}}}],"partialFingerprints":{"codehealthFindingId/v1":"f964af39027d05bf075a87954e4fa73b2bae0454afb5c040ab7892c724de692e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/InvocationMatching.cs:380-386 | engine/src/CodeHealth.Core/ModelAware/MutationIdempotencyAnalyzer.cs:1744-1750 \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":"engine/src/CodeHealth.Core/ModelAware/InvocationMatching.cs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"e38a05a39142ae3fd9204fcac2c8f985826964ebdb3e4be5d5fa31d891c84d42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/JavaDomainConventions.cs:289-294 | engine/src/CodeHealth.Core/ModelAware/KotlinDomainConventions.cs:82-87 \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":"engine/src/CodeHealth.Core/ModelAware/JavaDomainConventions.cs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ec241ffdb4a0b09142ea4ef6eb9592f6151c6e3eda7dc7b54897a8d5f3b3190"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/JavaDomainConventions.cs:590-605 | engine/src/CodeHealth.Core/ModelAware/PythonDomainConventions.cs:576-591 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060engine/src/CodeHealth.Core/ModelAware/PythonDomainConventions.cs:572\u0060 calls \u0060IsDunder\u0060, \u0060StartsWith\u0060, \u0060EndsWith\u0060 and \u0060engine/src/CodeHealth.Core/ModelAware/JavaDomainConventions.cs:586\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":"engine/src/CodeHealth.Core/ModelAware/JavaDomainConventions.cs"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc3eb0bf6bb76827e81d62ff9d6ed7fb1dc3b543bd298bec63f7fa4bb515d696"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/PhpDomainConventions.cs:408-418 | engine/src/CodeHealth.Core/ModelAware/RubyDomainConventions.cs:744-754 \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":"engine/src/CodeHealth.Core/ModelAware/PhpDomainConventions.cs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"caaa43240ee6aeac97c6bb16d1ec7356f68b4b6305df8f68a246078da9c83f9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/PhpDomainConventions.cs:531-535 | engine/src/CodeHealth.Core/ModelAware/RubyDomainConventions.cs:713-717 \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":"engine/src/CodeHealth.Core/ModelAware/PhpDomainConventions.cs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"539175352aa4d00c7c2b4b4272ebeda374cbf3c0182500adf144411d3417d046"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): engine/src/CodeHealth.Core/ModelAware/ScatteredDecision.cs:106-115 | engine/src/CodeHealth.Core/ModelAware/ScatteredDerivation.cs:220-229 \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":"engine/src/CodeHealth.Core/ModelAware/ScatteredDecision.cs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"80707322004597051d91190429d2e0abfb8c395f8b60fbb845e902358a4369ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): engine/src/CodeHealth.Core/Readiness/CiRerunUntilGreenGate.cs:365-374 | engine/src/CodeHealth.Core/Readiness/VacuousFormatGate.cs:255-264 \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":"engine/src/CodeHealth.Core/Readiness/CiRerunUntilGreenGate.cs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d7b2af31f549d4aee29cb9b260025ce60695ade9c605e9461582aedb3d28b08"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): engine/src/CodeHealth.Core/Readiness/PipelineVersionOutputScan.cs:230-238 | engine/src/CodeHealth.Core/Scoring/CiGateDetection.cs:257-265 | engine/src/CodeHealth.Dimensions.Security/Scanners/ConfigMapContentRuleFilter.cs:143-151 | engine/src/CodeHealth.Dimensions.Security/Scanners/SemgrepClaimRecheck.cs:1152-1160 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 4 times. 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":"engine/src/CodeHealth.Core/Readiness/PipelineVersionOutputScan.cs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"422e198c5aaae9938bd14b76a1a5e59d43f5d9393edbc384a65e1215d0c475ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs:330-340 | engine/src/CodeHealth.Dimensions.Security/RuntimeHardeningScan.cs:254-264 | engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs:4890-4897 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. 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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060tokens\u0060 to \u0060params string[]\u0060 in one and \u0060string[]\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"93bb365d694adc383f5d51e7cc87fb4633ab3facbbc1e615aa88153130affd87"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs:7511-7520 | engine/src/CodeHealth.Dimensions.Security/Scanners/DeclaredDependencies.cs:603-609 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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":"engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs"},"region":{"startLine":7511}}}],"partialFingerprints":{"codehealthFindingId/v1":"201b64acbe8024feb83b3f962e46eaf28921f5b03a7b523c583b97390bd31d4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): engine/src/CodeHealth.Core/Readiness/VacuousFormatGate.cs:361-369 | engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs:7210-7214 | engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs:10633-10637 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. 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":"engine/src/CodeHealth.Core/Readiness/VacuousFormatGate.cs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"7def5c6a8fd61a83e5a74e9531997a69108c81faa120dd3876c9e3a8ced59db4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): engine/src/CodeHealth.Core/Testing/CoverletCoverageCollector.cs:318-329 | engine/src/CodeHealth.Core/Testing/PolyglotCoverageCollector.cs:62-73 \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":"engine/src/CodeHealth.Core/Testing/CoverletCoverageCollector.cs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc6ee64d9bb6d90e7429af2ca183220af7b1a9a4603ff3d3f0e5db5150d2c035"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): engine/src/CodeHealth.Core/Testing/FSharpTestProjectScanner.cs:144-154 | engine/src/CodeHealth.Reporting/Linting/FindingTextRules.cs:171-181 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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":"engine/src/CodeHealth.Core/Testing/FSharpTestProjectScanner.cs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"240365173d553d1d7dd43d4dc6825e6b645ba0588b4535362e13811a58672bb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/src/CodeHealth.Dimensions.Security/DependencyVulnerabilityAnalyzer.cs:338-343 | engine/src/CodeHealth.Dimensions.Security/Scanners/DeepScan.cs:1656-1661 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/DependencyVulnerabilityAnalyzer.cs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"d76f8af304b1b1fea79ea0561cff1deaeace71a92c7dbb2de5f096068aae6303"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): engine/src/CodeHealth.Dimensions.Security/Scanners/AutomountedServiceAccountTokenScan.cs:114-124 | engine/src/CodeHealth.Dimensions.Security/Scanners/CommittedSecretManifestScan.cs:161-171 | engine/src/CodeHealth.Dimensions.Security/Scanners/HostPathPersistentVolumeScan.cs:108-118 | engine/src/CodeHealth.Dimensions.Security/Scanners/UnresolvableImageReferenceScan.cs:89-99 \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 4 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/AutomountedServiceAccountTokenScan.cs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c8d180ecd51b1526a18aede52783ce0137de244d590609f9e6d42461eec940f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 14): engine/src/CodeHealth.Dimensions.Security/Scanners/BrowserSandboxDisabledScan.cs:95-105 | engine/src/CodeHealth.Dimensions.Security/Scanners/BuildTimeKeyMaterialScan.cs:130-140 | engine/src/CodeHealth.Dimensions.Security/Scanners/EndOfLifeBaseImageScan.cs:162-172 | engine/src/CodeHealth.Dimensions.Security/Scanners/GitOwnershipCheckDisabledScan.cs:65-75 | engine/src/CodeHealth.Dimensions.Security/Scanners/InsecureTransportFetchScan.cs:117-127 | engine/src/CodeHealth.Dimensions.Security/Scanners/MutableBaseImageScan.cs:83-93 | engine/src/CodeHealth.Dimensions.Security/Scanners/MutableGitCloneScan.cs:71-81 | engine/src/CodeHealth.Dimensions.Security/Scanners/NoOpToolShimScan.cs:88-98 | engine/src/CodeHealth.Dimensions.Security/Scanners/PythonInstallGuardDisabledScan.cs:79-89 | engine/src/CodeHealth.Dimensions.Security/Scanners/SetuidBinaryGrantScan.cs:41-51 | engine/src/CodeHealth.Dimensions.Security/Scanners/UnpinnedToolchainInstallScan.cs:192-202 | engine/src/CodeHealth.Dimensions.Security/Scanners/UnverifiedRemoteInstallerScan.cs:546-556 | engine/src/CodeHealth.Dimensions.Security/Scanners/UnverifiedTrustAnchorScan.cs:114-124 | engine/src/CodeHealth.Dimensions.Security/Scanners/WorldWritableOwnedPathScan.cs:74-84 \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 14 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/BrowserSandboxDisabledScan.cs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccb2d3afa3b820f9185fb3e629ade80cb58bca57ca86a12430d1cebe419cc0dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5): engine/src/CodeHealth.Dimensions.Security/Scanners/BrowserSandboxDisabledScan.cs:483-491 | engine/src/CodeHealth.Dimensions.Security/Scanners/GitOwnershipCheckDisabledScan.cs:199-207 | engine/src/CodeHealth.Dimensions.Security/Scanners/PythonInstallGuardDisabledScan.cs:268-276 | engine/src/CodeHealth.Dimensions.Security/Scanners/SetuidBinaryGrantScan.cs:203-211 | engine/src/CodeHealth.Dimensions.Security/Scanners/UnscopedBuildContextCopyScan.cs:421-429 \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 5 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/BrowserSandboxDisabledScan.cs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"dae65e45d58392d24350cc01d6bc587657082072af658b54b39ef0d813a8997e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): engine/src/CodeHealth.Dimensions.Security/Scanners/CloudFrontDefaultCertificateAdvice.cs:98-107 | engine/src/CodeHealth.Dimensions.Security/Scanners/DuplicateResourceCopyAggregator.cs:242-253 | engine/src/CodeHealth.Dimensions.Security/Scanners/SpringSecurityActuatorRecheck.cs:241-250 | engine/src/CodeHealth.Dimensions.Security/Scanners/TerraformVariableDefaultFilter.cs:280-289 \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 4 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/CloudFrontDefaultCertificateAdvice.cs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"8924ad6c19b1a61404bebc18fe8340347398bc766fadc36067d2c196a8888ee6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): engine/src/CodeHealth.Dimensions.Security/Scanners/ComposeHostNamespaceScan.cs:102-112 | engine/src/CodeHealth.Dimensions.Security/Scanners/ComposeMutableServiceImageScan.cs:83-93 \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":"engine/src/CodeHealth.Dimensions.Security/Scanners/ComposeHostNamespaceScan.cs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe975d862682083bab71e0a402d3616341267aedb85cefff27b9beb439cc70ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): engine/src/CodeHealth.Dimensions.Security/Scanners/ComposeHostNamespaceScan.cs:274-282 | engine/src/CodeHealth.Dimensions.Security/Scanners/ComposeRuntimeSocketMountScan.cs:177-185 \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":"engine/src/CodeHealth.Dimensions.Security/Scanners/ComposeHostNamespaceScan.cs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c42707f211ff4a0f053665adaa4787411e8275cbca4e3dcb2b4ba68c9a63603"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): engine/src/CodeHealth.Dimensions.Security/Scanners/DuplicateResourceCopyAggregator.cs:335-344 | engine/src/CodeHealth.Dimensions.Security/Scanners/NamespaceScopedRuleAggregator.cs:368-377 \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":"engine/src/CodeHealth.Dimensions.Security/Scanners/DuplicateResourceCopyAggregator.cs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2c865cdee81e870ab8f9cad62fd53359123a85620dd48ced876810d28de746a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): engine/src/CodeHealth.Dimensions.Security/Scanners/InsecureTransportFetchScan.cs:322-330 | engine/src/CodeHealth.Dimensions.Security/Scanners/UnverifiedRemoteInstallerScan.cs:1135-1143 \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":"engine/src/CodeHealth.Dimensions.Security/Scanners/InsecureTransportFetchScan.cs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4fb0b6724490217fcabbb68cbc9023a5a489b8399a7d3ec71eda79e37b14201"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): engine/src/CodeHealth.Dimensions.Security/Scanners/MutableBaseImageScan.cs:213-221 | engine/src/CodeHealth.Dimensions.Security/Scanners/MutableGitCloneScan.cs:367-375 | engine/src/CodeHealth.Dimensions.Security/Scanners/NoOpToolShimScan.cs:407-415 | engine/src/CodeHealth.Dimensions.Security/Scanners/UnpinnedToolchainInstallScan.cs:650-658 \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 4 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/MutableBaseImageScan.cs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"291d2fdee13ebfca6b74654b916ddfe91da4f4df592a57f092bbf59e7b6ffc00"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): engine/src/CodeHealth.Dimensions.Security/Scanners/RubyArgumentMutatedScan.cs:138-148 | engine/src/CodeHealth.Dimensions.Security/Scanners/RubyDuplicateMethodDefinitionScan.cs:97-107 | engine/src/CodeHealth.Dimensions.Security/Scanners/RubyRescueDiscardsCaughtErrorScan.cs:123-133 | engine/src/CodeHealth.Dimensions.Security/Scanners/RubyUnreachableRescueClauseScan.cs:167-177 \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 4 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/RubyArgumentMutatedScan.cs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"986b15dfca960af664591fba6335d9db3f34e8de12c0f487aa2564c79363226b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): engine/src/CodeHealth.Dimensions.Docs/Llm/AdrQualityEvaluation.cs:33-43 | engine/src/CodeHealth.Dimensions.Docs/Llm/DocumentationEvaluation.cs:23-33 \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":"engine/src/CodeHealth.Dimensions.Docs/Llm/AdrQualityEvaluation.cs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7a0284717e4649393f9b869e4ccfd28bbc8831763157ec442933efb3133650b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/Kennel.Core/Billing/Ui/PlanCancel.razor:71-79 | src/Kennel.Core/Billing/Ui/PlanRefer.razor:93-101 \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":"src/Kennel.Core/Billing/Ui/PlanCancel.razor"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c2ad56fc2e6e822b6be44b2b37323fc894854640a512a06d6db3698cb3b2e28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/Kennel.Admin.Core/Admin/Ui/LanguageTraining.razor:683-689 | src/Kennel.Admin.Core/Admin/Ui/LanguageTrainingLanguages.razor:355-361 \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":"src/Kennel.Admin.Core/Admin/Ui/LanguageTraining.razor"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0ff56d6f227bd23ed1f9b55efaae7851ef3ac191de3adff43a7222462a09c1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/Kennel.Admin.Core/Admin/Ui/CorpusGrowth.razor:106-115 | src/Kennel.Admin.Core/Admin/Ui/Decisions.razor:173-182 \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":"src/Kennel.Admin.Core/Admin/Ui/CorpusGrowth.razor"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7f8f6d5610c5eafd5bcf6e5f52ba3346326c1ab0b58db24880fb001577baa6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): engine/src/CodeHealth.Reporting/Changelog/ChangelogNarrator.cs:567-571 | engine/src/CodeHealth.Reporting/Changelog/ChangelogNarrator.cs:714-718 \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":"engine/src/CodeHealth.Reporting/Changelog/ChangelogNarrator.cs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"515646696314318c3b095b60d625a8213d978a7a0436936fb1c4f2308a56655c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): engine/src/CodeHealth.Core/Testing/NodeTestReliabilityCollector.cs:734-741 | engine/src/CodeHealth.Core/Testing/NodeTestSuiteCoverageCollector.cs:789-796 \u2014 These two members are one piece of code written twice and then edited apart: 8 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":"engine/src/CodeHealth.Core/Testing/NodeTestReliabilityCollector.cs"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd9258db1bc0d2e7111dc30b9a515d6a72b3f1468c79139bd30477a0ba8bfc0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): engine/src/CodeHealth.Core/Testing/GoTestCensus.cs:87-153 | engine/src/CodeHealth.Core/Testing/JsTestCensus.cs:68-133 | engine/src/CodeHealth.Core/Testing/JsTestQualityCensus.cs:81-212 | engine/src/CodeHealth.Core/Testing/PythonTestCensus.cs:74-135 | engine/src/CodeHealth.Core/Testing/RustTestCensus.cs:76-142 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 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. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Testing/GoTestCensus.cs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d91e12b41af42b456271e803560671b0534fb29e5667f6da46ac5b671a6f3d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): engine/src/CodeHealth.Core/Testing/GoTestCensus.cs:362-392 | engine/src/CodeHealth.Core/Testing/JsTestCensus.cs:231-261 | engine/src/CodeHealth.Core/Testing/PythonTestCensus.cs:260-290 | engine/src/CodeHealth.Core/Testing/RustTestCensus.cs:339-369 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 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. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Testing/GoTestCensus.cs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"f410ec8c67f074f6f2d96149c5cc9b859db4499be9a98391698eac75f179044d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (40 lines \u00D7 2): engine/src/CodeHealth.Core/Testing/DiskTestScanner.cs:446-485 | engine/src/CodeHealth.Core/Testing/DiskTestScanner.cs:585-624 \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 \u0060engine/src/CodeHealth.Core/Testing/DiskTestScanner.cs:446\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":"engine/src/CodeHealth.Core/Testing/DiskTestScanner.cs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"778a21b6468a668a54553a7935c075545f3c666d97ab56d42c1a9d1d47419a67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 4): engine/src/CodeHealth.Core/Testing/GoTestCensus.cs:362-392 | engine/src/CodeHealth.Core/Testing/JsTestCensus.cs:231-261 | engine/src/CodeHealth.Core/Testing/PythonTestCensus.cs:260-290 | engine/src/CodeHealth.Core/Testing/RustTestCensus.cs:339-369 \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 4 call sites, so a change lands once. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060engine/src/CodeHealth.Core/Testing/PythonTestCensus.cs:294\u0060 calls \u0060HasDistributionManifest\u0060, \u0060Any\u0060, \u0060Exists\u0060 and \u0060engine/src/CodeHealth.Core/Testing/JsTestCensus.cs:269\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":"engine/src/CodeHealth.Core/Testing/GoTestCensus.cs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"6da43d5c761f34da66e71a6fdbc0e40ba22f84644273ab99566b0f50de70291b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): engine/src/CodeHealth.Core/Testing/GoTestCensus.cs:328-356 | engine/src/CodeHealth.Core/Testing/RustTestCensus.cs:304-332 \u2014 before extracting anything, compare \u0060engine/src/CodeHealth.Core/Testing/GoTestCensus.cs\u0060 and \u0060engine/src/CodeHealth.Core/Testing/RustTestCensus.cs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 183 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":"engine/src/CodeHealth.Core/Testing/GoTestCensus.cs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d891fe24873707a4c540123a620f6c1de8cbaaf09dc14862f4aa82e85888264"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 3): engine/src/CodeHealth.Core/Testing/GoTestCensus.cs:101-127 | engine/src/CodeHealth.Core/Testing/PythonTestCensus.cs:88-114 | engine/src/CodeHealth.Core/Testing/RustTestCensus.cs:90-116 \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 \u0060engine/src/CodeHealth.Core/Testing/GoTestCensus.cs:101\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":"engine/src/CodeHealth.Core/Testing/GoTestCensus.cs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"2098b7e06f2c4bec545285d62d1aaf8c86e1f697a986ae362ef209711e3addb4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201326 lines \u00D7 2): engine/src/CodeHealth.Core/Frontend/FrontendTestReachability.cs:1400-1423 | engine/src/CodeHealth.Core/Frontend/FrontendTestReachability.cs:1494-1519 \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 \u0060engine/src/CodeHealth.Core/Frontend/FrontendTestReachability.cs:1400\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":"engine/src/CodeHealth.Core/Frontend/FrontendTestReachability.cs"},"region":{"startLine":1400}}}],"partialFingerprints":{"codehealthFindingId/v1":"e03a6027ae09ce44dd54804187385427ebfeaab401094ec942e86707e15fe81d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): engine/src/CodeHealth.Core/Testing/NodeTestSuiteCoverageCollector.cs:840-858 | engine/src/CodeHealth.Core/Testing/NodeTestSuiteProbe.cs:180-200 \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. 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":"engine/src/CodeHealth.Core/Testing/NodeTestSuiteCoverageCollector.cs"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9aa4ffb56710bdaf8e23ae8d197e8a07893bf4e8d3ad206c31395cc30f054cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 5): engine/src/CodeHealth.Core/Testing/GoTestCensus.cs:100-117 | engine/src/CodeHealth.Core/Testing/JsTestCensus.cs:82-99 | engine/src/CodeHealth.Core/Testing/JsTestQualityCensus.cs:94-111 | engine/src/CodeHealth.Core/Testing/PythonTestCensus.cs:87-104 | engine/src/CodeHealth.Core/Testing/RustTestCensus.cs:89-106 \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 5 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Core/Testing/GoTestCensus.cs:100\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":"engine/src/CodeHealth.Core/Testing/GoTestCensus.cs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc463883f63508872b12870dc21ce1ed9dc682d04a818f855bc8e6df6f644968"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3): engine/src/CodeHealth.Core/Testing/DiskTestScanner.cs:468-485 | engine/src/CodeHealth.Core/Testing/DiskTestScanner.cs:607-624 | engine/src/CodeHealth.Core/Testing/DiskTestScanner.cs:946-963 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Core/Testing/DiskTestScanner.cs:468\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060engine/src/CodeHealth.Core/Testing/DiskTestScanner.cs:944\u0060 calls \u0060IsTestsDir\u0060, \u0060HasConventionalTestDirSegment\u0060 and \u0060engine/src/CodeHealth.Core/Testing/DiskTestScanner.cs:466\u0060 does not \u2014 after which the two agree again for 3 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":"engine/src/CodeHealth.Core/Testing/DiskTestScanner.cs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"d340131eda5cab0c4976cc576d0e9b831c01fd861a1dc838a5f68a6f3ea0e7cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 3): engine/src/CodeHealth.Core/Testing/GoTestCensus.cs:233-250 | engine/src/CodeHealth.Core/Testing/JsTestCensus.cs:164-180 | engine/src/CodeHealth.Core/Testing/RustTestCensus.cs:197-213 \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 \u0060engine/src/CodeHealth.Core/Testing/GoTestCensus.cs:233\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":"engine/src/CodeHealth.Core/Testing/GoTestCensus.cs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"3786c2ad4a0405d6a00f07d03c2951262fb2f0f82c49f5fa52417c77f240baaa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): engine/src/CodeHealth.Core/Frontend/FrontendTestAndDocRefs.cs:75-89 | engine/src/CodeHealth.Core/Frontend/FrontendTestAndDocRefs.cs:171-185 | engine/src/CodeHealth.Core/Frontend/FrontendTestAndDocRefs.cs:211-225 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Core/Frontend/FrontendTestAndDocRefs.cs:75\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":"engine/src/CodeHealth.Core/Frontend/FrontendTestAndDocRefs.cs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"43abdbb62f0ffe93bbffcf3098f8f636cbf4365339d77e824747d947265f86c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): engine/src/CodeHealth.Core/Testing/GoTestCensus.cs:307-321 | engine/src/CodeHealth.Core/Testing/RustTestCensus.cs:284-298 \u2014 before extracting anything, compare \u0060engine/src/CodeHealth.Core/Testing/GoTestCensus.cs\u0060 and \u0060engine/src/CodeHealth.Core/Testing/RustTestCensus.cs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 183 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/src/CodeHealth.Core/Testing/GoTestCensus.cs:307\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. 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":"engine/src/CodeHealth.Core/Testing/GoTestCensus.cs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"92416cb474bee3596babaef5ae9585d730c28e2c545600eaa48fd3494de75ae4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): engine/src/CodeHealth.Core/Testing/RoslynTestQualityCollector.cs:1140-1151 | engine/src/CodeHealth.Core/Testing/RoslynTestQualityCollector.cs:1322-1334 \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 \u0060engine/src/CodeHealth.Core/Testing/RoslynTestQualityCollector.cs:1140\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":"engine/src/CodeHealth.Core/Testing/RoslynTestQualityCollector.cs"},"region":{"startLine":1140}}}],"partialFingerprints":{"codehealthFindingId/v1":"53dc026757de19c940a0e248cb196f72aa8e265b4c026c107a0fd85be04227fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): engine/src/CodeHealth.Core/Testing/RoslynTestQualityCollector.cs:1722-1732 | engine/src/CodeHealth.Core/Testing/RoslynTestQualityCollector.cs:2067-2077 \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":"engine/src/CodeHealth.Core/Testing/RoslynTestQualityCollector.cs"},"region":{"startLine":1722}}}],"partialFingerprints":{"codehealthFindingId/v1":"97b7d850c7ab2e32bf8e5a316a00381b85a6cf05614149e0f5f0acb7e97d7d64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): engine/src/CodeHealth.Core/Testing/GoTestCensus.cs:134-143 | engine/src/CodeHealth.Core/Testing/PythonTestCensus.cs:117-125 \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 \u0060engine/src/CodeHealth.Core/Testing/GoTestCensus.cs:134\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":"engine/src/CodeHealth.Core/Testing/GoTestCensus.cs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"189382067e90995a3a453ad2ac69305d40ba39e72b7d5e1464424bb0e0435ffb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/src/CodeHealth.Core/Testing/NodeTestReliabilityCollector.cs:736-741 | engine/src/CodeHealth.Core/Testing/NodeTestSuiteCoverageCollector.cs:791-796 \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 \u0060engine/src/CodeHealth.Core/Testing/NodeTestReliabilityCollector.cs:736\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Testing/NodeTestReliabilityCollector.cs"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5a68fb06ebe1e97aed180417907aa8255965fcc50bdc629a0208062aa449543"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): engine/src/CodeHealth.Core/Testing/JsTestQualityCensus.cs:547-551 | engine/src/CodeHealth.Core/Testing/JsTestQualityCensus.cs:735-739 \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 \u0060engine/src/CodeHealth.Core/Testing/JsTestQualityCensus.cs:547\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060engine/src/CodeHealth.Core/Testing/JsTestQualityCensus.cs:733\u0060 calls \u0060foreach\u0060 and \u0060engine/src/CodeHealth.Core/Testing/JsTestQualityCensus.cs:546\u0060 does not \u2014 after which the two agree again for 3 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":"engine/src/CodeHealth.Core/Testing/JsTestQualityCensus.cs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"6050c99bf389cac0c82162a876ee34da14af7df1253d066af9750680a455d611"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): engine/src/CodeHealth.Core/Classification/RustInlineTestModule.cs:356-371 | engine/src/CodeHealth.Core/CodeShape/RustInlineTestRegions.cs:399-414 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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":"engine/src/CodeHealth.Core/Classification/RustInlineTestModule.cs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b95addd1f40592ae7665ea7a4f4d560949f5d2717f2f1fd5ae825bc9adc8030"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): engine/src/CodeHealth.Core/Testing/GoTestCensus.cs:547-554 | engine/src/CodeHealth.Core/Testing/JsTestCensus.cs:316-323 | engine/src/CodeHealth.Core/Testing/PythonTestCensus.cs:437-444 | engine/src/CodeHealth.Core/Testing/RustTestCensus.cs:475-482 \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 4 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Testing/GoTestCensus.cs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"600f06ebbf6ae8eeccf21922b09927539a6c2f87505582f682850b083e457392"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): engine/src/CodeHealth.Core/Testing/RoslynTestQualityCollector.cs:2659-2674 | engine/src/CodeHealth.Core/Testing/TestProjectClassifier.cs:257-272 \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":"engine/src/CodeHealth.Core/Testing/RoslynTestQualityCollector.cs"},"region":{"startLine":2659}}}],"partialFingerprints":{"codehealthFindingId/v1":"cee21d3d17348a48b8a02d64ae01292954e0d105cdc794d458657c3d164631b3"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: CodeHealth.Toolchain: CodeHealth.Toolchain: abstractness 0.10, instability 0.00, distance 0.90 \u2014 zone of pain \u2014 concrete and depended on by 16 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d75d6bc7a6ca05bd52675787c2b1a8c663815e78d132e4bc20f4af2676066647"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: CodeHealth.Llm.Abstractions: CodeHealth.Llm.Abstractions: abstractness 0.18, instability 0.00, distance 0.82 \u2014 the shape a shared-kernel / building-block library has BY DESIGN \u2014 concrete and widely depended-on is what makes it useful, and this dimension does not penalise it (the distance is reported for completeness, not as a defect). Worth a look only if it has grown past one coherent kernel into an everything-bucket."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"a5bd3f504497cf4d318c03cd027280e5231fccae057beebb9ed8e873b8cb24ea"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: CodeHealth.Core: CodeHealth.Core: abstractness 0.07, instability 0.12, distance 0.81 \u2014 zone of pain \u2014 concrete and depended on by 15 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bb58227bfd81cdd753767da2be6d25d4dcb03ae4fff7cbc49f8144c564121b59"}},{"ruleId":"D12","level":"warning","message":{"text":"Deprecated: xunit: xunit 2.9.3 \u2014 Legacy \u2014 the publisher\u0027s replacement is \u0060xunit.v3\u0060; that is the next major line under a new package id, so the move is a breaking rename rather than a version bump \u2014 budget for API changes in the code that uses it, not only the reference swap."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d37c8c0e8046c9e8358e976373216abfb78e9fdef63ed53d3edcaa7d2238edcd"}},{"ruleId":"D12","level":"warning","message":{"text":"Prerelease dependency: Cai.Delivery: Cai.Delivery resolves to 0.1.3-ws-g, a prerelease build. Prerelease packages carry no support policy, may change breaking between previews and can be unlisted \u2014 pin a stable release before shipping, or record the reason this preview is required."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"52339d350b35d783a4c55b2dc29646377cf8a63c0a3c8798d6af769a5952724d"}},{"ruleId":"D12","level":"warning","message":{"text":"Prerelease dependency: Cai.Scoring: Cai.Scoring resolves to 0.1.3-ws-g, a prerelease build. Prerelease packages carry no support policy, may change breaking between previews and can be unlisted \u2014 pin a stable release before shipping, or record the reason this preview is required."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"89178a07416c50fa2d56905086371c67c0f009021bbcd367cdb79fdfbe587c15"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs: engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs changed 146 times in last 90 days, max cyclomatic complexity 135 in SupplyChainProvenanceAnalyzer.RunAsync at line 2625. 39 of those changes were fix/bug commits, and the other 107 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs\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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":2625}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f9cafc4e7458082e03645224b7709ea82d7cbf1a3eee06df570850d69c5bc3a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs: engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs changed 152 times in last 90 days, max cyclomatic complexity 114 in ProductionReadinessAnalyzer.SecurityAndPerf at line 4675. 42 of those changes were fix/bug commits, and the other 110 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs\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":"engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs"},"region":{"startLine":4675}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0a6b6d9ffd8f08db1e32409426333a053769452ce56106c21e03d13d604698a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Cli/Commands/AnalyzeCommand.cs: engine/src/CodeHealth.Cli/Commands/AnalyzeCommand.cs changed 118 times in last 90 days, max cyclomatic complexity 144 in AnalyzeCommand.ExecuteCoreAsync at line 171. 51 of those changes were fix/bug commits, and the other 67 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Cli/Commands/AnalyzeCommand.cs\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":"engine/src/CodeHealth.Cli/Commands/AnalyzeCommand.cs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"811396f1944fe437a9a7446855d8b2670d593415512bdfeaddc062772042d623"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Dimensions.Dependencies/DependencyHygieneAnalyzer.cs: engine/src/CodeHealth.Dimensions.Dependencies/DependencyHygieneAnalyzer.cs changed 57 times in last 90 days, max cyclomatic complexity 252 in DependencyHygieneAnalyzer.RunAsync at line 130. 20 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Dimensions.Dependencies/DependencyHygieneAnalyzer.cs\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":"engine/src/CodeHealth.Dimensions.Dependencies/DependencyHygieneAnalyzer.cs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1341826f3a5b59ddc1610e872c41483ca2547620214bb2099ccf2bf12887f47"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs: engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs changed 116 times in last 90 days, max cyclomatic complexity 105 in AccessibilityAnalyzer.AssessEnforcement at line 6348. 47 of those changes were fix/bug commits, and the other 69 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs\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":"engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs"},"region":{"startLine":6348}}}],"partialFingerprints":{"codehealthFindingId/v1":"43bb6bd5cce830d777194522fc78573bb275d4b42c392c6d6e6185a287e66319"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs: engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs changed 87 times in last 90 days, max cyclomatic complexity 102 in JsDuplicationDetector.BuildDeclarationEntryMask at line 860. 55 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs\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":"engine/src/CodeHealth.Core/Frontend/JsDuplicationDetector.cs"},"region":{"startLine":860}}}],"partialFingerprints":{"codehealthFindingId/v1":"16b18df98c47e61ed893d97ec38067e3d363d1338685e82ed239971933899c3b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Dimensions.Security/Scanners/SemgrepClaimRecheck.cs: engine/src/CodeHealth.Dimensions.Security/Scanners/SemgrepClaimRecheck.cs changed 83 times in last 90 days, max cyclomatic complexity 94 in SemgrepClaimRecheck.PremiseRefutedByTheCitedSource at line 293. 34 of those changes were fix/bug commits, and the other 49 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Dimensions.Security/Scanners/SemgrepClaimRecheck.cs\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":"engine/src/CodeHealth.Dimensions.Security/Scanners/SemgrepClaimRecheck.cs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"848f1fd7ef441029c3d62fe978ad10a2d63bd013f909e70790d71a78705d3916"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/ModelAware/CSharpCorrectnessAnalyzer.cs: engine/src/CodeHealth.Core/ModelAware/CSharpCorrectnessAnalyzer.cs changed 60 times in last 90 days, max cyclomatic complexity 130 in CSharpCorrectnessAnalyzer.AnalyzeAsync at line 27. 11 of those changes were fix/bug commits, and the other 49 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/ModelAware/CSharpCorrectnessAnalyzer.cs\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":"engine/src/CodeHealth.Core/ModelAware/CSharpCorrectnessAnalyzer.cs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce206bdcab8647077eb973822f7105ef38d883331afa57d6ba6dd5386bbcc704"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs: engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs changed 57 times in last 90 days, max cyclomatic complexity 128 in ComplianceSecurityAnalyzer.S1 at line 5493. 11 of those changes were fix/bug commits, and the other 46 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs\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":"engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs"},"region":{"startLine":5493}}}],"partialFingerprints":{"codehealthFindingId/v1":"4237771499017cd63513f6e363046de2d8bc0a9270ed5edb7fe672bab36db83c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Maturity/MaturityAnalyzer.cs: engine/src/CodeHealth.Core/Maturity/MaturityAnalyzer.cs changed 71 times in last 90 days, max cyclomatic complexity 97 in MaturityAnalyzer.FolderStructure at line 881. 22 of those changes were fix/bug commits, and the other 49 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Maturity/MaturityAnalyzer.cs\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":"engine/src/CodeHealth.Core/Maturity/MaturityAnalyzer.cs"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"65199c820f02fae5f4c43893bf36f4ca1fb9260cf56640c5fdd7de72979a76a0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Dimensions.GitMining/ChangeCouplingAnalyzer.cs: engine/src/CodeHealth.Dimensions.GitMining/ChangeCouplingAnalyzer.cs changed 104 times in last 90 days, max cyclomatic complexity 53 in ChangeCouplingAnalyzer.HasExplicitDependency at line 3346. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Dimensions.GitMining/ChangeCouplingAnalyzer.cs\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":"engine/src/CodeHealth.Dimensions.GitMining/ChangeCouplingAnalyzer.cs"},"region":{"startLine":3346}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6a11c91db60c08e4f194d18102a3684a1b65ed1bead70924de99866a26f1176"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Dimensions.Security/SecretsHistoryAnalyzer.cs: engine/src/CodeHealth.Dimensions.Security/SecretsHistoryAnalyzer.cs changed 44 times in last 90 days, max cyclomatic complexity 119 in SecretsHistoryAnalyzer.GateCorpusAndDocumentedExampleFindings at line 897. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Dimensions.Security/SecretsHistoryAnalyzer.cs\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":"engine/src/CodeHealth.Dimensions.Security/SecretsHistoryAnalyzer.cs"},"region":{"startLine":897}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9460c1ddfc89438b79e750bcf763e2ce170ab4446beb5c2bb8cd571d0c6a745"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Classification/SourceClassifier.cs: engine/src/CodeHealth.Core/Classification/SourceClassifier.cs changed 70 times in last 90 days, max cyclomatic complexity 74 in SourceClassifier.EcosystemMarkerVerdict at line 3231. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Classification/SourceClassifier.cs\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":"engine/src/CodeHealth.Core/Classification/SourceClassifier.cs"},"region":{"startLine":3231}}}],"partialFingerprints":{"codehealthFindingId/v1":"7121d0c339d295ba7ae42e01c021116d59a3d826d3cdda3d853d5e807bcad7ab"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/CodeShape/RoslynDuplicationDetector.cs: engine/src/CodeHealth.Core/CodeShape/RoslynDuplicationDetector.cs changed 75 times in last 90 days, max cyclomatic complexity 67 in RoslynDuplicationDetector.ScanAsync at line 524. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/CodeShape/RoslynDuplicationDetector.cs\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":"engine/src/CodeHealth.Core/CodeShape/RoslynDuplicationDetector.cs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd74820ee2e3892697022a1e67c3049a4eb7081e83e9454de32245f4d5689538"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/ModelAware/IncompletenessAnalyzer.cs: engine/src/CodeHealth.Core/ModelAware/IncompletenessAnalyzer.cs changed 64 times in last 90 days, max cyclomatic complexity 76 in IncompletenessAnalyzer.AnalyzeAsync at line 146. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/ModelAware/IncompletenessAnalyzer.cs\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":"engine/src/CodeHealth.Core/ModelAware/IncompletenessAnalyzer.cs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd0b7de3bd72244b17ce32e41ea65f2d302ca548dc5ccd464afd1a1957acc6a3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Dimensions.Testing/CoverageAnalyzer.cs: engine/src/CodeHealth.Dimensions.Testing/CoverageAnalyzer.cs changed 58 times in last 90 days, max cyclomatic complexity 79 in CoverageAnalyzer.RunAsync at line 65. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Dimensions.Testing/CoverageAnalyzer.cs\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":"engine/src/CodeHealth.Dimensions.Testing/CoverageAnalyzer.cs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"10c75435843edf39536c3c736bdb553ff5ee50185cd24d13a40503c10113d612"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Dimensions.CodeQuality/CodeShape/GodClassAnalyzer.cs: engine/src/CodeHealth.Dimensions.CodeQuality/CodeShape/GodClassAnalyzer.cs changed 61 times in last 90 days, max cyclomatic complexity 73 in GodClassAnalyzer.RunAsync at line 25. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Dimensions.CodeQuality/CodeShape/GodClassAnalyzer.cs\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":"engine/src/CodeHealth.Dimensions.CodeQuality/CodeShape/GodClassAnalyzer.cs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d6fca8383227959f49f49bdcf44b0c6187fd5f299852f924363f4dcfded1f30"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Dimensions.Security/Scanners/ScanParsers.cs: engine/src/CodeHealth.Dimensions.Security/Scanners/ScanParsers.cs changed 89 times in last 90 days, max cyclomatic complexity 46 in ScanParsers.DependencyDetail at line 2102. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Dimensions.Security/Scanners/ScanParsers.cs\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":"engine/src/CodeHealth.Dimensions.Security/Scanners/ScanParsers.cs"},"region":{"startLine":2102}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c03a7e6b91fa4641dfe3b4307956cdd9003b086f2fb41b1b2b412ff75be060b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Dimensions.Security/Scanners/SecretNoiseFilter.cs: engine/src/CodeHealth.Dimensions.Security/Scanners/SecretNoiseFilter.cs changed 59 times in last 90 days, max cyclomatic complexity 69 in SecretNoiseFilter.IsGenericRuleNoise at line 431. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Dimensions.Security/Scanners/SecretNoiseFilter.cs\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":"engine/src/CodeHealth.Dimensions.Security/Scanners/SecretNoiseFilter.cs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bb24c85f0b7d1d5fd38976dd4f0d089c1abbda27af073e42bfcb1adad17121d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs: engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs changed 45 times in last 90 days, max cyclomatic complexity 69 in DomainModelAnalyzer.AnemicDomainModel at line 2379. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs\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":"engine/src/CodeHealth.Core/ModelAware/DomainModelAnalyzer.cs"},"region":{"startLine":2379}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cec64f623fe7440cfc40826aa1565d66e84c6a26646a723747421e1ef8b496a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Dimensions.CodeQuality/SolutionShape/SolutionShapeAnalyzer.cs: engine/src/CodeHealth.Dimensions.CodeQuality/SolutionShape/SolutionShapeAnalyzer.cs changed 38 times in last 90 days, max cyclomatic complexity 78 in SolutionShapeAnalyzer.RunAsync at line 82. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Dimensions.CodeQuality/SolutionShape/SolutionShapeAnalyzer.cs\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":"engine/src/CodeHealth.Dimensions.CodeQuality/SolutionShape/SolutionShapeAnalyzer.cs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a50a5990bcd62b56de23205802b2f61d05b26921e0ccfe16c0d0fd19c0ada47"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Kennel.Ui/wwwroot/kennel-ui.js: src/Kennel.Ui/wwwroot/kennel-ui.js changed 52 times in last 90 days, max cyclomatic complexity 56 in (anonymous) at line 212. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- src/Kennel.Ui/wwwroot/kennel-ui.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Kennel.Ui/wwwroot/kennel-ui.js"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"0336cda7b9ff2f60ce16761e48f1a3ea53604d9f13bbffca56899b0a81101c8a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Frontend/EntryPointCatalog.cs: engine/src/CodeHealth.Core/Frontend/EntryPointCatalog.cs changed 56 times in last 90 days, max cyclomatic complexity 45 in EntryPointCatalog.DetectApplication at line 269. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Frontend/EntryPointCatalog.cs\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":"engine/src/CodeHealth.Core/Frontend/EntryPointCatalog.cs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"33e758b74f958bdbe94a8b632f26c801686f9ede460a40991d0970c674a2cd62"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Dimensions.CodeQuality/CodeShape/DuplicationAnalyzer.cs: engine/src/CodeHealth.Dimensions.CodeQuality/CodeShape/DuplicationAnalyzer.cs changed 63 times in last 90 days, max cyclomatic complexity 40 in CloneSpanShape.Of at line 4123. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Dimensions.CodeQuality/CodeShape/DuplicationAnalyzer.cs\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":"engine/src/CodeHealth.Dimensions.CodeQuality/CodeShape/DuplicationAnalyzer.cs"},"region":{"startLine":4123}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d7801435aa4f440ad48d36447ada898bb99080efcb042bd0ff6523355b7c7dc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Frontend/FrontendEngineDimensions.cs: engine/src/CodeHealth.Core/Frontend/FrontendEngineDimensions.cs changed 78 times in last 90 days, max cyclomatic complexity 32 in FrontendEngineDimensions.DeadCodeDimension at line 622. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Frontend/FrontendEngineDimensions.cs\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":"engine/src/CodeHealth.Core/Frontend/FrontendEngineDimensions.cs"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"73354e6a9784c17dc6ea6df77792de50a4ef0313216ca0f5410ae08bdb8dfbd9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Security/NativeSecretScanner.cs: engine/src/CodeHealth.Core/Security/NativeSecretScanner.cs changed 43 times in last 90 days, max cyclomatic complexity 58 in NativeSecretScanner.ScanLines at line 782. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Security/NativeSecretScanner.cs\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":"engine/src/CodeHealth.Core/Security/NativeSecretScanner.cs"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"f284ca276cda41085d9a4518cb76558ac69368520db6e9453fd422e6023a14c6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/ExplicitDebt/RoslynExplicitDebtCollector.cs: engine/src/CodeHealth.Core/ExplicitDebt/RoslynExplicitDebtCollector.cs changed 88 times in last 90 days, max cyclomatic complexity 25 in RoslynExplicitDebtCollector.CollectObsoleteAsync at line 4381. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/ExplicitDebt/RoslynExplicitDebtCollector.cs\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":"engine/src/CodeHealth.Core/ExplicitDebt/RoslynExplicitDebtCollector.cs"},"region":{"startLine":4381}}}],"partialFingerprints":{"codehealthFindingId/v1":"a483cc9d981d3d5b270ad54fd5b938760ae59ff59c9a55698b2f34e59eaf5952"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Frontend/FrontendDependencyHygiene.cs: engine/src/CodeHealth.Core/Frontend/FrontendDependencyHygiene.cs changed 56 times in last 90 days, max cyclomatic complexity 39 in FrontendDependencyHygiene.CollectUnlisted at line 2010. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Frontend/FrontendDependencyHygiene.cs\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":"engine/src/CodeHealth.Core/Frontend/FrontendDependencyHygiene.cs"},"region":{"startLine":2010}}}],"partialFingerprints":{"codehealthFindingId/v1":"2da96472c6b07b01e3409d5f36d17cf42d4c96f61e84cbf3a3abbd521240c876"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Dimensions.ExplicitDebt/ExplicitDebtAnalyzer.cs: engine/src/CodeHealth.Dimensions.ExplicitDebt/ExplicitDebtAnalyzer.cs changed 43 times in last 90 days, max cyclomatic complexity 48 in ExplicitDebtAnalyzer.RunAsync at line 31. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Dimensions.ExplicitDebt/ExplicitDebtAnalyzer.cs\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":"engine/src/CodeHealth.Dimensions.ExplicitDebt/ExplicitDebtAnalyzer.cs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5c43e1690d13ece3a86736b1cb3d79e28ab39b9e9d8c0f07edf81b1692803e8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Dimensions.GitMining/HotspotAnalyzer.cs: engine/src/CodeHealth.Dimensions.GitMining/HotspotAnalyzer.cs changed 31 times in last 90 days, max cyclomatic complexity 66 in HotspotAnalyzer.RunAsync at line 34. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Dimensions.GitMining/HotspotAnalyzer.cs\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":"engine/src/CodeHealth.Dimensions.GitMining/HotspotAnalyzer.cs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2215e24dbe6216a2ea0affeb5791f9ff8bd231594ec41861d003392eedcad44"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Frontend/FrontendTestReachability.cs: engine/src/CodeHealth.Core/Frontend/FrontendTestReachability.cs changed 30 times in last 90 days, max cyclomatic complexity 59 in FrontendTestReachability.Analyze at line 81. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Frontend/FrontendTestReachability.cs\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":"engine/src/CodeHealth.Core/Frontend/FrontendTestReachability.cs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1382eddf5ea776b6ec72602ee5fd008477c7a37e09150ab593c3ad5ea648541"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Discovery/FrontendAnalyzer.cs: engine/src/CodeHealth.Core/Discovery/FrontendAnalyzer.cs changed 38 times in last 90 days, max cyclomatic complexity 42 in FrontendAnalyzer.Analyze at line 196. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Discovery/FrontendAnalyzer.cs\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":"engine/src/CodeHealth.Core/Discovery/FrontendAnalyzer.cs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"d37e377dad15a06a17343b085ff14902ddf0d59f3602e9158d23c83e2952fba0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Frontend/ModuleSyntaxScanner.cs: engine/src/CodeHealth.Core/Frontend/ModuleSyntaxScanner.cs changed 22 times in last 90 days, max cyclomatic complexity 71 in ModuleSyntaxScanner.Scan at line 284. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Frontend/ModuleSyntaxScanner.cs\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":"engine/src/CodeHealth.Core/Frontend/ModuleSyntaxScanner.cs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"58b79a7e2ae00329052854b07b5e91acdbdbe9ead7056588ec845a6602269eb9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Frontend/FrontendDeadCode.cs: engine/src/CodeHealth.Core/Frontend/FrontendDeadCode.cs changed 30 times in last 90 days, max cyclomatic complexity 50 in FrontendDeadCode.CountStandaloneReferences at line 1736. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Frontend/FrontendDeadCode.cs\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":"engine/src/CodeHealth.Core/Frontend/FrontendDeadCode.cs"},"region":{"startLine":1736}}}],"partialFingerprints":{"codehealthFindingId/v1":"919392cf8761ad59ceff03475b7ce84dfcce6aa4533983ad529437cc6bb94a49"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Frontend/FrontendBoundaries.cs: engine/src/CodeHealth.Core/Frontend/FrontendBoundaries.cs changed 24 times in last 90 days, max cyclomatic complexity 61 in FrontendBoundaries.CollectCrossPackageViolations at line 1055. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Frontend/FrontendBoundaries.cs\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":"engine/src/CodeHealth.Core/Frontend/FrontendBoundaries.cs"},"region":{"startLine":1055}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6e79e716dbf1ea92a8e2d58a0066db84fd16498b40ef1b395fb9f96bbb6f135"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs: engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs changed 20 times in last 90 days, max cyclomatic complexity 73 in EventDrivenAnalyzer.OutboxDualWrite at line 1680. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs\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":"engine/src/CodeHealth.Core/ModelAware/EventDrivenAnalyzer.cs"},"region":{"startLine":1680}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dda01966580f6ee4679a36db8f6090ec92301847f387f4a47c0ca9d59c8a39b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Dimensions.Testing/TestReliabilityAnalyzer.cs: engine/src/CodeHealth.Dimensions.Testing/TestReliabilityAnalyzer.cs changed 28 times in last 90 days, max cyclomatic complexity 52 in TestReliabilityAnalyzer.RunAsync at line 60. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Dimensions.Testing/TestReliabilityAnalyzer.cs\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":"engine/src/CodeHealth.Dimensions.Testing/TestReliabilityAnalyzer.cs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1e2acb3be839c446a537bfd3cd5b9f5ef318c54383790aecdb85cadcafc1842"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Markup/MarkupParser.cs: engine/src/CodeHealth.Core/Markup/MarkupParser.cs changed 37 times in last 90 days, max cyclomatic complexity 38 in MarkupParser.Build at line 52. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Markup/MarkupParser.cs\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":"engine/src/CodeHealth.Core/Markup/MarkupParser.cs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ac6307886a94de21754163b0c1d6f54dba1113bb947ffcc23106e6d100b9b0a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Dimensions.Security/StaticAnalysisAnalyzer.cs: engine/src/CodeHealth.Dimensions.Security/StaticAnalysisAnalyzer.cs changed 58 times in last 90 days, max cyclomatic complexity 24 in StaticAnalysisAnalyzer.RunAsync at line 85. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Dimensions.Security/StaticAnalysisAnalyzer.cs\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":"engine/src/CodeHealth.Dimensions.Security/StaticAnalysisAnalyzer.cs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c1481909ccaf433a9976c612cfd70024ed43f9171c9e0909480feaab6a40c40"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/ModelAware/ArchitectureModelAnalyzer.cs: engine/src/CodeHealth.Core/ModelAware/ArchitectureModelAnalyzer.cs changed 33 times in last 90 days, max cyclomatic complexity 42 in ArchitectureModelAnalyzer.SliceCohesion at line 2008. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/ModelAware/ArchitectureModelAnalyzer.cs\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":"engine/src/CodeHealth.Core/ModelAware/ArchitectureModelAnalyzer.cs"},"region":{"startLine":2008}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c8597b15630a87a9a124de6b9bfbcec36019c33c0102b3cffa6d4cb312ff2bc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Reporting/Templates/ReportViewModelFactory.cs: engine/src/CodeHealth.Reporting/Templates/ReportViewModelFactory.cs changed 25 times in last 90 days, max cyclomatic complexity 54 in ReportViewModelFactory.Build at line 64. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Reporting/Templates/ReportViewModelFactory.cs\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":"engine/src/CodeHealth.Reporting/Templates/ReportViewModelFactory.cs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"532b8ddd9c16c0b8412a28049b86208a81226fc5cec228fb6ca5bcf82153a6af"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Dimensions.CodeQuality/Complexity/ComplexityScoring.cs: engine/src/CodeHealth.Dimensions.CodeQuality/Complexity/ComplexityScoring.cs changed 50 times in last 90 days, max cyclomatic complexity 26 in ComplexityScoring.RemediationFor at line 311. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Dimensions.CodeQuality/Complexity/ComplexityScoring.cs\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":"engine/src/CodeHealth.Dimensions.CodeQuality/Complexity/ComplexityScoring.cs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"0feed1c71c0a75f7849016a48bdfc4054142f3717e88bc61d53fc59efb3bbdaf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Testing/RoslynTestQualityCollector.cs: engine/src/CodeHealth.Core/Testing/RoslynTestQualityCollector.cs changed 27 times in last 90 days, max cyclomatic complexity 44 in RoslynTestQualityCollector.AnalyzeRoot at line 552. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Testing/RoslynTestQualityCollector.cs\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":"engine/src/CodeHealth.Core/Testing/RoslynTestQualityCollector.cs"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad54079583327c6fd3c5853fd06417b4cff7cf59aee51459d46581e9b73d0399"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/FileQuality/UpstreamAttribution.cs: engine/src/CodeHealth.Core/FileQuality/UpstreamAttribution.cs changed 20 times in last 90 days, max cyclomatic complexity 54 in UpstreamAttribution.ForRepo at line 148. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/FileQuality/UpstreamAttribution.cs\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":"engine/src/CodeHealth.Core/FileQuality/UpstreamAttribution.cs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"31c901bc11358d45c19fcad447c94e1df62e414058f961afbd5fcaf469342173"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Kennel.Watchdog.Core/Agents/Ui/RepoFindings.razor: src/Kennel.Watchdog.Core/Agents/Ui/RepoFindings.razor changed 34 times in last 90 days, max cyclomatic complexity 31. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- src/Kennel.Watchdog.Core/Agents/Ui/RepoFindings.razor\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Kennel.Watchdog.Core/Agents/Ui/RepoFindings.razor"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce5cced9580c2c39b58a32be27d3f423d1191151dc0b78c0e1f2ce40ae4ea7ae"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Dimensions.Testing/TestQualityAnalyzer.cs: engine/src/CodeHealth.Dimensions.Testing/TestQualityAnalyzer.cs changed 18 times in last 90 days, max cyclomatic complexity 58 in TestQualityAnalyzer.RunAsync at line 23. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Dimensions.Testing/TestQualityAnalyzer.cs\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":"engine/src/CodeHealth.Dimensions.Testing/TestQualityAnalyzer.cs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eb91adeb0a2d4a89a52b7d6aa193ce2be76f72d4878c9d49f6b0383a72671c7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Dimensions.GitMining/KnowledgeFreshnessAnalyzer.cs: engine/src/CodeHealth.Dimensions.GitMining/KnowledgeFreshnessAnalyzer.cs changed 26 times in last 90 days, max cyclomatic complexity 39 in KnowledgeFreshnessAnalyzer.RunAsync at line 81. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Dimensions.GitMining/KnowledgeFreshnessAnalyzer.cs\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":"engine/src/CodeHealth.Dimensions.GitMining/KnowledgeFreshnessAnalyzer.cs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dec89e5f32e63a07c52f261a4f5ea61376e81d3ae322dc046444f59b5e8bf56"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/CodeShape/LineBasedGodClassDetector.cs: engine/src/CodeHealth.Core/CodeShape/LineBasedGodClassDetector.cs changed 28 times in last 90 days, max cyclomatic complexity 36 in LineBasedGodClassDetector.DetectAsync at line 34. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/CodeShape/LineBasedGodClassDetector.cs\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":"engine/src/CodeHealth.Core/CodeShape/LineBasedGodClassDetector.cs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bd2d178b14805e38992f97bd60fd31f8d76284b5ba9be486bc1b317d5de3f1f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Scoring/DiskSourceFiles.cs: engine/src/CodeHealth.Core/Scoring/DiskSourceFiles.cs changed 36 times in last 90 days, max cyclomatic complexity 26 in DiskSourceFiles.IsNeverProductionSourceFile at line 1163. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Scoring/DiskSourceFiles.cs\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":"engine/src/CodeHealth.Core/Scoring/DiskSourceFiles.cs"},"region":{"startLine":1163}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c22cc34d8b625ccae1daacbbfc7889eb2f6231408c317cabedcdad4e0d75d94"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/ModelAware/LogicDefectAnalyzer.cs: engine/src/CodeHealth.Core/ModelAware/LogicDefectAnalyzer.cs changed 28 times in last 90 days, max cyclomatic complexity 33 in LogicDefectAnalyzer.AnalyzeAsync at line 89. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/ModelAware/LogicDefectAnalyzer.cs\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":"engine/src/CodeHealth.Core/ModelAware/LogicDefectAnalyzer.cs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"f66597c0b2f2a384339ae3c32b02c0f411dcbd945cb1186d7e2cd630623b90e2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Dimensions.GitMining/KnowledgeConcentrationAnalyzer.cs: engine/src/CodeHealth.Dimensions.GitMining/KnowledgeConcentrationAnalyzer.cs changed 20 times in last 90 days, max cyclomatic complexity 43 in KnowledgeConcentrationAnalyzer.RunAsync at line 152. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Dimensions.GitMining/KnowledgeConcentrationAnalyzer.cs\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":"engine/src/CodeHealth.Dimensions.GitMining/KnowledgeConcentrationAnalyzer.cs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"63cbd78078f0ea5a917974edf1d614843463210f054a471798f02819b1b75f16"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/ModelAware/OperabilityExtrasAnalyzer.cs: engine/src/CodeHealth.Core/ModelAware/OperabilityExtrasAnalyzer.cs changed 20 times in last 90 days, max cyclomatic complexity 40 in OperabilityExtrasAnalyzer.AnalyzeAsync at line 21. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/ModelAware/OperabilityExtrasAnalyzer.cs\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":"engine/src/CodeHealth.Core/ModelAware/OperabilityExtrasAnalyzer.cs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f81d1a10641c7726f11caf9a09bb5fcd5e8e40ccf765a85c62501717eb709e8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Dimensions.Testing/TestDistributionAnalyzer.cs: engine/src/CodeHealth.Dimensions.Testing/TestDistributionAnalyzer.cs changed 18 times in last 90 days, max cyclomatic complexity 44 in TestDistributionAnalyzer.RunAsync at line 21. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Dimensions.Testing/TestDistributionAnalyzer.cs\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":"engine/src/CodeHealth.Dimensions.Testing/TestDistributionAnalyzer.cs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"c12458b825b40395674a2b0b57353c786ec094f50967ea832cb2e2023db63f0c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Dimensions.Architecture/CouplingAnalyzer.cs: engine/src/CodeHealth.Dimensions.Architecture/CouplingAnalyzer.cs changed 15 times in last 90 days, max cyclomatic complexity 52 in CouplingAnalyzer.RunAsync at line 27. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Dimensions.Architecture/CouplingAnalyzer.cs\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":"engine/src/CodeHealth.Dimensions.Architecture/CouplingAnalyzer.cs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8ffb87f95197f19eff606f9df4c1286edd7964584fd6863329a5d44995f5cfc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Dimensions.GitMining/GitMiningSourceFiles.cs: engine/src/CodeHealth.Dimensions.GitMining/GitMiningSourceFiles.cs changed 39 times in last 90 days, max cyclomatic complexity 19 in GitMiningSourceFiles.Eligible at line 429. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Dimensions.GitMining/GitMiningSourceFiles.cs\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":"engine/src/CodeHealth.Dimensions.GitMining/GitMiningSourceFiles.cs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3b91e7f710e6c34cabebf155240f06ed3f59537e50ff04bbf146bf4137608e9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Frontend/ModuleResolver.cs: engine/src/CodeHealth.Core/Frontend/ModuleResolver.cs changed 27 times in last 90 days, max cyclomatic complexity 25 in ModuleResolver.ModuleResolver.ctor at line 106. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Frontend/ModuleResolver.cs\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":"engine/src/CodeHealth.Core/Frontend/ModuleResolver.cs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"4699e4be12460b5bdf58c5372d79a0b5d608e5b90fccee7fee572f096bc4d486"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/ModelAware/DomainConventions.cs: engine/src/CodeHealth.Core/ModelAware/DomainConventions.cs changed 18 times in last 90 days, max cyclomatic complexity 36 in DomainConventions.ClassifyHandler at line 1634. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/ModelAware/DomainConventions.cs\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":"engine/src/CodeHealth.Core/ModelAware/DomainConventions.cs"},"region":{"startLine":1634}}}],"partialFingerprints":{"codehealthFindingId/v1":"65aa6646f95f2d04c92372ca4af9134f7a1c25ca4726a72c4bec2e733745858d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/CodeShape/NeutralFileLengthScanner.cs: engine/src/CodeHealth.Core/CodeShape/NeutralFileLengthScanner.cs changed 18 times in last 90 days, max cyclomatic complexity 35 in NeutralFileLengthScanner.CountBraces at line 721. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/CodeShape/NeutralFileLengthScanner.cs\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":"engine/src/CodeHealth.Core/CodeShape/NeutralFileLengthScanner.cs"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"28e16e3769dab6a01bd0c0844e323513a6fc13e49dfafafb16d9b168d7f1d9ad"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Reporting/Changelog/Fusion/ChangeSetBuilder.cs: engine/src/CodeHealth.Reporting/Changelog/Fusion/ChangeSetBuilder.cs changed 21 times in last 90 days, max cyclomatic complexity 28 in ChangeSetBuilder.IsTestFile at line 843. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Reporting/Changelog/Fusion/ChangeSetBuilder.cs\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":"engine/src/CodeHealth.Reporting/Changelog/Fusion/ChangeSetBuilder.cs"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dbe80c0f79432895a89ec166a230b296881192721f904925b65ef40b2b2f568"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Frontend/FrontendModuleGraph.cs: engine/src/CodeHealth.Core/Frontend/FrontendModuleGraph.cs changed 16 times in last 90 days, max cyclomatic complexity 36 in FrontendModuleGraph.Build at line 162. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Frontend/FrontendModuleGraph.cs\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":"engine/src/CodeHealth.Core/Frontend/FrontendModuleGraph.cs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd587a08e34bc499bbf7f65657ed73a1e8af7a98b643fc78f0c788b3970255a4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/ExplicitDebt/RoslynDeadCodeDetector.cs: engine/src/CodeHealth.Core/ExplicitDebt/RoslynDeadCodeDetector.cs changed 18 times in last 90 days, max cyclomatic complexity 32 in RoslynDeadCodeDetector.IsCandidate at line 361. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/ExplicitDebt/RoslynDeadCodeDetector.cs\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":"engine/src/CodeHealth.Core/ExplicitDebt/RoslynDeadCodeDetector.cs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"66c57f623b69c05e3189244733c31d4ef2ab0edc33dacd7a823db03405b8f63f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Dimensions.Security/Scanners/SemgrepShapeFilter.cs: engine/src/CodeHealth.Dimensions.Security/Scanners/SemgrepShapeFilter.cs changed 20 times in last 90 days, max cyclomatic complexity 28 in SemgrepShapeFilter.IsUnreachableClaim at line 102. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Dimensions.Security/Scanners/SemgrepShapeFilter.cs\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":"engine/src/CodeHealth.Dimensions.Security/Scanners/SemgrepShapeFilter.cs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"eea0f6659985eda7d5d2fe591973245175c6b14817506ac155874961bc871355"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Complexity/ControlFlowComplexity.cs: engine/src/CodeHealth.Core/Complexity/ControlFlowComplexity.cs changed 19 times in last 90 days, max cyclomatic complexity 28 in ControlFlowComplexity.CognitiveShape at line 274. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Complexity/ControlFlowComplexity.cs\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":"engine/src/CodeHealth.Core/Complexity/ControlFlowComplexity.cs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a98574e0245009e19247f43dbd68ff6359abe8f4661f93741af517c4fe684df"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Kennel.Core/Repositories/Ui/RepoHub.razor: src/Kennel.Core/Repositories/Ui/RepoHub.razor changed 35 times in last 90 days, max cyclomatic complexity 15. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- src/Kennel.Core/Repositories/Ui/RepoHub.razor\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Kennel.Core/Repositories/Ui/RepoHub.razor"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad69788f7f251c5040a8619103da2af8219a7d21c686a57eac9f4baabb460ba0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/ModelAware/AppKindDetector.cs: engine/src/CodeHealth.Core/ModelAware/AppKindDetector.cs changed 7 times in last 90 days, max cyclomatic complexity 74 in AppKindDetector.DetectAsync at line 14. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/ModelAware/AppKindDetector.cs\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":"engine/src/CodeHealth.Core/ModelAware/AppKindDetector.cs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb74774a2493cf1dbde62398f97f361a45554044e36171797cf93c4e5359c3e2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Reporting/Changelog/ChangelogNarrator.cs: engine/src/CodeHealth.Reporting/Changelog/ChangelogNarrator.cs changed 19 times in last 90 days, max cyclomatic complexity 27 in ChangelogNarrator.DescribeAsync at line 201. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Reporting/Changelog/ChangelogNarrator.cs\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":"engine/src/CodeHealth.Reporting/Changelog/ChangelogNarrator.cs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"1708a5d4516beef8e959286695aabfb7e4e6dafbbac8502bd32f68e7b421bbe5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/ModelAware/MutationIdempotencyAnalyzer.cs: engine/src/CodeHealth.Core/ModelAware/MutationIdempotencyAnalyzer.cs changed 28 times in last 90 days, max cyclomatic complexity 18 in MutationIdempotencyAnalyzer.GatherRoslynAsync at line 667. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/ModelAware/MutationIdempotencyAnalyzer.cs\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":"engine/src/CodeHealth.Core/ModelAware/MutationIdempotencyAnalyzer.cs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c7f9fdbc33f9df6ef1417d0b573c2280ca9c9f9da3aa7905c92ae128bdc266b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Kennel.Assay.Core/DecisionReports/Ui/DecisionReportsList.razor: src/Kennel.Assay.Core/DecisionReports/Ui/DecisionReportsList.razor changed 27 times in last 90 days, max cyclomatic complexity 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- src/Kennel.Assay.Core/DecisionReports/Ui/DecisionReportsList.razor\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Kennel.Assay.Core/DecisionReports/Ui/DecisionReportsList.razor"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e4fd625084863fd33f18e585556102cd1f606485cf670db04300d5293163665"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Testing/DiskTestScanner.cs: engine/src/CodeHealth.Core/Testing/DiskTestScanner.cs changed 22 times in last 90 days, max cyclomatic complexity 22 in DiskTestScanner.UnreadableTestSources at line 232. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Testing/DiskTestScanner.cs\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":"engine/src/CodeHealth.Core/Testing/DiskTestScanner.cs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"df555c88d76cf2e87786b304a3eb36835291d25e4e1a0d4c099c55b2f11261bc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/ModelAware/PerformanceAnalyzer.cs: engine/src/CodeHealth.Core/ModelAware/PerformanceAnalyzer.cs changed 22 times in last 90 days, max cyclomatic complexity 22 in PerformanceAnalyzer.CollectAsync at line 311. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/ModelAware/PerformanceAnalyzer.cs\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":"engine/src/CodeHealth.Core/ModelAware/PerformanceAnalyzer.cs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fb95dffe0cf9607c767dfdfd892eac49d563f66d2728ae8ba04aeaea26351f5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Dimensions.GitMining/KnowledgeDecayModel.cs: engine/src/CodeHealth.Dimensions.GitMining/KnowledgeDecayModel.cs changed 16 times in last 90 days, max cyclomatic complexity 29 in KnowledgeDecayModel.Build at line 208. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Dimensions.GitMining/KnowledgeDecayModel.cs\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":"engine/src/CodeHealth.Dimensions.GitMining/KnowledgeDecayModel.cs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"b973a3b193dbdf06ab94e0bc939221f409c37b561acb4ce94f254b32a967bb63"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/ModelAware/RepoProfiler.cs: engine/src/CodeHealth.Core/ModelAware/RepoProfiler.cs changed 7 times in last 90 days, max cyclomatic complexity 66 in RepoProfiler.DetectDdd at line 308. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/ModelAware/RepoProfiler.cs\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":"engine/src/CodeHealth.Core/ModelAware/RepoProfiler.cs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f6b8e2b1e7a235edb9af5684a6eb4449a275519db9ea417a07c870762a0d19a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/sidecars/ruby-frontend/selftest/check.mjs: engine/sidecars/ruby-frontend/selftest/check.mjs changed 9 times in last 90 days, max cyclomatic complexity 47 in main at line 47. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/sidecars/ruby-frontend/selftest/check.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/ruby-frontend/selftest/check.mjs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"62512256d48da6e3d2d72a0ac080beffe91d94c1c4703cd2b459d236447cda02"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Dimensions.Security/Scanners/DeclaredDependencies.cs: engine/src/CodeHealth.Dimensions.Security/Scanners/DeclaredDependencies.cs changed 20 times in last 90 days, max cyclomatic complexity 21 in DeclaredDependencies.FromManifests at line 838. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Dimensions.Security/Scanners/DeclaredDependencies.cs\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":"engine/src/CodeHealth.Dimensions.Security/Scanners/DeclaredDependencies.cs"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"69efb68f511bb6540b2d84ee1ca9575c62181c16e36fd64509d199651d9ce043"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Dimensions.Security/OsvScannerAnalyzer.cs: engine/src/CodeHealth.Dimensions.Security/OsvScannerAnalyzer.cs changed 24 times in last 90 days, max cyclomatic complexity 17 in OsvDependencyVulnerabilityArm.CollectAsync at line 41. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Dimensions.Security/OsvScannerAnalyzer.cs\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":"engine/src/CodeHealth.Dimensions.Security/OsvScannerAnalyzer.cs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"25b6d404105564ed2d634f284e9e7296ec9960a25fbeafa19fc4067c16a4ee96"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Complexity/CyclomaticComplexityCalculator.cs: engine/src/CodeHealth.Core/Complexity/CyclomaticComplexityCalculator.cs changed 19 times in last 90 days, max cyclomatic complexity 21 in CyclomaticComplexityCalculator.ComputeAsync at line 32. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Complexity/CyclomaticComplexityCalculator.cs\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":"engine/src/CodeHealth.Core/Complexity/CyclomaticComplexityCalculator.cs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"59a53084c4511e0e91021f6d4067c5c03233ace16b40ee71efbdedba8c35b555"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Reporting/Limitations/RunLimitations.cs: engine/src/CodeHealth.Reporting/Limitations/RunLimitations.cs changed 15 times in last 90 days, max cyclomatic complexity 26 in RunLimitations.BuildFailures at line 104. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Reporting/Limitations/RunLimitations.cs\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":"engine/src/CodeHealth.Reporting/Limitations/RunLimitations.cs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"596493df02388a64c010bf8d3dba6276d400f7e8850eac39f00f39a1b0476398"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Reporting/Recommendations/RuleRecommendationEngine.cs: engine/src/CodeHealth.Reporting/Recommendations/RuleRecommendationEngine.cs changed 13 times in last 90 days, max cyclomatic complexity 30 in RuleRecommendationEngine.ForDimension at line 325. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Reporting/Recommendations/RuleRecommendationEngine.cs\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":"engine/src/CodeHealth.Reporting/Recommendations/RuleRecommendationEngine.cs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbe85ca953f0938dae3bbbfa57bfb6adb99faeea8b0d8e2f7ee3cd80172c6e3c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Docs/AdrDetector.cs: engine/src/CodeHealth.Core/Docs/AdrDetector.cs changed 25 times in last 90 days, max cyclomatic complexity 15 in AdrDetector.IsExcludedNonAdr at line 406. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Docs/AdrDetector.cs\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":"engine/src/CodeHealth.Core/Docs/AdrDetector.cs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2df575c552b576bf7bd6e90b3bfeb3e21ea95b326ba2e9f260c8cd895721e52"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.CodeModel.Jvm/JvmProvider.cs: engine/src/CodeHealth.CodeModel.Jvm/JvmProvider.cs changed 17 times in last 90 days, max cyclomatic complexity 22 in JvmProvider.Build at line 450. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.CodeModel.Jvm/JvmProvider.cs\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":"engine/src/CodeHealth.CodeModel.Jvm/JvmProvider.cs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f8f0865fdab0cdcde02aad132520bea7a6c90db41d770272e713be46e961808"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Scoring/CodebaseSize.cs: engine/src/CodeHealth.Core/Scoring/CodebaseSize.cs changed 10 times in last 90 days, max cyclomatic complexity 32 in CodebaseSize.FromProjectsAsync at line 131. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Scoring/CodebaseSize.cs\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":"engine/src/CodeHealth.Core/Scoring/CodebaseSize.cs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"84c63b04aa663b7ac0f13fcc4b71865b5da8ef77931dce8e231834f6f47e7c5a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Readiness/CiWorkflowReader.cs: engine/src/CodeHealth.Core/Readiness/CiWorkflowReader.cs changed 13 times in last 90 days, max cyclomatic complexity 24 in CiWorkflowReader.IsPipelinePath at line 240. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Readiness/CiWorkflowReader.cs\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":"engine/src/CodeHealth.Core/Readiness/CiWorkflowReader.cs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"07d4c1daab18b687d7bdef719adfbbd3cbf7063a6c855ef979e3b6d679b081ac"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Cohesion/Lcom4Calculator.cs: engine/src/CodeHealth.Core/Cohesion/Lcom4Calculator.cs changed 12 times in last 90 days, max cyclomatic complexity 26 in Lcom4Calculator.Analyze at line 518. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Cohesion/Lcom4Calculator.cs\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":"engine/src/CodeHealth.Core/Cohesion/Lcom4Calculator.cs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c3ff4b53e5d7c4421805eccec038dd5d7939a9a3d18eb01155881a078218304"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: tools/localdev/ui/corpus-e2e.mjs: tools/localdev/ui/corpus-e2e.mjs changed 7 times in last 90 days, max cyclomatic complexity 43 in main at line 739. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- tools/localdev/ui/corpus-e2e.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/localdev/ui/corpus-e2e.mjs"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"60ed5b87c947ebc1b7d804de6ea09c829028af1ad0157521f0e68cb2a4b27b76"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Testing/CoverageReportAdvice.cs: engine/src/CodeHealth.Core/Testing/CoverageReportAdvice.cs changed 20 times in last 90 days, max cyclomatic complexity 15 in CoverageReportAdvice.SingleEcosystemCommand at line 98. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Testing/CoverageReportAdvice.cs\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":"engine/src/CodeHealth.Core/Testing/CoverageReportAdvice.cs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"da556caf5c82b9f4e3e08cccc6033ee0ff83641a88694dd8a1b2f6c79423f896"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/ModelAware/SymbolHelpers.cs: engine/src/CodeHealth.Core/ModelAware/SymbolHelpers.cs changed 18 times in last 90 days, max cyclomatic complexity 16 in SymbolHelpers.IsStronglyTypedId at line 727. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/ModelAware/SymbolHelpers.cs\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":"engine/src/CodeHealth.Core/ModelAware/SymbolHelpers.cs"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"4add8cb0db2d11d05e7e64661122086d4345597ec2fc7c8f74cb888c07453962"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Frontend/MinifiedJsHeuristics.cs: engine/src/CodeHealth.Core/Frontend/MinifiedJsHeuristics.cs changed 11 times in last 90 days, max cyclomatic complexity 26 in MinifiedJsHeuristics.StripStringsAndComments at line 251. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Frontend/MinifiedJsHeuristics.cs\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":"engine/src/CodeHealth.Core/Frontend/MinifiedJsHeuristics.cs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccb6d56d8b7603f6c5c4acc241beacd98821c9f3fa784e4785063364a54063b1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Markup/MarkupElement.cs: engine/src/CodeHealth.Core/Markup/MarkupElement.cs changed 15 times in last 90 days, max cyclomatic complexity 19 in MarkupElement.HasBoundTextContent.get at line 179. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Markup/MarkupElement.cs\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":"engine/src/CodeHealth.Core/Markup/MarkupElement.cs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c279524e25cca0d377722d8c15b6832a87e0cf598cb9d53a4c544a5e149ad0c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.CodeModel.Jvm/Builder.cs: engine/src/CodeHealth.CodeModel.Jvm/Builder.cs changed 15 times in last 90 days, max cyclomatic complexity 19 in ModelBuilder.WireTypes at line 125. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.CodeModel.Jvm/Builder.cs\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":"engine/src/CodeHealth.CodeModel.Jvm/Builder.cs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"db8767bda3cf7411f105e0c484273b246f51cc1f014d26c62f39293d42dd6a66"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Testing/CommittedCoverageReader.cs: engine/src/CodeHealth.Core/Testing/CommittedCoverageReader.cs changed 10 times in last 90 days, max cyclomatic complexity 28 in CommittedCoverageReader.ParseSimpleCovJson at line 726. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Testing/CommittedCoverageReader.cs\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":"engine/src/CodeHealth.Core/Testing/CommittedCoverageReader.cs"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2b17c8ee372a886115df425e416f299514e99a154bd841f8e8ebe32dccb5d51"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Discovery/FrontendMetaDimensions.cs: engine/src/CodeHealth.Core/Discovery/FrontendMetaDimensions.cs changed 14 times in last 90 days, max cyclomatic complexity 20 in FrontendMetaDimensions.ImportBoundariesFix at line 199. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Discovery/FrontendMetaDimensions.cs\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":"engine/src/CodeHealth.Core/Discovery/FrontendMetaDimensions.cs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"42701973f71ee77d6551a1f79b44ba80bdbb55a0bb63488445f6ef83b65409d5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Testing/NodeTestReliabilityCollector.cs: engine/src/CodeHealth.Core/Testing/NodeTestReliabilityCollector.cs changed 7 times in last 90 days, max cyclomatic complexity 39 in NodeTestReliabilityCollector.CollectAsync at line 143. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Testing/NodeTestReliabilityCollector.cs\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":"engine/src/CodeHealth.Core/Testing/NodeTestReliabilityCollector.cs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"61a91bc9009922d5adee71bd4da9b94197791ffc7e4c06bd2bc4ea30e21dc266"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Frontend/FrontendBundlerConfigRefs.cs: engine/src/CodeHealth.Core/Frontend/FrontendBundlerConfigRefs.cs changed 5 times in last 90 days, max cyclomatic complexity 53 in FrontendBundlerConfigRefs.CollectBundlerEntries at line 848. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Frontend/FrontendBundlerConfigRefs.cs\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":"engine/src/CodeHealth.Core/Frontend/FrontendBundlerConfigRefs.cs"},"region":{"startLine":848}}}],"partialFingerprints":{"codehealthFindingId/v1":"eab5fcd71f872cb87058734348434eba276bc34ec49d111714044ddfd1c03504"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/ModelAware/CsprojReferenceGraph.cs: engine/src/CodeHealth.Core/ModelAware/CsprojReferenceGraph.cs changed 13 times in last 90 days, max cyclomatic complexity 20 in CsprojReferenceGraph.ClassifyLayer at line 813. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/ModelAware/CsprojReferenceGraph.cs\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":"engine/src/CodeHealth.Core/ModelAware/CsprojReferenceGraph.cs"},"region":{"startLine":813}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec6f3fcbafd77bced115d6f9e10d3db045b6a1022dacdab8695f1e525af48403"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Readiness/SastAdvice.cs: engine/src/CodeHealth.Core/Readiness/SastAdvice.cs changed 14 times in last 90 days, max cyclomatic complexity 18 in SastAdvice.ScannerFor at line 155. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Readiness/SastAdvice.cs\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":"engine/src/CodeHealth.Core/Readiness/SastAdvice.cs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"0272b1b66f23af320bc4914fa2a72678f0be4b568447aebc538e7945989b40c5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Frontend/FrontendEngine.cs: engine/src/CodeHealth.Core/Frontend/FrontendEngine.cs changed 7 times in last 90 days, max cyclomatic complexity 36 in FrontendEngine.ModelGeneratedModules at line 142. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Frontend/FrontendEngine.cs\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":"engine/src/CodeHealth.Core/Frontend/FrontendEngine.cs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fd5854f739c9804c9d55f99ae06c971fa1e06042a6af096b812b1a069de4e15"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Frontend/JsFunctionScanner.cs: engine/src/CodeHealth.Core/Frontend/JsFunctionScanner.cs changed 7 times in last 90 days, max cyclomatic complexity 35 in JsFunctionScanner.ScanMember at line 429. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Frontend/JsFunctionScanner.cs\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":"engine/src/CodeHealth.Core/Frontend/JsFunctionScanner.cs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"38e70f69ae04e8d6105b8ccd47a9fd428a2054cd9d0dc31793171c27121a30a9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Architecture/IndirectionAnalyzer.cs: engine/src/CodeHealth.Core/Architecture/IndirectionAnalyzer.cs changed 10 times in last 90 days, max cyclomatic complexity 24 in IndirectionAnalyzer.AnalyzeAsync 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Architecture/IndirectionAnalyzer.cs\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":"engine/src/CodeHealth.Core/Architecture/IndirectionAnalyzer.cs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ca6591c2dc249722c1bc875169910632805e7270377c3cb218c45c7f01eb7bf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Dimensions.Architecture/ArchitecturalIntegrityAnalyzer.cs: engine/src/CodeHealth.Dimensions.Architecture/ArchitecturalIntegrityAnalyzer.cs changed 15 times in last 90 days, max cyclomatic complexity 16 in ArchitecturalIntegrityAnalyzer.RunAsync at line 26. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Dimensions.Architecture/ArchitecturalIntegrityAnalyzer.cs\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":"engine/src/CodeHealth.Dimensions.Architecture/ArchitecturalIntegrityAnalyzer.cs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e61c008c56a54c4512268f47460f769bdc327d7ec15c93fe474b2fba5d88a67"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Dimensions.Security/Scanners/UnverifiedRemoteInstallerScan.cs: engine/src/CodeHealth.Dimensions.Security/Scanners/UnverifiedRemoteInstallerScan.cs changed 10 times in last 90 days, max cyclomatic complexity 24 in UnverifiedRemoteInstallerScan.ExtractedAndExecuted at line 756. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Dimensions.Security/Scanners/UnverifiedRemoteInstallerScan.cs\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":"engine/src/CodeHealth.Dimensions.Security/Scanners/UnverifiedRemoteInstallerScan.cs"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"25d1a68c1a426e137be71296818290d1ed87a0d3e2dcec94a2d9bbb2d9235123"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Dimensions.Security/Scanners/DockerfileShapeRuleFilter.cs: engine/src/CodeHealth.Dimensions.Security/Scanners/DockerfileShapeRuleFilter.cs changed 12 times in last 90 days, max cyclomatic complexity 20 in DockerfileShapeRuleFilter.Filter 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Dimensions.Security/Scanners/DockerfileShapeRuleFilter.cs\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":"engine/src/CodeHealth.Dimensions.Security/Scanners/DockerfileShapeRuleFilter.cs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ad35eab01904770abb0e490b9d5cac5fe3a8cc8e046d2b69d26a81c6d693a45"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/ModelAware/JsInteropContractAnalyzer.cs: engine/src/CodeHealth.Core/ModelAware/JsInteropContractAnalyzer.cs changed 8 times in last 90 days, max cyclomatic complexity 29 in JsInteropContractAnalyzer.AnalyzeAsync at line 33. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/ModelAware/JsInteropContractAnalyzer.cs\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":"engine/src/CodeHealth.Core/ModelAware/JsInteropContractAnalyzer.cs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8600bb8a4ac56383b1f72f0cd5792f562768d425ebb13cd540bd522cacee92b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/ModelAware/GoDomainConventions.cs: engine/src/CodeHealth.Core/ModelAware/GoDomainConventions.cs changed 8 times in last 90 days, max cyclomatic complexity 29 in GoDomainConventions.IsNeutralAggregate at line 548. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/ModelAware/GoDomainConventions.cs\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":"engine/src/CodeHealth.Core/ModelAware/GoDomainConventions.cs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"68788fc187ee8fbae153dfc63bfad2328cc21a9a2f5232ae104cf953fb780290"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/ModelAware/GdprPersonalDataAnalyzer.cs: engine/src/CodeHealth.Core/ModelAware/GdprPersonalDataAnalyzer.cs changed 7 times in last 90 days, max cyclomatic complexity 33 in GdprPersonalDataAnalyzer.AnalyzeAsync at line 70. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/ModelAware/GdprPersonalDataAnalyzer.cs\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":"engine/src/CodeHealth.Core/ModelAware/GdprPersonalDataAnalyzer.cs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"80e0d4b4fa464794eb99eff082f055ec6f0b11787e9f9f434024e15070012370"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/ModelAware/EventSourcingAnalyzer.cs: engine/src/CodeHealth.Core/ModelAware/EventSourcingAnalyzer.cs changed 8 times in last 90 days, max cyclomatic complexity 28 in EventSourcingAnalyzer.PiiInEventStore at line 1128. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/ModelAware/EventSourcingAnalyzer.cs\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":"engine/src/CodeHealth.Core/ModelAware/EventSourcingAnalyzer.cs"},"region":{"startLine":1128}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb4a8ecdd235c98a99433f28e9a5ea6cda54f8e248e7b691ffae79d904847414"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/ModelAware/SupplyChainHygieneAnalyzer.cs: engine/src/CodeHealth.Core/ModelAware/SupplyChainHygieneAnalyzer.cs changed 8 times in last 90 days, max cyclomatic complexity 27 in SupplyChainHygieneAnalyzer.Detect at line 56. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/ModelAware/SupplyChainHygieneAnalyzer.cs\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":"engine/src/CodeHealth.Core/ModelAware/SupplyChainHygieneAnalyzer.cs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eb5ecb48bc494dcc0200e4a56d6e48d7816e361dce5df77341b7c10443edc4e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Frontend/FrontendPathLiteralRefs.cs: engine/src/CodeHealth.Core/Frontend/FrontendPathLiteralRefs.cs changed 4 times in last 90 days, max cyclomatic complexity 53 in FrontendPathLiteralRefs.CollectPathLiteralRefs at line 11. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Frontend/FrontendPathLiteralRefs.cs\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":"engine/src/CodeHealth.Core/Frontend/FrontendPathLiteralRefs.cs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ee26872c20f0e5391ac7d44b4591d2c5942c6e7689d0513b72644903b4abe6c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/ModelAware/DataShapeSmellAnalyzer.cs: engine/src/CodeHealth.Core/ModelAware/DataShapeSmellAnalyzer.cs changed 9 times in last 90 days, max cyclomatic complexity 23 in DataShapeSmellAnalyzer.AnalyzeAsync at line 29. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/ModelAware/DataShapeSmellAnalyzer.cs\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":"engine/src/CodeHealth.Core/ModelAware/DataShapeSmellAnalyzer.cs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"b227464c7fa32623bc363168e801001d3b83f90da03d94a0425bd539bf1b5c62"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/ModelAware/RustDomainConventions.cs: engine/src/CodeHealth.Core/ModelAware/RustDomainConventions.cs changed 12 times in last 90 days, max cyclomatic complexity 17 in RustDomainConventions.RawPrimitiveIds at line 541. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/ModelAware/RustDomainConventions.cs\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":"engine/src/CodeHealth.Core/ModelAware/RustDomainConventions.cs"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a9b176eb65fb0e0663c0607499532b512b4169eb02fe759c887765b8130bf3f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Reporting/Changelog/ChangelogDraftRenderer.cs: engine/src/CodeHealth.Reporting/Changelog/ChangelogDraftRenderer.cs changed 13 times in last 90 days, max cyclomatic complexity 15 in ChangelogDraftRenderer.Escape at line 286. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Reporting/Changelog/ChangelogDraftRenderer.cs\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":"engine/src/CodeHealth.Reporting/Changelog/ChangelogDraftRenderer.cs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"98e4bd4d3ec71bcda8a99ac234c65b3ff5a0cacdba41ca1fb4a16db89cb2e6b6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Cli/Commands/JvmSidecar.cs: engine/src/CodeHealth.Cli/Commands/JvmSidecar.cs changed 5 times in last 90 days, max cyclomatic complexity 38 in JvmSidecar.RunAsync at line 385. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Cli/Commands/JvmSidecar.cs\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":"engine/src/CodeHealth.Cli/Commands/JvmSidecar.cs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"48b0339a9fd38711a4f3171821c8493fbdb98ae7b82613da0c1e51aab1cb265e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/ModelAware/ModelAwareLlmJudge.cs: engine/src/CodeHealth.Core/ModelAware/ModelAwareLlmJudge.cs changed 10 times in last 90 days, max cyclomatic complexity 19 in ModelAwareLlmJudge.ResolveId at line 589. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/ModelAware/ModelAwareLlmJudge.cs\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":"engine/src/CodeHealth.Core/ModelAware/ModelAwareLlmJudge.cs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"83419f5a0c12be1491571cb3f66caac971566e0239951a1725173343912304c3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Dimensions.Architecture/NavigabilityAnalyzer.cs: engine/src/CodeHealth.Dimensions.Architecture/NavigabilityAnalyzer.cs changed 10 times in last 90 days, max cyclomatic complexity 18 in NavigabilityAnalyzer.RunAsync 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Dimensions.Architecture/NavigabilityAnalyzer.cs\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":"engine/src/CodeHealth.Dimensions.Architecture/NavigabilityAnalyzer.cs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"dddc5dcf1b81740c2f3171fa2e07e31c21d442487d3c58bbb2c5b14b1f8c3a7a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Testing/CoverletCoverageCollector.cs: engine/src/CodeHealth.Core/Testing/CoverletCoverageCollector.cs changed 12 times in last 90 days, max cyclomatic complexity 15 in CoverletCoverageCollector.CollectUncachedAsync at line 82. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Testing/CoverletCoverageCollector.cs\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":"engine/src/CodeHealth.Core/Testing/CoverletCoverageCollector.cs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"61d781a5514f2510b1b950346020674cfebd696d63f9511b13093408d04f9060"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/ModelAware/ArchitectureStyleDetector.cs: engine/src/CodeHealth.Core/ModelAware/ArchitectureStyleDetector.cs changed 7 times in last 90 days, max cyclomatic complexity 25 in ArchitectureStyleDetector.DetectAsync at line 99. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/ModelAware/ArchitectureStyleDetector.cs\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":"engine/src/CodeHealth.Core/ModelAware/ArchitectureStyleDetector.cs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"b048a4e5efc7457360dff701c02eda0d0579eb6036cad0e32968718e8b008c3d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Architecture/ArchitectureMapBuilder.cs: engine/src/CodeHealth.Core/Architecture/ArchitectureMapBuilder.cs changed 5 times in last 90 days, max cyclomatic complexity 32 in ArchitectureMapBuilder.BuildAsync at line 43. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Architecture/ArchitectureMapBuilder.cs\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":"engine/src/CodeHealth.Core/Architecture/ArchitectureMapBuilder.cs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1795e3c52bed0616b70a3965a51d29ba0b8700d9782e2572b2f712b1d444d09"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Scoring/CiGateDetection.cs: engine/src/CodeHealth.Core/Scoring/CiGateDetection.cs changed 7 times in last 90 days, max cyclomatic complexity 21 in CiGateDetection.SoftFailedAt at line 166. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Scoring/CiGateDetection.cs\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":"engine/src/CodeHealth.Core/Scoring/CiGateDetection.cs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9ddcdb38c2949e7f4832563f15978561ea820cadfcb290b013fd385bbde9e08"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Architecture/BoundaryCouplingDetector.cs: engine/src/CodeHealth.Core/Architecture/BoundaryCouplingDetector.cs changed 9 times in last 90 days, max cyclomatic complexity 16 in BoundaryCouplingDetector.ScanRoslynAsync at line 86. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Architecture/BoundaryCouplingDetector.cs\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":"engine/src/CodeHealth.Core/Architecture/BoundaryCouplingDetector.cs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"31e90f3717de4a3a4d884d4c1e74094f9eaed1b345b0e5c238534840dbe92a83"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/ModelAware/HeadingLabelQualityAnalyzer.cs: engine/src/CodeHealth.Core/ModelAware/HeadingLabelQualityAnalyzer.cs changed 9 times in last 90 days, max cyclomatic complexity 16 in HeadingLabelQualityAnalyzer.AnalyzeAsync at line 24. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/ModelAware/HeadingLabelQualityAnalyzer.cs\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":"engine/src/CodeHealth.Core/ModelAware/HeadingLabelQualityAnalyzer.cs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"90f26bd80ea97a4a209fef9aeb931ed3c414dd55c34acdb53f4c5d4350b300df"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/ModelAware/AggregateTransactionAnalyzer.cs: engine/src/CodeHealth.Core/ModelAware/AggregateTransactionAnalyzer.cs changed 7 times in last 90 days, max cyclomatic complexity 20 in AggregateTransactionAnalyzer.Analyze at line 67. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/ModelAware/AggregateTransactionAnalyzer.cs\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":"engine/src/CodeHealth.Core/ModelAware/AggregateTransactionAnalyzer.cs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"968a966dcbc05af738a257e48912eb6656c2fb5555d93a372a185b022064cbed"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Frontend/FrontendTestSuiteMasking.cs: engine/src/CodeHealth.Core/Frontend/FrontendTestSuiteMasking.cs changed 4 times in last 90 days, max cyclomatic complexity 34 in FrontendTestSuiteMasking.CollectFromBenchmarkTree at line 11. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Frontend/FrontendTestSuiteMasking.cs\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":"engine/src/CodeHealth.Core/Frontend/FrontendTestSuiteMasking.cs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff4cc71a51fe41608e05c4a031ec61d4a5061354a2c7c6e334e52011fb9131d5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Testing/NodeTestSuiteCoverageCollector.cs: engine/src/CodeHealth.Core/Testing/NodeTestSuiteCoverageCollector.cs changed 9 times in last 90 days, max cyclomatic complexity 15 in NodeTestSuiteCoverageCollector.CollectUncachedAsync at line 92. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Testing/NodeTestSuiteCoverageCollector.cs\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":"engine/src/CodeHealth.Core/Testing/NodeTestSuiteCoverageCollector.cs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e11e977010d6c91b747d291b7183fff0ca438e68785b99e502bb20a97b8c9dd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/ModelAware/LinkTextQualityAnalyzer.cs: engine/src/CodeHealth.Core/ModelAware/LinkTextQualityAnalyzer.cs changed 9 times in last 90 days, max cyclomatic complexity 15 in LinkTextQualityAnalyzer.AnalyzeAsync at line 24. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/ModelAware/LinkTextQualityAnalyzer.cs\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":"engine/src/CodeHealth.Core/ModelAware/LinkTextQualityAnalyzer.cs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"865f904e61e59d1b78204d45d5b06088d64cee98739e5e3bc8d271fb665e0591"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Dimensions.Security/Scanners/ShellExecRecheck.cs: engine/src/CodeHealth.Dimensions.Security/Scanners/ShellExecRecheck.cs changed 5 times in last 90 days, max cyclomatic complexity 27 in ShellExecRecheck.RubyCallArguments at line 683. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Dimensions.Security/Scanners/ShellExecRecheck.cs\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":"engine/src/CodeHealth.Dimensions.Security/Scanners/ShellExecRecheck.cs"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bea8905d4a671b46360b65aeb4941620c8cb246b393efe7209b200dccde680e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Dimensions.Architecture/InternalApiConsistencyAnalyzer.cs: engine/src/CodeHealth.Dimensions.Architecture/InternalApiConsistencyAnalyzer.cs changed 6 times in last 90 days, max cyclomatic complexity 22 in InternalApiConsistencyAnalyzer.RunAsync at line 24. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Dimensions.Architecture/InternalApiConsistencyAnalyzer.cs\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":"engine/src/CodeHealth.Dimensions.Architecture/InternalApiConsistencyAnalyzer.cs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fe880ed36153a589e246bc9d7164fc725833159f9c45605f16219c472b88ce8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Kennel.Assay.Core/DecisionReports/Ui/CodebaseDetail.razor: src/Kennel.Assay.Core/DecisionReports/Ui/CodebaseDetail.razor changed 5 times in last 90 days, max cyclomatic complexity 26. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- src/Kennel.Assay.Core/DecisionReports/Ui/CodebaseDetail.razor\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Kennel.Assay.Core/DecisionReports/Ui/CodebaseDetail.razor"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfbd058037ca1933b8a84e2b481cd52a87e785dd75f20eecb975d9fe6dd37507"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Reporting/Engineering/EngineeringReportRenderer.cs: engine/src/CodeHealth.Reporting/Engineering/EngineeringReportRenderer.cs changed 8 times in last 90 days, max cyclomatic complexity 16 in EngineeringReportRenderer.RenderMarkdown at line 83. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Reporting/Engineering/EngineeringReportRenderer.cs\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":"engine/src/CodeHealth.Reporting/Engineering/EngineeringReportRenderer.cs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"2acb0b03b5c1177a5977403fdf2cd010555e08ef53442b7c44701985cea5a0c5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Frontend/JsComplexity.cs: engine/src/CodeHealth.Core/Frontend/JsComplexity.cs changed 5 times in last 90 days, max cyclomatic complexity 25 in JsComplexity.FindBracelessBodyEnd at line 497. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Frontend/JsComplexity.cs\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":"engine/src/CodeHealth.Core/Frontend/JsComplexity.cs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"6188ba0d51acdc39f520f102a608b80be589bd847a56cf4116703ad94a332f3f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Llm.OpenAiCompatible/OpenAiCompatibleLlmProvider.cs: engine/src/CodeHealth.Llm.OpenAiCompatible/OpenAiCompatibleLlmProvider.cs changed 8 times in last 90 days, max cyclomatic complexity 15 in OpenAiCompatibleLlmProvider.CompleteAsync at line 112. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Llm.OpenAiCompatible/OpenAiCompatibleLlmProvider.cs\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":"engine/src/CodeHealth.Llm.OpenAiCompatible/OpenAiCompatibleLlmProvider.cs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"675ed9755250e6484d7091b6767fd38e76c2394aabad36b031155c2fd42da24b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Dimensions.Security/Scanners/WorkflowInputGateRecheck.cs: engine/src/CodeHealth.Dimensions.Security/Scanners/WorkflowInputGateRecheck.cs changed 5 times in last 90 days, max cyclomatic complexity 24 in WorkflowInputGateRecheck.ExpressionYieldsOnlyShellSafeText at line 105. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Dimensions.Security/Scanners/WorkflowInputGateRecheck.cs\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":"engine/src/CodeHealth.Dimensions.Security/Scanners/WorkflowInputGateRecheck.cs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4a1a41f8b77304a647240d2fbc4c200a8a1469d161f8324d2f206ee7444b2ae"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/ExplicitDebt/RoslynExplicitDebtCollector.Vb.cs: engine/src/CodeHealth.Core/ExplicitDebt/RoslynExplicitDebtCollector.Vb.cs changed 8 times in last 90 days, max cyclomatic complexity 15 in RoslynExplicitDebtCollector.CollectVbInvertedNullGuards at line 111. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/ExplicitDebt/RoslynExplicitDebtCollector.Vb.cs\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":"engine/src/CodeHealth.Core/ExplicitDebt/RoslynExplicitDebtCollector.Vb.cs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"74041f834ca113e981bdd583325b8fd4dd91e022cf342c3aa69f4da3132b6c6b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Frontend/JsScopeBindings.cs: engine/src/CodeHealth.Core/Frontend/JsScopeBindings.cs changed 3 times in last 90 days, max cyclomatic complexity 39 in JsScopeBindings.Build at line 354. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Frontend/JsScopeBindings.cs\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":"engine/src/CodeHealth.Core/Frontend/JsScopeBindings.cs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f76a5b95ffa4438b7459726ccf48b7ab1c9310f32bb724a89f4dfd82f20f4f9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.TemplateLanguageBlindness.cs: engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.TemplateLanguageBlindness.cs changed 4 times in last 90 days, max cyclomatic complexity 29 in AccessibilityAnalyzer.CountIndentationTemplateTags at line 313. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.TemplateLanguageBlindness.cs\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":"engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.TemplateLanguageBlindness.cs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"2079e4ddff76149eae62affdcf569174964a74225a070da90a3da751df6f4ee2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Dimensions.Security/Scanners/NpmLockGraph.cs: engine/src/CodeHealth.Dimensions.Security/Scanners/NpmLockGraph.cs changed 4 times in last 90 days, max cyclomatic complexity 29 in SemverRange.Admits at line 484. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Dimensions.Security/Scanners/NpmLockGraph.cs\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":"engine/src/CodeHealth.Dimensions.Security/Scanners/NpmLockGraph.cs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e21b6421cfa4b76ce8c5b430944b9c8b287f47bd7bd0556741b69a737fbd31b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Testing/NodeTestSuiteProbe.cs: engine/src/CodeHealth.Core/Testing/NodeTestSuiteProbe.cs changed 5 times in last 90 days, max cyclomatic complexity 23 in NodeTestSuiteProbe.ChooseRunner at line 466. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Testing/NodeTestSuiteProbe.cs\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":"engine/src/CodeHealth.Core/Testing/NodeTestSuiteProbe.cs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"2625f2d893c547a4a51d93c03595374b010461755a483b28df3dfa3e9c675058"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/ModelAware/InvocationMatching.cs: engine/src/CodeHealth.Core/ModelAware/InvocationMatching.cs changed 6 times in last 90 days, max cyclomatic complexity 18 in InvocationMatching.FirstMatch at line 29. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/ModelAware/InvocationMatching.cs\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":"engine/src/CodeHealth.Core/ModelAware/InvocationMatching.cs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f537aab82b72f4cba037f17a322bafdf0c1b0cbdbb277569a3a702efa752ba4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/CodeShape/NeutralMethodLengthScanner.cs: engine/src/CodeHealth.Core/CodeShape/NeutralMethodLengthScanner.cs changed 6 times in last 90 days, max cyclomatic complexity 18 in NeutralMethodLengthScanner.ReadSignature at line 216. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/CodeShape/NeutralMethodLengthScanner.cs\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":"engine/src/CodeHealth.Core/CodeShape/NeutralMethodLengthScanner.cs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"383a9302309cec1e9dcd3d8d82c34609bbf4cba7f22e5007141417652f55ae7f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/CodeShape/RustInlineTestRegions.cs: engine/src/CodeHealth.Core/CodeShape/RustInlineTestRegions.cs changed 4 times in last 90 days, max cyclomatic complexity 27 in LineLexer.CodeOnly at line 235. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/CodeShape/RustInlineTestRegions.cs\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":"engine/src/CodeHealth.Core/CodeShape/RustInlineTestRegions.cs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c76d1f36f36717d6ce6e58d1f1d71e2e6d3fdcf2b687a1cd222165c4a88ecbd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/ModelAware/MarkupTaintPass.cs: engine/src/CodeHealth.Core/ModelAware/MarkupTaintPass.cs changed 4 times in last 90 days, max cyclomatic complexity 26 in MarkupTaintPass.IsTainted at line 181. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/ModelAware/MarkupTaintPass.cs\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":"engine/src/CodeHealth.Core/ModelAware/MarkupTaintPass.cs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"d845319bca05557b8a17eeefcbf51b2d1ab0964b6ccc7ffe0c1dc6ae4ca650d5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/CodeShape/MemberFamilyRollup.cs: engine/src/CodeHealth.Core/CodeShape/MemberFamilyRollup.cs changed 2 times in last 90 days, max cyclomatic complexity 52 in MemberFamilyRollup.Collapse at line 102. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/CodeShape/MemberFamilyRollup.cs\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":"engine/src/CodeHealth.Core/CodeShape/MemberFamilyRollup.cs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9f479855ceaa37acf32a06113adb4d6bfcfce8fced4fe148e5a03e35bd9c2c4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/ModelAware/AmbientInputAnalyzer.cs: engine/src/CodeHealth.Core/ModelAware/AmbientInputAnalyzer.cs changed 6 times in last 90 days, max cyclomatic complexity 17 in AmbientInputAnalyzer.Analyze at line 98. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/ModelAware/AmbientInputAnalyzer.cs\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":"engine/src/CodeHealth.Core/ModelAware/AmbientInputAnalyzer.cs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"642fb1cedf874320b9873c0c55612672f1244e0ca97ffb50426d01da2fbc0109"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Testing/JsTestCensus.cs: engine/src/CodeHealth.Core/Testing/JsTestCensus.cs changed 4 times in last 90 days, max cyclomatic complexity 25 in JsTestCensus.Strip at line 163. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Testing/JsTestCensus.cs\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":"engine/src/CodeHealth.Core/Testing/JsTestCensus.cs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e4d6a3db71bac1e8720426b3a7379c23a099ff7245dc31d3a2f2bce986129f1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/CodeShape/VbGodClassScanner.cs: engine/src/CodeHealth.Core/CodeShape/VbGodClassScanner.cs changed 5 times in last 90 days, max cyclomatic complexity 20 in VbGodClassScanner.ScanAsync at line 19. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/CodeShape/VbGodClassScanner.cs\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":"engine/src/CodeHealth.Core/CodeShape/VbGodClassScanner.cs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fd013f529c0f51cf02b0aff1e7e8d18789774a70e2490f2de97199a482d6b71"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Architecture/SliceLocalityDetector.cs: engine/src/CodeHealth.Core/Architecture/SliceLocalityDetector.cs changed 6 times in last 90 days, max cyclomatic complexity 16 in SliceLocalityDetector.Collaborators at line 115. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Architecture/SliceLocalityDetector.cs\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":"engine/src/CodeHealth.Core/Architecture/SliceLocalityDetector.cs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb2e3efa4f0316e9141675cd2826b66ec90edb9c58fd7e9ddcad722106fc4e8f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Dependencies/BundlerManifestHygiene.cs: engine/src/CodeHealth.Core/Dependencies/BundlerManifestHygiene.cs changed 4 times in last 90 days, max cyclomatic complexity 24 in BundlerManifestHygiene.Read at line 90. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Dependencies/BundlerManifestHygiene.cs\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":"engine/src/CodeHealth.Core/Dependencies/BundlerManifestHygiene.cs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa455dcd0d37d23a66a4d82d51df7969f41bdab9cad8b0318d0d871277b8da0b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Scoring/CodebaseValuation.cs: engine/src/CodeHealth.Core/Scoring/CodebaseValuation.cs changed 5 times in last 90 days, max cyclomatic complexity 19 in CodebaseValuator.Compute at line 59. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Scoring/CodebaseValuation.cs\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":"engine/src/CodeHealth.Core/Scoring/CodebaseValuation.cs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"3160ee8986413f4abde2e31b1e2e0067e04760e531430c65e2ca986ded4caa1a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Testing/DotnetTestReliabilityCollector.cs: engine/src/CodeHealth.Core/Testing/DotnetTestReliabilityCollector.cs changed 4 times in last 90 days, max cyclomatic complexity 23 in DotnetTestReliabilityCollector.CollectAsync at line 30. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Testing/DotnetTestReliabilityCollector.cs\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":"engine/src/CodeHealth.Core/Testing/DotnetTestReliabilityCollector.cs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b8dae9cc33ecd2038dbeb9e59551f1f2f2e8930369af9b63c8a648a102dbd14"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/ModelAware/CoherenceSmellAnalyzer.cs: engine/src/CodeHealth.Core/ModelAware/CoherenceSmellAnalyzer.cs changed 4 times in last 90 days, max cyclomatic complexity 23 in CoherenceSmellAnalyzer.Implies at line 335. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/ModelAware/CoherenceSmellAnalyzer.cs\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":"engine/src/CodeHealth.Core/ModelAware/CoherenceSmellAnalyzer.cs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b314d307e37d6afa5c8b3656d701f03826c838c523a4e6ec2208ec1e4b21fa7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.TaggedTemplateBlindness.cs: engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.TaggedTemplateBlindness.cs changed 5 times in last 90 days, max cyclomatic complexity 18 in AccessibilityAnalyzer.CountUnreadTemplateMarkup at line 128. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.TaggedTemplateBlindness.cs\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":"engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.TaggedTemplateBlindness.cs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"d88872e9b9caed047960ee216ddd91456dca5768b3ca1ecdfd687654002f80cb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Testing/NodeDependencyInstaller.cs: engine/src/CodeHealth.Core/Testing/NodeDependencyInstaller.cs changed 6 times in last 90 days, max cyclomatic complexity 15 in NodeDependencyInstaller.InstallCoreAsync at line 145. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Testing/NodeDependencyInstaller.cs\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":"engine/src/CodeHealth.Core/Testing/NodeDependencyInstaller.cs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"20244d562d4fcf0d19ac6106cc906baee34e0f6b358aaa6e058b7f13a45cc727"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Docs/FileSystemDocumentationCollector.cs: engine/src/CodeHealth.Core/Docs/FileSystemDocumentationCollector.cs changed 5 times in last 90 days, max cyclomatic complexity 17 in FileSystemDocumentationCollector.CollectAsync at line 19. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Docs/FileSystemDocumentationCollector.cs\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":"engine/src/CodeHealth.Core/Docs/FileSystemDocumentationCollector.cs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"20f9022d202a1a8d63cb61b2cc9d13a6db46d75d162d8c0e4ef759258e490b56"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/ExplicitDebt/AttributeConsumptionScanner.cs: engine/src/CodeHealth.Core/ExplicitDebt/AttributeConsumptionScanner.cs changed 2 times in last 90 days, max cyclomatic complexity 42 in AttributeConsumptionScanner.CollectAsync at line 61. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/ExplicitDebt/AttributeConsumptionScanner.cs\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":"engine/src/CodeHealth.Core/ExplicitDebt/AttributeConsumptionScanner.cs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fbe1baa3ac6eefe278d20d7d215a703e225eaead63d01473abda8ce7201bd8b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Toolchain/Git/CommitIdentityGraph.cs: engine/src/CodeHealth.Toolchain/Git/CommitIdentityGraph.cs changed 3 times in last 90 days, max cyclomatic complexity 27 in CommitIdentityGraph.Build at line 62. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Toolchain/Git/CommitIdentityGraph.cs\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":"engine/src/CodeHealth.Toolchain/Git/CommitIdentityGraph.cs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8821b5e9278644f8769e9d5478394daa0d44a2fe9d44fca03f6c94dbf9cc4b3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Frontend/FrontendComplexity.cs: engine/src/CodeHealth.Core/Frontend/FrontendComplexity.cs changed 5 times in last 90 days, max cyclomatic complexity 16 in FrontendComplexity.Analyze at line 79. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Frontend/FrontendComplexity.cs\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":"engine/src/CodeHealth.Core/Frontend/FrontendComplexity.cs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"756cf113e2f3a44948672813dcdf64d0a1c9309ca8d530e8c3e3d38dad566e8f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/ModelAware/RubyDomainConventions.cs: engine/src/CodeHealth.Core/ModelAware/RubyDomainConventions.cs changed 4 times in last 90 days, max cyclomatic complexity 20 in RubyDomainConventions.IsStructuralAggregate at line 399. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/ModelAware/RubyDomainConventions.cs\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":"engine/src/CodeHealth.Core/ModelAware/RubyDomainConventions.cs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"df5ef8d07dcd5c3f9a30d905ab10eea3c0a641fb53ac5ef3ed83e35d2c31e9f8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Testing/JsTestQualityCensus.cs: engine/src/CodeHealth.Core/Testing/JsTestQualityCensus.cs changed 4 times in last 90 days, max cyclomatic complexity 19 in JsTestQualityCensus.Collect at line 80. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Testing/JsTestQualityCensus.cs\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":"engine/src/CodeHealth.Core/Testing/JsTestQualityCensus.cs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"023760e4d4ed05297824aeb42a9a4711b42dd0c6fb4a2ff26832e59eee481a96"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Frontend/DirectoryForkDetector.cs: engine/src/CodeHealth.Core/Frontend/DirectoryForkDetector.cs changed 4 times in last 90 days, max cyclomatic complexity 19 in DirectoryForkDetector.Analyze at line 154. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Frontend/DirectoryForkDetector.cs\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":"engine/src/CodeHealth.Core/Frontend/DirectoryForkDetector.cs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"75654811f80fdd9b9c29d1032cfe2d4c06cd713e9f6de7b978515cc463373ba4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/ModelAware/JavaDomainConventions.cs: engine/src/CodeHealth.Core/ModelAware/JavaDomainConventions.cs changed 4 times in last 90 days, max cyclomatic complexity 19 in JavaDomainConventions.IsStructuralAggregate at line 510. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/ModelAware/JavaDomainConventions.cs\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":"engine/src/CodeHealth.Core/ModelAware/JavaDomainConventions.cs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ac71dc53acb9e71b148cda4baa5b3b9e9358b800652c0f4aa05e4d26bae52bc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Frontend/JsCloneNearExactness.cs: engine/src/CodeHealth.Core/Frontend/JsCloneNearExactness.cs changed 5 times in last 90 days, max cyclomatic complexity 15 in JsCloneNearExactness.IsNearExactEnoughToPublish at line 270. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Frontend/JsCloneNearExactness.cs\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":"engine/src/CodeHealth.Core/Frontend/JsCloneNearExactness.cs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8c99de0f0c220bb296f38a55a09962c1cec093a3ec91fa86d4794b48502d9da"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Reporting/Synthesis/SynthesisEngine.cs: engine/src/CodeHealth.Reporting/Synthesis/SynthesisEngine.cs changed 5 times in last 90 days, max cyclomatic complexity 15 in SynthesisEngine.BreakingPoint at line 375. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Reporting/Synthesis/SynthesisEngine.cs\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":"engine/src/CodeHealth.Reporting/Synthesis/SynthesisEngine.cs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1e1b435614d8c0f8f388874f2a46ee50092a463e35aa631c5dfac880f5f43b7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/ModelAware/ConstructibleInvalidStateAnalyzer.cs: engine/src/CodeHealth.Core/ModelAware/ConstructibleInvalidStateAnalyzer.cs changed 5 times in last 90 days, max cyclomatic complexity 15 in ConstructibleInvalidStateAnalyzer.Analyze at line 65. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/ModelAware/ConstructibleInvalidStateAnalyzer.cs\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":"engine/src/CodeHealth.Core/ModelAware/ConstructibleInvalidStateAnalyzer.cs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"020a02f44c6e0978338ad4cc20db0d48eaab5857ccea0f99a421fdb59640f6b6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Dimensions.Security/Scanners/GoModuleContextRechecks.cs: engine/src/CodeHealth.Dimensions.Security/Scanners/GoModuleContextRechecks.cs changed 3 times in last 90 days, max cyclomatic complexity 25 in GoModuleContextRechecks.AssertedMapKeyIsLocalCompositeLiteral at line 275. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Dimensions.Security/Scanners/GoModuleContextRechecks.cs\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":"engine/src/CodeHealth.Dimensions.Security/Scanners/GoModuleContextRechecks.cs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"910ed34e33e7087e50f9c587aabea81d36a38fa4c6c7c19e379328da4ffa2048"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Dependencies/MixManifestHygiene.cs: engine/src/CodeHealth.Core/Dependencies/MixManifestHygiene.cs changed 3 times in last 90 days, max cyclomatic complexity 25 in MixManifestHygiene.Read at line 68. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Dependencies/MixManifestHygiene.cs\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":"engine/src/CodeHealth.Core/Dependencies/MixManifestHygiene.cs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c57e8f721304fb6f8ca1cc6e2c7f0f8771f18d00005420c80f63dadafe18324"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Dimensions.Security/Scanners/DockerfileHardeningAdvice.cs: engine/src/CodeHealth.Dimensions.Security/Scanners/DockerfileHardeningAdvice.cs changed 5 times in last 90 days, max cyclomatic complexity 15 in DockerfileHardeningAdvice.Annotated at line 151. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Dimensions.Security/Scanners/DockerfileHardeningAdvice.cs\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":"engine/src/CodeHealth.Dimensions.Security/Scanners/DockerfileHardeningAdvice.cs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"038e91e26d485d9dcd58d010a46bb0019128fca3a3535f64e996846ce114b786"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Dependencies/NpmManifestHygiene.cs: engine/src/CodeHealth.Core/Dependencies/NpmManifestHygiene.cs changed 3 times in last 90 days, max cyclomatic complexity 24 in NpmManifestHygiene.FloatingReason at line 314. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Dependencies/NpmManifestHygiene.cs\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":"engine/src/CodeHealth.Core/Dependencies/NpmManifestHygiene.cs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb2cb5bed47d6bbd2cbd8ded0acd6618b988bdc078ebfd1371f2dc74c95e5b8b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Testing/SelfDeclaredUnreliableTests.cs: engine/src/CodeHealth.Core/Testing/SelfDeclaredUnreliableTests.cs changed 4 times in last 90 days, max cyclomatic complexity 18 in SelfDeclaredUnreliableTests.TestNameAt at line 337. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Testing/SelfDeclaredUnreliableTests.cs\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":"engine/src/CodeHealth.Core/Testing/SelfDeclaredUnreliableTests.cs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"dca06ec9aa60d4a603653ac7301436248222da4dc2e450cd4e08ccf460db9ab6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Frontend/FrontendWorkspaceWalk.cs: engine/src/CodeHealth.Core/Frontend/FrontendWorkspaceWalk.cs changed 4 times in last 90 days, max cyclomatic complexity 18 in FrontendWorkspaceWalk.Walk at line 251. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Frontend/FrontendWorkspaceWalk.cs\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":"engine/src/CodeHealth.Core/Frontend/FrontendWorkspaceWalk.cs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b14eaa42dc04456a81a5ab70f0d5d1b6dcff734c2d9336482d322ff83606be6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/ModelAware/StringContractSmellAnalyzer.cs: engine/src/CodeHealth.Core/ModelAware/StringContractSmellAnalyzer.cs changed 4 times in last 90 days, max cyclomatic complexity 18 in StringContractSmellAnalyzer.Collect at line 130. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/ModelAware/StringContractSmellAnalyzer.cs\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":"engine/src/CodeHealth.Core/ModelAware/StringContractSmellAnalyzer.cs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fdf2c8db243714c5699d3881d03ab6c70696304dfd954700f4499e06fc9df06"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/ModelAware/PythonDomainConventions.cs: engine/src/CodeHealth.Core/ModelAware/PythonDomainConventions.cs changed 4 times in last 90 days, max cyclomatic complexity 18 in PythonDomainConventions.IsStructuralAggregate at line 319. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/ModelAware/PythonDomainConventions.cs\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":"engine/src/CodeHealth.Core/ModelAware/PythonDomainConventions.cs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dcdaeae5de1a7c6c58197406e4503eb7098c0fe8bd0ea979e2c4029babb0db6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Frontend/FrontendTestAndDocRefs.cs: engine/src/CodeHealth.Core/Frontend/FrontendTestAndDocRefs.cs changed 3 times in last 90 days, max cyclomatic complexity 23 in FrontendTestAndDocRefs.AddImportMapKeys at line 512. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Frontend/FrontendTestAndDocRefs.cs\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":"engine/src/CodeHealth.Core/Frontend/FrontendTestAndDocRefs.cs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5048aed94760471adee113c56eac6bac759117cfb7db3db4c8a59349849f315"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/CodeShape/QuotedTextMask.cs: engine/src/CodeHealth.Core/CodeShape/QuotedTextMask.cs changed 3 times in last 90 days, max cyclomatic complexity 23 in QuotedTextMask.Mask at line 144. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/CodeShape/QuotedTextMask.cs\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":"engine/src/CodeHealth.Core/CodeShape/QuotedTextMask.cs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"c14a81e51c3ca828f4e2ead22a16a6a2fce19a5ab8577fd210701629e75cf6e7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/CodeModel/Roslyn/RoslynMethodBody.cs: engine/src/CodeHealth.Core/CodeModel/Roslyn/RoslynMethodBody.cs changed 4 times in last 90 days, max cyclomatic complexity 17 in RoslynMethodBody.StripCommentsAndStrings at line 259. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/CodeModel/Roslyn/RoslynMethodBody.cs\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":"engine/src/CodeHealth.Core/CodeModel/Roslyn/RoslynMethodBody.cs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bae5c239dabbccbe7f15509f1044b091d7098b68709bc6ee7b5a88a0f9c63e4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Scoring/CodeComposition.cs: engine/src/CodeHealth.Core/Scoring/CodeComposition.cs changed 4 times in last 90 days, max cyclomatic complexity 17 in CodeCompositionAnalyzer.CyclomaticComplexity at line 266. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Scoring/CodeComposition.cs\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":"engine/src/CodeHealth.Core/Scoring/CodeComposition.cs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"45bd2cf18fc47fa197d2499b8bf462edb6a6b8ca9b60de9d2fc3ab0bcc22c5d3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Architecture/ContainerDetector.cs: engine/src/CodeHealth.Core/Architecture/ContainerDetector.cs changed 2 times in last 90 days, max cyclomatic complexity 34 in ContainerDetector.HostKind at line 123. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Architecture/ContainerDetector.cs\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":"engine/src/CodeHealth.Core/Architecture/ContainerDetector.cs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"f28c4a6597fd75bbf2b5db2a6428a06f0b26a992bd26658ddeb8975fe375cc1e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Compliance/HostedHttpSurfaceScan.cs: engine/src/CodeHealth.Core/Compliance/HostedHttpSurfaceScan.cs changed 4 times in last 90 days, max cyclomatic complexity 16 in HostedHttpSurfaceScan.RoleOf at line 326. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Compliance/HostedHttpSurfaceScan.cs\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":"engine/src/CodeHealth.Core/Compliance/HostedHttpSurfaceScan.cs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eceedcaf61ae2c2bd83f68a3914d9be642628463c7b4481050229c4435280e7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Dimensions.Security/Scanners/UnpinnedToolchainInstallScan.cs: engine/src/CodeHealth.Dimensions.Security/Scanners/UnpinnedToolchainInstallScan.cs changed 4 times in last 90 days, max cyclomatic complexity 16 in UnpinnedToolchainInstallScan.NodeOffence at line 413. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Dimensions.Security/Scanners/UnpinnedToolchainInstallScan.cs\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":"engine/src/CodeHealth.Dimensions.Security/Scanners/UnpinnedToolchainInstallScan.cs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"c16abb411721aaeec1c2ec15267cc976c53d305898553dbe7c9a7df67dabd5aa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.PublishTrigger.cs: engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.PublishTrigger.cs changed 3 times in last 90 days, max cyclomatic complexity 21 in SupplyChainProvenanceAnalyzer.UninvokedRegistryPublishPath at line 96. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.PublishTrigger.cs\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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.PublishTrigger.cs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb2a7144fa266b84a4fb5c32ca2d033a8bce6e27e6d637ff6f6b849a63d62975"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Dimensions.Security/Scanners/OsvScannerIgnores.cs: engine/src/CodeHealth.Dimensions.Security/Scanners/OsvScannerIgnores.cs changed 3 times in last 90 days, max cyclomatic complexity 21 in OsvScannerIgnores.Parse at line 244. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Dimensions.Security/Scanners/OsvScannerIgnores.cs\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":"engine/src/CodeHealth.Dimensions.Security/Scanners/OsvScannerIgnores.cs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"906bc1f7b43e58a008d38e9ef5900d71050007a5885a932f48246468537aee52"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Testing/CodeModelTestCensus.cs: engine/src/CodeHealth.Core/Testing/CodeModelTestCensus.cs changed 4 times in last 90 days, max cyclomatic complexity 15 in CodeModelTestCensus.ClassifyTier 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Testing/CodeModelTestCensus.cs\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":"engine/src/CodeHealth.Core/Testing/CodeModelTestCensus.cs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c2c241e9bc07812fd471348d8be51ac149c206bf65c39baadae456e87f53e43"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/CodeShape/ChainedCorrespondence.cs: engine/src/CodeHealth.Core/CodeShape/ChainedCorrespondence.cs changed 2 times in last 90 days, max cyclomatic complexity 30 in ChainedCorrespondence.Aggregate at line 79. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/CodeShape/ChainedCorrespondence.cs\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":"engine/src/CodeHealth.Core/CodeShape/ChainedCorrespondence.cs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a6272bb8b375ee50c9725c84c84341d37d36dc792ae1014287d22dc204c0cfa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/ModelAware/RuntimeBoot/ComposePsParser.cs: engine/src/CodeHealth.Core/ModelAware/RuntimeBoot/ComposePsParser.cs changed 3 times in last 90 days, max cyclomatic complexity 19 in ComposePsParser.ParseWebTargets at line 28. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/ModelAware/RuntimeBoot/ComposePsParser.cs\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":"engine/src/CodeHealth.Core/ModelAware/RuntimeBoot/ComposePsParser.cs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"76319256ce883151b29f9de9afbaae8dafdd41949e2c063dd3ce6e43857f34cf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Reporting/Svg/DsmSvg.cs: engine/src/CodeHealth.Reporting/Svg/DsmSvg.cs changed 3 times in last 90 days, max cyclomatic complexity 19 in DsmSvg.Render 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Reporting/Svg/DsmSvg.cs\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":"engine/src/CodeHealth.Reporting/Svg/DsmSvg.cs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"89940d8c406d90fdcca74ee63d67ea4e890cee587e60725a07972626bfbaa26f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Toolchain/Tools/ProcessToolRunner.cs: engine/src/CodeHealth.Toolchain/Tools/ProcessToolRunner.cs changed 3 times in last 90 days, max cyclomatic complexity 18 in ProcessToolRunner.RunAsync at line 17. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Toolchain/Tools/ProcessToolRunner.cs\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":"engine/src/CodeHealth.Toolchain/Tools/ProcessToolRunner.cs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d9199f392a14d003258a3f4845253f3e56835f8d43c49e85eff4237cccff218"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Frontend/JsLexer.Jsx.cs: engine/src/CodeHealth.Core/Frontend/JsLexer.Jsx.cs changed 3 times in last 90 days, max cyclomatic complexity 17 in Scanner.TryScanJsxTypeArguments at line 532. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Frontend/JsLexer.Jsx.cs\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":"engine/src/CodeHealth.Core/Frontend/JsLexer.Jsx.cs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"49d4ab6cad59372a071d0ee82f5099deaa503b092c14cbc55e734d33ecea264b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/CodeModel/Roslyn/CSharpBranchExtractor.cs: engine/src/CodeHealth.Core/CodeModel/Roslyn/CSharpBranchExtractor.cs changed 3 times in last 90 days, max cyclomatic complexity 17 in CSharpBranchExtractor.RecordCyclomatic at line 124. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/CodeModel/Roslyn/CSharpBranchExtractor.cs\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":"engine/src/CodeHealth.Core/CodeModel/Roslyn/CSharpBranchExtractor.cs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c02895e140744ea33ddf053209458ccc29d40f2afdc8edefda9532dc2fc4379"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Frontend/FrontendWorkspaceLoader.BuildOutput.cs: engine/src/CodeHealth.Core/Frontend/FrontendWorkspaceLoader.BuildOutput.cs changed 2 times in last 90 days, max cyclomatic complexity 25 in FrontendWorkspaceLoader.ReadSourceMapProvenance at line 139. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Frontend/FrontendWorkspaceLoader.BuildOutput.cs\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":"engine/src/CodeHealth.Core/Frontend/FrontendWorkspaceLoader.BuildOutput.cs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d1410d063dcf144dee06c03ef98b6fa84fc12318535f1cdc08951588c14068c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.NpmRegistryAuth.cs: engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.NpmRegistryAuth.cs changed 2 times in last 90 days, max cyclomatic complexity 25 in SupplyChainProvenanceAnalyzer.TokenAuthedNpmPublishes at line 176. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.NpmRegistryAuth.cs\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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.NpmRegistryAuth.cs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee96000f0f2bf4e577232919f45d8a7600e4bbf3676cf2c87aec1bb8f8a6f039"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Frontend/JsLexer.cs: engine/src/CodeHealth.Core/Frontend/JsLexer.cs changed 2 times in last 90 days, max cyclomatic complexity 25 in Scanner.ScanNumber at line 298. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Frontend/JsLexer.cs\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":"engine/src/CodeHealth.Core/Frontend/JsLexer.cs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"70c6cbacb28bb683cd01a30f89ee5e2db740ae40adbf6a64281ece79559eb133"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Testing/TestProjectClassifier.cs: engine/src/CodeHealth.Core/Testing/TestProjectClassifier.cs changed 3 times in last 90 days, max cyclomatic complexity 16 in TestProjectClassifier.FileTier at line 95. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Testing/TestProjectClassifier.cs\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":"engine/src/CodeHealth.Core/Testing/TestProjectClassifier.cs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddf156d2b5e89808940debd0e7b589ff7b0cfa4b74d027608a3fd3aa7b932825"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Dimensions.Security/Scanners/PrimaryConstructorShadow.cs: engine/src/CodeHealth.Dimensions.Security/Scanners/PrimaryConstructorShadow.cs changed 3 times in last 90 days, max cyclomatic complexity 16 in PrimaryConstructorShadow.SkipTypeName at line 283. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Dimensions.Security/Scanners/PrimaryConstructorShadow.cs\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":"engine/src/CodeHealth.Dimensions.Security/Scanners/PrimaryConstructorShadow.cs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8ba5354dab37e075602a8d0ea1bdd4743b3ea2c1c6856152592d4a00247dbb8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Dimensions.Security/Scanners/RubyArgumentMutatedScan.cs: engine/src/CodeHealth.Dimensions.Security/Scanners/RubyArgumentMutatedScan.cs changed 2 times in last 90 days, max cyclomatic complexity 24 in RubyArgumentMutatedScan.ParametersOf at line 264. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Dimensions.Security/Scanners/RubyArgumentMutatedScan.cs\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":"engine/src/CodeHealth.Dimensions.Security/Scanners/RubyArgumentMutatedScan.cs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ec1395776606ac18669db5e2861b30b3fe7cd30a18583249294c0f7e8117687"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Dimensions.Security/Scanners/MutableGitCloneScan.cs: engine/src/CodeHealth.Dimensions.Security/Scanners/MutableGitCloneScan.cs changed 2 times in last 90 days, max cyclomatic complexity 24 in MutableGitCloneScan.Offence 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Dimensions.Security/Scanners/MutableGitCloneScan.cs\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":"engine/src/CodeHealth.Dimensions.Security/Scanners/MutableGitCloneScan.cs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecd758fe991a5e7619fbc6a00d24c7e716f3f52797b884815d228570595b4dbd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Dimensions.Security/Scanners/PathCombineProvenanceRecheck.cs: engine/src/CodeHealth.Dimensions.Security/Scanners/PathCombineProvenanceRecheck.cs changed 3 times in last 90 days, max cyclomatic complexity 16 in PathCombineProvenanceRecheck.ExtractCombineArgs at line 292. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Dimensions.Security/Scanners/PathCombineProvenanceRecheck.cs\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":"engine/src/CodeHealth.Dimensions.Security/Scanners/PathCombineProvenanceRecheck.cs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcab938ef359d25b6911d50c203fa3757e4ac084cae484b20126aa71a9368e58"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Frontend/JsRedundantReDefault.cs: engine/src/CodeHealth.Core/Frontend/JsRedundantReDefault.cs changed 2 times in last 90 days, max cyclomatic complexity 24 in JsRedundantReDefault.IsRedundantAt at line 67. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Frontend/JsRedundantReDefault.cs\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":"engine/src/CodeHealth.Core/Frontend/JsRedundantReDefault.cs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"5823a1ded4fdce0fd660b5cea3f13a59565e837bf50141a144eed27c84dcd8ae"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Git/GitRefStore.cs: engine/src/CodeHealth.Core/Git/GitRefStore.cs changed 3 times in last 90 days, max cyclomatic complexity 16 in GitRefStore.Resolve at line 27. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Git/GitRefStore.cs\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":"engine/src/CodeHealth.Core/Git/GitRefStore.cs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fcfbc60d0da32bdf45dcabe258e168dae2e0264f094e456ca87f4223c3cc25c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/ModelAware/ScalaDomainConventions.cs: engine/src/CodeHealth.Core/ModelAware/ScalaDomainConventions.cs changed 2 times in last 90 days, max cyclomatic complexity 24 in ScalaDomainConventions.Dm6InfraLeak at line 233. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/ModelAware/ScalaDomainConventions.cs\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":"engine/src/CodeHealth.Core/ModelAware/ScalaDomainConventions.cs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b90019d2d4ea64572dc3166d252adbf0dd2c55827b3b207ba5da40e41872df9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/ModelAware/RuntimeBoot/TestFrameworkDetector.cs: engine/src/CodeHealth.Core/ModelAware/RuntimeBoot/TestFrameworkDetector.cs changed 3 times in last 90 days, max cyclomatic complexity 16 in TestFrameworkDetector.IsDependencyManifest at line 80. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/ModelAware/RuntimeBoot/TestFrameworkDetector.cs\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":"engine/src/CodeHealth.Core/ModelAware/RuntimeBoot/TestFrameworkDetector.cs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f7e10677b383ffdad2f0b6d37610f8a5f3286bf383a619709ef3df947c26504"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Dimensions.Security/Scanners/ConfigCredentialBindingScan.cs: engine/src/CodeHealth.Dimensions.Security/Scanners/ConfigCredentialBindingScan.cs changed 2 times in last 90 days, max cyclomatic complexity 23 in ConfigCredentialBindingScan.FindingsInFile at line 275. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Dimensions.Security/Scanners/ConfigCredentialBindingScan.cs\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":"engine/src/CodeHealth.Dimensions.Security/Scanners/ConfigCredentialBindingScan.cs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"b27851db2a48d26c03452d4d520f74fec8bd80ad8e9cede062015695868fc6ef"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Scoring/ArchitectureDepth.cs: engine/src/CodeHealth.Core/Scoring/ArchitectureDepth.cs changed 3 times in last 90 days, max cyclomatic complexity 15 in ArchitectureDepth.From at line 63. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Scoring/ArchitectureDepth.cs\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":"engine/src/CodeHealth.Core/Scoring/ArchitectureDepth.cs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"d77d2f6d6981e0bf338d3d51b9dbd278e9d630e255c14b5e679d2cf06c65ab10"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Frontend/ModuleGlobPattern.cs: engine/src/CodeHealth.Core/Frontend/ModuleGlobPattern.cs changed 3 times in last 90 days, max cyclomatic complexity 15 in ModuleGlobPattern.ResolveRepoRelative 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Frontend/ModuleGlobPattern.cs\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":"engine/src/CodeHealth.Core/Frontend/ModuleGlobPattern.cs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"b19faaadacf969188f78ffb0044ee561ca2a8303b4bfb9256d9cdb3997816c0d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Dimensions.Security/Scanners/SemgrepUnsafeAdvice.cs: engine/src/CodeHealth.Dimensions.Security/Scanners/SemgrepUnsafeAdvice.cs changed 3 times in last 90 days, max cyclomatic complexity 15 in SemgrepUnsafeAdvice.DoesArithmeticOnAUintptr at line 227. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Dimensions.Security/Scanners/SemgrepUnsafeAdvice.cs\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":"engine/src/CodeHealth.Dimensions.Security/Scanners/SemgrepUnsafeAdvice.cs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3c80c5db38bd86359c05892cf84708f9f9251c71dc87555ff2289926147e278"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Statistics/RoslynProjectStatistician.cs: engine/src/CodeHealth.Core/Statistics/RoslynProjectStatistician.cs changed 3 times in last 90 days, max cyclomatic complexity 15 in RoslynProjectStatistician.CollectAsync at line 13. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Statistics/RoslynProjectStatistician.cs\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":"engine/src/CodeHealth.Core/Statistics/RoslynProjectStatistician.cs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad5489d95074948c04226f1158de093d8719d3a8d94a2a1e1f0ccdbc0dfcafcc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/CodeShape/ChainedFamilyRollup.cs: engine/src/CodeHealth.Core/CodeShape/ChainedFamilyRollup.cs changed 2 times in last 90 days, max cyclomatic complexity 21 in ChainedFamilyRollup.Append at line 93. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/CodeShape/ChainedFamilyRollup.cs\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":"engine/src/CodeHealth.Core/CodeShape/ChainedFamilyRollup.cs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9d47e216ebc8f4d733ba902dabf2ab6a515087320e638ff44febba6a5f77443"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Dimensions.Security/Scanners/UnverifiedTrustAnchorScan.cs: engine/src/CodeHealth.Dimensions.Security/Scanners/UnverifiedTrustAnchorScan.cs changed 2 times in last 90 days, max cyclomatic complexity 20 in UnverifiedTrustAnchorScan.FetchLine at line 360. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Dimensions.Security/Scanners/UnverifiedTrustAnchorScan.cs\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":"engine/src/CodeHealth.Dimensions.Security/Scanners/UnverifiedTrustAnchorScan.cs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"695c7ae82eb7fe9e678038283ae42d816eddf72fc1425dd82150bcbb8bb67505"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/ModelAware/ErlangDomainConventions.cs: engine/src/CodeHealth.Core/ModelAware/ErlangDomainConventions.cs changed 2 times in last 90 days, max cyclomatic complexity 20 in ErlangDomainConventions.Ed1Gated at line 399. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/ModelAware/ErlangDomainConventions.cs\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":"engine/src/CodeHealth.Core/ModelAware/ErlangDomainConventions.cs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"66edf6edf00d73c405874626b47ca61de9f83f5c255d6abde4f1735e9022f2eb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Dimensions.Security/Scanners/NamelessWorkloadNormalisedScan.cs: engine/src/CodeHealth.Dimensions.Security/Scanners/NamelessWorkloadNormalisedScan.cs changed 2 times in last 90 days, max cyclomatic complexity 19 in NamelessWorkloadNormalisedScan.Normalise at line 222. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Dimensions.Security/Scanners/NamelessWorkloadNormalisedScan.cs\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":"engine/src/CodeHealth.Dimensions.Security/Scanners/NamelessWorkloadNormalisedScan.cs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a031fe9bc8b88db0115a2ff362ed0c75a5beb5a06ee9c878fe0cce0bec0b78"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Readiness/DartAnalyzerExclusions.cs: engine/src/CodeHealth.Core/Readiness/DartAnalyzerExclusions.cs changed 2 times in last 90 days, max cyclomatic complexity 19 in DartAnalyzerExclusions.Inspect at line 86. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Readiness/DartAnalyzerExclusions.cs\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":"engine/src/CodeHealth.Core/Readiness/DartAnalyzerExclusions.cs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"db910dfa9e34bbb76f18150efa74f3f026e3ac268fe1c948d11c76322f8adee1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/sidecars/tsjs-frontend/selftest/accessor-fixture/src/field-like.ts: engine/sidecars/tsjs-frontend/selftest/accessor-fixture/src/field-like.ts changed 2 times in last 90 days, max cyclomatic complexity 19 in tangledGetter at line 166. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/sidecars/tsjs-frontend/selftest/accessor-fixture/src/field-like.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/tsjs-frontend/selftest/accessor-fixture/src/field-like.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"75f600f03c25c184ba0ae2f09e60d5f3062fd65db39e0ee33830e1d13833e2e3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/ExplicitDebt/YamlDisabledConfigScanner.cs: engine/src/CodeHealth.Core/ExplicitDebt/YamlDisabledConfigScanner.cs changed 2 times in last 90 days, max cyclomatic complexity 18 in YamlDisabledConfigScanner.TryConvict at line 531. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/ExplicitDebt/YamlDisabledConfigScanner.cs\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":"engine/src/CodeHealth.Core/ExplicitDebt/YamlDisabledConfigScanner.cs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"39d16ffb5d8999e5672ad4f76e8436edb09f6377d46d594887d387eceb7764c4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/ModelAware/PhpDomainConventions.cs: engine/src/CodeHealth.Core/ModelAware/PhpDomainConventions.cs changed 2 times in last 90 days, max cyclomatic complexity 17 in PhpDomainConventions.IsStructuralAggregate at line 150. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/ModelAware/PhpDomainConventions.cs\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":"engine/src/CodeHealth.Core/ModelAware/PhpDomainConventions.cs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"8266f4204203baa911e815ee1775b655eef87a53412be4a9579a8e745e460d5d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Dimensions.Docs/Llm/LlmAdrConformanceChecker.cs: engine/src/CodeHealth.Dimensions.Docs/Llm/LlmAdrConformanceChecker.cs changed 2 times in last 90 days, max cyclomatic complexity 16 in LlmAdrConformanceChecker.CheckAsync at line 23. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Dimensions.Docs/Llm/LlmAdrConformanceChecker.cs\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":"engine/src/CodeHealth.Dimensions.Docs/Llm/LlmAdrConformanceChecker.cs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8d474b15335705174e463687c379392254caf6efeff9cd6b3c8a323e2fce006"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Dimensions.Security/Scanners/PowerShellFetchExecScriptRecheck.cs: engine/src/CodeHealth.Dimensions.Security/Scanners/PowerShellFetchExecScriptRecheck.cs changed 2 times in last 90 days, max cyclomatic complexity 16 in PowerShellFetchExecScriptRecheck.TextLines at line 102. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Dimensions.Security/Scanners/PowerShellFetchExecScriptRecheck.cs\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":"engine/src/CodeHealth.Dimensions.Security/Scanners/PowerShellFetchExecScriptRecheck.cs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9c90b5d824b99227514b567c08fdfb4811392d68e4b141a1737ae06d431681f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Testing/TestFrameworkAdvice.cs: engine/src/CodeHealth.Core/Testing/TestFrameworkAdvice.cs changed 2 times in last 90 days, max cyclomatic complexity 16 in TestFrameworkAdvice.FrameworksFor at line 31. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Testing/TestFrameworkAdvice.cs\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":"engine/src/CodeHealth.Core/Testing/TestFrameworkAdvice.cs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"d06426ada9253903a30285fad6855f1c361b4c76ee0a6b59a16a668857b93baf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Cli/Diagnostics/DegradedDiagnosticsReport.cs: engine/src/CodeHealth.Cli/Diagnostics/DegradedDiagnosticsReport.cs changed 2 times in last 90 days, max cyclomatic complexity 16 in DegradedDiagnosticsReport.Render at line 30. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Cli/Diagnostics/DegradedDiagnosticsReport.cs\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":"engine/src/CodeHealth.Cli/Diagnostics/DegradedDiagnosticsReport.cs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"b667216d08b74d4efe26fed6c5a8fb37dd9a296402e0f1ff499df22ff51510fe"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Scoring/DeclaredScriptExecutables.cs: engine/src/CodeHealth.Core/Scoring/DeclaredScriptExecutables.cs changed 2 times in last 90 days, max cyclomatic complexity 15 in DeclaredScriptExecutables.ForRepo at line 165. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Scoring/DeclaredScriptExecutables.cs\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":"engine/src/CodeHealth.Core/Scoring/DeclaredScriptExecutables.cs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"914d4cd3060674bed75aef1515b7185b12c0a67a7d35ec252fca7eee74b1ca8d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Dependencies/RubyGemsCurrencyCollector.cs: engine/src/CodeHealth.Core/Dependencies/RubyGemsCurrencyCollector.cs changed 2 times in last 90 days, max cyclomatic complexity 15 in RubyGemsCurrencyCollector.CollectAsync at line 84. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Dependencies/RubyGemsCurrencyCollector.cs\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":"engine/src/CodeHealth.Core/Dependencies/RubyGemsCurrencyCollector.cs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e5b555889c1ca4b9ac2fbe7a472c1d7702edaee86d74f708c72668a72cbf396"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Frontend/FrontendDeclaredPackageRefs.cs: engine/src/CodeHealth.Core/Frontend/FrontendDeclaredPackageRefs.cs changed 2 times in last 90 days, max cyclomatic complexity 15 in FrontendDeclaredPackageRefs.CollectLockfileExactRequirements at line 30. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Frontend/FrontendDeclaredPackageRefs.cs\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":"engine/src/CodeHealth.Core/Frontend/FrontendDeclaredPackageRefs.cs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"b623ecd90d926afd0d72810c4ca5e94b354f791e54f4aecc147c8695b372d5c6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Dimensions.CodeQuality/Complexity/ComplexityDisclosure.cs: engine/src/CodeHealth.Dimensions.CodeQuality/Complexity/ComplexityDisclosure.cs changed 2 times in last 90 days, max cyclomatic complexity 15 in ComplexityDisclosure.NestedItemDisclosure at line 46. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Dimensions.CodeQuality/Complexity/ComplexityDisclosure.cs\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":"engine/src/CodeHealth.Dimensions.CodeQuality/Complexity/ComplexityDisclosure.cs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"559c22529405c02dd0f19fab6bc1673e0e65a5df597dd2e5ecdd5f0080a5d8ab"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Dependencies/GoModuleHygiene.cs: engine/src/CodeHealth.Core/Dependencies/GoModuleHygiene.cs changed 2 times in last 90 days, max cyclomatic complexity 15 in GoModuleHygiene.Read at line 117. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Dependencies/GoModuleHygiene.cs\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":"engine/src/CodeHealth.Core/Dependencies/GoModuleHygiene.cs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4ba621290fdc02eaf0ee2917fb8ab32cf11b4a97ed6e6ea3b68ea57668b658d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/ExplicitDebt/RazorCodeBlockProjection.cs: engine/src/CodeHealth.Core/ExplicitDebt/RazorCodeBlockProjection.cs changed 2 times in last 90 days, max cyclomatic complexity 15 in RazorCodeBlockProjection.CodeBlockBodies at line 106. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/ExplicitDebt/RazorCodeBlockProjection.cs\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":"engine/src/CodeHealth.Core/ExplicitDebt/RazorCodeBlockProjection.cs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff581e44885c4af00bf02906fd5a33b3c41da8c628393bf9addc54d05dfa20f9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Security/DotnetProjectLicensesCollector.cs: engine/src/CodeHealth.Core/Security/DotnetProjectLicensesCollector.cs changed 2 times in last 90 days, max cyclomatic complexity 15 in DotnetProjectLicensesCollector.FilterToProductPackages at line 132. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Security/DotnetProjectLicensesCollector.cs\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":"engine/src/CodeHealth.Core/Security/DotnetProjectLicensesCollector.cs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"39f369a513251b4a50f5cdb5758fb290175fabebb5a9dd6b7a27d6cf526896f0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/src/CodeHealth.Core/Frontend/SfcScriptExtractor.cs: engine/src/CodeHealth.Core/Frontend/SfcScriptExtractor.cs changed 2 times in last 90 days, max cyclomatic complexity 15 in SfcScriptExtractor.AttributesIndicateTypeScript at line 220. 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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Frontend/SfcScriptExtractor.cs\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":"engine/src/CodeHealth.Core/Frontend/SfcScriptExtractor.cs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"88168e1f22780fe6f59536502815ff63d08ec43d10efcc1bfe5b604a85ce7258"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: engine/src/CodeHealth.Dimensions.Security/Scanners/DeepScan.cs: engine/src/CodeHealth.Dimensions.Security/Scanners/DeepScan.cs changed 40 times in last 90 days and 24 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is DeepScan.ReadTrivyCheckBundle at line 233), 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(D29/01a09684-39ee): a dimension with no population to measure was published as low confidence\u201D; \u201Cfix(D29/01a09654-2591): a check that never ran published 100% rule-coverage\u201D; \u201Cfix(01a0961f-16ae): a missing tool in our own image was filed as a check the reader deliberately left off\u201D; \u201Cfix(D31/01a07fde-acdd): admit Bicep and Ansible to the IaC gate, each with a checkov reader behind it\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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Dimensions.Security/Scanners/DeepScan.cs\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":"engine/src/CodeHealth.Dimensions.Security/Scanners/DeepScan.cs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"119aed136460dfd79d5fced9eaef26a71c810e81f23a2b22e57b876b067a61c4"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: engine/src/CodeHealth.Core/CodeShape/DuplicationFinding.cs: engine/src/CodeHealth.Core/CodeShape/DuplicationFinding.cs changed 21 times in last 90 days and 14 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 DuplicationFinding.PublishedIdentity.get at line 281), 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(R10/01a0996c-5eca): the clone group\u0027s content is its identity, so its measured extent stops being\u201D; \u201Cfix(R10/01a098cd-19c0): the listing arm claimed type bodies and prescribed a move they cannot take\u201D; \u201Cfix(R10): a specialisation delegating to its base was told to extract the shared core it already has\u201D; \u201Cfix(R10): a declaration run the WINDOW grain never saw was published unkeyed -- and the composition the plan expected does not exist\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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/CodeShape/DuplicationFinding.cs\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":"engine/src/CodeHealth.Core/CodeShape/DuplicationFinding.cs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3fc4443f2f17c8328fe7689faca92b986fe8d70f70624f4937b610c504ce2cd"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: engine/sidecars/tsjs-frontend/main.mjs: engine/sidecars/tsjs-frontend/main.mjs changed 23 times in last 90 days and 12 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 main at line 20), 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(01a08855-1404): the TS/JS sidecar emitted \u0027calls: []\u0027 as a LITERAL on every body record, so no TypeScript or JavaScript file could ever contribute a call site and D27 was structurally blind to both languages\u201D; \u201Cfix(01a08fbe-3fe8): the TS/JS frontend stamped every type with the MODULE name, so every namespace-derived quantity was a constant on every TypeScript repository\u201D; \u201Cfix(01a08855-1404): correct an overclaim in the park evidence \u2014 the namespace collapse is SHIELDED by this item, not live today\u201D; \u201Cguard(01a08855-1404): D27\u0027s TS/JS blindness cannot be fixed by populating \u0060calls\u0060 \u2014 the same sidecar collapses every type into ONE namespace, so the fix would publish a confident wrong number\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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/sidecars/tsjs-frontend/main.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/tsjs-frontend/main.mjs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b1b2ea5be1c80fb3f935282a0cc07e78fb64cd82949915235b218025ddd8878"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: engine/src/CodeHealth.Core/Orchestration/DimensionOrchestrator.cs: engine/src/CodeHealth.Core/Orchestration/DimensionOrchestrator.cs changed 18 times in last 90 days and 11 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is DimensionOrchestrator.UnclampedTimeoutFor at line 523), 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(D31,D32/01a09cb7-a534): derived tool budgets carved strictly inside the dimension, and a gdpr semgrep per-file limit that can fire\u201D; \u201Cfix(D29/01a09c8d-e8ed): a derived SAST budget, and a semgrep per-file limit that can actually fire\u201D; \u201Cfix(llm-ledger 01a08c8c-4c55): attribute every model call to the dimension that made it\u201D; \u201Cfix(D4/orchestration): a dimension our clock cut off must never render as measured-clean\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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Orchestration/DimensionOrchestrator.cs\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":"engine/src/CodeHealth.Core/Orchestration/DimensionOrchestrator.cs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee112a9bd4b5de37a0bfca124c59962a74c5b1b2ac4cee593c4dbd45cd08a92c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: engine/src/CodeHealth.Reporting/Templates/ReportViewModel.cs: engine/src/CodeHealth.Reporting/Templates/ReportViewModel.cs changed 15 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 2 (its worst body is DimensionCard.WorstGradeKey.get at line 233), 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(report a11y): the contrast fix was solved against the page, and the band words live on a card\u201D; \u201Cfix(reporting/01a084c7-3bb6): a run that lost its own checkout told the customer their build was broken\u201D; \u201Cfix(report): a dimension card may not display better than Adequate while it holds a Critical finding\u201D; \u201Cfix(D32/Appendix C/C5): four report-integrity defects from one Umbraco report\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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Reporting/Templates/ReportViewModel.cs\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":"engine/src/CodeHealth.Reporting/Templates/ReportViewModel.cs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9101a6ca3f14591241dd4a7629fc158a6cf8d08617898a39b6665d797b292bf"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/Kennel.Admin.Core/Admin/Ui/Reviews.razor: src/Kennel.Admin.Core/Admin/Ui/Reviews.razor changed 13 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 2, 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(a11y, invites): widen the gate to the screens it never audited, then fix the 56 violating nodes it had been hiding\u201D; \u201Cfix(a11y): controls with no name, pages with no title, tables with no headers\u201D; \u201Cfix(g2): the trim button would have destroyed 400 questions, and every item now names its language\u201D; \u201Cfix(g2): an audit is exactly the agreed number of questions, and the four at 120 can be cut back\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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- src/Kennel.Admin.Core/Admin/Ui/Reviews.razor\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Kennel.Admin.Core/Admin/Ui/Reviews.razor"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c170637d746cdf6138a88019240c67ad4385f4909e9e4d7e2a68bba8066775e1"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: engine/src/CodeHealth.Toolchain/Roslyn/MsBuildRoslynWorkspace.cs: engine/src/CodeHealth.Toolchain/Roslyn/MsBuildRoslynWorkspace.cs changed 10 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is MsBuildRoslynWorkspace.LoadCoreAsync at line 215), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(engine/01a08748-d7bf): a redundant NuGet package made a cleanly-loaded solution report BuildSucceeded=false\u201D; \u201Cfix(reporting): customer-facing narratives followed the analyzer host\u0027s locale\u201D; \u201Cfix(MODEL/D-450/01a058c1): FindSolution\u0027s maxDepth=3 left it strictly narrower than discovery\u0027s unbounded glob, so a repo whose solutions all sit at depth \u003E= 4 resolved NO target and every Roslyn dimension abstained\u201D; \u201Cfix(MODEL/D17/G-WEIXIN-ROSLYN-SOLUTION-PICKER): the solution search stopped at the shallowest depth holding ANY .sln, so a repo with one sln per sample scored the sample\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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Toolchain/Roslyn/MsBuildRoslynWorkspace.cs\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":"engine/src/CodeHealth.Toolchain/Roslyn/MsBuildRoslynWorkspace.cs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"496fc35e7a513e768c74743d59217109735d502760cd7c7b8f3b44003f878767"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: engine/src/CodeHealth.Core/Diagnostics/ScanBudgets.cs: engine/src/CodeHealth.Core/Diagnostics/ScanBudgets.cs changed 9 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 8 (its worst body is TestTierBudget.ForTiers at line 279), 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(D31,D32/01a09cb7-a534): derived tool budgets carved strictly inside the dimension, and a gdpr semgrep per-file limit that can fire\u201D; \u201Cfix(D29/01a09c8d-e8ed): a derived SAST budget, and a semgrep per-file limit that can actually fire\u201D; \u201Cfix(D4/orchestration): a dimension our clock cut off must never render as measured-clean\u201D; \u201Cfix(scans): tell the engine its own run budget, so an inner bound can never outlive the outer one\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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Diagnostics/ScanBudgets.cs\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":"engine/src/CodeHealth.Core/Diagnostics/ScanBudgets.cs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"25bd65c29d20e5f1b33f986d5eb9bca069e2fb9a049e873f95600b4b84c593da"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: engine/src/CodeHealth.Core/ModelAware/SwiftDomainConventions.cs: engine/src/CodeHealth.Core/ModelAware/SwiftDomainConventions.cs changed 9 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 14 (its worst body is SwiftDomainConventions.RawPrimitiveIds at line 950), 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(DM4/DM6): \u0022no domain types\u0022 and \u0022a clean domain\u0022 are not the same 10.0 \u2014 the four arms that graded no population now have one\u201D; \u201Cfix(ED3/swift): it reported correctly-named event cases as breaking the convention they follow\u201D; \u201Cfix(DM2/swift): the last of four dimensions still asking CoreData for an id type it cannot have\u201D; \u201Cfix(DM5/swift): the fields it told teams to make \u0060let\u0060 cannot be \u0060let\u0060\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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/ModelAware/SwiftDomainConventions.cs\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":"engine/src/CodeHealth.Core/ModelAware/SwiftDomainConventions.cs"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"e813f147b8b0b47a37c623229287d530fdd244199c65ca089810436ac5410428"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: engine/src/CodeHealth.Core/Testing/TestProjectDetection.cs: engine/src/CodeHealth.Core/Testing/TestProjectDetection.cs changed 11 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is TestProjectDetection.FindTestProjectsNotLoaded at line 241), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(engine/01a081bf-344e): LooksLikeTestProject reads the declared IsTestProject before guessing\u201D; \u201Cfix(X2/01a081c4): the size census answered \u0022is this a test?\u0022 without reading the declaration the analyzers read first\u201D; \u201Cfix(X2/X3/D19/IC1): compose the IsTestProject read with the fixture-corpus guard \u2014 an explicit \u0060false\u0060 must not admit a fixture corpus\u201D; \u201Cfix(X2/X3/D19/IC1): the AUTHORITATIVE IsTestProject was unreadable, so the test vocabulary was name-and-path convention\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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Testing/TestProjectDetection.cs\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":"engine/src/CodeHealth.Core/Testing/TestProjectDetection.cs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"77522323e4dfbe1413403ed071690645f8d80c22f323d7cf9412f22a3338d0f5"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: engine/src/CodeHealth.Core/Scoring/MetaDimension.cs: engine/src/CodeHealth.Core/Scoring/MetaDimension.cs changed 9 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 5 (its worst body is MetaDimension.NotMeasuredReason.get at line 43), 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(01a080ee-1ac9): the one publication question had two names, and only one of them was in the sidecar\u201D; \u201Cfix(AX10): a card that cannot emit a finding now SAYS so, and the census reads it\u201D; \u201Cfix(meta): a card that carries an \u0022our gap\u0022 is not filed as irrelevant to the customer\u0027s codebase\u201D; \u201Cfix(AC/D4): the a11y lens read 46 scaffold pages and called it the repository\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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Scoring/MetaDimension.cs\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":"engine/src/CodeHealth.Core/Scoring/MetaDimension.cs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"f460f506eee118f40ab5c639caa9829c3f8663c856d82afdd3a2630992aa26da"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: engine/src/CodeHealth.Dimensions.Docs/AdrQualityAnalyzer.cs: engine/src/CodeHealth.Dimensions.Docs/AdrQualityAnalyzer.cs changed 8 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is AdrQualityAnalyzer.RunAsync at line 26), 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(D7,D10,D15,D23,D34/01a096bd-6276): sixteen dimensions published \u0022does not apply here\u0022 as a low-confidence measurement\u201D; \u201Cfix(D20/01a07fdf-dcd8): the repo-kind classifier read .NET project files only, so every non-.NET repository was Unknown and D20 abstained on all of them\u201D; \u201Cfix(docs-d20/01a09287): the \u0022No ADRs found\u0022 row stated the configured tier\u0027s bounds as the walk\u0027s, and said no ADR directory existed over one the owner could see\u201D; \u201Cfix(D20): the repo-kind classifier reads .NET project files only and its no-evidence fallthrough was \u0022Library\u0022, so every non-.NET repository was told it is a consumed library\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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Dimensions.Docs/AdrQualityAnalyzer.cs\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":"engine/src/CodeHealth.Dimensions.Docs/AdrQualityAnalyzer.cs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"096d04232247ec9f5b789729e53b00266733a5031cd5b3ae46ee6c7dd368c265"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: engine/src/CodeHealth.Core/ModelAware/AltTextQualityAnalyzer.cs: engine/src/CodeHealth.Core/ModelAware/AltTextQualityAnalyzer.cs changed 8 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is AltTextQualityAnalyzer.AnalyzeAsync at line 25), 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(01a0811a-868b): an abstain gate must ask WHY the population is empty\u201D; \u201Cfix(01a089a0-97fd): a transient LLM abstention minted a permanent \u0027cannot be measured\u0027 backlog item off one repository, because OurGap merges two senses with opposite remedies\u201D; \u201Cfix(01a08137-f2ac): an LLM abstention was typed by WHOSE it was, so an operator opt-out and a dead host both reported as a permanent gap in our analyzer\u201D; \u201Cfix(modelaware): a11y advisory rows named the file by basename, so two products\u0027 rows read alike\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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/ModelAware/AltTextQualityAnalyzer.cs\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":"engine/src/CodeHealth.Core/ModelAware/AltTextQualityAnalyzer.cs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"596756f6ee2dc972c271fa1c4ac57ee23a7ec419ff92bbe7f3e608750e850dd6"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: engine/src/CodeHealth.Core/Dimensions/DimensionResult.cs: engine/src/CodeHealth.Core/Dimensions/DimensionResult.cs 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 11 (its worst body is DimensionResult.SynthesizedOurGap at line 128), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(engine): an our-gap result files itself with no reason, so 3,164 rows named nothing\u201D; \u201Cfix(D29/01a09684-39ee): a dimension with no population to measure was published as low confidence\u201D; \u201Cfix(01a077fc-22eb): a dimension that never ran said so three ways and the coverage channel heard none of them\u201D; \u201Cfix(01a080ee-1ac9): the one publication question had two names, and only one of them was in the sidecar\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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Dimensions/DimensionResult.cs\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":"engine/src/CodeHealth.Core/Dimensions/DimensionResult.cs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fa65e8ae66df7953976473d72fdb9ceddef6e416a93b371303edda75c39ee08"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: engine/src/CodeHealth.Dimensions.CodeQuality/IlEfficiencyAnalyzer.cs: engine/src/CodeHealth.Dimensions.CodeQuality/IlEfficiencyAnalyzer.cs 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 14 (its worst body is IlEfficiencyAnalyzer.RunAsync at line 35), 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(D39): an environment build failure filed itself as a capability we never built\u201D; \u201Cfix(D7,D10,D15,D23,D34/01a096bd-6276): sixteen dimensions published \u0022does not apply here\u0022 as a low-confidence measurement\u201D; \u201Cfix(D8/D11/D39): the concurrency gate keyed on the LIMIT, so two dotnet builds ran at once\u201D; \u201Cfix(engine): a killed tool is a NAMED gap, and every tool budget is derived from the one that contains it\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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Dimensions.CodeQuality/IlEfficiencyAnalyzer.cs\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":"engine/src/CodeHealth.Dimensions.CodeQuality/IlEfficiencyAnalyzer.cs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd5a517ada46a9901f3d050492c2a82a389ea82ba76584f6f8439c29a58db80d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/Kennel.Admin.Core/Admin/Ui/CycleLifecycle.razor: src/Kennel.Admin.Core/Admin/Ui/CycleLifecycle.razor changed 8 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 3, 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(console): the cycles banner repeated the provenance the cards hide; gate hints beside their buttons; one (i) per heading\u201D; \u201Cfix(console): \u0022Is the number any good?\u0022 showed ONE language\u0027s ABN as the cycle\u0027s\u201D; \u201Cfix(console): a rule lifted out of its @media block became always-on\u201D; \u201Cfix(console): 33 classes across the new pages had no rule anywhere\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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- src/Kennel.Admin.Core/Admin/Ui/CycleLifecycle.razor\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Kennel.Admin.Core/Admin/Ui/CycleLifecycle.razor"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"13db85f54b768f9fdfec7c635aaecc99a350ab9e9cb3245860db9ca59d8d7bf4"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: engine/src/CodeHealth.Core/Statistics/BuildStatistics.cs: engine/src/CodeHealth.Core/Statistics/BuildStatistics.cs changed 8 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is BuildStatistics.BlockedByEnvironment.get at line 268), 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(D18/01a084e5-12d3): a build input WE lost counted as the customer\u0027s compile failure\u201D; \u201Cfix(D18): stop capping a repo for compile errors an unloadable project manufactured\u201D; \u201Cfix(D18): a build we could not run told the owner their build failed\u201D; \u201Cfix(D18): a VB.NET or F# repo that does not compile was told the failure was ours\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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Statistics/BuildStatistics.cs\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":"engine/src/CodeHealth.Core/Statistics/BuildStatistics.cs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ae79b1b46f309d77bd4ec1d9d558003c85258aebaf3d1d87ae6645979677d54"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: engine/src/CodeHealth.Toolchain/Isolation/IsolatedWorkspace.cs: engine/src/CodeHealth.Toolchain/Isolation/IsolatedWorkspace.cs 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 10 (its worst body is IsolatedWorkspace.DeclaredSubmodulePaths at line 226), 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(platform/01a09e22-7957): refuse an EMPTY isolated checkout at the isolation boundary (engine exit 9) instead of analysing nothing and signing it\u201D; \u201Cfix(scan-pipeline/01a080d1): the engine\u0027s isolated checkout was hard-wired to the shared temp filesystem, so one scan could take the whole box down and nothing measured the filesystem it filled\u201D; \u201Cfix(engine 01a08ed4-978b): the directories ABOVE the scan root are not the repository\u201D; \u201Cfix(engine): isolate by reading the checkout, not by writing into it\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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Toolchain/Isolation/IsolatedWorkspace.cs\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":"engine/src/CodeHealth.Toolchain/Isolation/IsolatedWorkspace.cs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"13d6f514a4e5dbc63c5fa24961b209b5208d9810279179e6fe7042f36871e20b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: tools/localdev/ui/a11y-gate.mjs: tools/localdev/ui/a11y-gate.mjs changed 6 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 12 (its worst body is main at line 146), 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(a11y-gate): it was auditing the dark theme twice and reporting two\u201D; \u201Cfix(a11y, invites): widen the gate to the screens it never audited, then fix the 56 violating nodes it had been hiding\u201D; \u201CR2: break up the three main() functions the R4 fix created\u201D; \u201Cwatchdog audit: 39 findings fixed across 8 dimensions\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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- tools/localdev/ui/a11y-gate.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/localdev/ui/a11y-gate.mjs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8a336958c96e41828bae5239cdd47c700b66f0669409b99d8e328ba3f66b1ea"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/Kennel.Admin.Core/Admin/Ui/LanguageTrainingLanguages.razor: src/Kennel.Admin.Core/Admin/Ui/LanguageTrainingLanguages.razor changed 7 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 5, 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(console): the Languages page rendered a literal \u0022}\u0022 - and nothing objected\u201D; \u201Cfix(console): 33 classes across the new pages had no rule anywhere\u201D; \u201Cfix(console): the split is green - and the last red tests found four more losses\u201D; \u201Cfix(console): restore what the split dropped - alerts, holdout, and three regressions\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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- src/Kennel.Admin.Core/Admin/Ui/LanguageTrainingLanguages.razor\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Kennel.Admin.Core/Admin/Ui/LanguageTrainingLanguages.razor"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"621629e9f9bb697533d4912fb62bbfc26c1dd5e25c3a02658d9f12d43b4fecfb"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: engine/src/CodeHealth.Dimensions.Security/DataComplianceAnalyzer.cs: engine/src/CodeHealth.Dimensions.Security/DataComplianceAnalyzer.cs 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 5 (its worst body is DataComplianceAnalyzer.ResultFor at line 85), 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(D31,D32/01a09cb7-a534): derived tool budgets carved strictly inside the dimension, and a gdpr semgrep per-file limit that can fire\u201D; \u201Cfix(d32): a file semgrep could not parse no longer ships inside a clean PII sweep\u201D; \u201Cfix(D32/Appendix C/C5): four report-integrity defects from one Umbraco report\u201D; \u201Cfix(engine): restore D32 (PII/GDPR), and stop a missing capability reading as an absent subject\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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Dimensions.Security/DataComplianceAnalyzer.cs\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":"engine/src/CodeHealth.Dimensions.Security/DataComplianceAnalyzer.cs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3ae4f590bf182bd56f7feedc34361e0494d73893ff6d1aa69cb4ff60fafbb2b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: engine/src/CodeHealth.Dimensions.Docs/CommentValueAnalyzer.cs: engine/src/CodeHealth.Dimensions.Docs/CommentValueAnalyzer.cs 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 12 (its worst body is CommentValueAnalyzer.RunAsync at line 26), 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(D7,D10,D15,D23,D34/01a096bd-6276): sixteen dimensions published \u0022does not apply here\u0022 as a low-confidence measurement\u201D; \u201Cfix(D24/01a0772b-7ead): a comment verdict shipped without anything checking it against its own site\u201D; \u201Cfix(llm): the \u0022outage\u0022 was two dimensions not saying they call a model\u201D; \u201Cfix(D24): a one-word comment swallowed by a longer quote stole the row\u0027s location\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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Dimensions.Docs/CommentValueAnalyzer.cs\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":"engine/src/CodeHealth.Dimensions.Docs/CommentValueAnalyzer.cs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"354fb073b26457d8a76c739edc0f59f43ed450ca116cb602f4feea5a673926f1"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: engine/src/CodeHealth.Core/Adr/FileSystemAdrInventoryBuilder.cs: engine/src/CodeHealth.Core/Adr/FileSystemAdrInventoryBuilder.cs 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 11 (its worst body is FileSystemAdrInventoryBuilder.BuildAsync at line 17), 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(D20/01a0798f-0d4f): a bold-emphasised word was read as a declared enforcement field\u201D; \u201Cfix(D7/01a07d11-606b): a declared enforcement value we could not map read as no field at all\u201D; \u201Cfix(docs-d20/01a09287): the \u0022No ADRs found\u0022 row stated the configured tier\u0027s bounds as the walk\u0027s, and said no ADR directory existed over one the owner could see\u201D; \u201Cfix(engine 01a08db6-0ced): the D25 ADR conformance prompt is content-addressed again, not keyed on the scratch checkout\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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Adr/FileSystemAdrInventoryBuilder.cs\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":"engine/src/CodeHealth.Core/Adr/FileSystemAdrInventoryBuilder.cs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5a7e6d61517ec79325a68e98494857b73e69114678acbc481262021cf99731f"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: engine/sidecars/tsjs-frontend/extract-file.mjs: engine/sidecars/tsjs-frontend/extract-file.mjs 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 11 (its worst body is typeRefOfNode at line 130), 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(01a09005-4d4b): every TS/JS constructor reached the neutral model as MethodKind.Ordinary, because the frontend emitted a CAPITALISED methodKind that the provider\u0027s parser matched case-sensitively and dropped to its default\u201D; \u201Cfix(01a08fe6-2352): the TS/JS sidecar emitted NO member type at all, so D27\u0027s collaborator sample was empty on every TypeScript repository and locality was the \u0022measured nothing\u0022 literal\u201D; \u201Cfix(01a08fbe-3fe8): the TS/JS frontend stamped every type with the MODULE name, so every namespace-derived quantity was a constant on every TypeScript repository\u201D; \u201Cwatchdog audit: 39 findings fixed across 8 dimensions\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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/sidecars/tsjs-frontend/extract-file.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/tsjs-frontend/extract-file.mjs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"e384a6581b057c75fb4cc02eaec848c185573be8f8554df301bb43ad4ed573b7"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: engine/src/CodeHealth.Core/Scoring/LanguageCensus.cs: engine/src/CodeHealth.Core/Scoring/LanguageCensus.cs changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is LanguageCensus.TakeAsync at line 60), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(engine/01a0a3e3-b1e1): \u0060.ts\u0060 is also the HLS video segment, so 21 committed MPEG-2 streams counted as 411,343 lines of production TypeScript and degraded a Swift repository\u201D; \u201Cfix(platform/01a0a098-6082): the honesty denominators and the language census now count the languages the engine cannot read\u201D; \u201Cfix(census): a bundle somebody else\u0027s compiler emitted is not this repo\u0027s authored source\u201D; \u201Cfix(D34/01a05750): a gem\u0027s declared entry point had no extension, so five separate gates each hid it and its 130 lines were counted nowhere\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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Scoring/LanguageCensus.cs\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":"engine/src/CodeHealth.Core/Scoring/LanguageCensus.cs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eed3ebb0bcd61e56982f167bb19045fa71f20d015c44cafd3e11e1c12d958ef"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: engine/src/CodeHealth.Core/Discovery/FrontendSourcePresence.cs: engine/src/CodeHealth.Core/Discovery/FrontendSourcePresence.cs changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is FrontendSourcePresence.Any at line 59), 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(D12/01a0a151-6e07): a Unity repo\u0027s UPM dependencies were invisible to the probe that decides what a tree declares, so 22 committed declarations went unread and its author was told to add a .csproj\u201D; \u201Cfix(D3): a \u0060.d.cts\u0060 twin was scored as production while its identical \u0060.d.ts\u0060 was skipped\u201D; \u201Cfix(D12/B-CAP-D12-NPM-BLIND): a NuGet-only measurement published as the product\u0027s dependency verdict\u201D; \u201Cfix(D12): find the npm manifest a polyglot monorepo keeps below its root\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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Discovery/FrontendSourcePresence.cs\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":"engine/src/CodeHealth.Core/Discovery/FrontendSourcePresence.cs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"a37dd733f3ccd16eeec00a223d9dbbf68bdae76f71c1e47c29dc13848be7150d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/Kennel.Admin.Core/Admin/Ui/VerificationRunbook.razor: src/Kennel.Admin.Core/Admin/Ui/VerificationRunbook.razor changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10, 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(admin): the third left menu, the duplicate button, and the half-width card\u201D; \u201Cfix(a11y): controls with no name, pages with no title, tables with no headers\u201D; \u201Cfix(train): the stop switch and the runbook were still local \u2014 the same bug, twice more\u201D; \u201Cadmin(reviews): per-language verification dashboard (noise%/absolute-depth history \u002B G2 \u03BA), cadence\u002Brunbook Start/Deepen/Add-language, assign; fix reseed-orphan Reviews-badge \u002B go seed \u2014 Co-Authored-By: Claude Opus 4.8 \[e-mail redacted]\u003E\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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- src/Kennel.Admin.Core/Admin/Ui/VerificationRunbook.razor\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Kennel.Admin.Core/Admin/Ui/VerificationRunbook.razor"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2b490977c30743fd361fbb3a86651c7e8c0e4002d8d9b3ec87aa95b670a016b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: engine/src/CodeHealth.Cli/Diagnostics/PartialLoadDiagnosticsReport.cs: engine/src/CodeHealth.Cli/Diagnostics/PartialLoadDiagnosticsReport.cs changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is PartialLoadDiagnosticsReport.Render at line 118), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(engine/01a08748-d7bf): a redundant NuGet package made a cleanly-loaded solution report BuildSucceeded=false\u201D; \u201Cfix(engine/01a08180-d644): the partial-load headline counted projects OPENED, and the run\u0027s own restore verdict sat unread beside it\u201D; \u201Cfix(engine/01a081d5-6746): the partial-load headline added a TFM-expanded project count to a file count\u201D; \u201Cfix(engine): price the whole product, keep one identity, stop inventing a cause\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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Cli/Diagnostics/PartialLoadDiagnosticsReport.cs\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":"engine/src/CodeHealth.Cli/Diagnostics/PartialLoadDiagnosticsReport.cs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"faf977f0855985014d7bf31f1b683147cacfcf34946336fd52c05670fcbe31d5"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: engine/src/CodeHealth.Llm.OpenAiCompatible/Http/OpenAiCompatibleHttpClient.cs: engine/src/CodeHealth.Llm.OpenAiCompatible/Http/OpenAiCompatibleHttpClient.cs changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is OpenAiCompatibleHttpClient.PostChatCompletionAsync at line 40), 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(reporting): customer-facing narratives followed the analyzer host\u0027s locale\u201D; \u201Cfix(llm): the \u0022outage\u0022 was two dimensions not saying they call a model\u201D; \u201Cfix(llm): an empty answer is a failed evaluation, and the ledger has to say so\u201D; \u201Cfix(llm): stop paying for a reasoning model\u0027s thinking pass\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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Llm.OpenAiCompatible/Http/OpenAiCompatibleHttpClient.cs\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":"engine/src/CodeHealth.Llm.OpenAiCompatible/Http/OpenAiCompatibleHttpClient.cs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"eefc45cfff76503db2aacb19ead73d4c31ddf3916975974e6f9ee3c4d413c03d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: engine/src/CodeHealth.Core/ModelAware/UnreadFrontendGate.cs: engine/src/CodeHealth.Core/ModelAware/UnreadFrontendGate.cs changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 5 (its worst body is UnreadFrontendGate.Detect at line 66), 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(a11y/01a08b60-f5e3): a frontend built as HTML strings was read by none of the four paths, and declared no gap\u201D; \u201Cfix(01a08b12-5fb5): the a11y family must read markup that carries no angle brackets\u201D; \u201Cfix(01a08afc-e380): the a11y family must not assert an absence over a template language it never read\u201D; \u201Cfix(01a0811a-868b): an abstain gate must ask WHY the population is empty\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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/ModelAware/UnreadFrontendGate.cs\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":"engine/src/CodeHealth.Core/ModelAware/UnreadFrontendGate.cs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee5172c4648e045b365bd241fdeed045d6d0ee03b1a9345940e00c95b34c617a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: engine/src/CodeHealth.Cli/CliExceptionHandler.cs: engine/src/CodeHealth.Cli/CliExceptionHandler.cs changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 5 (its worst body is CliExceptionHandler.Handle at line 35), 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(platform/01a09e22-7957): refuse an EMPTY isolated checkout at the isolation boundary (engine exit 9) instead of analysing nothing and signing it\u201D; \u201Cfix(scan-pipeline/01a09238): the isolated checkout had no per-scan ceiling, so a large build could exhaust the analyzer volume for every other scan, and inside the container it hit ENOSPC and read as \u0022this repository does not build\u0022\u201D; \u201Cfix(cli): a run stopped by its own --timeout budget exits the documented 7, not 255\u201D; \u201Cfix(cli): an analyzer crash exits the documented 3, not an undocumented 255\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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Cli/CliExceptionHandler.cs\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":"engine/src/CodeHealth.Cli/CliExceptionHandler.cs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4051594251027b1ba092172119db85b07d59728f1e4c63f49d8a4b592863b7a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: engine/sidecars/tsjs-frontend/ts-helpers.mjs: engine/sidecars/tsjs-frontend/ts-helpers.mjs 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 13 (its worst body is stripStringsAndComments at line 106), 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(tsjs sidecar): the deep model\u0027s production set disagreed with the C# feed on 514 files, and the module that DEFINES the bundler markers was one of them\u201D; \u201Cfix(01a08855-1404): the TS/JS sidecar emitted \u0027calls: []\u0027 as a LITERAL on every body record, so no TypeScript or JavaScript file could ever contribute a call site and D27 was structurally blind to both languages\u201D; \u201Cfix(engine): five defects the Umbraco survey published, found by challenging our own 45\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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/sidecars/tsjs-frontend/ts-helpers.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/tsjs-frontend/ts-helpers.mjs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b9bc9a9e9edb799df0eb549288fb88d099bfa79d5a56e809275dc6f5cd4921a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: engine/src/CodeHealth.Reporting/Fingerprints/FingerprintsJsonRenderer.cs: engine/src/CodeHealth.Reporting/Fingerprints/FingerprintsJsonRenderer.cs 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 5 (its worst body is FingerprintsJsonRenderer.Render at line 33), 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(fingerprints/01a0998a-be23): a row can re-key twice, so the legacy channel is a list\u201D; \u201Cfix(report): fingerprints.json kept its OWN copy of MetaSurfaces \u2014 the drift that predicate exists to prevent had come back\u201D; \u201Cfix(fingerprints/B-XLANG-REKEY-SHAPE-B-RULINGS): resolve a pre-change ruling from one scan\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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Reporting/Fingerprints/FingerprintsJsonRenderer.cs\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":"engine/src/CodeHealth.Reporting/Fingerprints/FingerprintsJsonRenderer.cs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"268f2499fce8b1784351cac7168797eee981c295b7ba5dd61b473d45bd3f6319"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: engine/src/CodeHealth.Core/Dimensions/FindingPathNormalizer.cs: engine/src/CodeHealth.Core/Dimensions/FindingPathNormalizer.cs 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 FindingPathNormalizer.Leaks at line 219), 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(D11/01a09643-5e1e): a gap quoted the tool\u0027s own error, and the tool named the scratch checkout\u201D; \u201Cfix(engine 01a08eb1-ec8c): the report linter judges the artifact that ships\u201D; \u201Cfix(RT-05): the scratch-leak gate knew ONE spelling of its own token, so an identifier-normalised leak scored 0 and the hard-scrub never ran\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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Dimensions/FindingPathNormalizer.cs\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":"engine/src/CodeHealth.Core/Dimensions/FindingPathNormalizer.cs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"7192767da3b700e7ad84a2a5e1e3bae6ec929f2569ac92276996ca2ce0b75145"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: engine/src/CodeHealth.Core/ModelAware/EnvironmentSeparationAnalyzer.cs: engine/src/CodeHealth.Core/ModelAware/EnvironmentSeparationAnalyzer.cs 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 13 (its worst body is EnvironmentSeparationAnalyzer.FindEnvConfigs at line 269), 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(LA4/01a07fe0-a5cb): per-environment configuration is recognised by SHAPE, not by fifteen .NET/node filenames\u201D; \u201Cfix(01a0810a-4ceb): LA4 reported a failed filesystem probe as \u0022this control is not relevant to your repository\u0022\u201D; \u201Cfix(01a0811a-868b): an abstain gate must ask WHY the population is empty\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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/ModelAware/EnvironmentSeparationAnalyzer.cs\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":"engine/src/CodeHealth.Core/ModelAware/EnvironmentSeparationAnalyzer.cs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"b64fae2f99fffcca64dd78a06e2fe107d42b004c15a09ee208acccdfbc6b658c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: engine/sidecars/ruby-frontend/members.mjs: engine/sidecars/ruby-frontend/members.mjs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is methodMember at line 15), 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(01a09039-e0a1): a bare receiverless \u0027new\u0027 in a Ruby INSTANCE method was stated to be an object creation, so a real call was dropped from D27\u0027s scored population\u201D; \u201Cfix(D3/01a06dcd-af89): Ruby\u0027s \u0060class \u003C\u003C self\u0060 body never reached the model at all\u201D; \u201Cwatchdog audit: 39 findings fixed across 8 dimensions\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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/sidecars/ruby-frontend/members.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/ruby-frontend/members.mjs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"03c2eb843bd3af391ce6838387569531d8baf399d44c1654c9cd92719072e2b7"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: engine/src/CodeHealth.Reporting/Linting/ReportLinter.cs: engine/src/CodeHealth.Reporting/Linting/ReportLinter.cs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is ReportLinter.CheckCountsSum at line 296), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(engine 01a08eb1-ec8c): the report linter judges the artifact that ships\u201D; \u201Cfix(report): ONE finding population per report \u2014 the trust banner counted a set the appendix withholds\u201D; \u201Cfix(RT-05): the scratch-leak gate knew ONE spelling of its own token, so an identifier-normalised leak scored 0 and the hard-scrub never ran\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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Reporting/Linting/ReportLinter.cs\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":"engine/src/CodeHealth.Reporting/Linting/ReportLinter.cs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"af3ac905bab99444a1e5c5b744f8e61ad79b73578f644847f8f5d4b7fb092006"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: engine/src/CodeHealth.Toolchain/MsBuild/AnalyzerBuildProperties.cs: engine/src/CodeHealth.Toolchain/MsBuild/AnalyzerBuildProperties.cs 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 5 (its worst body is AnalyzerBuildProperties.NetFrameworkReferenceAssemblyRoot.get at line 122), 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(D18/vbnet): neutralise the non-compiler build steps that hid a working compile\u201D; \u201Cfix(D18/vbnet): lend System.Resources.Extensions to resgen so a BinaryFormatter resx stops blocking the build\u201D; \u201Cfix(D18): .NET Framework repos were never compiled, and the miss read as a clean 10\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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Toolchain/MsBuild/AnalyzerBuildProperties.cs\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":"engine/src/CodeHealth.Toolchain/MsBuild/AnalyzerBuildProperties.cs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"db73e41b5e56ec270317d4e66c63557a738e05332fc255941242b4877f8d3d6e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: engine/src/CodeHealth.Cli/Composition/LlmProviderRegistration.cs: engine/src/CodeHealth.Cli/Composition/LlmProviderRegistration.cs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is LlmProviderRegistration.RegisterAll at line 27), 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(dgx1\u002Bjudge): the model host crashes on the BOX, so make a scan survive it\u201D; \u201Cfix(llm): a route that says nothing about thinking must not inherit the SERVER\u0027s answer\u201D; \u201Cfix(llm): stop paying for a reasoning model\u0027s thinking pass\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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Cli/Composition/LlmProviderRegistration.cs\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":"engine/src/CodeHealth.Cli/Composition/LlmProviderRegistration.cs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ca4b57789511512712d6da4766e2e82fafdd648e7636593b68ae87035b404e9"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/Kennel.Watchdog.Core/PublicGallery/Embed/PublicSurveyCard.razor: src/Kennel.Watchdog.Core/PublicGallery/Embed/PublicSurveyCard.razor 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, 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(public card): the embedded survey card claimed \u0022bus factor 1\u0022 about a single-maintainer repo \u2014 chip removed\u201D; \u201Cfix(gallery): an aliased card must not link the identity its alias hides\u201D; \u201Cfix(gallery): the public survey card was a dead end\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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- src/Kennel.Watchdog.Core/PublicGallery/Embed/PublicSurveyCard.razor\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Kennel.Watchdog.Core/PublicGallery/Embed/PublicSurveyCard.razor"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6e15097a3193ce67aa97ae9d72d5434d228cb1352c15abfac0482bfa7905a79"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/Kennel.Core/Repositories/Ui/DimensionTrendGrid.razor: src/Kennel.Core/Repositories/Ui/DimensionTrendGrid.razor 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 2, UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(ui): ONE (i) everywhere \u2014 the lens cards used a second, invented disclosure\u201D; \u201Cfix(ui): a lens this repo does not have should not be on its trends page at all\u201D; \u201Cfix(ui): a lens the newest scan didn\u0027t measure showed its frozen last value as a live score\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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- src/Kennel.Core/Repositories/Ui/DimensionTrendGrid.razor\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Kennel.Core/Repositories/Ui/DimensionTrendGrid.razor"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a0253fb094eac1b5d24fe52a4cae5c22b3e73ff54cb931d0215b7425f519503"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: engine/src/CodeHealth.Dimensions.Security/JsDependencyVulnerabilityArm.cs: engine/src/CodeHealth.Dimensions.Security/JsDependencyVulnerabilityArm.cs 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 9 (its worst body is JsDependencyVulnerabilityArm.CollectAsync at line 36), 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(D30/01a09e05-9a7d): trivy vulnerability rows classify their directness like the osv arm\u201D; \u201Cfix(D30/01a07d11-96b3-72fc-89dd-8d782c7a15e8): a nested npm manifest declaring another repository as its origin is a dead vendored manifest, not this product\u0027s supply chain (terragoat\u0027s verbatim angular/angular package.json, 218 rows)\u201D; \u201Cfix(D23,DM9): kill two hardcoded-vocabulary gates \u2014 and DM9 was measuring NOTHING, C# included\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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Dimensions.Security/JsDependencyVulnerabilityArm.cs\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":"engine/src/CodeHealth.Dimensions.Security/JsDependencyVulnerabilityArm.cs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef2ea10d18ef42bb604d6633e09fbcdf2b315a16e2282a24a323b1b4258a6c29"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/Kennel.Core/Repositories/Ui/RepoScanMenu.razor: src/Kennel.Core/Repositories/Ui/RepoScanMenu.razor changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7, UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(ui): pop-outs pick the side that keeps them on screen, and the scan menu looks like a menu\u201D; \u201Cfix(scans): the scan control shared the page\u0027s DbContext and 500\u0027d it \u2014 give it its own scope\u201D; \u201Cfix(scans): the shared scan control can no longer 500 a page, and Settings no longer renders it twice\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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- src/Kennel.Core/Repositories/Ui/RepoScanMenu.razor\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Kennel.Core/Repositories/Ui/RepoScanMenu.razor"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"62dd390a8f518fbdcff30c8e28be32217c49379fb53f24f578818485d7db0bca"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: engine/src/CodeHealth.Core/Scoring/BuildLoadOutcome.cs: engine/src/CodeHealth.Core/Scoring/BuildLoadOutcome.cs 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 BuildLoadOutcome.Failed at line 103), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(engine 01a08d3e-9569): a repo whose only .NET project is a TEST project has no production build to fail\u201D; \u201Cfix(engine 01a08d2e-202a): a repo with no .NET projects has no build to fail, so stop degrading it\u201D; \u201Cfix(cli/01a08285-662b): a missing checkout was published to the customer as \u0022no .NET projects in the tree\u0022\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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Core/Scoring/BuildLoadOutcome.cs\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":"engine/src/CodeHealth.Core/Scoring/BuildLoadOutcome.cs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"c57985392c59879a77719c2004743e8b86a240e877c07b5ca8e83e96ec6c8ab3"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: engine/src/CodeHealth.Dimensions.Security/Scanners/SemgrepSqlIdentifierAdvice.cs: engine/src/CodeHealth.Dimensions.Security/Scanners/SemgrepSqlIdentifierAdvice.cs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is SemgrepSqlIdentifierAdvice.Specialise at line 83), 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(D29/csharp-sqli): an identity forward into a wrapped instance is a delegation, not a construction\u201D; \u201Cfix(D29/01a01018-e8a4-7bb8-a67c-0dc96b6917a4): IdentifierSlot reaches quoted interpolations and ORDER BY/GROUP BY sort columns\u201D; \u201Cfix(D29): a statement can interpolate a name AND a value\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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Dimensions.Security/Scanners/SemgrepSqlIdentifierAdvice.cs\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":"engine/src/CodeHealth.Dimensions.Security/Scanners/SemgrepSqlIdentifierAdvice.cs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"aba7f81cd6fefa9ec3f027739ca6eb4195754e4e0584193853838c57ed52b240"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: engine/src/CodeHealth.Llm.OpenAiCompatible/OpenAiCompatibleOptions.cs: engine/src/CodeHealth.Llm.OpenAiCompatible/OpenAiCompatibleOptions.cs 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 1 (its worst body is OpenAiCompatibleOptions.ConfiguredTimeout at line 31), 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(llm): the \u0022outage\u0022 was two dimensions not saying they call a model\u201D; \u201Cfix(llm): a route that says nothing about thinking must not inherit the SERVER\u0027s answer\u201D; \u201Cfix(llm): stop paying for a reasoning model\u0027s thinking pass\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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Llm.OpenAiCompatible/OpenAiCompatibleOptions.cs\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":"engine/src/CodeHealth.Llm.OpenAiCompatible/OpenAiCompatibleOptions.cs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f1993c8e4b5a52a63c99c06db5ed46d3e41eb5dfcee59855152e48347613c35"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: e2e/runtime-evidence-tier.mjs: e2e/runtime-evidence-tier.mjs changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is check at line 77), 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(e2e): the runtime-evidence probe resolves Playwright instead of hardcoding one machine\u0027s path\u201D; \u201Cfix(e2e): the runtime-evidence checker records its own verdict, so the JS typecheck gate is green\u201D; \u201Cfix(e2e): restore the runtime-evidence e2e \u2014 I deleted it on two false claims\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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- e2e/runtime-evidence-tier.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"e2e/runtime-evidence-tier.mjs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ea081dc927fa4ea447dbc4837608e5fb4d4465164c8324ae21aaec7d31a5b81"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: tools/localdev/e2e/repo-hub-hover.cjs: tools/localdev/e2e/repo-hub-hover.cjs changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is (anonymous) at line 36), 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(ci): typecheck-js red on main \u2014 offsetParent is on HTMLElement, not Element\u201D; \u201Cfix(localdev): the hover runner resolved the WRONG playwright from a worktree\u201D; \u201Cfix(hub): tooltips were being eaten by the card overlay; artifact cards say only their name\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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- tools/localdev/e2e/repo-hub-hover.cjs\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":"tools/localdev/e2e/repo-hub-hover.cjs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"96e0126a97a863524678accf92586023b1fe6f24a100a73d94c2594e1d3d74bf"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: engine/src/CodeHealth.Dimensions.Security/Scanners/PrivateKeyBlobHistoryScan.cs: engine/src/CodeHealth.Dimensions.Security/Scanners/PrivateKeyBlobHistoryScan.cs changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is PrivateKeyBlobHistoryScan.FindingsAsync at line 81), 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(X1/PF3): PrivateKeyBlobHistoryScan goes async end-to-end \u2014 6 blocking calls left, 3\u201D; \u201Cwatchdog audit: 39 findings fixed across 8 dimensions\u201D; \u201Cfix(D28): the key blob its own advice describes \u2014 committed, then deleted \u2014 was the one case it could not see\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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Dimensions.Security/Scanners/PrivateKeyBlobHistoryScan.cs\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":"engine/src/CodeHealth.Dimensions.Security/Scanners/PrivateKeyBlobHistoryScan.cs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cdd20d782383af72a1bf08d6040e8ddc6f8025c6cc01c3679316f8c67d390f4"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: engine/src/CodeHealth.Toolchain/Git/RenameAliases.cs: engine/src/CodeHealth.Toolchain/Git/RenameAliases.cs changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is RenameAliases.RecreatedRenameSources at line 154), 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(D15): a rename source that was RECREATED is a different file, not a former name\u201D; \u201Cfix(D34/D16): the lifetime stake was blind to every rename, so sweepers were crowned builders\u201D; \u201Cfix(D15/rust): a rename inside the window filed the commit under a name the file no longer carries\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-06-17..2026-09-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-17 14:31:48 \u002B02:00\u0027 --until=\u00272026-09-15 14:31:48 \u002B02:00\u0027 --full-history --no-merges -- engine/src/CodeHealth.Toolchain/Git/RenameAliases.cs\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":"engine/src/CodeHealth.Toolchain/Git/RenameAliases.cs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"b21c582cb7cb6d54f6f583641063fca9f73e570a9c76ac497eaab12cf0b80bdb"}},{"ruleId":"D17","level":"error","message":{"text":"NoWarnInCsproj \u2014 7 warning codes suppressed in one element: A single \u003CNoWarn\u003E suppresses 7 warning codes (CS1591;CA1305;CA1307;CS8600;CS8602;CS8604;CS8605) in one stroke \u2014 one team-wide decision, not 7 independent debts. Review the set centrally rather than code-by-code; each code you can re-enable is one less blanket suppression. (Every code still counts toward the score and metrics.)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/backlog-sessions/01a0711e-ee78-732a-9fcd-2b9927957dd6/harness/d35replay.csproj"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"415aa1c671de816f40e780d978374fc7a168cc7159d75af21014080099bc6299"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // and load-confidence degradation. TODO(security): wire those before enabling provisioning in production. \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":"engine/src/CodeHealth.Cli/Commands/AnalyzeCommand.cs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea3bdfe5d4d0aac143adaa426dd2efef786e786a5aa0260776deeb116328cec0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // the same way \u2014 the owner cannot move another project\u0027s TODO to their tracker, and editing the tree \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":"engine/src/CodeHealth.Core/ExplicitDebt/RoslynExplicitDebtCollector.cs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"45edbc9ddfa74dfb02b59aab5daa7f022744b04fa42729438db255a8973432ca"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // (B-WPFUI-D17-XAML-TODO). See MarkupTaskCommentScanner and RazorCodeBlockProjection. \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":"engine/src/CodeHealth.Core/ExplicitDebt/RoslynExplicitDebtCollector.cs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"00f9baaf676a54f5decce7aaa4950ff57b9a5f42f240a462cc583c991b0664ca"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(SelectYesAsync): \u0060separated == false\u0060 is NOT distinguishable from \u0022the model did not answer for this \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":"engine/src/CodeHealth.Core/ModelAware/EnvironmentSeparationAnalyzer.cs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb77c4b6c547416a7706ce8af01244328d96bdc9ec47361d7f8db8b26260cf62"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // recorded as a known defect at the LA4 call site (EnvironmentSeparationAnalyzer, TODO(SelectYesAsync)), \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":"engine/src/CodeHealth.Core/ModelAware/ModelAwareLlmJudge.cs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"302911cc7882fcf7171935040c8f58e7a39430f20cb1a8e9d88203fba8152c21"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(SelectYesAsync): \u0060real == false\u0060 is NOT distinguishable from \u0022the model did not answer for this item\u0022. \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":"engine/src/CodeHealth.Core/ModelAware/SecurityPolicyAnalyzer.cs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"890bfb5e5cc60d93287d5779b01258dcbb07775931f445a82933c61a6072cef5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // threshold compare, \u0060::error::\u0060, \u0060exit 1\u0060). Anchored enough that a plain \u0022TODO: \u2026\u0022 comment (stripped by the \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":"engine/src/CodeHealth.Core/Scoring/DimensionEnforcementKeywords.cs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"be5e010671eab26aa3edc3576c850f1922bfbe43cbdcec45173bfda506a77300"}},{"ruleId":"D17","level":"warning","message":{"text":"BarePragmaDisable: #pragma warning disable CHA0004 \u2014 the disable is closed again below, so its scope is not the problem; what it records is no reason: there is nothing on the directive line, and no ordinary comment attached to it either side. A suppression is a decision somebody made, and without the reason the next reader cannot tell a considered exception from an unexamined one, so it is never revisited and it outlives the code it was written for. Put the reason on the directive line \u2014 what makes this site legitimately different \u2014 or fix what the rule is pointing at and delete the pair. A rationale in the member\u0027s documentation comment does not clear this row and is not meant to: it explains the member to its callers, and the next person to touch the suppression is not reading it for that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Statistics/DotnetBuildStatistician.cs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cfaaa450a379e038fdaee931f1e3548d54b686ca722a2eddd3829bff1cc0a4d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // rows, every one a \u0060.cs\u0060 path \u2014 against a repository carrying 879 TODO occurrences in \u0060.ts\u0060 versus 640 in \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":"engine/src/CodeHealth.Dimensions.ExplicitDebt/ExplicitDebtAnalyzer.cs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4d3f7b51d6be48b80b99c93386e490cb877f1d16f139aa3f2adceefe159b1fb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // The same two exclusions the Roslyn path applies at \u0060deductible\u0060, for the same reasons: upstream\u0027s TODO is \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":"engine/src/CodeHealth.Dimensions.ExplicitDebt/ExplicitDebtAnalyzer.cs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"12545e6a95d7c7b5911fa1422296d3d6c3e586de880d9dd92cd138015196f503"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // the first few suppressions per file, then dampen logarithmically. Every other debt kind (TODO, commented-out \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":"engine/src/CodeHealth.Dimensions.ExplicitDebt/ExplicitDebtAnalyzer.cs"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"764d4ca18380cd5726e684a86ae0671c7ed8e810b789908b4730b1848469a334"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // \u2014 \u0022sbom\u0022 must be a whole path segment or a whole artifact-name value \u2014 so PROSE (\u0022# TODO: add an SBOM later\u0022, a \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":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"514e4a40c76fec9e6720414e1a00da2cde1581643e7815a6699fd5789bd01812"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // \u0022one TODO \u2192 6.x\u0022, never 0.0/Critical \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":"engine/src/CodeHealth.Reporting/FileQuality/FileQualityScorer.cs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c3185f68b2d104c7319e16614274d6d079b6c269cc88dea840eae98557f1c2e"}},{"ruleId":"D17","level":"error","message":{"text":"WriteOnlyPrivateField: private Task _loop \u2014 assigned 2 time(s), read never \u2014 this field is written and never read anywhere its type can be reached from, so the state it keeps answers no question: every assignment to it computes a value that nothing observes, on every instance, for the lifetime of each one. It reads as a flag the code branches on, and nothing branches on it. Delete the field and its assignments \u2014 or, if the value was MEANT to be consulted, the missing read is the defect this row is pointing at, and the branch that should have depended on it is not there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Toolchain/Isolation/ScratchCeiling.cs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"f391f3397383300526704a7ee8c1c4d5af5221bb8a273f5407c4a6602043aefa"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX is not the lead-in rule\u0027s to decide: it is also the redaction glyph, so IsLowercaseProseSlot answers the \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":"engine/tests/CodeHealth.Tests.Unit/ExplicitDebt/RoslynExplicitDebtCollectorTests.cs"},"region":{"startLine":2235}}}],"partialFingerprints":{"codehealthFindingId/v1":"d82f2c0beb3dd0ae76b4b88b84ef40ac91b1d1b15f558ad01862ca6256d6f394"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // GUARD \u2014 the gate is XXX-only: TODO/FIXME/HACK are not English words and never occupy a noun slot \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":"engine/tests/CodeHealth.Tests.Unit/ExplicitDebt/XxxProseSlotTests.cs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"9499890398fe00fc9c24f87e785f0ef15371fa7d45fab73117c0000272e53eaa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // earlier hand-rolled, host-wide gate). SECURITY-TODO: the WRITE side of registry tenancy \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Kennel.Assay.Core/DecisionReports/Ui/CodebaseDetail.razor"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4b1c364a64a01a0f32507ecce991eb325192d11db9946497543ddaf96dc1451"}},{"ruleId":"D17","level":"error","message":{"text":"NoWarnInCsproj: CS8618 \u2014 this warning is switched off for the WHOLE project, in every file it builds, including code written years from now: nothing at the call site records that the rule was ever silenced, so the next reader has no reason to look here. Fix what the rule is reporting and drop the code from the list, or \u2014 if some occurrences really are legitimate \u2014 narrow the suppression to those sites and give each one its reason, so the rule keeps protecting the rest of the project."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/backlog-sessions/01a080f8-419a-7d18-916b-4bd2bbf18927/probe-Probe.csproj"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"87e6d25b38fe52473a3f09eaebc5ca61259cae268d19fe3a91305f90929b48e3"}},{"ruleId":"D17","level":"error","message":{"text":"NoWarnInCsproj: CA1852 \u2014 this warning is switched off for the WHOLE project, in every file it builds, including code written years from now: nothing at the call site records that the rule was ever silenced, so the next reader has no reason to look here. Fix what the rule is reporting and drop the code from the list, or \u2014 if some occurrences really are legitimate \u2014 narrow the suppression to those sites and give each one its reason, so the rule keeps protecting the rest of the project."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/backlog-sessions/01a080f8-419a-7d18-916b-4bd2bbf18927/probe-Probe.csproj"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5127335cbc2e290682475036fbca33db21b3c97d61459dd76ffb5ab4fb9e55b"}},{"ruleId":"D17","level":"error","message":{"text":"NoWarnInCsproj: CS1591 \u2014 this warning is switched off for the WHOLE project, in every file it builds, including code written years from now: nothing at the call site records that the rule was ever silenced, so the next reader has no reason to look here. Fix what the rule is reporting and drop the code from the list, or \u2014 if some occurrences really are legitimate \u2014 narrow the suppression to those sites and give each one its reason, so the rule keeps protecting the rest of the project."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/backlog-sessions/01a09e22-7957-7dd1-8c61-e313dbdb17fb/harness/sizeprobe.csproj"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"883ebf4196ae91982769680265fe0d3e3d1614be1017cd3937835ad5d6a374b2"}},{"ruleId":"D17","level":"error","message":{"text":"NoWarnInCsproj: CS1591 \u2014 this warning is switched off for the WHOLE project, in every file it builds, including code written years from now: nothing at the call site records that the rule was ever silenced, so the next reader has no reason to look here. Fix what the rule is reporting and drop the code from the list, or \u2014 if some occurrences really are legitimate \u2014 narrow the suppression to those sites and give each one its reason, so the rule keeps protecting the rest of the project."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/backlog-sessions/01a09e20-5cea-736e-967d-bc957889e676/harness/r10replay.csproj"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"108e133997d91ee4d81a97242061e1fdb37e1c664167b6ce279cbb81d4f86bda"}},{"ruleId":"D17","level":"error","message":{"text":"NoWarnInCsproj: CS1591 \u2014 this warning is switched off for the WHOLE project, in every file it builds, including code written years from now: nothing at the call site records that the rule was ever silenced, so the next reader has no reason to look here. Fix what the rule is reporting and drop the code from the list, or \u2014 if some occurrences really are legitimate \u2014 narrow the suppression to those sites and give each one its reason, so the rule keeps protecting the rest of the project."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/backlog-sessions/01a080b5-9ab2-7452-9384-b5d68b1122d3/harness/dm12ab.csproj"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b6c9b86d664b09223048497569ac61d851392b3bca7f3cb87ff2b027f7361d8"}},{"ruleId":"D17","level":"error","message":{"text":"NoWarnInCsproj: CS1591 \u2014 this warning is switched off for the WHOLE project, in every file it builds, including code written years from now: nothing at the call site records that the rule was ever silenced, so the next reader has no reason to look here. Fix what the rule is reporting and drop the code from the list, or \u2014 if some occurrences really are legitimate \u2014 narrow the suppression to those sites and give each one its reason, so the rule keeps protecting the rest of the project."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/backlog-sessions/01a080aa-ee06-7fd0-9c46-8623acd96890/harness/dm6ab.csproj"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"affa63d6c4e092116a803f0b8d7d6dce5d8f730ddcbcd9133de30a78051f15d6"}},{"ruleId":"D17","level":"error","message":{"text":"NoWarnInCsproj: CS1591 \u2014 this warning is switched off for the WHOLE project, in every file it builds, including code written years from now: nothing at the call site records that the rule was ever silenced, so the next reader has no reason to look here. Fix what the rule is reporting and drop the code from the list, or \u2014 if some occurrences really are legitimate \u2014 narrow the suppression to those sites and give each one its reason, so the rule keeps protecting the rest of the project."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/backlog-sessions/01a08091-e938-76af-8e54-2628bae0fd2c/harness/dm6ab.csproj"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"be435a4679fcca29a0279cf7b1261994cce6eff53008c3d58bc481a607b46125"}},{"ruleId":"D17","level":"error","message":{"text":"NoWarnInCsproj: CS1591 \u2014 this warning is switched off for the WHOLE project, in every file it builds, including code written years from now: nothing at the call site records that the rule was ever silenced, so the next reader has no reason to look here. Fix what the rule is reporting and drop the code from the list, or \u2014 if some occurrences really are legitimate \u2014 narrow the suppression to those sites and give each one its reason, so the rule keeps protecting the rest of the project."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/backlog-sessions/01a07fdf-6e55-7703-845c-528f7b401fab/harness/dm6ab.csproj"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"392db2e72e61fed3ad4f3e97a3b49db8eea0b14a15a629a55bebbaa2e3e71fce"}},{"ruleId":"D17","level":"error","message":{"text":"NoWarnInCsproj: CS1591 \u2014 this warning is switched off for the WHOLE project, in every file it builds, including code written years from now: nothing at the call site records that the rule was ever silenced, so the next reader has no reason to look here. Fix what the rule is reporting and drop the code from the list, or \u2014 if some occurrences really are legitimate \u2014 narrow the suppression to those sites and give each one its reason, so the rule keeps protecting the rest of the project."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/backlog-sessions/01a071a1-6fdf-7a1c-99d4-430f6bdb4599/harness/r10replay.csproj"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f3525ee19de5011c754eaabb4b3b26529bce7a7f6c76ef8348fa57f45f3c0e1"}},{"ruleId":"D17","level":"error","message":{"text":"NoWarnInCsproj: CA1305 \u2014 this warning is switched off for the WHOLE project, in every file it builds, including code written years from now: nothing at the call site records that the rule was ever silenced, so the next reader has no reason to look here. Fix what the rule is reporting and drop the code from the list, or \u2014 if some occurrences really are legitimate \u2014 narrow the suppression to those sites and give each one its reason, so the rule keeps protecting the rest of the project."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/backlog-sessions/01a09e22-7957-7dd1-8c61-e313dbdb17fb/harness/sizeprobe.csproj"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"4211971b1f0c4133e4af5aa5022ea8dbcc561d675dd3e41ec14079ad879e24d5"}},{"ruleId":"D17","level":"error","message":{"text":"NoWarnInCsproj: CA1305 \u2014 this warning is switched off for the WHOLE project, in every file it builds, including code written years from now: nothing at the call site records that the rule was ever silenced, so the next reader has no reason to look here. Fix what the rule is reporting and drop the code from the list, or \u2014 if some occurrences really are legitimate \u2014 narrow the suppression to those sites and give each one its reason, so the rule keeps protecting the rest of the project."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/backlog-sessions/01a09e20-5cea-736e-967d-bc957889e676/harness/r10replay.csproj"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0ce85f3460bb6ae444d7ee2c2afa034bcaa17d39ca9a7779ea5c05e2bdad0e7"}},{"ruleId":"D17","level":"error","message":{"text":"NoWarnInCsproj: CA1305 \u2014 this warning is switched off for the WHOLE project, in every file it builds, including code written years from now: nothing at the call site records that the rule was ever silenced, so the next reader has no reason to look here. Fix what the rule is reporting and drop the code from the list, or \u2014 if some occurrences really are legitimate \u2014 narrow the suppression to those sites and give each one its reason, so the rule keeps protecting the rest of the project."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/backlog-sessions/01a080b5-9ab2-7452-9384-b5d68b1122d3/harness/dm12ab.csproj"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b4c36a375905579a0c5006f850f745608dc65ec5cc17df1a6e60dc940277c83"}},{"ruleId":"D17","level":"error","message":{"text":"NoWarnInCsproj: CA1305 \u2014 this warning is switched off for the WHOLE project, in every file it builds, including code written years from now: nothing at the call site records that the rule was ever silenced, so the next reader has no reason to look here. Fix what the rule is reporting and drop the code from the list, or \u2014 if some occurrences really are legitimate \u2014 narrow the suppression to those sites and give each one its reason, so the rule keeps protecting the rest of the project."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/backlog-sessions/01a080aa-ee06-7fd0-9c46-8623acd96890/harness/dm6ab.csproj"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"1367573bd0a22cf8ca0b6705bc7e97e84f905a2fcd3a84ab3443ee068169bd4b"}},{"ruleId":"D17","level":"error","message":{"text":"NoWarnInCsproj: CA1305 \u2014 this warning is switched off for the WHOLE project, in every file it builds, including code written years from now: nothing at the call site records that the rule was ever silenced, so the next reader has no reason to look here. Fix what the rule is reporting and drop the code from the list, or \u2014 if some occurrences really are legitimate \u2014 narrow the suppression to those sites and give each one its reason, so the rule keeps protecting the rest of the project."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/backlog-sessions/01a08091-e938-76af-8e54-2628bae0fd2c/harness/dm6ab.csproj"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"03cd8a485301d108e9ae545e17969386549bf60dd00df1b0cf5c8d462a886810"}},{"ruleId":"D17","level":"error","message":{"text":"NoWarnInCsproj: CA1305 \u2014 this warning is switched off for the WHOLE project, in every file it builds, including code written years from now: nothing at the call site records that the rule was ever silenced, so the next reader has no reason to look here. Fix what the rule is reporting and drop the code from the list, or \u2014 if some occurrences really are legitimate \u2014 narrow the suppression to those sites and give each one its reason, so the rule keeps protecting the rest of the project."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/backlog-sessions/01a07fdf-6e55-7703-845c-528f7b401fab/harness/dm6ab.csproj"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f9c2b5b062d3997df7a934cd11c18a89eab6bf805461f3d79b758804ef2b73d"}},{"ruleId":"D17","level":"error","message":{"text":"NoWarnInCsproj: CA1305 \u2014 this warning is switched off for the WHOLE project, in every file it builds, including code written years from now: nothing at the call site records that the rule was ever silenced, so the next reader has no reason to look here. Fix what the rule is reporting and drop the code from the list, or \u2014 if some occurrences really are legitimate \u2014 narrow the suppression to those sites and give each one its reason, so the rule keeps protecting the rest of the project."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/backlog-sessions/01a071a1-6fdf-7a1c-99d4-430f6bdb4599/harness/r10replay.csproj"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed5eb271604eb632fb11258da1d924a2e150baac52416cd9262189f21af7bda2"}},{"ruleId":"D17","level":"error","message":{"text":"NoWarnInCsproj: CA1307 \u2014 this warning is switched off for the WHOLE project, in every file it builds, including code written years from now: nothing at the call site records that the rule was ever silenced, so the next reader has no reason to look here. Fix what the rule is reporting and drop the code from the list, or \u2014 if some occurrences really are legitimate \u2014 narrow the suppression to those sites and give each one its reason, so the rule keeps protecting the rest of the project."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/backlog-sessions/01a09e22-7957-7dd1-8c61-e313dbdb17fb/harness/sizeprobe.csproj"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"8470ae015197966a9615fb7d0b4b637314b5ec2f961c91bbf1070e47a17ecc47"}},{"ruleId":"D17","level":"error","message":{"text":"NoWarnInCsproj: CA1307 \u2014 this warning is switched off for the WHOLE project, in every file it builds, including code written years from now: nothing at the call site records that the rule was ever silenced, so the next reader has no reason to look here. Fix what the rule is reporting and drop the code from the list, or \u2014 if some occurrences really are legitimate \u2014 narrow the suppression to those sites and give each one its reason, so the rule keeps protecting the rest of the project."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/backlog-sessions/01a09e20-5cea-736e-967d-bc957889e676/harness/r10replay.csproj"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"52908edac93106053330585a861f14a32e7cd32d15c03725c009e6fc1bf61015"}},{"ruleId":"D17","level":"error","message":{"text":"NoWarnInCsproj: CA1307 \u2014 this warning is switched off for the WHOLE project, in every file it builds, including code written years from now: nothing at the call site records that the rule was ever silenced, so the next reader has no reason to look here. Fix what the rule is reporting and drop the code from the list, or \u2014 if some occurrences really are legitimate \u2014 narrow the suppression to those sites and give each one its reason, so the rule keeps protecting the rest of the project."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/backlog-sessions/01a080b5-9ab2-7452-9384-b5d68b1122d3/harness/dm12ab.csproj"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b98a1ac491ddc5fdada824c8dbb94d1da3ea9bfeafa3c58257a802cbf1c0057"}},{"ruleId":"D17","level":"error","message":{"text":"NoWarnInCsproj: CA1307 \u2014 this warning is switched off for the WHOLE project, in every file it builds, including code written years from now: nothing at the call site records that the rule was ever silenced, so the next reader has no reason to look here. Fix what the rule is reporting and drop the code from the list, or \u2014 if some occurrences really are legitimate \u2014 narrow the suppression to those sites and give each one its reason, so the rule keeps protecting the rest of the project."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/backlog-sessions/01a080aa-ee06-7fd0-9c46-8623acd96890/harness/dm6ab.csproj"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"c61d2a31efdd88f98937fad8c7255c7c80a9da60d322ffdca51f61d257f2a43c"}},{"ruleId":"D17","level":"error","message":{"text":"NoWarnInCsproj: CA1307 \u2014 this warning is switched off for the WHOLE project, in every file it builds, including code written years from now: nothing at the call site records that the rule was ever silenced, so the next reader has no reason to look here. Fix what the rule is reporting and drop the code from the list, or \u2014 if some occurrences really are legitimate \u2014 narrow the suppression to those sites and give each one its reason, so the rule keeps protecting the rest of the project."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/backlog-sessions/01a08091-e938-76af-8e54-2628bae0fd2c/harness/dm6ab.csproj"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddf285931947279f1b179df2b0b47dbea83866b336993081e58d831208b4c29e"}},{"ruleId":"D17","level":"error","message":{"text":"NoWarnInCsproj: CA1307 \u2014 this warning is switched off for the WHOLE project, in every file it builds, including code written years from now: nothing at the call site records that the rule was ever silenced, so the next reader has no reason to look here. Fix what the rule is reporting and drop the code from the list, or \u2014 if some occurrences really are legitimate \u2014 narrow the suppression to those sites and give each one its reason, so the rule keeps protecting the rest of the project."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/backlog-sessions/01a07fdf-6e55-7703-845c-528f7b401fab/harness/dm6ab.csproj"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"3930fa7a01c2cec3ad4dc6b18eb3de216ed0623d483d4605fbaf5c5d842f45df"}},{"ruleId":"D17","level":"error","message":{"text":"NoWarnInCsproj: CA1307 \u2014 this warning is switched off for the WHOLE project, in every file it builds, including code written years from now: nothing at the call site records that the rule was ever silenced, so the next reader has no reason to look here. Fix what the rule is reporting and drop the code from the list, or \u2014 if some occurrences really are legitimate \u2014 narrow the suppression to those sites and give each one its reason, so the rule keeps protecting the rest of the project."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/backlog-sessions/01a071a1-6fdf-7a1c-99d4-430f6bdb4599/harness/r10replay.csproj"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"802b121952d689493b77c3e155e81a4676b45047fa2b0aab2b28b9d7608800f5"}},{"ruleId":"D17","level":"error","message":{"text":"DemotedWarningsAsErrors: TreatWarningsAsErrors \u2014 this repository turns the warnings-are-errors gate ON in a scope above this line, and this entry switches it back OFF: from here down, no warning fails the build. That is broader than any suppression list \u2014 it is not one rule silenced but every rule, present and future, stopped from gating, for every project under this scope and for code nobody has written yet. Warnings keep being printed, so nothing looks switched off, and the only record of the decision is this line, which a reader of the code below has no reason to open. Fix what the build is reporting here and delete the entry so the scope rejoins the gate, or \u2014 where this scope really is allowed to warn (generated code, throwaway benchmarks) \u2014 name the codes it is allowed to warn about instead of standing the whole gate down, so the exception stays reviewable and the rest keeps protecting you. If the demotion is genuinely correct as it is, say why in a comment above it: that is what turns it from unexplained debt into a recorded decision, and it clears this row."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/tools/noise-probe/noise-probe.csproj"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"92418f858c8ea7fe055d0f0e1b6bd9b8c6cf8a2bd0f08cb12e340565427585b6"}},{"ruleId":"D17","level":"error","message":{"text":"DemotedWarningsAsErrors: TreatWarningsAsErrors \u2014 this repository turns the warnings-are-errors gate ON in a scope above this line, and this entry switches it back OFF: from here down, no warning fails the build. That is broader than any suppression list \u2014 it is not one rule silenced but every rule, present and future, stopped from gating, for every project under this scope and for code nobody has written yet. Warnings keep being printed, so nothing looks switched off, and the only record of the decision is this line, which a reader of the code below has no reason to open. Fix what the build is reporting here and delete the entry so the scope rejoins the gate, or \u2014 where this scope really is allowed to warn (generated code, throwaway benchmarks) \u2014 name the codes it is allowed to warn about instead of standing the whole gate down, so the exception stays reviewable and the rest keeps protecting you. If the demotion is genuinely correct as it is, say why in a comment above it: that is what turns it from unexplained debt into a recorded decision, and it clears this row."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/tools/loc-sweep/loc-sweep.csproj"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"694cb335cd4be8dd1580a32ec15bfa45a4124ce0c3f681ed6bffdc1256f10997"}},{"ruleId":"D17","level":"error","message":{"text":"DemotedWarningsAsErrors: TreatWarningsAsErrors \u2014 this repository turns the warnings-are-errors gate ON in a scope above this line, and this entry switches it back OFF: from here down, no warning fails the build. That is broader than any suppression list \u2014 it is not one rule silenced but every rule, present and future, stopped from gating, for every project under this scope and for code nobody has written yet. Warnings keep being printed, so nothing looks switched off, and the only record of the decision is this line, which a reader of the code below has no reason to open. Fix what the build is reporting here and delete the entry so the scope rejoins the gate, or \u2014 where this scope really is allowed to warn (generated code, throwaway benchmarks) \u2014 name the codes it is allowed to warn about instead of standing the whole gate down, so the exception stays reviewable and the rest keeps protecting you. If the demotion is genuinely correct as it is, say why in a comment above it: that is what turns it from unexplained debt into a recorded decision, and it clears this row."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/backlog-sessions/01a080f8-419a-7d18-916b-4bd2bbf18927/probe-Probe.csproj"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"23b7bcfc4de1dc3cfa2897e639ca719f8cff317ae695ba28c5644bbffbc1b9bb"}},{"ruleId":"D17","level":"error","message":{"text":"DemotedWarningsAsErrors: TreatWarningsAsErrors \u2014 this repository turns the warnings-are-errors gate ON in a scope above this line, and this entry switches it back OFF: from here down, no warning fails the build. That is broader than any suppression list \u2014 it is not one rule silenced but every rule, present and future, stopped from gating, for every project under this scope and for code nobody has written yet. Warnings keep being printed, so nothing looks switched off, and the only record of the decision is this line, which a reader of the code below has no reason to open. Fix what the build is reporting here and delete the entry so the scope rejoins the gate, or \u2014 where this scope really is allowed to warn (generated code, throwaway benchmarks) \u2014 name the codes it is allowed to warn about instead of standing the whole gate down, so the exception stays reviewable and the rest keeps protecting you. If the demotion is genuinely correct as it is, say why in a comment above it: that is what turns it from unexplained debt into a recorded decision, and it clears this row."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/backlog-sessions/01a09e22-7957-7dd1-8c61-e313dbdb17fb/harness/sizeprobe.csproj"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ea901e22d6d2b6df5e7f9935fb5a2164e54549af4553b1b2d4670cf4ea535c1"}},{"ruleId":"D17","level":"error","message":{"text":"DemotedWarningsAsErrors: TreatWarningsAsErrors \u2014 this repository turns the warnings-are-errors gate ON in a scope above this line, and this entry switches it back OFF: from here down, no warning fails the build. That is broader than any suppression list \u2014 it is not one rule silenced but every rule, present and future, stopped from gating, for every project under this scope and for code nobody has written yet. Warnings keep being printed, so nothing looks switched off, and the only record of the decision is this line, which a reader of the code below has no reason to open. Fix what the build is reporting here and delete the entry so the scope rejoins the gate, or \u2014 where this scope really is allowed to warn (generated code, throwaway benchmarks) \u2014 name the codes it is allowed to warn about instead of standing the whole gate down, so the exception stays reviewable and the rest keeps protecting you. If the demotion is genuinely correct as it is, say why in a comment above it: that is what turns it from unexplained debt into a recorded decision, and it clears this row."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/backlog-sessions/01a09e20-5cea-736e-967d-bc957889e676/harness/r10replay.csproj"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa3c7a45eb43b4fb1c7ea4bc2a2a58412486a041ac1af751dc4c24c1f21d60da"}},{"ruleId":"D17","level":"error","message":{"text":"DemotedWarningsAsErrors: TreatWarningsAsErrors \u2014 this repository turns the warnings-are-errors gate ON in a scope above this line, and this entry switches it back OFF: from here down, no warning fails the build. That is broader than any suppression list \u2014 it is not one rule silenced but every rule, present and future, stopped from gating, for every project under this scope and for code nobody has written yet. Warnings keep being printed, so nothing looks switched off, and the only record of the decision is this line, which a reader of the code below has no reason to open. Fix what the build is reporting here and delete the entry so the scope rejoins the gate, or \u2014 where this scope really is allowed to warn (generated code, throwaway benchmarks) \u2014 name the codes it is allowed to warn about instead of standing the whole gate down, so the exception stays reviewable and the rest keeps protecting you. If the demotion is genuinely correct as it is, say why in a comment above it: that is what turns it from unexplained debt into a recorded decision, and it clears this row."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/backlog-sessions/01a080b5-9ab2-7452-9384-b5d68b1122d3/harness/dm12ab.csproj"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceea67edae677299fa2d296cb97dc86cff8beca6d9339b4d6151159d5d4e8d04"}},{"ruleId":"D17","level":"error","message":{"text":"DemotedWarningsAsErrors: TreatWarningsAsErrors \u2014 this repository turns the warnings-are-errors gate ON in a scope above this line, and this entry switches it back OFF: from here down, no warning fails the build. That is broader than any suppression list \u2014 it is not one rule silenced but every rule, present and future, stopped from gating, for every project under this scope and for code nobody has written yet. Warnings keep being printed, so nothing looks switched off, and the only record of the decision is this line, which a reader of the code below has no reason to open. Fix what the build is reporting here and delete the entry so the scope rejoins the gate, or \u2014 where this scope really is allowed to warn (generated code, throwaway benchmarks) \u2014 name the codes it is allowed to warn about instead of standing the whole gate down, so the exception stays reviewable and the rest keeps protecting you. If the demotion is genuinely correct as it is, say why in a comment above it: that is what turns it from unexplained debt into a recorded decision, and it clears this row."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/backlog-sessions/01a080aa-ee06-7fd0-9c46-8623acd96890/harness/dm6ab.csproj"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"b25d6023b315f130e17455acdb57ed5d349524dc0fb7f8e4c0f083dc8f14b9d3"}},{"ruleId":"D17","level":"error","message":{"text":"DemotedWarningsAsErrors: TreatWarningsAsErrors \u2014 this repository turns the warnings-are-errors gate ON in a scope above this line, and this entry switches it back OFF: from here down, no warning fails the build. That is broader than any suppression list \u2014 it is not one rule silenced but every rule, present and future, stopped from gating, for every project under this scope and for code nobody has written yet. Warnings keep being printed, so nothing looks switched off, and the only record of the decision is this line, which a reader of the code below has no reason to open. Fix what the build is reporting here and delete the entry so the scope rejoins the gate, or \u2014 where this scope really is allowed to warn (generated code, throwaway benchmarks) \u2014 name the codes it is allowed to warn about instead of standing the whole gate down, so the exception stays reviewable and the rest keeps protecting you. If the demotion is genuinely correct as it is, say why in a comment above it: that is what turns it from unexplained debt into a recorded decision, and it clears this row."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/backlog-sessions/01a08091-e938-76af-8e54-2628bae0fd2c/harness/dm6ab.csproj"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d1f11fcd7b4e27afa0257a9aee82415e633dab74e1ad222cc81bf3834fb0442"}},{"ruleId":"D17","level":"error","message":{"text":"DemotedWarningsAsErrors: TreatWarningsAsErrors \u2014 this repository turns the warnings-are-errors gate ON in a scope above this line, and this entry switches it back OFF: from here down, no warning fails the build. That is broader than any suppression list \u2014 it is not one rule silenced but every rule, present and future, stopped from gating, for every project under this scope and for code nobody has written yet. Warnings keep being printed, so nothing looks switched off, and the only record of the decision is this line, which a reader of the code below has no reason to open. Fix what the build is reporting here and delete the entry so the scope rejoins the gate, or \u2014 where this scope really is allowed to warn (generated code, throwaway benchmarks) \u2014 name the codes it is allowed to warn about instead of standing the whole gate down, so the exception stays reviewable and the rest keeps protecting you. If the demotion is genuinely correct as it is, say why in a comment above it: that is what turns it from unexplained debt into a recorded decision, and it clears this row."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/backlog-sessions/01a07fdf-6e55-7703-845c-528f7b401fab/harness/dm6ab.csproj"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"49ed174cf5c6bcecd76c07fa36b9dc5f71bee7c6ddf6804e3ecf23ed22facfa3"}},{"ruleId":"D17","level":"error","message":{"text":"DemotedWarningsAsErrors: TreatWarningsAsErrors \u2014 this repository turns the warnings-are-errors gate ON in a scope above this line, and this entry switches it back OFF: from here down, no warning fails the build. That is broader than any suppression list \u2014 it is not one rule silenced but every rule, present and future, stopped from gating, for every project under this scope and for code nobody has written yet. Warnings keep being printed, so nothing looks switched off, and the only record of the decision is this line, which a reader of the code below has no reason to open. Fix what the build is reporting here and delete the entry so the scope rejoins the gate, or \u2014 where this scope really is allowed to warn (generated code, throwaway benchmarks) \u2014 name the codes it is allowed to warn about instead of standing the whole gate down, so the exception stays reviewable and the rest keeps protecting you. If the demotion is genuinely correct as it is, say why in a comment above it: that is what turns it from unexplained debt into a recorded decision, and it clears this row."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/backlog-sessions/01a071a1-6fdf-7a1c-99d4-430f6bdb4599/harness/r10replay.csproj"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a484f00c794b358245f4a2dc96d6ad0d2abc688f9f072d08ea8819231f9f09a"}},{"ruleId":"D17","level":"error","message":{"text":"DemotedWarningsAsErrors: TreatWarningsAsErrors \u2014 this repository turns the warnings-are-errors gate ON in a scope above this line, and this entry switches it back OFF: from here down, no warning fails the build. That is broader than any suppression list \u2014 it is not one rule silenced but every rule, present and future, stopped from gating, for every project under this scope and for code nobody has written yet. Warnings keep being printed, so nothing looks switched off, and the only record of the decision is this line, which a reader of the code below has no reason to open. Fix what the build is reporting here and delete the entry so the scope rejoins the gate, or \u2014 where this scope really is allowed to warn (generated code, throwaway benchmarks) \u2014 name the codes it is allowed to warn about instead of standing the whole gate down, so the exception stays reviewable and the rest keeps protecting you. If the demotion is genuinely correct as it is, say why in a comment above it: that is what turns it from unexplained debt into a recorded decision, and it clears this row."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/backlog-sessions/01a0711e-ee78-732a-9fcd-2b9927957dd6/harness/d35replay.csproj"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"15048b451235dacf8b40a79c2c0a3a8742188348c1b083fbc96b3ad20aa14afb"}},{"ruleId":"D17","level":"error","message":{"text":"DisabledAnalyzers: EnableNETAnalyzers \u2014 this does not switch a rule off, it stops the analyzers running for the whole project: every rule they ship is silenced at once, including every rule added by a future upgrade, and nothing at the sites they would have reported records that anything was switched off. There is no code here to look up and nothing to weigh, which is what makes it the one suppression that is never revisited. Turn the analyzers back on and deal with what they report \u2014 suppressing the handful of rules that are genuinely unwanted, each on its own line with its reason, keeps the rest protecting the project and leaves a record a reader can audit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/tools/noise-probe/noise-probe.csproj"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"39c3eb074e5a87433d15f140488bf4f9aed2e650804f9d406ee71d2c69ff23d5"}},{"ruleId":"D17","level":"error","message":{"text":"DisabledAnalyzers: EnableNETAnalyzers \u2014 this does not switch a rule off, it stops the analyzers running for the whole project: every rule they ship is silenced at once, including every rule added by a future upgrade, and nothing at the sites they would have reported records that anything was switched off. There is no code here to look up and nothing to weigh, which is what makes it the one suppression that is never revisited. Turn the analyzers back on and deal with what they report \u2014 suppressing the handful of rules that are genuinely unwanted, each on its own line with its reason, keeps the rest protecting the project and leaves a record a reader can audit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/tools/loc-sweep/loc-sweep.csproj"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"b441be5fb8c72db276e6f683f2712647a6800524b7001b6d14de19847cf59185"}},{"ruleId":"D17","level":"error","message":{"text":"DisabledAnalyzers: RunAnalyzers \u2014 this does not switch a rule off, it stops the analyzers running for the whole project: every rule they ship is silenced at once, including every rule added by a future upgrade, and nothing at the sites they would have reported records that anything was switched off. There is no code here to look up and nothing to weigh, which is what makes it the one suppression that is never revisited. Turn the analyzers back on and deal with what they report \u2014 suppressing the handful of rules that are genuinely unwanted, each on its own line with its reason, keeps the rest protecting the project and leaves a record a reader can audit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/backlog-sessions/01a080f8-419a-7d18-916b-4bd2bbf18927/probe-Probe.csproj"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"e52837681cb31641a0fb1d09839dfca2b8c2e95396a6cafaf235732d37367400"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no installation or build instructions: The README does not state how to install, build, or run the project from source. Add a short setup/install section covering dotnet tooling, global.json pinning, and the one-command build/run flow."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fa6bfcd5c6ae231d1b8ee99bced50b832d1f61cde9da6cbb533467b879a57db"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no usage examples: The README lacks runnable usage examples showing how to invoke Watchdog/Assay from the command line. Add a \u0027Run it\u0027 section with an example of starting Watchdog and Assay, referencing the e2e/run-loop.sh harness."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1355eb4e127a4bc9236772ce1c46f09510aa9286e7a06d1e47f308229df19049"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no architecture or design documentation: The architecture is described in one screen (00-architecture.md) but no separate architecture/design document exists for readers to refer to. Create a dedicated Architecture/Docs file covering the DDD/VSA model, shared Core, CAI reference scorer, and the two deployable apps."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"086460f2da112d94904fac5439f54a7780bc7778ff9375a067e428a1cc9a8a4c"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no licence statement: No licence statement appears in any document. Add a LICENSE file or a one-line licensing line to each repository (or the top-level README) so readers can verify it for themselves."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc71d4465cafafc3df7a1b646a8cd5f9a306761b307dc199a6de8c1c35d8b21d"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 2 of 25 project(s) overshoot their size bounds, lowering Project Cohesion to 8.4/10. The most over is \u0060CodeHealth.Core\u0060 (239627 LoC, 943 public types across 47 namespaces). Review these for cohesion \u2014 split a project that spans unrelated responsibilities."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d5a94650dc74886a0f1f08eb9fb6775f1fc395279ef7e901c970c9d26f767a72"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"06674ddc047530f4dd482c81b44afeab7801a1f591f216e876b81bfc56643228"},"properties":{"commitSha":"82d431252c1a906e200e30d7149b927f55261938"}},{"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":"0d5024c191585fadf08062dde06c726a40efcdc7c0c06c970c395d712cb07f27"},"properties":{"commitSha":"82d431252c1a906e200e30d7149b927f55261938"}},{"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":"e00ccf788a6ef85576f5802c107a38c300d7ba9beff0901dbdb440f9f59e8741"},"properties":{"commitSha":"e8a88a16ef4c0835666437b7667575414a48c4ce"}},{"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":"0ed9ceb15dd300c9a6b0bfa97822e4943a458f61a59fd55502895d9ad2f61cd2"},"properties":{"commitSha":"ada79cd3b1abb05738ca06fc799cb1032edc04cf"}},{"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":"e32961d82f6b93cc098a8806a949b895357b961c8ad07c8288fedb8ae7eaebbd"},"properties":{"commitSha":"4291ee3e4e55c26023552c74239047ab400533f9"}},{"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":"c314cfb727c251da6cfd6c4c757e6fa1f7094e0fc93c55b1181327ef57862afa"},"properties":{"commitSha":"4291ee3e4e55c26023552c74239047ab400533f9"}},{"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":"5a99696a10f670e089788a59575472aa02dbec9110e1e860532906bfa6021090"},"properties":{"commitSha":"c82a6467b6aa113f287fabc6dd0dcc5a1518e972"}},{"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":"e77838691e6302ec8487ca7c96e59082d6fc20dadce992fc42581281a46457a7"},"properties":{"commitSha":"33841c8630235ed5fd5b71d87a0896730f2c890e"}},{"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":"f9be757a1eaae0871590a5f80cf435eb1fd084107e4dcada0befdb375c918b97"},"properties":{"commitSha":"33841c8630235ed5fd5b71d87a0896730f2c890e"}},{"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":"f8ec29cab48cb45a87d9d0d0f7cef24789f6ca89aab8e2f44961356ce127409d"},"properties":{"commitSha":"33841c8630235ed5fd5b71d87a0896730f2c890e"}},{"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":"2d8efe9d265915fe18e3c46593545e74989fcdbe068b21353f1d4c52399d8ff4"},"properties":{"commitSha":"33841c8630235ed5fd5b71d87a0896730f2c890e"}},{"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":"29d3b71dfb594e2d22c63e378f9a906ef11c2c7dc1148051abbc9620b32d9726"},"properties":{"commitSha":"33841c8630235ed5fd5b71d87a0896730f2c890e"}},{"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":"056c25e51ba8f68146b242c9e96e031148bd7f7ddb792154bdedf759885f4b95"},"properties":{"commitSha":"33841c8630235ed5fd5b71d87a0896730f2c890e"}},{"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":"f08c16d5150c624153970710cff3e44d74e88917005f7f044631bc93da7d1e68"},"properties":{"commitSha":"33841c8630235ed5fd5b71d87a0896730f2c890e"}},{"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":"6fd445d8fde224ddce95f64e63061622d13e659a4624de8903ec886e7e650d55"},"properties":{"commitSha":"33841c8630235ed5fd5b71d87a0896730f2c890e"}},{"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":"f924a5a45ac24368af0c05c716cb763da1fb0e56a51fe8f34f775d8019879901"},"properties":{"commitSha":"33841c8630235ed5fd5b71d87a0896730f2c890e"}},{"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":"b6895432334849492895fb600714fcd71c4bd95cf02b7a9e0098acd6b731a87c"},"properties":{"commitSha":"33841c8630235ed5fd5b71d87a0896730f2c890e"}},{"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":"b35fb273e7225bc94fbcd0a70c6693c98c33e3e60e45336849d52b1b50f7282b"},"properties":{"commitSha":"33841c8630235ed5fd5b71d87a0896730f2c890e"}},{"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":"c201599b9570e6ec3fe7e71f39b7629bed517ff6f34caf1c04cb91fbc5bf35c3"},"properties":{"commitSha":"33841c8630235ed5fd5b71d87a0896730f2c890e"}},{"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":"e502ae8dd01dce26e7549b0ddfa8ab0f43941e7db0958582ed596690f7e13be7"},"properties":{"commitSha":"772b8e9730f889292995093dfbc7876d245b42e1"}},{"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":"d2ae4604d08eff0b35b945404591a1a72464a3a7a0325af69837d5116c85cc4b"},"properties":{"commitSha":"772b8e9730f889292995093dfbc7876d245b42e1"}},{"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":"5dbdedbf77dafa0cfbfadd75ba5061498694669f2100ad6ba4ccde877b063391"},"properties":{"commitSha":"772b8e9730f889292995093dfbc7876d245b42e1"}},{"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":"203a63ffa0c2d531782b0ef3ce2c4e970b341f5270fea474f844b2dc6292c14f"},"properties":{"commitSha":"8e853d73b1c76b703cf45528405fbee93804d822"}},{"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":"7256929c89090a3c655ef72561ed73ffe34bfb2ad41ea2c854360be0bbf9328e"},"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"}}]},{"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":"120dc073a2f2840a1b2f6f48783b5e6f6e8e2fe1ff8a6d2430ec78b6c869dcb2"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"f304565aac5d9ab06f6d1fa6c9fd44ad69de3c599bde14ea529881fca0392491"},"taxa":[{"id":"CWE-22","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"0eba26eb1fb24c8eaebc07c4ca56e9f14536948d6cc00a200cb876abfb25f260"},"taxa":[{"id":"CWE-22","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"69ee8530ea2b4d49d960b1049600db3f8b2ac95d6f14b315e30bad3b0f24d894"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"6ae9eb7af823a00ccd5ecdc709e4742907de542b75d456c86277623c0d15ee45"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"83f900f828afefb96caa93ab6f3c7439e8ac50cc8d7cc00d2023e99ee3f781dd"},"taxa":[{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"67e65f027c20f07e0f2f869b8547723b4989d75a12b58f2d13e1eff797db9a68"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"746506a7495c33bbe1afe853504585345d0bdb49bd9d512fb776bece949aa154"},"taxa":[{"id":"CWE-426","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-693","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cfb3a5470fa750e7105da2822519774f2775ce8228b49c204f1113c07edb54c7"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: IMetricsWriter.cs \u2192 IMetricsReader.cs, MetricPoint.cs, MetricsReader.cs: \u0060src/Kennel.Core/Metrics/Contracts/IMetricsWriter.cs\u0060 changes together with 3 other files \u2014 \u0060src/Kennel.Core/Metrics/Contracts/IMetricsReader.cs\u0060, \u0060src/Kennel.Core/Metrics/Domain/MetricPoint.cs\u0060, \u0060src/Kennel.Core/Metrics/MetricsReader.cs\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 3 separate couplings, not 3 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 3."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Kennel.Core/Metrics/Contracts/IMetricsWriter.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fe0a16986f85e2d92e37caadf818edf36cc37d254c40497d81ad884d8e78667"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: IMetricsReader.cs \u2194 MetricPoint.cs: \u0060src/Kennel.Core/Metrics/Contracts/IMetricsReader.cs\u0060 and \u0060src/Kennel.Core/Metrics/Domain/MetricPoint.cs\u0060 change together 91% of the time (10 of the 11 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). They sit in different directories, but in this ecosystem the namespace is declared in the FILE, not by the folder \u2014 so the two may well share one namespace and reference each other with no import for this pass to see. Read the pair before acting: if one derives from or overrides the other, the dependency is explicit in the type declaration and the co-change is definitional; if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE and the thing to add is a comment saying so; if they simply belong together, co-locate them; if none of these holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are \u0060bc90d938\u0060 fix(corpus): only a full scan is publishable; \u00608c5f85ed\u0060 feat(coverage): engine gaps reach the wire, the store and the run-his\u2026; \u0060e2069206\u0060 fix(w8): ship the file-quality percentages with their denominator \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Kennel.Core/Metrics/Contracts/IMetricsReader.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"12115078368099bc3b641c4385905cefab8e83331249ba5c23536df0f5bb685b"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: NoiseSplit.cs \u2194 AdvisoryCatalog.cs: \u0060src/Kennel.Core/LanguageTraining/Services/NoiseSplit.cs\u0060 and \u0060src/Kennel.Core/Repositories/Advisory/AdvisoryCatalog.cs\u0060 change together 69% of the time (9 of the 13 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). They sit in different directories, but in this ecosystem the namespace is declared in the FILE, not by the folder \u2014 so the two may well share one namespace and reference each other with no import for this pass to see. Read the pair before acting: if one derives from or overrides the other, the dependency is explicit in the type declaration and the co-change is definitional; if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE and the thing to add is a comment saying so; if they simply belong together, co-locate them; if none of these holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u00606b68b05c\u0060 fix(advisory): the four Runtime Evidence cards are declared advisory \u2026; \u006022e2210b\u0060 fix(dm9): declare the dimension everywhere it has to be declared; \u00607e0bee07\u0060 fix(X32): adding a dimension is a TWO-repository change, and 9c5dcfa1\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Kennel.Core/LanguageTraining/Services/NoiseSplit.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0506b3c6e3f36aed595ede8e2e65e20279306eb89ea46d159631d170a4fbd19f"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: BillingDbContext.cs \u2194 ICommercialCatalog.cs: \u0060src/Kennel.Core/Billing/Persistence/BillingDbContext.cs\u0060 and \u0060src/Kennel.Core/Commercial/Contracts/ICommercialCatalog.cs\u0060 change together 55% of the time (6 of the 11 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). They sit in different directories, but in this ecosystem the namespace is declared in the FILE, not by the folder \u2014 so the two may well share one namespace and reference each other with no import for this pass to see. Read the pair before acting: if one derives from or overrides the other, the dependency is explicit in the type declaration and the co-change is definitional; if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE and the thing to add is a comment saying so; if they simply belong together, co-locate them; if none of these 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 \u006093da3467\u0060 feat(pricing): a bucket can require modules, which confines it to one\u2026; \u0060da9f0560\u0060 feat(billing): close the Stripe go-live gaps \u2014 real cancel, in-place \u2026; \u0060224cc995\u0060 feat(billing): simplify Assay pricing to the module-modifier model \u2014 \u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Kennel.Core/Billing/Persistence/BillingDbContext.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8768008b987847b759a682a8df726f75608dd96ff38e0fc346dbea87c0fe2641"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: BillingDbContext.cs \u2194 EfCommercialCatalog.cs: \u0060src/Kennel.Core/Billing/Persistence/BillingDbContext.cs\u0060 and \u0060src/Kennel.Core/Commercial/Services/EfCommercialCatalog.cs\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). They sit in different directories, but in this ecosystem the namespace is declared in the FILE, not by the folder \u2014 so the two may well share one namespace and reference each other with no import for this pass to see. Read the pair before acting: if one derives from or overrides the other, the dependency is explicit in the type declaration and the co-change is definitional; if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE and the thing to add is a comment saying so; if they simply belong together, co-locate them; if none of these 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 \u006093da3467\u0060 feat(pricing): a bucket can require modules, which confines it to one\u2026; \u0060da9f0560\u0060 feat(billing): close the Stripe go-live gaps \u2014 real cancel, in-place \u2026; \u0060224cc995\u0060 feat(billing): simplify Assay pricing to the module-modifier model \u2014 \u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Kennel.Core/Billing/Persistence/BillingDbContext.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"81f82f7760c5713e0bacddaca3f6ac6e901bb0c2604feac9741394a7c663331a"}},{"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":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"}},{"ruleId":"D39","level":"note","message":{"text":"IL efficiency: 615 authored method(s) exceed the IL budget: 615 of 22384 first-party methods compile to oversized IL bodies (\u003E 250 instructions); worst: CodeHealth.Core.Compliance.ComplianceSecurityAnalyzer.S1 @ engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs:5494, 2456 IL instructions; that pulled this dimension to 9.5/10. These bodies are far past the JIT\u0027s inline budget, so splitting them does not make them inlinable \u2014 what moves the number is emitting less: collapsing LINQ chains and closures on hot paths, and interpolation built eagerly where it is only sometimes used."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs"},"region":{"startLine":5494}}}],"partialFingerprints":{"codehealthFindingId/v1":"dff64f3f3d32e15daa3bc1b3da3dd130ec7a2d879ec24cc1edd383056fd268f8"}},{"ruleId":"D40","level":"note","message":{"text":"No network policy: No Kubernetes NetworkPolicy (or Cilium policy) found. Without one, every pod can talk to every other pod and reach out to the internet by default. Add a default-deny policy and open only the flows you need."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"295828650a2aaa1b03ae9b32ae6843a0c38011e5a70b1926442c4fa7187de5f0"}},{"ruleId":"D41","level":"note","message":{"text":"No AppArmor/SELinux confinement: Workloads declare no AppArmor or SELinux profile. A mandatory-access-control profile confines what a compromised container can touch on the host, complementing seccomp\u0027s syscall filter."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e83fbc31033373d6c51983ed230eb4ba61f7775ed02afb30f5fc1840bde01d4f"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Kennel.Admin.Core/Admin/Ui/Cohorts.razor"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"521c949123b9d6520379b66d42f81646b71eebfaca3bba44f051c42adf5c1d98"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Kennel.Admin.Core/Admin/Ui/PricingAssay.razor"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb8a7f6709735b48ad1bd5930e380681c10b9a34b9e86ab351a24e6a6f309d88"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Kennel.Admin.Core/Admin/Ui/PricingAssay.razor"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed474beffdb706c13dc735ce41dc11e7c3b6c5cb210c187b84be81a50e8ecd7d"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Kennel.Admin.Core/Admin/Ui/PricingAssay.razor"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb287c153240da806a41a984066758f89ca54092ee7bd34a3692d0b1f8b7d8cd"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Kennel.Admin.Core/Admin/Ui/PricingAssay.razor"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"8214f3187433fe9bb72b04f755162459ebe466856a79dc08e7bbe98bd11ab9a7"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Kennel.Admin.Core/Admin/Ui/Questionnaires.razor"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"db85f7bba1ed05b18138594bfb5afe6fc6feea3910ff98e204ef31158936312d"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Kennel.Core/Accounts/Ui/Settings.razor"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ee5301ef95733f19b76ed2a7ab0942e3d8f4517d354631aed06b27b3fabbe14"}},{"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":"tools/train/backlog-sessions/01a0755a-3825-7a5a-962d-5d54313f8058/bubbling-probe.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"790aaa9d45621a244eaae6d4bf3223a9243c4df53e0fe4c9c86f1d34f8e3086d"}},{"ruleId":"AC4","level":"error","message":{"text":"Clickable element isn\u0027t keyboard-operable: The repo\u0027s own CSS styles .dlv-row with \u0060cursor: pointer\u0060, so this \u003Cdiv\u003E is a control \u2014 but it has no role, no tabindex=\u00220\u0022 and no key handler, so it can only be reached with a mouse. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Kennel.Core/Deliveries/Ui/RepoEvidence.razor"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"775006435a418847e3e53cd8a62b21c0e7b15e478715dd64ac44b3b0b103e8d9"}},{"ruleId":"AX6","level":"note","message":{"text":"Fat interface: ICodeType (69 members): \u0060ICodeType\u0060 declares 69 members: \u0060Kind\u0060, \u0060IsRecord\u0060, \u0060IsAbstract\u0060, \u0060IsSealed\u0060, \u0060IsStatic\u0060, \u0060IsValueType\u0060, \u0060IsGenericType\u0060, \u0060Name\u0060, \u0060Namespace\u0060, \u0060AssemblyName\u0060, \u0060ProjectName\u0060, \u0060Accessibility\u0060, \u0060TypeParameters\u0060, \u0060BaseType\u0060, \u0060HasMeaningfulBase\u0060, \u0060DirectInterfaces\u0060, \u0060AllInterfaces\u0060, \u0060AllInterfaceRefs\u0060, \u0060Special\u0060, \u0060Location\u0060, \u0060Members\u0060, \u0060UnionCases\u0060, \u0060Attributes\u0060, \u0060EmbeddedTypes\u0060, \u0060UnderlyingType\u0060, \u0060Language\u0060, \u0060FileImports\u0060, \u0060DerivesClause\u0060, \u0060RecoveryFoldCount\u0060, \u0060RecoveryFoldCalls\u0060, \u0060ConstructionCalls\u0060, \u0060CommandCalls\u0060, \u0060BypassConstructions\u0060, \u0060IsOrmRow\u0060, \u0060PrimaryCtorArity\u0060, \u0060OtpBehaviour\u0060, \u0060RestartStrategy\u0060, \u0060SupervisedChildren\u0060, \u0060ErlangEffects\u0060, \u0060ErlangTestOnlyExports\u0060, and 29 more. Counted as the author wrote them \u2014 a property is ONE member and its get/set accessors are not counted separately, and an event counts once. A wide interface forces every implementer and caller to depend on methods they don\u0027t use (the Interface-Segregation \u0027I\u0027 in SOLID). Split it into focused role-interfaces."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/CodeModel/ICodeType.cs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6ad2fa5e232366d610bb384450ccd3e02316044e8aace451bc8a812bbb5cf98"}},{"ruleId":"DM9","level":"note","message":{"text":"Rule about [Failed, Passed] decided in 2 places: (int Passed, int Failed)\u0027s [Failed, Passed] are judged in CodeHealth.Core.Testing.DotnetTestReliabilityCollector, CodeHealth.Core.Testing.NodeTestReliabilityCollector \u2014 the same decision, restated. Every copy is a chance to drift, and copies drift silently because each one looks correct on its own. Move the judgement onto the type that owns the members and let the call sites ask it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"184705b1fac007e5b8503fddf4bd6aa6d4d31c8d587947bec2f601b03bf3b304"}},{"ruleId":"DM9","level":"note","message":{"text":"Rule about [End, Start] decided in 3 places: (int Start, int End)\u0027s [End, Start] are judged in CodeHealth.Core.CodeShape.RoslynDuplicationDetector, CodeHealth.Core.CodeShape.RoslynDuplicationDetector.CoalescedRegion, CodeHealth.Core.ExplicitDebt.RazorGeneratedDocumentSynthesizer \u2014 the same decision, restated. Every copy is a chance to drift, and copies drift silently because each one looks correct on its own. Move the judgement onto the type that owns the members and let the call sites ask it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1ecc65290b3e12fca57d3991c2beaf02110b69d7b37bab5e3fc720a156cdae5c"}},{"ruleId":"DM9","level":"note","message":{"text":"Rule about [Setter, SetterAccessibility] decided in 8 places: CodeHealth.Core.CodeModel.IProperty\u0027s [Setter, SetterAccessibility] are judged in CodeHealth.Core.ModelAware.DartDomainConventions, CodeHealth.Core.ModelAware.DomainConventions, CodeHealth.Core.ModelAware.DomainModelAnalyzer, CodeHealth.Core.ModelAware.EventSourcingAnalyzer, CodeHealth.Core.ModelAware.KotlinDomainConventions, CodeHealth.Core.ModelAware.PythonDomainConventions, CodeHealth.Core.ModelAware.SwiftDomainConventions, CodeHealth.Core.ModelAware.SymbolHelpers \u2014 the same decision, restated. Every copy is a chance to drift, and copies drift silently because each one looks correct on its own. Move the judgement onto the type that owns the members and let the call sites ask it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8c21e214a31543f5fb3b152b07d72405c9c59d0df7d1cb613b3dcf12c8aca7be"}},{"ruleId":"DM9","level":"note","message":{"text":"Rule about [Class, Record] decided in 2 places: CodeHealth.Core.CodeModel.TypeKind\u0027s [Class, Record] are judged in CodeHealth.Core.ModelAware.DomainModelAnalyzer, CodeHealth.Core.ModelAware.SwiftDomainConventions \u2014 the same decision, restated. Every copy is a chance to drift, and copies drift silently because each one looks correct on its own. Move the judgement onto the type that owns the members and let the call sites ask it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7fcd9cbe40fc9b5e8ad132d87526cf5bdd49688b0f930a29fa73ddb7d7e32c94"}},{"ruleId":"DM9","level":"note","message":{"text":"Rule about [EndLine, StartLine] decided in 4 places: CodeHealth.Core.CodeShape.CloneMemberExtent\u0027s [EndLine, StartLine] are judged in CodeHealth.Core.CodeShape.ChainedCorrespondence, CodeHealth.Core.CodeShape.ChainedFamilyRollup, CodeHealth.Core.CodeShape.MemberFamilyRollup, CodeHealth.Core.CodeShape.MemberPairRollup \u2014 the same decision, restated. Every copy is a chance to drift, and copies drift silently because each one looks correct on its own. Move the judgement onto the type that owns the members and let the call sites ask it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"69ccdb5b5db0d0d1743b15c53294d024fa6adb9e7115e157dc27873b1454b788"}},{"ruleId":"DM9","level":"note","message":{"text":"Rule about [EndLine, StartLine] decided in 3 places: CodeHealth.Core.CodeShape.DuplicationLocation\u0027s [EndLine, StartLine] are judged in CodeHealth.Core.CodeShape.RoslynDuplicationDetector, CodeHealth.Core.CodeShape.RoslynDuplicationDetector.CoalescedRegion, CodeHealth.Core.Frontend.JsDuplicationDetector \u2014 the same decision, restated. Every copy is a chance to drift, and copies drift silently because each one looks correct on its own. Move the judgement onto the type that owns the members and let the call sites ask it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"439c48a65068becefcd077de2fe817c62794a0f8c632e889b1222439f692bf36"}},{"ruleId":"DM9","level":"note","message":{"text":"Rule about [BodyClose, BodyOpen] decided in 2 places: CodeHealth.Core.Frontend.JsConstantOnlyField.ClassBody\u0027s [BodyClose, BodyOpen] are judged in CodeHealth.Core.Frontend.JsConstantOnlyField, CodeHealth.Core.Frontend.JsConstantOnlyField.PropertyWrite \u2014 the same decision, restated. Every copy is a chance to drift, and copies drift silently because each one looks correct on its own. Move the judgement onto the type that owns the members and let the call sites ask it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e56facb846f98490078c9477bf03484a69591dd3239c6606021fd0f8beb89b7f"}},{"ruleId":"DM9","level":"note","message":{"text":"Rule about [BodyTokenEnd, BodyTokenStart] decided in 2 places: CodeHealth.Core.Frontend.JsFunctionUnit\u0027s [BodyTokenEnd, BodyTokenStart] are judged in CodeHealth.Core.Complexity.FirstPartyJsComplexity, CodeHealth.Core.Frontend.JsComplexity \u2014 the same decision, restated. Every copy is a chance to drift, and copies drift silently because each one looks correct on its own. Move the judgement onto the type that owns the members and let the call sites ask it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ffa3c3fce8b22ceb6f54326eeeb31a143654755303c75d048d8b59ba60876ec4"}},{"ruleId":"DM9","level":"note","message":{"text":"Rule about [Kind, Text] decided in 4 places: CodeHealth.Core.Frontend.JsToken\u0027s [Kind, Text] are judged in CodeHealth.Core.Frontend.FrontendTestReachability, CodeHealth.Core.Frontend.JsConstantOnlyField, CodeHealth.Core.Frontend.JsDuplicationDetector, CodeHealth.Core.Frontend.JsScopeBindings \u2014 the same decision, restated. Every copy is a chance to drift, and copies drift silently because each one looks correct on its own. Move the judgement onto the type that owns the members and let the call sites ask it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3a120f8731e6ad8e37f45adbfaed1c1c31c741453322b4dbd99207d6f61023aa"}},{"ruleId":"DM9","level":"note","message":{"text":"Rule about [Identifier, Keyword] decided in 4 places: CodeHealth.Core.Frontend.JsTokenKind\u0027s [Identifier, Keyword] are judged in CodeHealth.Core.Frontend.ExportUsageSolver, CodeHealth.Core.Frontend.JsScopeBindings, CodeHealth.Core.Frontend.JsToken, CodeHealth.Core.Frontend.ModuleSyntaxScanner \u2014 the same decision, restated. Every copy is a chance to drift, and copies drift silently because each one looks correct on its own. Move the judgement onto the type that owns the members and let the call sites ask it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"f1362f9aa39447f72b43b1a083cb878fa95ceff7edc4027d69d7b8076bc23edc"}},{"ruleId":"DM9","level":"note","message":{"text":"Rule about [StringLiteral, TemplateString] decided in 2 places: CodeHealth.Core.Frontend.JsTokenKind\u0027s [StringLiteral, TemplateString] are judged in CodeHealth.Core.Frontend.FrontendEngine, CodeHealth.Core.Frontend.ModuleSyntaxScanner \u2014 the same decision, restated. Every copy is a chance to drift, and copies drift silently because each one looks correct on its own. Move the judgement onto the type that owns the members and let the call sites ask it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"75f96f19eea3d0794b050481eb20e52215afa89680e189e132cc8b5261163faa"}},{"ruleId":"DM9","level":"note","message":{"text":"Rule about [Identifier, Punctuator] decided in 3 places: CodeHealth.Core.Frontend.JsTokenKind\u0027s [Identifier, Punctuator] are judged in CodeHealth.Core.Frontend.JsDuplicationDetector, CodeHealth.Core.Markup.JsxMarkupProducer, CodeHealth.Core.Markup.JsxMarkupProducer.Walker \u2014 the same decision, restated. Every copy is a chance to drift, and copies drift silently because each one looks correct on its own. Move the judgement onto the type that owns the members and let the call sites ask it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"2f4b976e3bb5f30e85405992ce2d66195647ea836984f211d9581567ad54e985"}},{"ruleId":"DM9","level":"note","message":{"text":"Rule about [SpecialType, TypeKind] decided in 2 places: Microsoft.CodeAnalysis.ITypeSymbol\u0027s [SpecialType, TypeKind] are judged in CodeHealth.Core.ModelAware.CSharpCorrectnessAnalyzer, CodeHealth.Core.ModelAware.JsInteropContractAnalyzer \u2014 the same decision, restated. Every copy is a chance to drift, and copies drift silently because each one looks correct on its own. Move the judgement onto the type that owns the members and let the call sites ask it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7ce3ba9ba30c3389f01074d33be8767968b8fe00b16337663ca7cd6876d8047e"}},{"ruleId":"DM9","level":"note","message":{"text":"Rule about [Count, this[]] decided in 2 places: System.Collections.Generic.List\u003Cint\u003E\u0027s [Count, this[]] are judged in CodeHealth.Core.Frontend.JsLexer, CodeHealth.Core.Frontend.JsLexer.Scanner \u2014 the same decision, restated. Every copy is a chance to drift, and copies drift silently because each one looks correct on its own. Move the judgement onto the type that owns the members and let the call sites ask it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9286830cc4a76058f11b01941438b08192dfea68ce79f7babfad38dbe862d92e"}},{"ruleId":"DM9","level":"note","message":{"text":"Rule about [Length, this[]] decided in 3 places: System.ReadOnlySpan\u003Cchar\u003E\u0027s [Length, this[]] are judged in CodeHealth.Core.CodeShape.NeutralFileLengthScanner, CodeHealth.Core.ExplicitDebt.SourceCommentTaskScanner, CodeHealth.Core.Scoring.DiskSourceFiles \u2014 the same decision, restated. Every copy is a chance to drift, and copies drift silently because each one looks correct on its own. Move the judgement onto the type that owns the members and let the call sites ask it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"c9d607e001f147ee270737706203d8d6330011b0e40f1d346e48c30db6053f7d"}},{"ruleId":"DM9","level":"note","message":{"text":"Rule about [Object, String] decided in 11 places: System.Text.Json.JsonValueKind\u0027s [Object, String] are judged in CodeHealth.Core.Dependencies.NpmRegistryClient, CodeHealth.Core.Dependencies.OsvAdvisoryClient, CodeHealth.Core.Dependencies.RubyGemsRegistryClient, CodeHealth.Core.Dependencies.UnityRegistryClient, CodeHealth.Core.Frontend.FrontendManifestEntryPoints, CodeHealth.Core.Frontend.FrontendManifestParsing, CodeHealth.Core.Maturity.MaturityAnalyzer, CodeHealth.Core.Readiness.ProductionReadinessAnalyzer, CodeHealth.Core.Testing.CommittedCoverageReader, CodeHealth.Core.Testing.NodeTestSuiteProbe, CodeHealth.Core.Testing.NodeWorkspaceSiblingBuilder \u2014 the same decision, restated. Every copy is a chance to drift, and copies drift silently because each one looks correct on its own. Move the judgement onto the type that owns the members and let the call sites ask it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9eca0b2a584d59eca78779cbd64ebf889a34f6f2aaf7f2829eb6e044f6ea19c7"}},{"ruleId":"DM9","level":"note","message":{"text":"Rule about [Array, Object] decided in 6 places: System.Text.Json.JsonValueKind\u0027s [Array, Object] are judged in CodeHealth.Core.Frontend.FrontendManifestEntryPoints, CodeHealth.Core.Frontend.FrontendManifestParsing, CodeHealth.Core.Frontend.FrontendWorkspaceLoader, CodeHealth.Core.Maturity.MaturityAnalyzer, CodeHealth.Core.Security.SyftSbomNormalizer, CodeHealth.Core.Testing.CommittedCoverageReader \u2014 the same decision, restated. Every copy is a chance to drift, and copies drift silently because each one looks correct on its own. Move the judgement onto the type that owns the members and let the call sites ask it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ee0ea6fcea4a975439e1003e4898f5013aac6b7245b2a27f06f25e078243d9f1"}},{"ruleId":"DM9","level":"note","message":{"text":"Rule about [Length, this[]] decided in 4 places: System.Text.StringBuilder\u0027s [Length, this[]] are judged in CodeHealth.Core.Markup.TaggedTemplateMarkupProducer, CodeHealth.Core.Markup.TaggedTemplateMarkupProducer.Template, CodeHealth.Core.Markup.TemplMarkupProducer, CodeHealth.Core.Markup.TemplateLanguageMarkupProducer \u2014 the same decision, restated. Every copy is a chance to drift, and copies drift silently because each one looks correct on its own. Move the judgement onto the type that owns the members and let the call sites ask it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"dedba324e672ef302251515c25085cc90806c48ab224e5f2778713134aac8d90"}},{"ruleId":"DM9","level":"note","message":{"text":"Rule about [Length, this[]] decided in 81 places: string\u0027s [Length, this[]] are judged in CodeHealth.Core.ApiSurface.ApiSurfaceExtractor, CodeHealth.Core.ApiSurface.CSharpSourceScanner, CodeHealth.Core.ApiSurface.RouteTemplateNormalizer, CodeHealth.Core.Classification.RustInlineTestModule, CodeHealth.Core.CodeShape.GoRawStringRegions, CodeHealth.Core.CodeShape.NeutralFileLengthScanner, CodeHealth.Core.CodeShape.NeutralMethodLengthScanner, CodeHealth.Core.CodeShape.PolyglotConditionScanner, CodeHealth.Core.CodeShape.RazorCodeVirtualizer, CodeHealth.Core.CodeShape.RoslynDuplicationDetector, CodeHealth.Core.CodeShape.RustInlineTestRegions, CodeHealth.Core.CodeShape.RustInlineTestRegions.LineLexer, CodeHealth.Core.Cohesion.Lcom4Calculator, CodeHealth.Core.Compliance.PiiDataMapAnalyzer, CodeHealth.Core.Dart.DartDeadLibraryField, CodeHealth.Core.Dart.DartRepositoryIdentifiers, CodeHealth.Core.Dependencies.MavenVersion, CodeHealth.Core.Dependencies.NpmManifestHygiene, CodeHealth.Core.Dependencies.PnpmLockfileReader, CodeHealth.Core.Dependencies.SwiftPackageHygiene, CodeHealth.Core.Discovery.FrontendAnalyzer, CodeHealth.Core.Discovery.FrontendSourcePresence, CodeHealth.Core.Discovery.UnityProjectPresence, CodeHealth.Core.ExplicitDebt.AttributeConsumptionScanner, CodeHealth.Core.ExplicitDebt.RazorCodeBlockProjection, CodeHealth.Core.ExplicitDebt.RazorGeneratedDocumentSynthesizer, CodeHealth.Core.ExplicitDebt.ReflectiveDiscoveryScanner, CodeHealth.Core.ExplicitDebt.RoslynDeadCodeDetector, CodeHealth.Core.ExplicitDebt.RoslynExplicitDebtCollector, CodeHealth.Core.FileQuality.GeneratedCodePolicy, CodeHealth.Core.Frontend.EntryPointCatalog, CodeHealth.Core.Frontend.FrontendBoundaries, CodeHealth.Core.Frontend.FrontendDeadCode, CodeHealth.Core.Frontend.FrontendDeclaredPackageRefs, CodeHealth.Core.Frontend.FrontendDependencyHygiene, CodeHealth.Core.Frontend.FrontendEngine, CodeHealth.Core.Frontend.FrontendEngineDimensions, CodeHealth.Core.Frontend.FrontendMarkupRefs, CodeHealth.Core.Frontend.FrontendPathLiteralRefs, CodeHealth.Core.Frontend.FrontendSpecifierScanning, CodeHealth.Core.Frontend.FrontendTestReachability, CodeHealth.Core.Frontend.FrontendTestSuiteMasking, CodeHealth.Core.Frontend.JsLexer, CodeHealth.Core.Frontend.JsLexer.Scanner, CodeHealth.Core.Frontend.JsScopeBindings, CodeHealth.Core.Frontend.JsStringConstants, CodeHealth.Core.Frontend.MinifiedJsHeuristics, CodeHealth.Core.Frontend.ModuleGlobPattern, CodeHealth.Core.Frontend.ModuleResolver, CodeHealth.Core.Frontend.ModuleSyntaxScanner, CodeHealth.Core.Frontend.NonProductionPaths, CodeHealth.Core.Frontend.NonProductionTreeReadmission, CodeHealth.Core.Frontend.PlatformSubstitutionTable, CodeHealth.Core.Frontend.TsConfigFacts, CodeHealth.Core.Frontend.TsConfigGlob, CodeHealth.Core.Markup.AstroMarkupProducer, CodeHealth.Core.Markup.IndentedMarkupProducer, CodeHealth.Core.Markup.MarkupParser, CodeHealth.Core.Markup.TemplateLanguageMarkupProducer, CodeHealth.Core.Maturity.MaturityAnalyzer, CodeHealth.Core.ModelAware.AccessibilityAnalyzer, CodeHealth.Core.ModelAware.DomainConventions, CodeHealth.Core.ModelAware.GoDomainConventions, CodeHealth.Core.ModelAware.HeadingLabelQualityAnalyzer, CodeHealth.Core.ModelAware.IncompletenessAnalyzer, CodeHealth.Core.ModelAware.LogicDefectAnalyzer, CodeHealth.Core.ModelAware.PerformanceAnalyzer, CodeHealth.Core.ModelAware.RubyDomainConventions, CodeHealth.Core.ModelAware.SupplyChainHygieneAnalyzer, CodeHealth.Core.Readiness.CiWorkflowReader, CodeHealth.Core.Readiness.PipelineVersionOutputScan, CodeHealth.Core.Readiness.VacuousFormatGate, CodeHealth.Core.Scoring.CiGateDetection, CodeHealth.Core.Scoring.CompileRemovedPaths, CodeHealth.Core.Security.NativeSecretScanner, CodeHealth.Core.Testing.CompileExcludedTestFiles, CodeHealth.Core.Testing.GoTestCensus, CodeHealth.Core.Testing.JsTestCensus, CodeHealth.Core.Testing.JsTestQualityCensus, CodeHealth.Core.Testing.PythonTestCensus, CodeHealth.Core.Testing.RustTestCensus \u2014 the same decision, restated. Every copy is a chance to drift, and copies drift silently because each one looks correct on its own. Move the judgement onto the type that owns the members and let the call sites ask it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"cf181a79e3c2b13863807ddef9175147c2a1b153312f76a0c412adf301919cb0"}},{"ruleId":"DM9","level":"note","message":{"text":"Rule about [AchievedRung, CeilingRung] decided in 2 places: CodeHealth.Core.Dimensions.DimensionResult\u0027s [AchievedRung, CeilingRung] are judged in CodeHealth.Reporting.Recommendations.RuleRecommendationEngine, CodeHealth.Reporting.Scorecard.ScorecardJsonRenderer \u2014 the same decision, restated. Every copy is a chance to drift, and copies drift silently because each one looks correct on its own. Move the judgement onto the type that owns the members and let the call sites ask it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6cd1b41bb0906c067f0a38c872beaaa89c4f15d131d3edf1859f5c97dafb6bde"}},{"ruleId":"DM9","level":"note","message":{"text":"Rule about [Count, this[]] decided in 3 places: System.Collections.Generic.List\u003Cstring\u003E\u0027s [Count, this[]] are judged in CodeHealth.Dimensions.Security.Scanners.MutableGitCloneScan, CodeHealth.Dimensions.Security.Scanners.UnpinnedToolchainInstallScan, CodeHealth.Dimensions.Security.SupplyChainProvenanceAnalyzer \u2014 the same decision, restated. Every copy is a chance to drift, and copies drift silently because each one looks correct on its own. Move the judgement onto the type that owns the members and let the call sites ask it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"842949e25b2820667725c15960f040ee6c9749c7b73a646695ad27870fc18f4c"}},{"ruleId":"GD1","level":"note","message":{"text":"Placeholder literal left in code: A placeholder string (\u0022Is this heading or label TEXT a non-desc\u2026\u0022) is still in shipped code \u2014 typical of generated boilerplate that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/HeadingLabelQualityAnalyzer.cs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"b05537f1fdbab2b588031e5851b1a5ee1bf70a5d31798a2195a77e14a0e874a4"}},{"ruleId":"GD1","level":"note","message":{"text":"Placeholder literal left in code: A placeholder string (\u0022lorem ipsum\u0022) is still in shipped code \u2014 typical of generated boilerplate that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/IncompletenessAnalyzer.cs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b4e5d1211e02d283227ea60890f234abee73a33529fef292e8d79cf24dab803"}},{"ruleId":"GD1","level":"note","message":{"text":"Placeholder literal left in code: A placeholder string (\u0022changeme\u0022) is still in shipped code \u2014 typical of generated boilerplate that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Security/NativeSecretScanner.cs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"de963fa861b88320986d53a7c5e08410f2dd6051e42d9bbb4e0c3bbe77692b34"}},{"ruleId":"GD1","level":"note","message":{"text":"Placeholder literal left in code: A placeholder string (\u0022changeme\u0022) is still in shipped code \u2014 typical of generated boilerplate that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Security/NativeSecretScanner.cs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"8142a6c07d4df058f929c208429643f5e3bebb568042e5b1e60a180830fdfbe5"}},{"ruleId":"GD1","level":"note","message":{"text":"Placeholder literal left in code: A placeholder string (\u0022changeme\u0022) is still in shipped code \u2014 typical of generated boilerplate that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Security/NativeSecretScanner.cs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"f49b383ab97c148621e24872504919d7ced0983ace71ba20ced456042908963c"}},{"ruleId":"GD1","level":"note","message":{"text":"Placeholder literal left in code: A placeholder string (\u0022changeme\u0022) is still in shipped code \u2014 typical of generated boilerplate that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Security/NativeSecretScanner.cs"},"region":{"startLine":1617}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e050dd4b3d7e81ef87131d78b50b3c0dcd917c2d35a529eaa1d3c3d46a4fd75"}},{"ruleId":"GD1","level":"note","message":{"text":"Placeholder literal left in code: A placeholder string (\u0022changeme\u0022) is still in shipped code \u2014 typical of generated boilerplate that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/CommittedSecretManifestScan.cs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ea8ea9644a61de15d986b051b2cf6ee64fced897fbe50d6c075e2b3ae795913"}},{"ruleId":"GD1","level":"note","message":{"text":"Placeholder literal left in code: A placeholder string (\u0022change_me\u0022) is still in shipped code \u2014 typical of generated boilerplate that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/CommittedSecretManifestScan.cs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9d0414db67f08c2e5e92ac2a0f6eb7175907062883ce388c4b0af8933ffe1ff"}},{"ruleId":"GD1","level":"note","message":{"text":"Placeholder literal left in code: A placeholder string (\u0022replaceme\u0022) is still in shipped code \u2014 typical of generated boilerplate that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/CommittedSecretManifestScan.cs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f63f412e40cbde1cfc76168441eb51955f94cd9ceae9f2d508f77bf7ad04c9f"}},{"ruleId":"GD1","level":"note","message":{"text":"Placeholder literal left in code: A placeholder string (\u0022replace_me\u0022) is still in shipped code \u2014 typical of generated boilerplate that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/CommittedSecretManifestScan.cs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"31ff96fafeb00e028c1155a5059041d9d1bda96c1251278882600267f1760cdc"}},{"ruleId":"GD1","level":"note","message":{"text":"Placeholder literal left in code: A placeholder string (\u0022changeme\u0022) is still in shipped code \u2014 typical of generated boilerplate that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/ConfigCredentialBindingScan.cs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"87e445b25e4224013104bb32149b98e054dcabb78ba7cd1967306a0970faa0f9"}},{"ruleId":"GD1","level":"note","message":{"text":"Placeholder literal left in code: A placeholder string (\u0022replaceme\u0022) is still in shipped code \u2014 typical of generated boilerplate that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/ConfigCredentialBindingScan.cs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"56faa26773d9d252da51c3b10b3f6eb9965bd0abae39357d1f4ac413e7493a6f"}},{"ruleId":"GD1","level":"note","message":{"text":"Placeholder literal left in code: A placeholder string (\u0022(?ix) \u003C[^\u003E]*\u003E\n              | \\b firstna\u2026\u0022) is still in shipped code \u2014 typical of generated boilerplate that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/HostPathPersistentVolumeScan.cs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"6042f48641c90549fe6789cf5a7a1e3dfeb8f2a4e925b147008f1a743d4e20c3"}},{"ruleId":"GD1","level":"note","message":{"text":"Placeholder literal left in code: A placeholder string (\u0022changeme\u0022) is still in shipped code \u2014 typical of generated boilerplate that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/SecretNoiseFilter.cs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb8d724a4430aba555a73a4673176826019200471a2308016796f2c0edb7af0c"}},{"ruleId":"GD1","level":"note","message":{"text":"Placeholder literal left in code: A placeholder string (\u0022change_me\u0022) is still in shipped code \u2014 typical of generated boilerplate that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/SecretNoiseFilter.cs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"36831cc4c17afc169784051b8146256a2287516b608230a99df52646c8f5404d"}},{"ruleId":"GD1","level":"note","message":{"text":"Placeholder literal left in code: A placeholder string (\u0022changeme\u0022) is still in shipped code \u2014 typical of generated boilerplate that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/SecretNoiseFilter.cs"},"region":{"startLine":3733}}}],"partialFingerprints":{"codehealthFindingId/v1":"926939f3582a1a681778f4a1f7c51a7e47551ca573abf78e65f784f827c884d2"}},{"ruleId":"GD1","level":"note","message":{"text":"Placeholder literal left in code: A placeholder string (\u0022changeme\u0022) is still in shipped code \u2014 typical of generated boilerplate that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/SecretNoiseFilter.cs"},"region":{"startLine":3758}}}],"partialFingerprints":{"codehealthFindingId/v1":"a910a93e300c627d892c8e0d9ac33ba00083b2b6a889b8c7e3fb29eb1785a932"}},{"ruleId":"GD1","level":"note","message":{"text":"Placeholder literal left in code: A placeholder string (\u0022change_me\u0022) is still in shipped code \u2014 typical of generated boilerplate that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/SecretNoiseFilter.cs"},"region":{"startLine":3758}}}],"partialFingerprints":{"codehealthFindingId/v1":"01ee83e1181a4831465fbe91ea6c10c423a35869b221baa9926d7f4f5ee0c240"}},{"ruleId":"GD1","level":"note","message":{"text":"Placeholder literal left in code: A placeholder string (\u0022replaceme\u0022) is still in shipped code \u2014 typical of generated boilerplate that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/SecretNoiseFilter.cs"},"region":{"startLine":3758}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fa890b971b297f81bb5cceaa6fc1c33db27d0eddfbdef2570858f42faf2ad44"}},{"ruleId":"GD1","level":"note","message":{"text":"Placeholder literal left in code: A placeholder string (\u0022replace_me\u0022) is still in shipped code \u2014 typical of generated boilerplate that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/SecretNoiseFilter.cs"},"region":{"startLine":3758}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a4283145442106fd429f5b3817e60db624ea2cb26b08347589c37a065603617"}},{"ruleId":"GD1","level":"note","message":{"text":"Placeholder literal left in code: A placeholder string (\u0022_change_me\u0022) is still in shipped code \u2014 typical of generated boilerplate that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/SecretNoiseFilter.cs"},"region":{"startLine":3759}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3903318c178e75b3c85ab4f8af8c0187f2289f79669f5c92a0ae6d910360606"}},{"ruleId":"IC1","level":"note","message":{"text":"Commented-out code: A line of code has been commented out rather than removed \u2014 dead weight that rots and confuses. Delete it (version control remembers)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs"},"region":{"startLine":1334}}}],"partialFingerprints":{"codehealthFindingId/v1":"46b4962948fc8d41938bbeefea48652abf3feac56d8e00ab060f7066d8cd389f"}},{"ruleId":"IC1","level":"note","message":{"text":"Commented-out code: A line of code has been commented out rather than removed \u2014 dead weight that rots and confuses. Delete it (version control remembers)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs"},"region":{"startLine":1335}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3cee9caa2b8127f950afc4854aface354b42f5e1cb5b1c8615eb33486b6bf22"}},{"ruleId":"IC1","level":"note","message":{"text":"Commented-out code: A line of code has been commented out rather than removed \u2014 dead weight that rots and confuses. Delete it (version control remembers)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/CSharpCorrectnessAnalyzer.cs"},"region":{"startLine":1117}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c175c5c12386f1711e4152798f7dee6ecef3970215c55267e5a4bd99fc3b514"}},{"ruleId":"IC1","level":"note","message":{"text":"Commented-out code: A line of code has been commented out rather than removed \u2014 dead weight that rots and confuses. Delete it (version control remembers)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/CSharpCorrectnessAnalyzer.cs"},"region":{"startLine":2626}}}],"partialFingerprints":{"codehealthFindingId/v1":"09da496d1e9c517277ff5263b1daa9190bd6ad396ecb0bd5d93aacab859235b7"}},{"ruleId":"IC1","level":"note","message":{"text":"Commented-out code: A line of code has been commented out rather than removed \u2014 dead weight that rots and confuses. Delete it (version control remembers)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/CSharpCorrectnessAnalyzer.cs"},"region":{"startLine":2628}}}],"partialFingerprints":{"codehealthFindingId/v1":"d404589dac5675732a11df949da97a73592dbeff9b89b37dc35898261811c5c8"}},{"ruleId":"IC1","level":"note","message":{"text":"Commented-out code: A line of code has been commented out rather than removed \u2014 dead weight that rots and confuses. Delete it (version control remembers)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/CSharpCorrectnessAnalyzer.cs"},"region":{"startLine":2630}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0edd094d623cf7de8ee083f9948f29ff50d5f1413522fbb1f5b1d5e5d0c274f"}},{"ruleId":"IC1","level":"note","message":{"text":"Placeholder data left in code: A placeholder value (\u0022Is this heading or label TEXT a non-desc\u2026\u0022) is still in shipped code \u2014 sample/mock data that was never replaced with the real thing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/HeadingLabelQualityAnalyzer.cs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"360148aa6f3b16c4e996d06ad6c23a0bb9328835823c40fdef14d9aae3adb06c"}},{"ruleId":"IC1","level":"note","message":{"text":"Placeholder data left in code: A placeholder value (\u0022john doe\u0022) is still in shipped code \u2014 sample/mock data that was never replaced with the real thing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/IncompletenessAnalyzer.cs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b9915cb3fc4afc824dc065e84e61d4cfa157aace2b028e46b2da0002a4300f7"}},{"ruleId":"IC1","level":"note","message":{"text":"Placeholder data left in code: A placeholder value (\u0022jane doe\u0022) is still in shipped code \u2014 sample/mock data that was never replaced with the real thing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/IncompletenessAnalyzer.cs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"90c7d3cf87228bf3aa7a3400d079f14495d3b152c340f8fe2294787e4da86199"}},{"ruleId":"IC1","level":"note","message":{"text":"Placeholder data left in code: A placeholder value (\u0022john smith\u0022) is still in shipped code \u2014 sample/mock data that was never replaced with the real thing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/IncompletenessAnalyzer.cs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1fec95203ba8d1bb5ec3512e2321887c85a0edae515b69f1a2da26a26dc233e"}},{"ruleId":"IC1","level":"note","message":{"text":"Placeholder data left in code: A placeholder value (\u0022foo bar\u0022) is still in shipped code \u2014 sample/mock data that was never replaced with the real thing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/IncompletenessAnalyzer.cs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc555f9f9b748123f1f09d2937e22366f701254e6b2b6cc007fca329a667d64f"}},{"ruleId":"IC1","level":"note","message":{"text":"Placeholder data left in code: A placeholder value (\u0022lorem ipsum\u0022) is still in shipped code \u2014 sample/mock data that was never replaced with the real thing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/IncompletenessAnalyzer.cs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5c72ea6d26db55ab3752f7feb4312b556ef662f6761f1d538782bd7877f95e0"}},{"ruleId":"P12","level":"note","message":{"text":"Sleep-based test synchronization: 85 Task.Delay/Thread.Sleep call(s) in test code synchronize with background work by sleeping \u2014 a known flakiness precursor on slow runners. Prefer polling with a deadline or completion signals."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6a03a2c4f0cdb020131eedb5050e85716d2d15c3e6c049458617ddd83166de9e"}},{"ruleId":"P2","level":"note","message":{"text":"Logging is not universal: Only 17/20 service-like projects use logging (pure contract/DTO projects are excluded \u2014 they have nothing to log). Of those 20, 2 ship a process this repository operates; the rest are libraries their consumer hosts, where the logging decision belongs to the host."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): engine/docker/analyzer/render/axe-render.mjs:227 \u00B7 engine/docker/analyzer/render/observe-proxy.mjs:89 \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":"engine/docker/analyzer/render/axe-render.mjs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6e4f39747ef0865746ffdffb78318d42cf9cd8665d28d4332007a1be564164e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): tools/localdev/ui/corpus-e2e.mjs:891 \u00B7 tools/localdev/ui/corpus-e2e.mjs:904 \u2014 the two spans are one implementation copied and then locally edited \u2014 86 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/localdev/ui/corpus-e2e.mjs"},"region":{"startLine":891}}}],"partialFingerprints":{"codehealthFindingId/v1":"b742070501c290561fcafc2095dbc8c3518235a4322c19c43ec4d804619279cc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): engine/docker/analyzer/render/observe-proxy.mjs:88 \u00B7 tools/localdev/ui/lib/cli.mjs:23 \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":"engine/docker/analyzer/render/observe-proxy.mjs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb08360981191566e4203f2dda1e993368785e60ce89217fa4e41e4d0a6c74f5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): engine/sidecars/ruby-frontend/body-facts.mjs:129 \u00B7 engine/sidecars/ruby-frontend/file-extractor.mjs:191 \u2014 the two spans are one implementation copied and then locally edited \u2014 56 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/ruby-frontend/body-facts.mjs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"579a743909b6092a1308b6a6d84fef880ebd21ea047c1310713ab7109df2b030"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): engine/sidecars/ruby-frontend/project.mjs:39 \u00B7 engine/sidecars/ruby-frontend/project.mjs:51 \u2014 the two spans are one implementation copied and then locally edited \u2014 53 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/ruby-frontend/project.mjs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee1a8dc4074cce272a79e4cf7ae385cfa5acd37ca5f1f0757e9f3ac7b2a827b6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 43, cognitive 67): main has cyclomatic complexity 43 and cognitive complexity 67; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/localdev/ui/corpus-e2e.mjs"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8e33e924230d307d8803e03428ec00c85b896e34368e96c682f95374505c0f5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inspect (cyclomatic 24, cognitive 27): inspect has cyclomatic complexity 24 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/localdev/ui/corpus-e2e.mjs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"7926558460725be8d2cc302fbc443f4aa6e50a2cd7d9fe67c126d53d55f477b5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function walk (cyclomatic 21, cognitive 22): walk has cyclomatic complexity 21 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/localdev/ui/corpus-e2e.mjs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"6358249ac67e70e1e99af1db0168ded6c14536770ff99d5a8b235faef6cc346f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 11): (anonymous) has cyclomatic complexity 14 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/localdev/e2e/compliance-scope-parity.cjs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"caf6c6264a7de89334a40ba1ece5422a93533f239346b8e7822ceb6aead436d8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 10): (anonymous) has cyclomatic complexity 14 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/localdev/e2e/repo-hub-hover.cjs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"8751e97b3f71a64d3eed77c2f163cb2f82be0b885242ab3a5f996451a4ead838"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stripStringsAndComments (cyclomatic 13, cognitive 18): stripStringsAndComments has cyclomatic complexity 13 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/tsjs-frontend/ts-helpers.mjs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"7728e4983e27728c0c550d466b9ae9e7ef5185bcadd4c8e8132825ce344ac7fa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function walk (cyclomatic 12, cognitive 21): walk has cyclomatic complexity 12 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/tsjs-frontend/ts-helpers.mjs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"a027f685765226ef43a5e0d05f025bf6bcbe3dc6f759bc60f52121314d458e49"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 12, cognitive 16): main has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/localdev/ui/a11y-gate.mjs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"929d671721f5c9504a88ff8e025a959ef8245d882f2058d627a4bf80ad0aa359"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function walk (cyclomatic 12, cognitive 15): walk has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/localdev/ui/corpus-e2e.mjs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6ba3d1099a4d7943b46316a9c6da25926ce8408a41e22799745cd804b80a96f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function methodMember (cyclomatic 12, cognitive 12): methodMember has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/ruby-frontend/members.mjs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd77d98babbb56b66411b3a0e1c8c857cd975290bc0dbbd7ef0b443159013083"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function looksMinified (cyclomatic 12, cognitive 12): looksMinified has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/tsjs-frontend/ts-helpers.mjs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e33ae65083f4e3f38e2a94803a018f24764474b84642fd57cb0504e5a7d7f7b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function judgeShare (cyclomatic 12, cognitive 12): judgeShare has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/localdev/ui/corpus-e2e.mjs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"0137838143736e075cc766e2c70e60c16b2cc57dca52c4e9e9528b77f824d6e1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 11): (anonymous) has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/localdev/ui/corpus-e2e.mjs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"096ba2a25242486914331ed59bd1f5f61d0f97996d71c5deab584cb4d1ecd7d6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseCsv (cyclomatic 11, cognitive 15): parseCsv has cyclomatic complexity 11 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/localdev/ui/corpus-e2e.mjs"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"591a1695d42e853b911a9ac99e0e4f6a8c1657be58301784b97c4cb64398bd99"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function typeRefOfNode (cyclomatic 11, cognitive 11): typeRefOfNode has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/tsjs-frontend/extract-file.mjs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a17a330c218f9a68bbd6b6af7fdd2542880d02e822d3703564ce005301f2120"}},{"ruleId":"R3","level":"warning","message":{"text":"Large Files: 3 file(s) over 400 lines (counted as significant lines \u2014 blank lines excluded \u2014 over production source only, tests excluded), largest first: tools/localdev/ui/corpus-e2e.mjs (849), engine/sidecars/tsjs-frontend/ts-helpers.mjs (540), engine/sidecars/tsjs-frontend/extract-file.mjs (528)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"cecee31b569df4f07e06db732f1ca037af27b5afef9023da51f9673d931a142f"}},{"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":"tools/train/backlog-sessions/01a09ba7-5207-791d-a102-a79db2fa205c/fixture-slice.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f217929c686488039a610dcc2bf2754caacf54d1094ee0e51516dbdf8e8584f6"}},{"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":"tools/train/backlog-sessions/01a0755a-3825-7a5a-962d-5d54313f8058/bubbling-probe.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"edce5aeb72eac207c5eb68245f8ea5fad3c756c307714c1d5606e73f98949303"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~110 LoC): no import path from any entry point (39 application, 13 tooling, 149 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/backlog-sessions/01a09ba7-5207-791d-a102-a79db2fa205c/fixture-slice.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6caed5e9a7381b246971e0dbd6f02b5b0c52626bc8b684a2d2ee86afbd46fb8"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~12 LoC): no import path from any entry point (39 application, 13 tooling, 149 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/train/backlog-sessions/01a0755a-3825-7a5a-962d-5d54313f8058/bubbling-probe.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f4084673924b8bdf47389ad76a9dc1ff57f3a0605e1763396a1f53b6408b132"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027NAME_ONLY\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/tsjs-frontend/constants.mjs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd162adceff539d9180e6c5b906c83cefec9507c883f6e6f91d288c2c70a79cf"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027ORM_DECORATORS\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/tsjs-frontend/constants.mjs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d2f812426cb53779832ac94af1279666b3ef1c3cd93cd6769dbbd0a6393f1ab"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!dir.EndsWith(\u0022.xcodeproj\u0022, StringComparison.OrdinalIgnoreCase) \u0026\u0026 !dir.EndsWith(\u0022.xcworkspace\u0022, StringComparison.OrdinalIgnoreCase)\u0060 appears character-identically in 2 files \u2014 engine/src/CodeHealth.Core/Dependencies/SwiftPackageHygiene.cs, engine/src/CodeHealth.Core/Discovery/UnreadManifestDisclosure.cs. 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":"engine/src/CodeHealth.Core/Dependencies/SwiftPackageHygiene.cs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"27092ae9207190711fd8c0e5d5cf322ecb37aaafe0f64470265d60988713dea7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!doc.RootElement.TryGetProperty(\u0022packages\u0022, out var packages) || packages.ValueKind != JsonValueKind.Object\u0060 appears character-identically in 3 files \u2014 engine/src/CodeHealth.Core/Frontend/FrontendDeclaredPackageRefs.cs, engine/src/CodeHealth.Core/Frontend/FrontendScriptCommandRefs.cs, engine/src/CodeHealth.Core/Frontend/FrontendWorkspaceWalk.cs. 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":"engine/src/CodeHealth.Core/Frontend/FrontendDeclaredPackageRefs.cs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"55879970a944fe4d21e2e3513423d2bce127279351bc881357b714b68539730c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!ext.Equals(\u0022.yaml\u0022, StringComparison.OrdinalIgnoreCase) \u0026\u0026 !ext.Equals(\u0022.yml\u0022, StringComparison.OrdinalIgnoreCase)\u0060 appears character-identically in 2 files \u2014 engine/src/CodeHealth.Dimensions.Security/RuntimeHardeningScan.cs, engine/src/CodeHealth.Dimensions.Security/Scanners/DeepScan.cs. 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":"engine/src/CodeHealth.Dimensions.Security/RuntimeHardeningScan.cs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"37b1ec6676c05503b6d2e76ce9694f10ae4e9342b9087733e084bf4986a1012f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!n.Contains(\u0022/bin/\u0022, StringComparison.OrdinalIgnoreCase) \u0026\u0026 !n.Contains(\u0022/obj/\u0022, StringComparison.OrdinalIgnoreCase) \u0026\u0026 !n.Contains(\u0022/node_m\u2026\u0060 appears character-identically in 2 files \u2014 engine/src/CodeHealth.Core/FileQuality/ReleaseEvidence.cs, engine/src/CodeHealth.Core/ModelAware/AppKindDetector.cs. 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":"engine/src/CodeHealth.Core/FileQuality/ReleaseEvidence.cs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dc62177e0ea91d4faf7805f3e92afa78d940155f3ebba2b8eaa094802c13bfc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!range.TryGetProperty(\u0022events\u0022, out var events) || events.ValueKind != JsonValueKind.Array\u0060 appears character-identically in 2 files \u2014 engine/src/CodeHealth.Core/Dependencies/OsvAdvisoryClient.cs, engine/src/CodeHealth.Dimensions.Security/Scanners/ScanParsers.cs. 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":"engine/src/CodeHealth.Core/Dependencies/OsvAdvisoryClient.cs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"d78653c7e80893435d0c4bee403d51e446593cea134df1f811d9962d0aec81ab"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!specifier.StartsWith(\u0022./\u0022, StringComparison.Ordinal) \u0026\u0026 !specifier.StartsWith(\u0022../\u0022, StringComparison.Ordinal)\u0060 appears character-identically in 3 files \u2014 engine/src/CodeHealth.Core/Frontend/FrontendBoundaries.cs, engine/src/CodeHealth.Core/Frontend/FrontendEngine.cs, engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs. 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":"engine/src/CodeHealth.Core/Frontend/FrontendBoundaries.cs"},"region":{"startLine":1004}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2b700c5bb6595a41531fe2e1a6d6a52d5f681f6bcc63c56ba9a3ec5a885bb15"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!string.Equals(ext, \u0022.yml\u0022, StringComparison.OrdinalIgnoreCase) \u0026\u0026 !string.Equals(ext, \u0022.yaml\u0022, StringComparison.OrdinalIgnoreCase)\u0060 appears character-identically in 2 files \u2014 engine/src/CodeHealth.Core/Frontend/FrontendToolAndRuntimeRefs.cs, engine/src/CodeHealth.Dimensions.Security/Scanners/WorkflowTriggerRecheck.cs. 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":"engine/src/CodeHealth.Core/Frontend/FrontendToolAndRuntimeRefs.cs"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b14dcfc5034d882892b45324d83646f6523030f342e197b5ab0d8ca31803269"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!string.Equals(finding.RuleId, RuleId, StringComparison.Ordinal) \u0026\u0026 !(finding.RuleId ?? string.Empty).EndsWith(\u0022.\u0022 \u002B RuleId, StringCompariso\u2026\u0060 appears character-identically in 4 files \u2014 engine/src/CodeHealth.Dimensions.Security/Scanners/DartDeadPrivateFieldRecheck.cs, engine/src/CodeHealth.Dimensions.Security/Scanners/JsDeadFieldRoundTripRecheck.cs, engine/src/CodeHealth.Dimensions.Security/Scanners/JsRedundantReDefaultRecheck.cs, engine/src/CodeHealth.Dimensions.Security/Scanners/JsRegexCaptureGroupRecheck.cs. 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":"engine/src/CodeHealth.Dimensions.Security/Scanners/DartDeadPrivateFieldRecheck.cs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbf01a5ef55f1fa6fb4755d7dbd6f48e8fbc9b4e4a9cc2eb142372b0e2112a5d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!tag.IsWord(\u0022html\u0022) \u0026\u0026 !tag.IsWord(\u0022svg\u0022)\u0060 appears character-identically in 2 files \u2014 engine/src/CodeHealth.Core/Markup/TaggedTemplateMarkupProducer.cs, engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.TaggedTemplateBlindness.cs. 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":"engine/src/CodeHealth.Core/Markup/TaggedTemplateMarkupProducer.cs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2a0a5929406a481173aba95b186cbb59226ca10fd8aa1feae85ec0c9e8040c8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!vuln.TryGetProperty(\u0022affected\u0022, out var affected) || affected.ValueKind != JsonValueKind.Array\u0060 appears character-identically in 2 files \u2014 engine/src/CodeHealth.Core/Dependencies/OsvAdvisoryClient.cs, engine/src/CodeHealth.Dimensions.Security/Scanners/ScanParsers.cs. 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":"engine/src/CodeHealth.Core/Dependencies/OsvAdvisoryClient.cs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2b6610ec3912721fc3ed970764c62ec230ab7f50641da8cb7b88185e9c19c9b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060dir.Length == 0 || file.StartsWith(dir \u002B \u0022/\u0022, StringComparison.Ordinal)\u0060 appears character-identically in 2 files \u2014 engine/src/CodeHealth.Core/Frontend/FrontendDeadCode.cs, engine/src/CodeHealth.Core/ModelAware/TemplateDetection.cs. 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":"engine/src/CodeHealth.Core/Frontend/FrontendDeadCode.cs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"73f2b3aafe8d53ecd29ed0d613adcff013431ae058cceaad1aa6b931be2e7e5b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060doc.FilePath is not { } path || !path.EndsWith(\u0022.cs\u0022, StringComparison.OrdinalIgnoreCase)\u0060 appears character-identically in 5 files \u2014 engine/src/CodeHealth.Core/Architecture/ContainerDetector.cs, engine/src/CodeHealth.Core/ExplicitDebt/MarkdownSnippetReferenceScanner.cs, engine/src/CodeHealth.Core/ModelAware/AppKindDetector.cs, engine/src/CodeHealth.Core/ModelAware/OperabilityExtrasAnalyzer.cs. 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":"engine/src/CodeHealth.Core/Architecture/ContainerDetector.cs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"56f2332fede3684e23d34c9f54f93e5fc6b0011d336976117c9527d2df99ae16"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060doc.RootElement.ValueKind != JsonValueKind.Object || !doc.RootElement.TryGetProperty(\u0022dependencies\u0022, out var deps) || deps.ValueKind != Json\u2026\u0060 appears character-identically in 2 files \u2014 engine/src/CodeHealth.Core/Dependencies/UnityLockfileReader.cs, engine/src/CodeHealth.Core/Dependencies/UnityPackageHygiene.cs. 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":"engine/src/CodeHealth.Core/Dependencies/UnityLockfileReader.cs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"064cc0df1653f3c732add6f2b2707e90aefe99779106a14160c43ded35688699"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060doc.RootElement.ValueKind != JsonValueKind.Object || !doc.RootElement.TryGetProperty(\u0022scripts\u0022, out var scripts) || scripts.ValueKind != Jso\u2026\u0060 appears character-identically in 2 files \u2014 engine/src/CodeHealth.Core/ModelAware/RuntimeBoot/DevServerDetector.cs, engine/src/CodeHealth.Core/Readiness/VacuousFormatGate.cs. 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":"engine/src/CodeHealth.Core/ModelAware/RuntimeBoot/DevServerDetector.cs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a35e346c0754f434555fa08a86f87f98cebc1353a6d592b985e67cfebe2d773"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060document.FilePath is not { } path || !path.EndsWith(\u0022.cs\u0022, StringComparison.OrdinalIgnoreCase) || path.EndsWith(\u0022.g.cs\u0022, StringComparison.Or\u2026\u0060 appears character-identically in 2 files \u2014 engine/src/CodeHealth.Core/Compliance/PiiDataMap.cs, engine/src/CodeHealth.Core/Scoring/CodeComposition.cs. 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":"engine/src/CodeHealth.Core/Compliance/PiiDataMap.cs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcf3268413c9a4e16f20037917459d25416aa1016d9149e10ff3e092f01fd8cd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060document.FilePath is { } p \u0026\u0026 (p.Contains(\u0022/obj/\u0022, StringComparison.OrdinalIgnoreCase) || p.EndsWith(\u0022.g.cs\u0022, StringComparison.OrdinalIgnore\u2026\u0060 appears character-identically in 2 files \u2014 engine/src/CodeHealth.Core/CodeShape/RoslynDuplicationDetector.cs, engine/src/CodeHealth.Core/Cohesion/Lcom4Calculator.cs. 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":"engine/src/CodeHealth.Core/CodeShape/RoslynDuplicationDetector.cs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bfdb8af5a3e83fb67d87614f362011a399b8bb23e353e9be96467c3a1b82359"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060element.HasDynamicTextContent || (element.TextContent?.Contains(\u0022${\u0022, StringComparison.Ordinal) ?? false)\u0060 appears character-identically in 2 files \u2014 engine/src/CodeHealth.Core/Markup/TaggedTemplateMarkupProducer.cs, engine/src/CodeHealth.Core/Markup/TemplateLanguageMarkupProducer.cs. 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":"engine/src/CodeHealth.Core/Markup/TaggedTemplateMarkupProducer.cs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c212b56b7480328e08f0c2f92d92b5fe18a220d28d8b1d5185c870f92b2def4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ext.Equals(\u0022.html\u0022, StringComparison.OrdinalIgnoreCase) || ext.Equals(\u0022.htm\u0022, StringComparison.OrdinalIgnoreCase)\u0060 appears character-identically in 2 files \u2014 engine/src/CodeHealth.Core/Frontend/FrontendWorkspaceWalk.cs, engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs. 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":"engine/src/CodeHealth.Core/Frontend/FrontendWorkspaceWalk.cs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"755bf88c36a624b86a41753ecca4924b0e39c2d773589b3f38c65f3f0f76872b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ext.Equals(\u0022.jsx\u0022, StringComparison.OrdinalIgnoreCase) || ext.Equals(\u0022.tsx\u0022, StringComparison.OrdinalIgnoreCase)\u0060 appears character-identically in 3 files \u2014 engine/src/CodeHealth.Core/Frontend/JsRedundantReDefault.cs, engine/src/CodeHealth.Core/Frontend/JsScopeBindings.cs, engine/src/CodeHealth.Dimensions.Security/Scanners/JsDeadFieldRoundTripRecheck.cs. 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":"engine/src/CodeHealth.Core/Frontend/JsRedundantReDefault.cs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"74cac2053bbcb9a1ee907a53f1c257e29543c13250013ad03d808daae00050a9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060f.EndsWith(\u0022.yml\u0022, StringComparison.OrdinalIgnoreCase) || f.EndsWith(\u0022.yaml\u0022, StringComparison.OrdinalIgnoreCase)\u0060 appears character-identically in 2 files \u2014 engine/src/CodeHealth.Core/Frontend/FrontendScriptCommandRefs.cs, engine/src/CodeHealth.Core/Readiness/CiWorkflowReader.cs. 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":"engine/src/CodeHealth.Core/Frontend/FrontendScriptCommandRefs.cs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"35dab93a9a91699342f3ba3b258d12cd3aa8005904cac1e9db9ad13b00d8d6d1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060file.EndsWith(\u0022.d.ts\u0022, StringComparison.OrdinalIgnoreCase) || file.EndsWith(\u0022.d.mts\u0022, StringComparison.OrdinalIgnoreCase) || file.EndsWith(\u0022\u2026\u0060 appears character-identically in 2 files \u2014 engine/src/CodeHealth.Core/Frontend/FrontendDeadCode.cs, engine/src/CodeHealth.Core/Frontend/FrontendEmittedTemplateRefs.cs. 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":"engine/src/CodeHealth.Core/Frontend/FrontendDeadCode.cs"},"region":{"startLine":1006}}}],"partialFingerprints":{"codehealthFindingId/v1":"579980589874e0fe0e3a5c7cfe758427dbf970842b911c55a30e08dcd1686396"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060file.EndsWith(\u0022.vue\u0022, StringComparison.OrdinalIgnoreCase) || file.EndsWith(\u0022.svelte\u0022, StringComparison.OrdinalIgnoreCase)\u0060 appears character-identically in 2 files \u2014 engine/src/CodeHealth.Core/Frontend/FrontendEngine.cs, engine/src/CodeHealth.Core/Frontend/FrontendTestReachability.cs. 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":"engine/src/CodeHealth.Core/Frontend/FrontendEngine.cs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"4645214660d782d556c9c353be8092621ed9ea9e8ea957c8c9f6b5d5cbced40e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060fileName.StartsWith(\u0022requirements\u0022, StringComparison.OrdinalIgnoreCase) \u0026\u0026 fileName.EndsWith(\u0022.txt\u0022, StringComparison.OrdinalIgnoreCase)\u0060 appears character-identically in 2 files \u2014 engine/src/CodeHealth.Dimensions.Security/Scanners/DeepScan.cs, engine/src/CodeHealth.Reporting/Changelog/Fusion/ChangeSetBuilder.cs. 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":"engine/src/CodeHealth.Reporting/Changelog/Fusion/ChangeSetBuilder.cs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"04a2c090fa22d7c9929fdeef6bb5cf72d043ddd13264d387766f4039eede1a5c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060head.StartsWith(\u0022mode: set\u0022, StringComparison.Ordinal) || head.StartsWith(\u0022mode: count\u0022, StringComparison.Ordinal) || head.StartsWith(\u0022mode:\u2026\u0060 appears character-identically in 2 files \u2014 engine/src/CodeHealth.Core/Testing/CommittedCoverageReader.cs, engine/src/CodeHealth.Core/Testing/CoverageReportAdvice.cs. 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":"engine/src/CodeHealth.Core/Testing/CommittedCoverageReader.cs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"94f67335a6fcc2d040107d371f398c8840fb18c285742ffb5dfab82aecd97f1d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060i \u002B 1 \u003C tokens.Count \u0026\u0026 tokens[i \u002B 1].IsPunct(\u0022:\u0022)\u0060 appears character-identically in 2 files \u2014 engine/src/CodeHealth.Core/Frontend/JsScopeBindings.cs, engine/src/CodeHealth.Core/Frontend/ModuleSyntaxScanner.cs. 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":"engine/src/CodeHealth.Core/Frontend/JsScopeBindings.cs"},"region":{"startLine":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9e8ce1124bd17c46817acd626ae5db655865cce9af91eea344457a53607cfe6"}},{"ruleId":"X18","level":"warning","message":{"text":"Disposable created and abandoned in the method that made it: \u0060workspace\u0060 is a \u0060AdhocWorkspace\u0060, which implements \u0060IDisposable\u0060, and it is created here (line 233). Every use of it in \u0060Build\u0060 reads a member through it \u2014 it is never returned, never stored, never handed to anything else, and never disposed \u2014 so this method both creates the value and is the last thing that can release it, and does not. Nothing announces the leak: the object holds its resource until finalization if its type has a finalizer, and until the process ends if it does not, so the cost accumulates once per CALL rather than showing up as a failure. Declare it with \u0060using\u0060 (\u0060using var workspace = \u2026;\u0060), which releases it at the end of the scope on every path including a throw."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Roslyn/BuildlessCSharpProjects.cs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c4e27a5e7910481e75ce53348d34e4cb8349f327bbdca1d25673810717c51f2"}},{"ruleId":"X2","level":"note","message":{"text":"Not all async methods take a CancellationToken: Only 346/379 async methods accept a CancellationToken, so in-flight work can\u0027t be stopped early when the caller gives up \u2014 whatever ends it in your host (shutdown signal, timeout, abandoned request, user cancel). Thread a token through the call chain and honour it at each await and loop; where a method genuinely cannot be interrupted, omitting it is a deliberate choice \u2014 judge against your hosting model."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bf623a92fb752b336427856888a9b386c434e686662a2cdc1bba21832c0a048c"}},{"ruleId":"X31","level":"note","message":{"text":"Test-only surface in a production module: \u0060dispatch_surface:helper_for_tests/1\u0060 is exported unconditionally, and the comment directly above the \u0060-export\u0060 on this line says the exports below it are for testing. Erlang has no visibility below \u0060-export\u0060, so this is part of the module\u0027s public contract: it cannot be changed without a compatibility argument. This arm read the comment, not the call graph: if the comment is right and only tests call it, wrapping the attribute in \u0060-ifdef(TEST). \u2026 -endif.\u0060 keeps the test\u0027s access and removes it from the shipped module. If production code calls it, the comment is stale and wrapping the export would break the build \u2014 delete the comment and document the function as part of the module\u0027s API."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/erlang-frontend/selftest/fixtures/src/dispatch_surface.erl"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"4595498336b47d876dd8dadea4c68da0abff43d5fe734097197e8c27a8d1cb16"}},{"ruleId":"X31","level":"note","message":{"text":"Test-only surface in a production module: \u0060observed_surface:probe_test/2\u0060 is exported unconditionally and its name carries a test marker at a name-segment boundary, so the shipped module publishes a function named for the test tree. No other module in this repository calls it at any arity. Erlang has no visibility below \u0060-export\u0060, so this is part of the module\u0027s public contract: it cannot be changed without a compatibility argument. Nothing tells the next maintainer that its only caller is a test. Wrapping the attribute in \u0060-ifdef(TEST). \u2026 -endif.\u0060 keeps the test\u0027s access and removes it from the shipped module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/erlang-frontend/selftest/fixtures/src/observed_surface.erl"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"1945748cfe6ba6048a28f3d67ec9ff8ba1b627246bba340d3d568e3f37c8caf4"}},{"ruleId":"X31","level":"note","message":{"text":"Test-only surface in a production module: \u0060test_surface_module:helper_for_tests/1\u0060 is exported unconditionally, and the comment directly above the \u0060-export\u0060 on this line says the exports below it are for testing. Erlang has no visibility below \u0060-export\u0060, so this is part of the module\u0027s public contract: it cannot be changed without a compatibility argument. This arm read the comment, not the call graph: if the comment is right and only tests call it, wrapping the attribute in \u0060-ifdef(TEST). \u2026 -endif.\u0060 keeps the test\u0027s access and removes it from the shipped module. If production code calls it, the comment is stale and wrapping the export would break the build \u2014 delete the comment and document the function as part of the module\u0027s API."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/erlang-frontend/selftest/fixtures/src/test_surface_module.erl"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb44272466466a8293e8f6ebc3e160e20cf96c35cf4348672369164d285ae296"}},{"ruleId":"X31","level":"note","message":{"text":"Test-only surface in a production module: \u0060test_surface_module:test_probe/2\u0060 is exported unconditionally and its name carries a test marker at a name-segment boundary, so the shipped module publishes a function named for the test tree. No other module in this repository calls it at any arity. Erlang has no visibility below \u0060-export\u0060, so this is part of the module\u0027s public contract: it cannot be changed without a compatibility argument. Nothing tells the next maintainer that its only caller is a test. Wrapping the attribute in \u0060-ifdef(TEST). \u2026 -endif.\u0060 keeps the test\u0027s access and removes it from the shipped module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/erlang-frontend/selftest/fixtures/src/test_surface_module.erl"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"045264e98e61eef537eecae23941cd36c467a7c5466921062b74b0255aab6759"}},{"ruleId":"X31","level":"note","message":{"text":"Test-only surface in a production module: \u0060test_surface_module:test/0\u0060 is exported unconditionally and its name IS the test marker, so the shipped module publishes a function named for the test tree. No other module in this repository calls it at any arity. Erlang has no visibility below \u0060-export\u0060, so this is part of the module\u0027s public contract: it cannot be changed without a compatibility argument. Nothing tells the next maintainer that its only caller is a test. Wrapping the attribute in \u0060-ifdef(TEST). \u2026 -endif.\u0060 keeps the test\u0027s access and removes it from the shipped module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sidecars/erlang-frontend/selftest/fixtures/src/test_surface_module.erl"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3b2ff88e8d5d93c6f2f3d81673041d340525f048b43ccb9bcef5ea5ae8e0735"}},{"ruleId":"X5","level":"warning","message":{"text":"Null guard scopes only part of the work it protects: This method contradicts itself about \u0060unreadStrings\u0060: line 7186 tests it for null before doing anything with it \u2014 the author\u0027s own statement that null is an input this code expects \u2014 but that \u0060if\u0060 scopes only the block beneath it, and line 7221 then dereferences \u0060unreadStrings\u0060 as \u0060unreadStrings.Examples\u0060 AFTER the block has closed, where the guard no longer applies. A null \u0060unreadStrings\u0060 skips the guarded body and reaches that line anyway, throwing NullReferenceException on exactly the input the guard was written for. If the dereference belongs to the guarded work, move it inside the block; if \u0060unreadStrings\u0060 truly cannot be null by then, the guard above is misleading and should go."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs"},"region":{"startLine":7221}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ad58ac8989f5082691e579ff6a066ca9b76f316c18be0063f71c68a3245c33d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: This method contradicts itself about \u0060model\u0060: line 162 writes \u0060model?.\u0060, which says \u0060model\u0060 can be null, but line 163 then dereferences it directly as \u0060model.CloneUnits\u0060 with no null test between them and no guard around it. If the \u0060?.\u0060 is right, that dereference throws NullReferenceException on the input it was written for; if \u0060model\u0060 truly cannot be null here, the \u0060?.\u0060 is misleading. Settle it one way \u2014 test \u0060model\u0060 once before the first use and handle the null case, or drop the \u0060?.\u0060 \u2014 rather than leaving the two readings side by side."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.CodeQuality/CodeShape/DuplicationAnalyzer.cs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"cef1498c754e7f7032de0930eb900fdffac52ff30f4ff3d708e5fa9e3a4f2f80"}},{"ruleId":"X5","level":"note","message":{"text":"Null-forgiving operator (\u0060!\u0060) suppressions reduce the NRT score: ~0.3 \u0060!\u0060 suppressions per 1k syntax nodes \u2014 413 suppression(s) across the 1501958 syntax node(s) in code where nullable warnings are ENABLED, which is the only code a \u0060!\u0060 can suppress anything in (a \u0060!\u0060 under \u0060#nullable disable\u0060 is inert and is not counted, and its file\u0027s nodes are not in the denominator). Each one tells the compiler to trust you about null, suppressing the very safety NRTs provide."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"93cfe05d4ad8c8c171267603b23dfe289b74842e38edd1b7bfed59cc32bda337"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This project already references a real parser; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/CodeModel/Roslyn/RoslynCodeProject.cs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e2d8468ef91503a2db3b96a47cefae1cef823cb6dc16b79dae702ea6c887ebb"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This project already references a real parser; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/CodeModel/Roslyn/RoslynCodeProject.cs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"99cb2889899c1bb278cd5e93e7f224c2e34df0edc86cd602921a5d5db7779a37"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This project already references a real parser; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/TsConfigJsChecking.cs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ae2e5365deb982c12c0b8a67841f38b11e121bdf0d246d93b64c71da16763e9"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This project already references a real parser; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Markup/MarkupParser.cs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"aad30dcc50948c9dc4c60c83a632228c98e893eff809d572888bc0f36b8cbfd7"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This project already references a real parser; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/CsprojReferenceGraph.cs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"d53056c38a6efe3523be77d62d5ccd5d21bfbfc59f3c9a0dde6c10e619366b19"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This project already references a real parser; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/CsprojReferenceGraph.cs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba505ffe2bd2038a1cd5b8f12dca60a28edb6750ba40bab9183f7f4bdbcb9b0b"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This project already references a real parser; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/CsprojReferenceGraph.cs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0ac990f9bd7026cfd92b93c6f5bf1251b02fc289c65003abae75e17c8133f81"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This project already references a real parser; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/CsprojReferenceGraph.cs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5665536a780c58deb65f5cc6294fcc0117e28ce32d9e8338b33872fea4d463b"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This project already references a real parser; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs"},"region":{"startLine":7745}}}],"partialFingerprints":{"codehealthFindingId/v1":"cadcbf816bf2bcc2115c0209cb9ee9827eac1016ec0744c504e932cb7ee65d25"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This project already references a real parser; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/ConfigKeyNameRecheck.cs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba99a99715d48dfe7d7bf971a287b42ccaed7bd29edc42b1b8d1fa0d24e0164c"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This project already references a real parser; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/RenovateRuleRecheck.cs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca08286c88fac7efbfe125a41ff89b7486590d5f5aa2708d4ec2187fa9e64072"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This project already references a real parser; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/RenovateRuleRecheck.cs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0ecbe52fcecb2b24e37cb99143e596ef1daa8cd494ea97a9f0533cf93cb143a"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This project already references a real parser; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.cs"},"region":{"startLine":5073}}}],"partialFingerprints":{"codehealthFindingId/v1":"97fde2c9d3ac71395794f10bc09bb4674050c8edadc97c14de99d6613184f1fa"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060HasTitledHeadRegion\u0060 returns \u0060false\u0060 when \u0060headOpen.Success\u0060 is false, with no log or throw \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer to the test rather than a stand-in for a value that could not be read, this is not a silent default: say so in a comment on the member and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Markup/MarkupParser.cs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcde7a85142064fd2905e425863441fa6528b6bc1d106f9bf164b22901255228"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060Clamp255\u0060 falls back to \u00600\u0060 when \u0060int.TryParse(n.Trim(), NumberStyles.Integer, CultureInfo.InvariantCulture, out v\u2026\u0060 is false, with no log or throw \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer to the test rather than a stand-in for a value that could not be read, this is not a silent default: say so in a comment on the member and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs"},"region":{"startLine":10293}}}],"partialFingerprints":{"codehealthFindingId/v1":"01fb1876aa3eb8fb2daa7ab3dcf45b81251b9b13c71f12d1dc49ef19f4cbc845"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060ParseSummaryCount\u0060 falls back to \u00600\u0060 when \u0060matches.Count \u003E 0 \u0026\u0026 int.TryParse(matches[^1].Groups[1].Value, out var n)\u0060 is false, with no log or throw \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer to the test rather than a stand-in for a value that could not be read, this is not a silent default: say so in a comment on the member and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Statistics/DotnetBuildStatistician.cs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"031279168390717daee023f9027dcc1ae74266db8796f0cb5e6639da87efccd2"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060ParseDouble\u0060 falls back to \u00600\u0060 when \u0060double.TryParse(v, NumberStyles.Float, CultureInfo.InvariantCulture, out var d)\u0060 is false, with no log or throw \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer to the test rather than a stand-in for a value that could not be read, this is not a silent default: say so in a comment on the member and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Testing/CoverletCoverageCollector.cs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fde905050bffd2af4325b627a2aae360aa3a4eaa6c813a27b994a0184ba06d2"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060ParseInt\u0060 falls back to \u00600\u0060 when \u0060int.TryParse(v, out var i)\u0060 is false, with no log or throw \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer to the test rather than a stand-in for a value that could not be read, this is not a silent default: say so in a comment on the member and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Testing/CoverletCoverageCollector.cs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"0961c34d5adbf70411451afafb98daaf2a90b585f07afb69cf2ed0e6cbe8a57d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060Split\u0060 falls back to \u0060-1\u0060 when \u0060i \u003C id.Length \u0026\u0026 int.TryParse(id[i..], out var n)\u0060 is false, with no log or throw \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer to the test rather than a stand-in for a value that could not be read, this is not a silent default: say so in a comment on the member and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Cli/Commands/DimensionsCommand.cs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"7415188c4b7a91c8083ac3174c1f9e5fabb479d4da33cb6f1300a8803ad588ec"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060CollectPackages\u0060 falls back to \u0060\u0022?\u0022\u0060 when \u0060pkg.TryGetProperty(\u0022id\u0022, out var idEl)\u0060 is false, with no log or throw \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer to the test rather than a stand-in for a value that could not be read, this is not a silent default: say so in a comment on the member and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/DependencyVulnerabilityAnalyzer.cs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ca16f78cd3dd5f44706764ac0ec397d0c7b1788105d942231540c64b71c2fde"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060LeadingIdentifier\u0060 falls back to \u0060string.Empty\u0060 when \u0060m.Success\u0060 is false, with no log or throw \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer to the test rather than a stand-in for a value that could not be read, this is not a silent default: say so in a comment on the member and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/Scanners/JsRegexCaptureGroupRecheck.cs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"475e5618be50ed83a530ab0026debbcdbed12d01f59d404c4501f934c1f3bd72"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060t.Contains(\u0022IdentityDbContext\u0022, StringComparison.Ordinal)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060t.Contains(\u0022IdentityDbContext\u0022, StringComparison.Ordinal)\u0060 also satisfies \u0060t.Contains(\u0022DbContext\u0022, StringComparison.Ordinal)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Compliance/ComplianceSecurityAnalyzer.cs"},"region":{"startLine":997}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6eb4d9d6a3eacfed8d0b7be02b94e15c2755a0d7fcdbc238b47f9a74d2ddeb4"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060fileName.Equals(\u0022package-lock.json\u0022, StringComparison.OrdinalIgnoreCase)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060fileName.Equals(\u0022package-lock.json\u0022, StringComparison.OrdinalIgnoreCase)\u0060 also satisfies \u0060fileName.EndsWith(\u0022lock.json\u0022, StringComparison.OrdinalIgnoreCase)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/FrontendBundlerConfigRefs.cs"},"region":{"startLine":1234}}}],"partialFingerprints":{"codehealthFindingId/v1":"430d903e1f9fbb4b1237458c3003ca9991ba98d308aab592e369c5ffd08363ea"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060first.Contains(\u0022bash\u0022, StringComparison.Ordinal)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060first.Contains(\u0022bash\u0022, StringComparison.Ordinal)\u0060 also satisfies \u0060first.Contains(\u0022sh\u0022, StringComparison.Ordinal)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/FrontendScriptCommandRefs.cs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"51cbb5a572b42087276b3d8cecf606cd88d65898e5aa057fe7d008c60092b9fd"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060fn.Contains(\u0022.email.\u0022, StringComparison.OrdinalIgnoreCase)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060fn.Contains(\u0022.email.\u0022, StringComparison.OrdinalIgnoreCase)\u0060 also satisfies \u0060fn.Contains(\u0022email\u0022, StringComparison.OrdinalIgnoreCase)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Frontend/NonProductionPaths.cs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb2bb6a24b1a0cd9e501beb6f3ebb26eb51c4086eb575c2cc20159e600161251"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060part.EndsWith(\u0022::before\u0022, StringComparison.OrdinalIgnoreCase)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060part.EndsWith(\u0022::before\u0022, StringComparison.OrdinalIgnoreCase)\u0060 also satisfies \u0060part.EndsWith(\u0022:before\u0022, StringComparison.OrdinalIgnoreCase)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs"},"region":{"startLine":5016}}}],"partialFingerprints":{"codehealthFindingId/v1":"aee637520491433861a9aac6655942bd6754c1fd74114a44c33670bd6273ce9e"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060part.EndsWith(\u0022::after\u0022, StringComparison.OrdinalIgnoreCase)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060part.EndsWith(\u0022::after\u0022, StringComparison.OrdinalIgnoreCase)\u0060 also satisfies \u0060part.EndsWith(\u0022:after\u0022, StringComparison.OrdinalIgnoreCase)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs"},"region":{"startLine":5017}}}],"partialFingerprints":{"codehealthFindingId/v1":"08b579dd419a381675551285aa5a38827283e7b682a3d603362b0d0e7ef56111"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060enforcementFileName.StartsWith(\u0022biome.jsonc\u0022, StringComparison.OrdinalIgnoreCase)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060enforcementFileName.StartsWith(\u0022biome.jsonc\u0022, StringComparison.OrdinalIgnoreCase)\u0060 also satisfies \u0060enforcementFileName.StartsWith(\u0022biome.json\u0022, StringComparison.OrdinalIgnoreCase)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/AccessibilityAnalyzer.cs"},"region":{"startLine":6444}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0549947c30b6a81df99bb1b4fa402e6401ea851edc1391435be868183afa1a0"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060n.Contains(\u0022infrastructure\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060n.Contains(\u0022infrastructure\u0022)\u0060 also satisfies \u0060n.Contains(\u0022infra\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/CsprojReferenceGraph.cs"},"region":{"startLine":837}}}],"partialFingerprints":{"codehealthFindingId/v1":"2022fe71b07a8bd0196c223be34b96b847acd74d981296f0a420f2a1ed934fb5"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060type.Name.EndsWith(\u0022IntegrationEvent\u0022, StringComparison.Ordinal)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060type.Name.EndsWith(\u0022IntegrationEvent\u0022, StringComparison.Ordinal)\u0060 also satisfies \u0060type.Name.EndsWith(\u0022Event\u0022, StringComparison.Ordinal)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/DomainConventions.cs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa39238f3e5fac26abef2e9214a3203ab5280445a2d47ffd29a1fe49a376fca8"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060type.Name.EndsWith(\u0022IntegrationEvent\u0022, StringComparison.Ordinal)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060type.Name.EndsWith(\u0022IntegrationEvent\u0022, StringComparison.Ordinal)\u0060 also satisfies \u0060type.Name.EndsWith(\u0022Event\u0022, StringComparison.Ordinal)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/DomainConventions.cs"},"region":{"startLine":1159}}}],"partialFingerprints":{"codehealthFindingId/v1":"9abc21d081a01f50c2f530639106f9b95ed5ea1407589ed3964895b22f195f6b"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060text.Contains(\u0022IHttpClientFactory\u0022, StringComparison.Ordinal)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060text.Contains(\u0022IHttpClientFactory\u0022, StringComparison.Ordinal)\u0060 also satisfies \u0060text.Contains(\u0022HttpClient\u0022, StringComparison.Ordinal)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/OperabilityExtrasAnalyzer.cs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffc2ca5a2f93021357c178d549a2ca90708fed73f51174c6334b72c9670e0e33"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060text.Contains(\u0022AddHttpClient\u0022, StringComparison.Ordinal)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060text.Contains(\u0022AddHttpClient\u0022, StringComparison.Ordinal)\u0060 also satisfies \u0060text.Contains(\u0022HttpClient\u0022, StringComparison.Ordinal)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/OperabilityExtrasAnalyzer.cs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5c628a7938328b6b6321b38d09aaee8ac535975d4684ead60ca4a7092ed0948"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060csproj.Contains(\u0022Nerdbank.GitVersioning\u0022, StringComparison.OrdinalIgnoreCase)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060csproj.Contains(\u0022Nerdbank.GitVersioning\u0022, StringComparison.OrdinalIgnoreCase)\u0060 also satisfies \u0060csproj.Contains(\u0022GitVersion\u0022, StringComparison.OrdinalIgnoreCase)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/ModelAware/OperabilityExtrasAnalyzer.cs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"69ae28239d6af654349da659608c490db4107fdf046c21bb3f921698b290a0c2"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060text.Contains(\u0022IRequestHandler\u0022, StringComparison.Ordinal)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060text.Contains(\u0022IRequestHandler\u0022, StringComparison.Ordinal)\u0060 also satisfies \u0060text.Contains(\u0022Handler\u0022, StringComparison.Ordinal)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs"},"region":{"startLine":4666}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5579361da716fe499e63436a088376aa4c607f2db35a12c2dd09f2f5b65a896"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060text.Contains(\u0022INotificationHandler\u0022, StringComparison.Ordinal)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060text.Contains(\u0022INotificationHandler\u0022, StringComparison.Ordinal)\u0060 also satisfies \u0060text.Contains(\u0022Handler\u0022, StringComparison.Ordinal)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs"},"region":{"startLine":4666}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5c50acbcba15c8f25277167b2f11712042583961f337c7ba064213cc0bfb436"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060text.Contains(\u0022BackgroundService\u0022, StringComparison.Ordinal)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060text.Contains(\u0022BackgroundService\u0022, StringComparison.Ordinal)\u0060 also satisfies \u0060text.Contains(\u0022Service\u0022, StringComparison.Ordinal)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs"},"region":{"startLine":4667}}}],"partialFingerprints":{"codehealthFindingId/v1":"07dc50c22a52c5c3016c87f0062d30b3a304ff8a28784d43040135d725a50b2e"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060text.Contains(\u0022IHostedService\u0022, StringComparison.Ordinal)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060text.Contains(\u0022IHostedService\u0022, StringComparison.Ordinal)\u0060 also satisfies \u0060text.Contains(\u0022Service\u0022, StringComparison.Ordinal)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs"},"region":{"startLine":4667}}}],"partialFingerprints":{"codehealthFindingId/v1":"841e0c0f0ac4fec36169ceccdad66a484b1b830ba4d775a4475861de91753bc4"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060text.Contains(\u0022IServiceCollection\u0022, StringComparison.Ordinal)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060text.Contains(\u0022IServiceCollection\u0022, StringComparison.Ordinal)\u0060 also satisfies \u0060text.Contains(\u0022Service\u0022, StringComparison.Ordinal)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs"},"region":{"startLine":4669}}}],"partialFingerprints":{"codehealthFindingId/v1":"8110964bb6af95908ea2a19a7c0a56bfdda6a352ae1b2bfd822d8ad59d9521cf"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060ciText.Contains(\u0022cargo-fuzz\u0022, StringComparison.OrdinalIgnoreCase)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060ciText.Contains(\u0022cargo-fuzz\u0022, StringComparison.OrdinalIgnoreCase)\u0060 also satisfies \u0060ciText.Contains(\u0022go-fuzz\u0022, StringComparison.OrdinalIgnoreCase)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs"},"region":{"startLine":4831}}}],"partialFingerprints":{"codehealthFindingId/v1":"96e316991d17cc102558f9274dad2727343fbd6a149fb5763d3ee981159de094"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060ciText.Contains(\u0022codehealth analyze\u0022, StringComparison.OrdinalIgnoreCase)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060ciText.Contains(\u0022codehealth analyze\u0022, StringComparison.OrdinalIgnoreCase)\u0060 also satisfies \u0060ciText.Contains(\u0022codehealth \u0022, StringComparison.OrdinalIgnoreCase)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Core/Readiness/ProductionReadinessAnalyzer.cs"},"region":{"startLine":4853}}}],"partialFingerprints":{"codehealthFindingId/v1":"a39d0ca49d26312bad4d85c649e32536bbf8e24306f855fe51b08e753bae6165"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060raw.Length \u003E= 40\u0060 can never decide this \u0060\u0026\u0026\u0060 \u2014 every value satisfying \u0060raw.Length \u003E 40\u0060 also satisfies \u0060raw.Length \u003E= 40\u0060, so the \u0060\u0026\u0026\u0060 chain is already decided by the former. The expression is equivalent to the chain without it, which means it is narrower than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Toolchain/Git/LibGit2GitAccessor.cs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"a123a8a525cb828e8d20d79ca65171fe028e145118eb2a66b4d0bfcc151b350f"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060norm.EndsWith(\u0022/build.rs\u0022, StringComparison.OrdinalIgnoreCase)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060norm.EndsWith(\u0022/build.rs\u0022, StringComparison.OrdinalIgnoreCase)\u0060 also satisfies \u0060norm.EndsWith(\u0022build.rs\u0022, StringComparison.OrdinalIgnoreCase)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Cli/Commands/AnalyzeCommand.cs"},"region":{"startLine":4528}}}],"partialFingerprints":{"codehealthFindingId/v1":"211c25e9b5008bd324b2d9c07aa7babb46525b8ab3bc9b7fbeeace14f0278514"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060first.Contains(\u0022bash\u0022, StringComparison.Ordinal)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060first.Contains(\u0022bash\u0022, StringComparison.Ordinal)\u0060 also satisfies \u0060first.Contains(\u0022sh\u0022, StringComparison.Ordinal)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/src/CodeHealth.Dimensions.Security/SupplyChainProvenanceAnalyzer.PackagingIdentity.cs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"a72dd794658dbbcad1a66a8da605dc4995c81a2f41d518004c01b7a2548579f1"}}],"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-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-22","guid":"b68d9ca7-bdde-d057-a6cc-9f8b1e739552","name":"CWE-22","shortDescription":{"text":"CWE-22"},"helpUri":"https://cwe.mitre.org/data/definitions/22.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":"CWE-353","shortDescription":{"text":"CWE-353"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-426","guid":"7b39d500-c310-9a5d-9a3d-4c2bf49492a3","name":"CWE-426","shortDescription":{"text":"CWE-426"},"helpUri":"https://cwe.mitre.org/data/definitions/426.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-693","guid":"b9b141dc-018a-9c59-8953-1e3c4e020745","name":"CWE-693","shortDescription":{"text":"CWE-693"},"helpUri":"https://cwe.mitre.org/data/definitions/693.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":"Command Injection","shortDescription":{"text":"Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"OS Command Injection","shortDescription":{"text":"OS Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Cross-site Scripting (XSS)","shortDescription":{"text":"Cross-site Scripting (XSS)"},"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":"CWE-829","shortDescription":{"text":"CWE-829"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"SQL Injection","shortDescription":{"text":"SQL Injection"},"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":"Code Injection","shortDescription":{"text":"Code Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]}],"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":36,"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."]}]}