{"$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":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D21","name":"Naming Consistency","shortDescription":{"text":"Naming Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D21"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D31","name":"IaC \u0026 Container Security","shortDescription":{"text":"IaC \u0026 Container Security"},"helpUri":"https://codehealth.canine.dev/dimensions/D31","relationships":[{"target":{"id":"CWE-1032","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-16","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1032","CWE-732","CWE-16"],"owasp":"A02:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX6","name":"Interface segregation","shortDescription":{"text":"Interface segregation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX6"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"GD1","name":"Unfinished \u0026 placeholder code","shortDescription":{"text":"Unfinished \u0026 placeholder code"},"helpUri":"https://codehealth.canine.dev/dimensions/GD1"},{"id":"IC1","name":"Incompleteness \u0026 stubs","shortDescription":{"text":"Incompleteness \u0026 stubs"},"helpUri":"https://codehealth.canine.dev/dimensions/IC1"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"PF1","name":"Benchmark discipline","shortDescription":{"text":"Benchmark discipline"},"helpUri":"https://codehealth.canine.dev/dimensions/PF1"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"S1","name":"Web-Security Posture","shortDescription":{"text":"Web-Security Posture"},"helpUri":"https://codehealth.canine.dev/dimensions/S1"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X16","name":"Unfloored truncation loop","shortDescription":{"text":"Unfloored truncation loop"},"helpUri":"https://codehealth.canine.dev/dimensions/X16"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X3","name":"Exception handling","shortDescription":{"text":"Exception handling"},"helpUri":"https://codehealth.canine.dev/dimensions/X3"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"id":"X5","name":"Nullable reference types","shortDescription":{"text":"Nullable reference types"},"helpUri":"https://codehealth.canine.dev/dimensions/X5"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"OptimizerCore.foldBinaryOp (cyclomatic 236): OptimizerCore.foldBinaryOp has cyclomatic complexity 236 (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":"scalafmt-benchmarks/src/resources/scala-js/OptimizerCore.scala"},"region":{"startLine":2261}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c8d4996c2877ae1836bb0e3ceb7f66689f28edc7986651166ee3b07e5a1944b"}},{"ruleId":"D1","level":"warning","message":{"text":"SplitsAfterLeftParenOrBracket.getNoBinPack (cyclomatic 101): SplitsAfterLeftParenOrBracket.getNoBinPack has cyclomatic complexity 101 (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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala"},"region":{"startLine":1763}}}],"partialFingerprints":{"codehealthFindingId/v1":"48db86cb3b18c849269f61ceed5b0639e9036756344c04ec359e41334fd0d5c2"}},{"ruleId":"D1","level":"warning","message":{"text":"JSCodePhase.genSimpleOp (cyclomatic 89): JSCodePhase.genSimpleOp has cyclomatic complexity 89 (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":"scalafmt-benchmarks/src/resources/scala-js/GenJSCode.scala"},"region":{"startLine":2584}}}],"partialFingerprints":{"codehealthFindingId/v1":"91cb7d4b64bd3b3337de956e3f8eee663dc48ee76eeac27406e16e3682aeb8ed"}},{"ruleId":"D1","level":"warning","message":{"text":"OptimizerCore.transform (cyclomatic 78): OptimizerCore.transform has cyclomatic complexity 78 (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":"scalafmt-benchmarks/src/resources/scala-js/OptimizerCore.scala"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"a812d3926e98d1f0a11d2ab1c7cf06908ba106c9d6592a21ea5d537b0b174d13"}},{"ruleId":"D1","level":"warning","message":{"text":"SplitsAfterLeftBrace.getRest (cyclomatic 76): SplitsAfterLeftBrace.getRest has cyclomatic complexity 76 (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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"660dd9fca1c327b0cbcfad8348297a71a15ec86810eaaf916246128725abe67d"}},{"ruleId":"D1","level":"warning","message":{"text":"SplitsBeforeDot.getSelect (cyclomatic 74): SplitsBeforeDot.getSelect 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala"},"region":{"startLine":2595}}}],"partialFingerprints":{"codehealthFindingId/v1":"835b45ce402d6127b01e6bd05aa3cc2d7dcc4f9139fee1c762059e6a07c54884"}},{"ruleId":"D1","level":"warning","message":{"text":"InfixSplits.getBeforeLhsOrRhs (cyclomatic 61): InfixSplits.getBeforeLhsOrRhs 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/InfixSplits.scala"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"28975dc819130794bcc3a4773dc7136620df7b1737a2882055e03d98e54154b3"}},{"ruleId":"D1","level":"warning","message":{"text":"SplitsAfterLeftParenOrBracket.getArgSiteBinPack (cyclomatic 60): SplitsAfterLeftParenOrBracket.getArgSiteBinPack has cyclomatic complexity 60 (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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala"},"region":{"startLine":1512}}}],"partialFingerprints":{"codehealthFindingId/v1":"adf2c89c524069b0e5ef8e74b2397eeda7bd0a546cee28cce0fa24d57936962e"}},{"ruleId":"D1","level":"warning","message":{"text":"JSCodePhase.genStatOrExpr (cyclomatic 52): JSCodePhase.genStatOrExpr 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":"scalafmt-benchmarks/src/resources/scala-js/GenJSCode.scala"},"region":{"startLine":1345}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e8079792b5da961399fa6764c1933e32d683dcfaefa3a6367aa44bbb70ef5f1"}},{"ruleId":"D1","level":"warning","message":{"text":"OptimizerCore.callIntrinsic (cyclomatic 52): OptimizerCore.callIntrinsic has cyclomatic complexity 52 (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":"scalafmt-benchmarks/src/resources/scala-js/OptimizerCore.scala"},"region":{"startLine":1510}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1337532ec0be9661f031d77d827e9bba3b3b9c0a98a4f29716865c5dd533bf4"}},{"ruleId":"D1","level":"warning","message":{"text":"SplitsBeforeLeftParenOrBracket.get (cyclomatic 46): SplitsBeforeLeftParenOrBracket.get 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala"},"region":{"startLine":1237}}}],"partialFingerprints":{"codehealthFindingId/v1":"939a6ba874dc67b1d514c30a7d71906f7fecf54202d2297f32526bb17ed59623"}},{"ruleId":"D1","level":"warning","message":{"text":"FormatOps.insideInfixSplit (cyclomatic 45): FormatOps.insideInfixSplit has cyclomatic complexity 45 (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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatOps.scala"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8fe9e0fd6a7a8992fbe2739e7e8959e5f2f4018ce1d4ade55c7eeea616e15ec"}},{"ruleId":"D1","level":"warning","message":{"text":"FormatOps.getSlbEndOnLeft (cyclomatic 44): FormatOps.getSlbEndOnLeft has cyclomatic complexity 44 (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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatOps.scala"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ab207a5e37bb1a365edc644ed14a4da97f13adaed28eb331e56f1f91a6a0234"}},{"ruleId":"D1","level":"warning","message":{"text":"BestFirstSearch.shortestPath (cyclomatic 43): BestFirstSearch.shortestPath 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/BestFirstSearch.scala"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc5d82c16bfe68c3051cf41524697b95352a857395c71bb473bd1f7d5a88209d"}},{"ruleId":"D1","level":"warning","message":{"text":"OptimizerCore.foldUnaryOp (cyclomatic 41): OptimizerCore.foldUnaryOp has cyclomatic complexity 41 (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":"scalafmt-benchmarks/src/resources/scala-js/OptimizerCore.scala"},"region":{"startLine":2084}}}],"partialFingerprints":{"codehealthFindingId/v1":"98cc86e8c255591f23b39ba5ced9759436ce373d20b8ffc112d1663e31c114ff"}},{"ruleId":"D1","level":"warning","message":{"text":"Fold.addClausesToGroup (cyclomatic 41): Fold.addClausesToGroup has cyclomatic complexity 41 (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":"scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/Imports.scala"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"36d62f97b65267567f97511e6473d0adcbd54d9b429c9ee84eab7f3754fd510b"}},{"ruleId":"D1","level":"warning","message":{"text":"RewriteLiterals.prettyPrintFloatingPoint (cyclomatic 38): RewriteLiterals.prettyPrintFloatingPoint 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/RewriteLiterals.scala"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ab2b819e51f6b8aefefef5fa47b3eed8bc8c85922bbd0923be5984dda9a01bb"}},{"ruleId":"D1","level":"warning","message":{"text":"SplitsAfterComma.get (cyclomatic 37): SplitsAfterComma.get 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala"},"region":{"startLine":2391}}}],"partialFingerprints":{"codehealthFindingId/v1":"500f3fe6f16d05d47619996f7ceabdd68424563985b90e2c5ce7b5fcf2f5147e"}},{"ruleId":"D1","level":"warning","message":{"text":"RedundantBraces.onLeftBrace (cyclomatic 37): RedundantBraces.onLeftBrace 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/RedundantBraces.scala"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cda2bb00744961cd2f4f2261a56512009c01c6c223577444b5e9e25ff781ede"}},{"ruleId":"D1","level":"warning","message":{"text":"RedundantParens.okToReplaceWithCount (cyclomatic 37): RedundantParens.okToReplaceWithCount has cyclomatic complexity 37 (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":"scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/RedundantParens.scala"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"2564a2a15bec4621a8c334d1590a8d3ec4b1892216db64b7696ed74507ed3f63"}},{"ruleId":"D1","level":"warning","message":{"text":"JSCodePhase.genJSPrimitive (cyclomatic 36): JSCodePhase.genJSPrimitive has cyclomatic complexity 36 (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":"scalafmt-benchmarks/src/resources/scala-js/GenJSCode.scala"},"region":{"startLine":3292}}}],"partialFingerprints":{"codehealthFindingId/v1":"2be59f84c997e84040428b0a048af30e994931ee9e743f16a6f609e92e1492b4"}},{"ruleId":"D1","level":"warning","message":{"text":"TreeOps.getStyleAndOwners (cyclomatic 36): TreeOps.getStyleAndOwners 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/util/TreeOps.scala"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e16199a97c9634b7ad00968e79370bc708a6915e1bbd99b2c1e9022c8fa0f6b"}},{"ruleId":"D1","level":"warning","message":{"text":"FormatOps.verticalMultiline (cyclomatic 35): FormatOps.verticalMultiline has cyclomatic complexity 35 (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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatOps.scala"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a21fd74ed019368157876e1f443f29cd0bd2e4725ae106e19223a985c05e339"}},{"ruleId":"D1","level":"warning","message":{"text":"FormatLocations.alignmentTokens (cyclomatic 35): FormatLocations.alignmentTokens 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatWriter.scala"},"region":{"startLine":1211}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee02a39b042525c72fcfeae39836255f678a330e9b43b61424147c301f2745bc"}},{"ruleId":"D1","level":"warning","message":{"text":"AlignBlock.tryAppendToBlock (cyclomatic 35): AlignBlock.tryAppendToBlock has cyclomatic complexity 35 (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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatWriter.scala"},"region":{"startLine":1912}}}],"partialFingerprints":{"codehealthFindingId/v1":"effb450f9197b81768eab9358017e658b62ec35587e896f6e91c170369ed18b2"}},{"ruleId":"D1","level":"warning","message":{"text":"Builder.processForStatements (cyclomatic 35): Builder.processForStatements has cyclomatic complexity 35 (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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/OptimizationEntities.scala"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"f76db6d81c69bc154342e56fbffb41c4ef0979988adb865657e1e2f8afebee23"}},{"ruleId":"D1","level":"warning","message":{"text":"OptimizerCore.foldIf (cyclomatic 34): OptimizerCore.foldIf has cyclomatic complexity 34 (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":"scalafmt-benchmarks/src/resources/scala-js/OptimizerCore.scala"},"region":{"startLine":1918}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dcdbeca760be21d567be90b8f7c0e77d054a7e1dfc57989b0fb70c3f6b1bd81"}},{"ruleId":"D1","level":"warning","message":{"text":"FormatWriter.checkInsertBraces (cyclomatic 34): FormatWriter.checkInsertBraces has cyclomatic complexity 34 (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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatWriter.scala"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"f765f5ef26219f8c125dcd1ca98593471eebd2925c0c638740b20681b93b590d"}},{"ruleId":"D1","level":"warning","message":{"text":"State.next (cyclomatic 33): State.next 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/State.scala"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4ce93d924c9b889cc4cb51b4a63f86b136a977694b1469572e6c7cc97239a47"}},{"ruleId":"D1","level":"warning","message":{"text":"RemoveScala3OptionalBraces.onLeftForBlock (cyclomatic 32): RemoveScala3OptionalBraces.onLeftForBlock has cyclomatic complexity 32 (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":"scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/RemoveScala3OptionalBraces.scala"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6fd7875c56bf4da5a78db9425636c640324b08d74d49aec172aa889db21ebc2"}},{"ruleId":"D1","level":"warning","message":{"text":"ConvertToNewScala3Syntax.onToken (cyclomatic 31): ConvertToNewScala3Syntax.onToken has cyclomatic complexity 31 (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":"scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/ConvertToNewScala3Syntax.scala"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"d72a6affcb19dd83c39642ed082dda7c1449158de693fbb84511ba05377fa776"}},{"ruleId":"D1","level":"warning","message":{"text":"FormatWriter.getEndMarkerLabel (cyclomatic 28): FormatWriter.getEndMarkerLabel has cyclomatic complexity 28 (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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatWriter.scala"},"region":{"startLine":2155}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ad7344a16092004ee3d4d00d29595da01cd7d1c68cb2cb2cfb5e74e50fcc453"}},{"ruleId":"D1","level":"warning","message":{"text":"OptimizerCore.pretransformExpr (cyclomatic 27): OptimizerCore.pretransformExpr has cyclomatic complexity 27 (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":"scalafmt-benchmarks/src/resources/scala-js/OptimizerCore.scala"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"05c71615c62408e0084f5c5c358c3a12d92ddba92d36c263e06eac4bd93b6815"}},{"ruleId":"D1","level":"warning","message":{"text":"FormatOps.getBinpackSiteFlags (cyclomatic 27): FormatOps.getBinpackSiteFlags has cyclomatic complexity 27 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatOps.scala"},"region":{"startLine":1426}}}],"partialFingerprints":{"codehealthFindingId/v1":"72bf61fae6ce1607c4a13f2823fe7b13420dc3eb7ccb70e946214d66b9b05a15"}},{"ruleId":"D1","level":"warning","message":{"text":"CtrlBodySplits.foldedNonEmptyNonComment (cyclomatic 27): CtrlBodySplits.foldedNonEmptyNonComment 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatOps.scala"},"region":{"startLine":1018}}}],"partialFingerprints":{"codehealthFindingId/v1":"e74e8dbe54e2adf6ab967841c6ea53108df9b7bfea0eeba4f350bf3ccbff90db"}},{"ruleId":"D1","level":"warning","message":{"text":"State.getOverflowPenalty (cyclomatic 27): State.getOverflowPenalty has cyclomatic complexity 27 (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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/State.scala"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"861f15cc7ae260b68a60715f29d8bce3a6bb1bb268a3981a7358f1cb59f7d93c"}},{"ruleId":"D1","level":"warning","message":{"text":"JSCodePhase.tryGenAndRecordAnonFunctionClassGeneric (cyclomatic 25): JSCodePhase.tryGenAndRecordAnonFunctionClassGeneric 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":"scalafmt-benchmarks/src/resources/scala-js/GenJSCode.scala"},"region":{"startLine":4177}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbd38333619eb7d94161dd6fccbf91a3be0f945cddddc0bc382aa84bb9280060"}},{"ruleId":"D1","level":"warning","message":{"text":"RedundantBraces.shouldRemoveSingleStatBlock (cyclomatic 25): RedundantBraces.shouldRemoveSingleStatBlock 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/RedundantBraces.scala"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ee8091362f7a30450b6931b2996919f6f60f5cbf84a180856f85508ca5b8440"}},{"ruleId":"D1","level":"warning","message":{"text":"RemoveScala3OptionalBraces.onToken (cyclomatic 25): RemoveScala3OptionalBraces.onToken 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/RemoveScala3OptionalBraces.scala"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b6f282311cda65a73b34e8ff9e229570f2ba888d05ba14a162a2f182636d41b"}},{"ruleId":"D1","level":"warning","message":{"text":"JSCodePhase.genApplyDynamic (cyclomatic 24): JSCodePhase.genApplyDynamic 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":"scalafmt-benchmarks/src/resources/scala-js/GenJSCode.scala"},"region":{"startLine":3017}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcf9e6bd0ac60da7987e1a213f2627996517d01e65c150d920d95e1c7231389d"}},{"ruleId":"D1","level":"warning","message":{"text":"ScalafmtConfig.checkErrors (cyclomatic 24): ScalafmtConfig.checkErrors 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/config/ScalafmtConfig.scala"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fd90c8cf4aef2cf8a47af8d17438b46b3ed0f1180a847403e9b06e31319af7a"}},{"ruleId":"D1","level":"warning","message":{"text":"SplitsAfterIdent.get (cyclomatic 24): SplitsAfterIdent.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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala"},"region":{"startLine":2900}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c3b209005fc153eddd7b0dbad879d0f7bfcfbb444e3ee6432e9d35448b79a09"}},{"ruleId":"D1","level":"warning","message":{"text":"AvoidInfix.rewriteImpl (cyclomatic 24): AvoidInfix.rewriteImpl 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/AvoidInfix.scala"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"141333d827389d427c02280274999412580f071ee15be3090f1b5e9e31779791"}},{"ruleId":"D1","level":"warning","message":{"text":"ExpandBase.processImports (cyclomatic 24): ExpandBase.processImports 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/Imports.scala"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"09cf1abe33ee6bc0860a5a662e3f50dcffd292948f3913ef45fabbc1f9d5f844"}},{"ruleId":"D1","level":"warning","message":{"text":"RedundantBraces.onLeftParen (cyclomatic 24): RedundantBraces.onLeftParen 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/RedundantBraces.scala"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"daa5328c00304bca7b34153c810d5ea8de430f8af5296234a1eb4b8912d05a84"}},{"ruleId":"D1","level":"warning","message":{"text":"RedundantBraces.okToRemoveBlock (cyclomatic 24): RedundantBraces.okToRemoveBlock 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/RedundantBraces.scala"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"1185914e8fae6c88dd558b332a3cc815c48ffa9674ece479acf86a563d0e7c29"}},{"ruleId":"D1","level":"warning","message":{"text":"JSCodePhase.genMethodWithCurrentLocalNameScope (cyclomatic 23): JSCodePhase.genMethodWithCurrentLocalNameScope 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":"scalafmt-benchmarks/src/resources/scala-js/GenJSCode.scala"},"region":{"startLine":1020}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0f77250640e92ef32d89c852f64eef48dbaf9b9147c174bfec356b3dfd0ce22"}},{"ruleId":"D1","level":"warning","message":{"text":"SplitsAfterLeftParenOrBracket.getParamSiteBinPack (cyclomatic 23): SplitsAfterLeftParenOrBracket.getParamSiteBinPack 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala"},"region":{"startLine":1677}}}],"partialFingerprints":{"codehealthFindingId/v1":"c03a7a756cde14649eebc311f0a219fb6aa04de299f2f54376f2cc7cf72f1ad9"}},{"ruleId":"D1","level":"warning","message":{"text":"TreeOps.addDialectFeatures (cyclomatic 23): TreeOps.addDialectFeatures has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-core/shared/src/main/scala/org/scalafmt/util/TreeOps.scala"},"region":{"startLine":1196}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8b46d7a761f96d0b6d35f589818f11392356510908e38b70a61dc82b395b043"}},{"ruleId":"D1","level":"warning","message":{"text":"Router.getSplits (cyclomatic 22): Router.getSplits 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Router.scala"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f7ca9413a81a05844b16ce24bc421eb8acd524ec5307b91f6d25a4d9182dd34"}},{"ruleId":"D1","level":"warning","message":{"text":"SplitsBeforeStatement.get (cyclomatic 22): SplitsBeforeStatement.get 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2ab609b276d4ad4d9c1473e94f395b4f9eef69ce8587b359225dcec0fb7caff"}},{"ruleId":"D1","level":"warning","message":{"text":"FormatTokensRewrite.getRewrittenTokens (cyclomatic 22): FormatTokensRewrite.getRewrittenTokens 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/FormatTokensRewrite.scala"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca97eb88313efa988e40ba2ac1a3a504c69070049d5532adc95c75f9b1a5c869"}},{"ruleId":"D1","level":"warning","message":{"text":"Entry.formatWhitespace (cyclomatic 21): Entry.formatWhitespace 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatWriter.scala"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ddbdc3f88393dd472d046d53a5c38ead0f68cd825f7cea893aed8be054b440f"}},{"ruleId":"D1","level":"warning","message":{"text":"SplitsAfterFunctionArrow.functionOrSelf (cyclomatic 21): SplitsAfterFunctionArrow.functionOrSelf 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala"},"region":{"startLine":870}}}],"partialFingerprints":{"codehealthFindingId/v1":"63cbe3c4aa2159b1f314e355de597778ce7c2961b38afd5ef626881bc44b92f6"}},{"ruleId":"D1","level":"warning","message":{"text":"BaseLinker.linkedClassDef (cyclomatic 20): BaseLinker.linkedClassDef 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":"scalafmt-benchmarks/src/resources/scala-js/BaseLinker.scala"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"6812c4b259f7127f442a53cb66904209931bfe1ca9b0ee8335907fd883b61cb8"}},{"ruleId":"D1","level":"warning","message":{"text":"BinPackOneline.policyOnRightDelim (cyclomatic 20): BinPackOneline.policyOnRightDelim has cyclomatic complexity 20 (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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatOps.scala"},"region":{"startLine":1539}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6a050d32e55902c86dea74d6f32c4ee071c0d8e50d6dfa26045fd881cc44822"}},{"ruleId":"D1","level":"warning","message":{"text":"SplitsAfterCase.getCaseTree (cyclomatic 20): SplitsAfterCase.getCaseTree 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala"},"region":{"startLine":3418}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f62afd7c7e912d5a1a100809b4c5b592d207e837519a8bb8541ce7b10eca1ba"}},{"ruleId":"D1","level":"warning","message":{"text":"RemoveScala3OptionalBraces.onRightFromBraces (cyclomatic 20): RemoveScala3OptionalBraces.onRightFromBraces 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/RemoveScala3OptionalBraces.scala"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"df32b8270c52c649a133acbf732fbbaf46560cd8b93c262437c4604c5247fd88"}},{"ruleId":"D1","level":"warning","message":{"text":"Division.modInverseLorencz (cyclomatic 19): Division.modInverseLorencz 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":"scalafmt-benchmarks/src/resources/scala-js/Division.scala"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"81fb737e877286efdf2b199f1b740d1529d418e6fa1464f8ab12e1b0b27ec64e"}},{"ruleId":"D1","level":"warning","message":{"text":"JSCodePhase.genJSCallGeneric (cyclomatic 19): JSCodePhase.genJSCallGeneric 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":"scalafmt-benchmarks/src/resources/scala-js/GenJSCode.scala"},"region":{"startLine":3581}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3e0887d05eae34daf59ae47766a1186f23ca188f25dfe9c2d43cc8e3ac6efb3"}},{"ruleId":"D1","level":"warning","message":{"text":"OptimizerCore.pretransformApply (cyclomatic 19): OptimizerCore.pretransformApply 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":"scalafmt-benchmarks/src/resources/scala-js/OptimizerCore.scala"},"region":{"startLine":1125}}}],"partialFingerprints":{"codehealthFindingId/v1":"854839fd3b155cdd878363d4cfe1de47e2dc40e016f9fefc51e0f7a222078f75"}},{"ruleId":"D1","level":"warning","message":{"text":"FormatWriter.mkString (cyclomatic 19): FormatWriter.mkString 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatWriter.scala"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb5d0bf74934ac57ff40f094a92344c31597ced0b7f2ed09032721b6e0060fc0"}},{"ruleId":"D1","level":"warning","message":{"text":"FormatLocations.getAlignContainerParent (cyclomatic 19): FormatLocations.getAlignContainerParent 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatWriter.scala"},"region":{"startLine":1359}}}],"partialFingerprints":{"codehealthFindingId/v1":"0abd398d5f8b491ec1e10321491f574a2b7f64b94d89cfb91e5618b484f46411"}},{"ruleId":"D1","level":"warning","message":{"text":"Imports.validateImports (cyclomatic 19): Imports.validateImports 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/Imports.scala"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"76b3c6147fbf20dfbee4edbc4e516e94473907dfbe483d20532636fa18872026"}},{"ruleId":"D1","level":"warning","message":{"text":"JSCodePhase.genClass (cyclomatic 18): JSCodePhase.genClass 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":"scalafmt-benchmarks/src/resources/scala-js/GenJSCode.scala"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"d36f8d41fb78b788330ab602dbd79438bc5068d9927272a3796a879643a2cc5a"}},{"ruleId":"D1","level":"warning","message":{"text":"OptimizerCore.withNewLocalDef (cyclomatic 18): OptimizerCore.withNewLocalDef 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":"scalafmt-benchmarks/src/resources/scala-js/OptimizerCore.scala"},"region":{"startLine":3191}}}],"partialFingerprints":{"codehealthFindingId/v1":"b86cb01543e4824fd3fd6a994f0240f58effd401b57c579849514083752ce40b"}},{"ruleId":"D1","level":"warning","message":{"text":"HiveMetastoreCatalog.createDataSourceTable (cyclomatic 18): HiveMetastoreCatalog.createDataSourceTable 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":"scalafmt-benchmarks/src/resources/spark/HiveMetastoreCatalog.scala"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a62dc73584018c3321b3054982b917ae6202f7b974442ee7c1be50a6511a27d"}},{"ruleId":"D1","level":"warning","message":{"text":"SplitsAfterLeftParen.getRest (cyclomatic 18): SplitsAfterLeftParen.getRest 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala"},"region":{"startLine":2107}}}],"partialFingerprints":{"codehealthFindingId/v1":"8132f0276f7569b6dc1df09756f63902fac7e024c87cb80718aa800bf43146dd"}},{"ruleId":"D1","level":"warning","message":{"text":"State.getRelativeToLhsLastLineEnd (cyclomatic 18): State.getRelativeToLhsLastLineEnd 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/State.scala"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b6b3c93ef5ce0a550d651df2df406bcf1c81ed5f8b081ccf36e4f69e0d7c3f1"}},{"ruleId":"D1","level":"warning","message":{"text":"DefaultMessageDispatcher.dispatch (cyclomatic 17): DefaultMessageDispatcher.dispatch has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-benchmarks/src/resources/Endpoint.scala"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"dda08d12d40f68119e27085d2e7ea1a33f9fd65a75947b8e042ec9f4388d3d83"}},{"ruleId":"D1","level":"warning","message":{"text":"JSCodePhase.apply (cyclomatic 17): JSCodePhase.apply 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":"scalafmt-benchmarks/src/resources/scala-js/GenJSCode.scala"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbde981e4ce657841358a359942127f9310b04445013a0c35023d6e5da02ab36"}},{"ruleId":"D1","level":"warning","message":{"text":"ScalaJSClassEmitter.genInstanceTests (cyclomatic 17): ScalaJSClassEmitter.genInstanceTests 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":"scalafmt-benchmarks/src/resources/scala-js/ScalaJSClassEmitter.scala"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"19aec97b20a9e7f70b72fb824d69c6ebf55dc026e896e6e7bf4ff45385efeb7f"}},{"ruleId":"D1","level":"warning","message":{"text":"FormatWriter.checkRemoveEndMarkers (cyclomatic 17): FormatWriter.checkRemoveEndMarkers 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatWriter.scala"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"f939eb605357abd34387795b640a3d82f40dd23d309cf1048849adaafc52352d"}},{"ruleId":"D1","level":"warning","message":{"text":"FormatMlDoc.formatTerm (cyclomatic 17): FormatMlDoc.formatTerm 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatWriter.scala"},"region":{"startLine":930}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a90779e62ec686865eb6ab9763d19defa03c64608f8340ecc4bbc01e0620549"}},{"ruleId":"D1","level":"warning","message":{"text":"ColonEolImpl.onArgClause (cyclomatic 17): ColonEolImpl.onArgClause has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This is NOT this file\u0027s highest cyclomatic complexity: OptionalBraces.getWithBrace (cyclomatic 21) 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/OptionalBraces.scala"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"69c0ef5bb20b4eef86bfd498d0ae9c072370823ef53045e16ed807cc9b744519"}},{"ruleId":"D1","level":"warning","message":{"text":"SplitsBeforeLeftBrace.get (cyclomatic 17): SplitsBeforeLeftBrace.get 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"87f6fac9144ac777362a0cfad48189c94344f7939a575534cbb32305799e404f"}},{"ruleId":"D1","level":"warning","message":{"text":"RedundantBraces.onRightBrace (cyclomatic 17): RedundantBraces.onRightBrace 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/RedundantBraces.scala"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"a50ae5d96f303e156313c4df03a328896a687759373b08784bbe91271735e3a0"}},{"ruleId":"D1","level":"warning","message":{"text":"EndpointWriter.sendBufferedMessages (cyclomatic 16): EndpointWriter.sendBufferedMessages 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":"scalafmt-benchmarks/src/resources/Endpoint.scala"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba966242096bb094169377423903e60809f239d8539570cd31f0ad7f42f5414b"}},{"ruleId":"D1","level":"warning","message":{"text":"MethodInfo.doReach (cyclomatic 16): MethodInfo.doReach 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":"scalafmt-benchmarks/src/resources/scala-js/Analyzer.scala"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb5e755be85ec8ee3d17ac5b98bb1df0f6ca75b66fb3c545895e3ad266dd245a"}},{"ruleId":"D1","level":"warning","message":{"text":"FormatWriter.getFormatLocations (cyclomatic 16): FormatWriter.getFormatLocations 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatWriter.scala"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5f7e37c5b16d88e721869d0b7752b43d61b613436057708d8b843e2b4e06e72"}},{"ruleId":"D1","level":"warning","message":{"text":"RedundantBraces.canRewriteStatWithParens (cyclomatic 16): RedundantBraces.canRewriteStatWithParens 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/RedundantBraces.scala"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"b376b5ef52e63fa4681000e857ebecc45eb90cc29d3e8f51ccc86085ff611958"}},{"ruleId":"D2","level":"warning","message":{"text":"OptimizerCore.foldBinaryOp (cognitive 222): OptimizerCore.foldBinaryOp has cognitive complexity 222 (threshold 15). Drivers by points: if/else 71 (106 pts), match/switch 49 (104 pts), boolean chains 12 (nesting depth added 90). 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":"scalafmt-benchmarks/src/resources/scala-js/OptimizerCore.scala"},"region":{"startLine":2261}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ccdb63778827766e45255baa9b7d69eb92d7f3adcc57efed9618bde4472d66f"}},{"ruleId":"D2","level":"warning","message":{"text":"SplitsAfterLeftParenOrBracket.getNoBinPack (cognitive 152): SplitsAfterLeftParenOrBracket.getNoBinPack has cognitive complexity 152 (threshold 15). Drivers by points: if/else 68 (88 pts), boolean chains 53, match/switch 7 (11 pts) (nesting depth added 24). 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala"},"region":{"startLine":1763}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d0bc2c780c8c83bf93dd9b9fa166a4e389503887fe23db71d721dc6b48cd675"}},{"ruleId":"D2","level":"warning","message":{"text":"SplitsBeforeDot.getSelect (cognitive 145): SplitsBeforeDot.getSelect has cognitive complexity 145 (threshold 15). Drivers by points: if/else 68 (102 pts), boolean chains 22, match/switch 9 (21 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala"},"region":{"startLine":2595}}}],"partialFingerprints":{"codehealthFindingId/v1":"498a1d0255425d0996349836ad5e6ae9ca3d67a46847e4728c676d9b3c7fb274"}},{"ruleId":"D2","level":"warning","message":{"text":"SplitsAfterLeftBrace.getRest (cognitive 133): SplitsAfterLeftBrace.getRest has cognitive complexity 133 (threshold 15). Drivers by points: if/else 65 (85 pts), match/switch 17 (31 pts), boolean chains 17 (nesting depth added 34). 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"16bc9696caf6e9b2d68d36723555af71a0d10755771d169d338296b77cbf1eed"}},{"ruleId":"D2","level":"warning","message":{"text":"BestFirstSearch.shortestPath (cognitive 115): BestFirstSearch.shortestPath has cognitive complexity 115 (threshold 15). Drivers by points: if/else 39 (90 pts), boolean chains 13, match/switch 1 (7 pts), loops 2 (5 pts) (nesting depth added 60). 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/BestFirstSearch.scala"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba270d3abea44dc5e38eed1ff48e9f3ec866e82d6897e68da98acfed97d9f533"}},{"ruleId":"D2","level":"warning","message":{"text":"InfixSplits.getBeforeLhsOrRhs (cognitive 103): InfixSplits.getBeforeLhsOrRhs has cognitive complexity 103 (threshold 15). Drivers by points: if/else 54 (72 pts), boolean chains 25, match/switch 5 (6 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/InfixSplits.scala"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"7056c54c0fa777f5d270b836fb1e62b799289eb4459845e59f359be4f8bf89e0"}},{"ruleId":"D2","level":"warning","message":{"text":"SplitsAfterLeftParenOrBracket.getArgSiteBinPack (cognitive 97): SplitsAfterLeftParenOrBracket.getArgSiteBinPack has cognitive complexity 97 (threshold 15). Drivers by points: if/else 49 (61 pts), boolean chains 24, match/switch 6 (12 pts) (nesting depth added 18). 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala"},"region":{"startLine":1512}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6acf2343f23df141a4ef7f89409ff6a08a8ae43f002d929c968d96018c6c039"}},{"ruleId":"D2","level":"warning","message":{"text":"State.next (cognitive 93): State.next has cognitive complexity 93 (threshold 15). Drivers by points: if/else 42 (81 pts), loops 2 (6 pts), match/switch 3 (4 pts), boolean chains 2 (nesting depth added 44). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/State.scala"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"9407ee148cc8f9a3afe92df6a26bcea20e192a6bf6f3dc3b3e849fc680017d8e"}},{"ruleId":"D2","level":"warning","message":{"text":"SplitsBeforeLeftParenOrBracket.get (cognitive 90): SplitsBeforeLeftParenOrBracket.get has cognitive complexity 90 (threshold 15). Drivers by points: if/else 37 (54 pts), match/switch 11 (28 pts), boolean chains 8 (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala"},"region":{"startLine":1237}}}],"partialFingerprints":{"codehealthFindingId/v1":"247425067449900d84be83767681e90453c701759527b0b30c51f9899b893777"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeOps.getStyleAndOwners (cognitive 86): TreeOps.getStyleAndOwners has cognitive complexity 86 (threshold 15). Drivers by points: if/else 30 (73 pts), boolean chains 8, match/switch 2 (3 pts), loops 1 (2 pts) (nesting depth added 45). 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/util/TreeOps.scala"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"83b56716465785dbbb188590283b4eec0b71f72a3be7dd5f961392e823e5614a"}},{"ruleId":"D2","level":"warning","message":{"text":"JSCodePhase.genSimpleOp (cognitive 81): JSCodePhase.genSimpleOp has cognitive complexity 81 (threshold 15). Drivers by points: if/else 25 (41 pts), match/switch 13 (36 pts), boolean chains 4 (nesting depth added 39). 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":"scalafmt-benchmarks/src/resources/scala-js/GenJSCode.scala"},"region":{"startLine":2584}}}],"partialFingerprints":{"codehealthFindingId/v1":"311c1e948bca1ec4821be40586cb18175b6a804f67d72292db8c5a31d29c5d26"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatOps.insideInfixSplit (cognitive 75): FormatOps.insideInfixSplit has cognitive complexity 75 (threshold 15). Drivers by points: if/else 35 (46 pts), boolean chains 16, match/switch 7 (13 pts) (nesting depth added 17). 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatOps.scala"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"afc261dbb6d7051eae43ace7d45220a3fec7c33f87540eedfb7d249fa81dcaaa"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatLocations.alignmentTokens (cognitive 74): FormatLocations.alignmentTokens has cognitive complexity 74 (threshold 15). Drivers by points: if/else 21 (58 pts), boolean chains 14, loops 1 (2 pts) (nesting depth added 38). 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatWriter.scala"},"region":{"startLine":1211}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e6b46b4a09ff5625b28778b9f5011d92807fadba4bbcf00fba6f5f458ececa5"}},{"ruleId":"D2","level":"warning","message":{"text":"OptimizerCore.transform (cognitive 71): OptimizerCore.transform has cognitive complexity 71 (threshold 15). Drivers by points: if/else 27 (41 pts), match/switch 13 (29 pts), boolean chains 1 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-benchmarks/src/resources/scala-js/OptimizerCore.scala"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1e6fffac97f55ca6eb895348c47420ae30c7882fc7747656f1069fef78f51fa"}},{"ruleId":"D2","level":"warning","message":{"text":"RewriteLiterals.prettyPrintFloatingPoint (cognitive 67): RewriteLiterals.prettyPrintFloatingPoint has cognitive complexity 67 (threshold 15). Drivers by points: if/else 42 (57 pts), boolean chains 8, match/switch 1 (2 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/RewriteLiterals.scala"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"a13b16fa19cb6d7df644a27cef805473822af8ef189bb225f2600f90d56a00b2"}},{"ruleId":"D2","level":"warning","message":{"text":"OptimizerCore.pretransformApply (cognitive 61): OptimizerCore.pretransformApply has cognitive complexity 61 (threshold 15). Drivers by points: if/else 18 (33 pts), match/switch 5 (25 pts), boolean chains 3 (nesting depth added 35). 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":"scalafmt-benchmarks/src/resources/scala-js/OptimizerCore.scala"},"region":{"startLine":1125}}}],"partialFingerprints":{"codehealthFindingId/v1":"da5116fdb7213b1a3b769712179dcb91522b700bb5fb0908f881454e7e306d48"}},{"ruleId":"D2","level":"warning","message":{"text":"JSCodePhase.genStatOrExpr (cognitive 59): JSCodePhase.genStatOrExpr has cognitive complexity 59 (threshold 15). Drivers by points: if/else 29 (48 pts), match/switch 5 (9 pts), boolean chains 2 (nesting depth added 23). 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":"scalafmt-benchmarks/src/resources/scala-js/GenJSCode.scala"},"region":{"startLine":1345}}}],"partialFingerprints":{"codehealthFindingId/v1":"8571efa50f7d5abea20b33c9e36eb7fc52d32cedcb5b44ce915b9289708e76d8"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatOps.getSlbEndOnLeft (cognitive 57): FormatOps.getSlbEndOnLeft has cognitive complexity 57 (threshold 15). Drivers by points: if/else 22 (31 pts), match/switch 8 (19 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatOps.scala"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"556e81413a0e418463e911026a4d0eae6081dba6af4beffb7161ecb9d9ffb166"}},{"ruleId":"D2","level":"warning","message":{"text":"SplitsAfterComma.get (cognitive 57): SplitsAfterComma.get has cognitive complexity 57 (threshold 15). Drivers by points: if/else 24 (33 pts), boolean chains 15, match/switch 4 (9 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala"},"region":{"startLine":2391}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef16044d5f31725cab51bec0ae21d41cbfd826f7484f4104c14ae0472d859fe1"}},{"ruleId":"D2","level":"warning","message":{"text":"SplitsAfterLeftParenOrBracket.getParamSiteBinPack (cognitive 55): SplitsAfterLeftParenOrBracket.getParamSiteBinPack has cognitive complexity 55 (threshold 15). Drivers by points: if/else 29 (46 pts), match/switch 2 (6 pts), boolean chains 3 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala"},"region":{"startLine":1677}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddf89094e22293afcb75fe20ff1b75d5b8146b12e38a5077108c33671acbff2f"}},{"ruleId":"D2","level":"warning","message":{"text":"JSCodePhase.genJSPrimitive (cognitive 53): JSCodePhase.genJSPrimitive has cognitive complexity 53 (threshold 15). Drivers by points: match/switch 11 (30 pts), if/else 16 (21 pts), boolean chains 2 (nesting depth added 24). 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":"scalafmt-benchmarks/src/resources/scala-js/GenJSCode.scala"},"region":{"startLine":3292}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bec1873c3d4ae2533bea0fe70be17240961088ecf04c680cc1ab32351665853"}},{"ruleId":"D2","level":"warning","message":{"text":"CtrlBodySplits.foldedNonEmptyNonComment (cognitive 53): CtrlBodySplits.foldedNonEmptyNonComment has cognitive complexity 53 (threshold 15). Drivers by points: if/else 29 (40 pts), match/switch 5 (9 pts), boolean chains 4 (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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatOps.scala"},"region":{"startLine":1018}}}],"partialFingerprints":{"codehealthFindingId/v1":"3028c54b23a7265a65886e247e9703e59828127fd8930531a70aab0a00223e7c"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatWriter.checkInsertBraces (cognitive 51): FormatWriter.checkInsertBraces has cognitive complexity 51 (threshold 15). Drivers by points: if/else 22 (28 pts), boolean chains 16, match/switch 4 (7 pts) (nesting depth added 9). 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatWriter.scala"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"30aff006217781eb2ff06ca421d032a64d5b6a5a12fd7ac3a020a239155a953c"}},{"ruleId":"D2","level":"warning","message":{"text":"JSCodePhase.genApplyDynamic (cognitive 49): JSCodePhase.genApplyDynamic has cognitive complexity 49 (threshold 15). Drivers by points: if/else 14 (29 pts), boolean chains 10, match/switch 2 (8 pts), loops 1 (2 pts) (nesting depth added 22). 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":"scalafmt-benchmarks/src/resources/scala-js/GenJSCode.scala"},"region":{"startLine":3017}}}],"partialFingerprints":{"codehealthFindingId/v1":"0da9788a89fd5bceece2e4c8d3ffcfceeded5895624ef20de556cf408fcd9c83"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatOps.verticalMultiline (cognitive 49): FormatOps.verticalMultiline has cognitive complexity 49 (threshold 15). Drivers by points: if/else 25 (31 pts), boolean chains 9, match/switch 6 (9 pts) (nesting depth added 9). 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatOps.scala"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"e576b856adfcbe4ea7ecb1880729d23d9775e2f95a065e1649cb8e187725db1d"}},{"ruleId":"D2","level":"warning","message":{"text":"RedundantBraces.onLeftBrace (cognitive 49): RedundantBraces.onLeftBrace has cognitive complexity 49 (threshold 15). Drivers by points: if/else 19 (30 pts), boolean chains 11, match/switch 4 (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":"scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/RedundantBraces.scala"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d09e9f5ea40d540602d8dda52b114ba7c8880abed250f3d096c9932c3f6f316"}},{"ruleId":"D2","level":"warning","message":{"text":"OptimizerCore.callIntrinsic (cognitive 46): OptimizerCore.callIntrinsic has cognitive complexity 46 (threshold 15). Drivers by points: match/switch 12 (25 pts), if/else 17 (21 pts) (nesting depth added 17). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-benchmarks/src/resources/scala-js/OptimizerCore.scala"},"region":{"startLine":1510}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecf47d38881de40d526445ccd589cb887c5c9f1e82e703a7e6fa4021584a238b"}},{"ruleId":"D2","level":"warning","message":{"text":"Fold.addClausesToGroup (cognitive 46): Fold.addClausesToGroup has cognitive complexity 46 (threshold 15). Drivers by points: if/else 21 (27 pts), boolean chains 9, match/switch 5 (8 pts), loops 2 (nesting depth added 9). 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/Imports.scala"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac083ee84c61ac4c381f73ec8e940ee1d119915e96f685f0da7e82a89ba4e90c"}},{"ruleId":"D2","level":"warning","message":{"text":"AlignBlock.tryAppendToBlock (cognitive 45): AlignBlock.tryAppendToBlock has cognitive complexity 45 (threshold 15). Drivers by points: if/else 23 (28 pts), boolean chains 15, match/switch 2 (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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatWriter.scala"},"region":{"startLine":1912}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e499a8f2db00ed02b22bcc26abadd2290d06824c5acf4263350062bbd2b1c7a"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeOps.addDialectFeatures (cognitive 45): TreeOps.addDialectFeatures has cognitive complexity 45 (threshold 15). Drivers by points: match/switch 11 (24 pts), if/else 15 (18 pts), boolean chains 3 (nesting depth added 16). 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/util/TreeOps.scala"},"region":{"startLine":1196}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f1f6897b56536fcd634e09a1ac67144cf72ed7a3e2e63a41122bdb87c02d36a"}},{"ruleId":"D2","level":"warning","message":{"text":"Division.modInverseLorencz (cognitive 44): Division.modInverseLorencz has cognitive complexity 44 (threshold 15). Drivers by points: if/else 21 (41 pts), boolean chains 2, loops 1 (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":"scalafmt-benchmarks/src/resources/scala-js/Division.scala"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"45dfeab281dcc730100f4c495e0ea92f63a8e7faaf353f5bd191ab432584e412"}},{"ruleId":"D2","level":"warning","message":{"text":"State.getOverflowPenalty (cognitive 44): State.getOverflowPenalty has cognitive complexity 44 (threshold 15). Drivers by points: if/else 25 (31 pts), boolean chains 8, match/switch 2 (5 pts) (nesting depth added 9). 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/State.scala"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ef5061d756310354213b4fce7ed49dde07be24209b6d45b2f9bb8c29c4cfd13"}},{"ruleId":"D2","level":"warning","message":{"text":"RedundantBraces.onLeftParen (cognitive 43): RedundantBraces.onLeftParen has cognitive complexity 43 (threshold 15). Drivers by points: if/else 17 (25 pts), match/switch 6 (13 pts), boolean chains 5 (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":"scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/RedundantBraces.scala"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3bab7078d2d197fe2b436443413daa721745cfb92457b9899ecf3c779ed3f12"}},{"ruleId":"D2","level":"warning","message":{"text":"OptimizerCore.foldIf (cognitive 42): OptimizerCore.foldIf has cognitive complexity 42 (threshold 15). Drivers by points: boolean chains 20, if/else 10 (15 pts), match/switch 3 (7 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":"scalafmt-benchmarks/src/resources/scala-js/OptimizerCore.scala"},"region":{"startLine":1918}}}],"partialFingerprints":{"codehealthFindingId/v1":"430516fe5e847a30464c530add27ae8ed9c228f9babe27687820ac7a9e20daa7"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatTokensRewrite.getRewrittenTokens (cognitive 39): FormatTokensRewrite.getRewrittenTokens has cognitive complexity 39 (threshold 15). Drivers by points: if/else 20 (34 pts), boolean chains 2, match/switch 2, 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/FormatTokensRewrite.scala"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"7df336a559269d66984b404c596fe6d6dc7c33d005e23c3e674c967e48a6e916"}},{"ruleId":"D2","level":"warning","message":{"text":"JSCodePhase.tryGenAndRecordAnonFunctionClassGeneric (cognitive 38): JSCodePhase.tryGenAndRecordAnonFunctionClassGeneric has cognitive complexity 38 (threshold 15). Drivers by points: if/else 20 (30 pts), boolean chains 6, error handling 1, 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":"scalafmt-benchmarks/src/resources/scala-js/GenJSCode.scala"},"region":{"startLine":4177}}}],"partialFingerprints":{"codehealthFindingId/v1":"c32d298feb853104c4203593eabeb8e159963b438732044733213c712e28dd23"}},{"ruleId":"D2","level":"warning","message":{"text":"OptimizerCore.tryOptimizePatternMatch (cognitive 37): OptimizerCore.tryOptimizePatternMatch has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (23 pts), match/switch 4 (14 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":"scalafmt-benchmarks/src/resources/scala-js/OptimizerCore.scala"},"region":{"startLine":3094}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce6dd6b516fa38ad3c3a64b23bf6c43d39760c3b70664cae86c7a720f47b2044"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatOps.getBinpackSiteFlags (cognitive 37): FormatOps.getBinpackSiteFlags has cognitive complexity 37 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 15, match/switch 3 (5 pts) (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatOps.scala"},"region":{"startLine":1426}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdcd5c1c5026da5e41babd524223eab14ed7d7ee2e7a314f4902aeb31367afe2"}},{"ruleId":"D2","level":"warning","message":{"text":"ExpandBase.processImports (cognitive 37): ExpandBase.processImports has cognitive complexity 37 (threshold 15). Drivers by points: if/else 20 (28 pts), match/switch 4 (6 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/Imports.scala"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"48d4739cd4c06892593bab073d4e4dd70f799ba6899524ecdf883a6fc0b5ab9d"}},{"ruleId":"D2","level":"warning","message":{"text":"Entry.formatWhitespace (cognitive 36): Entry.formatWhitespace has cognitive complexity 36 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 9, match/switch 3 (7 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatWriter.scala"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea43dcbbe13947a83a3a11c5013f30c3e9713f63ebb7bf60c6b7a2f7d325cb57"}},{"ruleId":"D2","level":"warning","message":{"text":"JSCodePhase.genMethodWithCurrentLocalNameScope (cognitive 35): JSCodePhase.genMethodWithCurrentLocalNameScope has cognitive complexity 35 (threshold 15). Drivers by points: if/else 18 (23 pts), boolean chains 9, match/switch 1 (2 pts), loops 1 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"scalafmt-benchmarks/src/resources/scala-js/GenJSCode.scala"},"region":{"startLine":1020}}}],"partialFingerprints":{"codehealthFindingId/v1":"d470cbd96c2cbecc26b433440fe7810660df8c674dfa119284a3bcfa4e8e0592"}},{"ruleId":"D2","level":"warning","message":{"text":"SplitsBeforeRightArrow.get (cognitive 35): SplitsBeforeRightArrow.get has cognitive complexity 35 (threshold 15). Drivers by points: match/switch 7 (22 pts), if/else 9 (12 pts), boolean chains 1 (nesting depth added 18). 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala"},"region":{"startLine":1057}}}],"partialFingerprints":{"codehealthFindingId/v1":"83649a15582b83065ffa42ee347b92a5aa865dc002573bfd1a5e35b319c18b77"}},{"ruleId":"D2","level":"warning","message":{"text":"SplitsAfterLeftParen.getRest (cognitive 35): SplitsAfterLeftParen.getRest has cognitive complexity 35 (threshold 15). Drivers by points: if/else 15 (25 pts), boolean chains 5, match/switch 3 (5 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala"},"region":{"startLine":2107}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5e09b633a44840ad851d8151f15566a3cfa4ad29459d1f17fb1563d80d34003"}},{"ruleId":"D2","level":"warning","message":{"text":"ConvertToNewScala3Syntax.onToken (cognitive 35): ConvertToNewScala3Syntax.onToken has cognitive complexity 35 (threshold 15). Drivers by points: match/switch 8 (15 pts), if/else 12, boolean chains 8 (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":"scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/ConvertToNewScala3Syntax.scala"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"de46b4463641768578f369354aba348bbaf8610dfebdaef9d28f6d703b194dd4"}},{"ruleId":"D2","level":"warning","message":{"text":"OptimizerCore.pretransformExpr (cognitive 34): OptimizerCore.pretransformExpr has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (18 pts), match/switch 6 (13 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 15). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-benchmarks/src/resources/scala-js/OptimizerCore.scala"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"94fd2d481ba9b51898b35a22fb8c288ba50d644c967fe24f8b4029f7f350d32c"}},{"ruleId":"D2","level":"warning","message":{"text":"SplitsBeforeStatement.get (cognitive 34): SplitsBeforeStatement.get has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 12, match/switch 2 (6 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"706ca7ec599c0c1c7202507a1279667d6e35dc303fd1e3219d89777b17577c6f"}},{"ruleId":"D2","level":"warning","message":{"text":"SplitsBeforeLeftBrace.get (cognitive 33): SplitsBeforeLeftBrace.get has cognitive complexity 33 (threshold 15). Drivers by points: if/else 15 (24 pts), match/switch 2 (6 pts), boolean chains 3 (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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"db9d4636bef7678d8f1f8752d04cb20f185096b8360501b0ebac3284b8e14ccf"}},{"ruleId":"D2","level":"warning","message":{"text":"RemoveScala3OptionalBraces.onToken (cognitive 33): RemoveScala3OptionalBraces.onToken has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (18 pts), match/switch 5 (12 pts), boolean chains 3 (nesting depth added 13). 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/RemoveScala3OptionalBraces.scala"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"d17df9f57a86f92f21bc9b3de48922e33a3b65efc3d375be8be4b59267c89eb8"}},{"ruleId":"D2","level":"warning","message":{"text":"ScalaJSClassEmitter.genInstanceTests (cognitive 32): ScalaJSClassEmitter.genInstanceTests has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (21 pts), boolean chains 6, match/switch 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":"scalafmt-benchmarks/src/resources/scala-js/ScalaJSClassEmitter.scala"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8293896a64d383430580de9cb0819f57bd0f78824d1a66c7327637f44626c68"}},{"ruleId":"D2","level":"warning","message":{"text":"AvoidInfix.rewriteImpl (cognitive 32): AvoidInfix.rewriteImpl has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (17 pts), match/switch 5 (9 pts), boolean chains 6 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/AvoidInfix.scala"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"71588273e1f115785e95c05a7f6ffeb1376c46ebd4f54600af4337bc1484f5fd"}},{"ruleId":"D2","level":"warning","message":{"text":"RemoveScala3OptionalBraces.onLeftForBlock (cognitive 32): RemoveScala3OptionalBraces.onLeftForBlock has cognitive complexity 32 (threshold 15). Drivers by points: if/else 16 (21 pts), match/switch 5 (9 pts), boolean chains 2 (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":"scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/RemoveScala3OptionalBraces.scala"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"651f0a1aff703fd139a52b67e659082465f4a4352522a8591f758878a0b3995a"}},{"ruleId":"D2","level":"warning","message":{"text":"Division.divide (cognitive 31): Division.divide has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (26 pts), loops 2 (5 pts) (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":"scalafmt-benchmarks/src/resources/scala-js/Division.scala"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"0afa3ac9984fb28fa89933e26f4df4a0cf1c948f51b03479f1a509c54b838b49"}},{"ruleId":"D2","level":"warning","message":{"text":"OptimizerCore.foldUnaryOp (cognitive 31): OptimizerCore.foldUnaryOp has cognitive complexity 31 (threshold 15). Drivers by points: match/switch 9 (18 pts), if/else 11 (13 pts) (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":"scalafmt-benchmarks/src/resources/scala-js/OptimizerCore.scala"},"region":{"startLine":2084}}}],"partialFingerprints":{"codehealthFindingId/v1":"c75b39b8ae0761c824ec665cc23678fe815fb8acad91ef2d425805e81691527e"}},{"ruleId":"D2","level":"warning","message":{"text":"OptimizerCore.withNewLocalDef (cognitive 30): OptimizerCore.withNewLocalDef has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (19 pts), match/switch 5 (11 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":"scalafmt-benchmarks/src/resources/scala-js/OptimizerCore.scala"},"region":{"startLine":3191}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef378b015d01972433414d6ca0fd5b2e0a33734f8c6398a71f33917d2f8f29d8"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatWriter.checkRemoveEndMarkers (cognitive 30): FormatWriter.checkRemoveEndMarkers has cognitive complexity 30 (threshold 15). Drivers by points: if/else 15 (22 pts), match/switch 3 (5 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatWriter.scala"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb0f650609e55a94ffb02e68cb14c696f3f6bc831c6fc71a032656faa3c75867"}},{"ruleId":"D2","level":"warning","message":{"text":"SplitsAfterFunctionArrow.functionOrSelf (cognitive 30): SplitsAfterFunctionArrow.functionOrSelf has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (15 pts), match/switch 5 (9 pts), boolean chains 6 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala"},"region":{"startLine":870}}}],"partialFingerprints":{"codehealthFindingId/v1":"de708d5969e8411c4d34df53256c45e82fedcf8f8acac88b78bfd919c581a62f"}},{"ruleId":"D2","level":"warning","message":{"text":"SplitsAfterIdent.get (cognitive 30): SplitsAfterIdent.get has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (12 pts), match/switch 5 (12 pts), boolean chains 6 (nesting depth added 10). 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala"},"region":{"startLine":2900}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb40a5243a16aaaffed074906b77641e3c49841d7b716b475463be3a79316fca"}},{"ruleId":"D2","level":"warning","message":{"text":"SplitsAfterCase.getCaseTree (cognitive 30): SplitsAfterCase.getCaseTree has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 6, match/switch 3 (5 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala"},"region":{"startLine":3418}}}],"partialFingerprints":{"codehealthFindingId/v1":"010c0d7bfab08a8fe4c964f3f8dab0e9564d1acf8f4dc429419dafaecf8115db"}},{"ruleId":"D2","level":"warning","message":{"text":"RedundantBraces.shouldRemoveSingleStatBlock (cognitive 30): RedundantBraces.shouldRemoveSingleStatBlock has cognitive complexity 30 (threshold 15). Drivers by points: match/switch 8 (19 pts), if/else 8, boolean chains 3 (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":"scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/RedundantBraces.scala"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d89f0604d1a8266198a50e1a05444064051d6a57babb978ebca36a6f949977c"}},{"ruleId":"D2","level":"warning","message":{"text":"Router.getSplits (cognitive 29): Router.getSplits has cognitive complexity 29 (threshold 15). Drivers by points: if/else 20 (23 pts), match/switch 3 (4 pts), boolean chains 2 (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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Router.scala"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"59b9c556323ec8bb79868a203aafc1e4abdfbd5dc1a80cd8ad1734ed0f50bdb5"}},{"ruleId":"D2","level":"warning","message":{"text":"State.getRelativeToLhsLastLineEnd (cognitive 29): State.getRelativeToLhsLastLineEnd has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 6, match/switch 3 (6 pts) (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/State.scala"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"7991a39beedb7a537ef85893ae199c24b06f6b287aa72590482da90e0430d039"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeOps.findEnclosedBetweenParens (cognitive 29): TreeOps.findEnclosedBetweenParens has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (27 pts), boolean chains 2 (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":"scalafmt-core/shared/src/main/scala/org/scalafmt/util/TreeOps.scala"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7f1e48f3e0819f1d3431f427c5b4ae175fe41c9c0f2b5bf081f4f78dcb032c6"}},{"ruleId":"D2","level":"warning","message":{"text":"MethodInfo.doReach (cognitive 28): MethodInfo.doReach has cognitive complexity 28 (threshold 15). Drivers by points: loops 11 (17 pts), if/else 5 (11 pts) (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":"scalafmt-benchmarks/src/resources/scala-js/Analyzer.scala"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dd99f274b1184a7dce2d66c72392dcf74de417bc9d8e6b8514f3fad201917e6"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatWriter.checkInsertEndMarkers (cognitive 28): FormatWriter.checkInsertEndMarkers has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (19 pts), match/switch 3 (8 pts), boolean chains 1 (nesting depth added 16). 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatWriter.scala"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"da5461254e9941f022a490f142271b34624036d48141853d740fcf2cd0bbdc47"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder.processForStatements (cognitive 28): Builder.processForStatements has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (16 pts), match/switch 4 (8 pts), boolean chains 4 (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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/OptimizationEntities.scala"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"4222481d1737bd53ccd4dc261c5f46b8e594831ab59ef458307703c53becbbb3"}},{"ruleId":"D2","level":"warning","message":{"text":"ColonEolImpl.onArgClause (cognitive 28): ColonEolImpl.onArgClause has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (13 pts), match/switch 6 (10 pts), boolean chains 5 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/OptionalBraces.scala"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"afaec9b8d66f2410c535d910ae1118ccdd95e880031be237f37dbee31af496c0"}},{"ruleId":"D2","level":"warning","message":{"text":"SplitsAfterInterpolationStart.get (cognitive 28): SplitsAfterInterpolationStart.get has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (15 pts), match/switch 5 (11 pts), boolean chains 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a89e14815d2d291e529a6138b64a9cb5714d71268ebed2e7b7c1e88c32d21f7"}},{"ruleId":"D2","level":"warning","message":{"text":"SplitsBeforeIf.get (cognitive 28): SplitsBeforeIf.get has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (19 pts), match/switch 4 (9 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala"},"region":{"startLine":3111}}}],"partialFingerprints":{"codehealthFindingId/v1":"27a4c873bd2541fd45e3aa390d62635ae85f3d83cd19f020fe6c4af91bd985c0"}},{"ruleId":"D2","level":"warning","message":{"text":"RedundantParens.okToReplaceWithCount (cognitive 28): RedundantParens.okToReplaceWithCount has cognitive complexity 28 (threshold 15). Drivers by points: match/switch 5 (11 pts), boolean chains 9, if/else 7 (8 pts) (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/RedundantParens.scala"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6ed17fe6a9725c6da763078e858473bdb2950fc33fc391db85ac1e465387d29"}},{"ruleId":"D2","level":"warning","message":{"text":"DefaultMessageDispatcher.dispatch (cognitive 27): DefaultMessageDispatcher.dispatch has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 3, match/switch 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":"scalafmt-benchmarks/src/resources/Endpoint.scala"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"61b1bd71c8c710f134f63854bd43d764e6e3786e353abf28b732b61158007230"}},{"ruleId":"D2","level":"warning","message":{"text":"Primality.nextProbablePrime (cognitive 27): Primality.nextProbablePrime has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 7 (12 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":"scalafmt-benchmarks/src/resources/scala-js/Primality.scala"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"81abc46ddf66c856d209ea0b14a86a1045e2bbaa3b9c01b073a0188ec1128ca9"}},{"ruleId":"D2","level":"warning","message":{"text":"ScalafmtConfig.checkErrors (cognitive 27): ScalafmtConfig.checkErrors has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 10, match/switch 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/config/ScalafmtConfig.scala"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a5003b1e32617b2e185982d08f7ec4800062addba685fb05247e173a971f201"}},{"ruleId":"D2","level":"warning","message":{"text":"Primality.millerRabin (cognitive 26): Primality.millerRabin has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 3 (7 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":"scalafmt-benchmarks/src/resources/scala-js/Primality.scala"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"25cebcda3fd3daac448f70847b64d593ba8d2aabdd2c7c62e2a889f80722b385"}},{"ruleId":"D2","level":"warning","message":{"text":"BinPackOneline.policyOnRightDelim (cognitive 26): BinPackOneline.policyOnRightDelim has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (13 pts), match/switch 5 (8 pts), boolean chains 5 (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatOps.scala"},"region":{"startLine":1539}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcf8ed96788bf0c7bde093d3731c974a3dc8a5cef5773b111a72aefacebc4ee7"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatMlc.format (cognitive 26): FormatMlc.format has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 5, loops 2 (5 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatWriter.scala"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"e53aaa481c9e8eb165f04271f8bda0f0ce69c39745521d8c251494ed2a32f109"}},{"ruleId":"D2","level":"warning","message":{"text":"SplitsAfterEqualsLeftArrow.getSplitsEnumerator (cognitive 26): SplitsAfterEqualsLeftArrow.getSplitsEnumerator has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (19 pts), match/switch 2 (5 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"da54853cb9386b9c675053301a5eaece8d77d9bd639e4464047d4b4a542d8ade"}},{"ruleId":"D2","level":"warning","message":{"text":"Imports.validateImports (cognitive 26): Imports.validateImports has cognitive complexity 26 (threshold 15). Drivers by points: if/else 18 (22 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/Imports.scala"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ac08138345add7b0d2b021a4c03de160d2730bcaca92b1042fea75fa565b5e7"}},{"ruleId":"D2","level":"warning","message":{"text":"RedundantBraces.onRightBrace (cognitive 26): RedundantBraces.onRightBrace has cognitive complexity 26 (threshold 15). Drivers by points: match/switch 6 (14 pts), boolean chains 6, if/else 6 (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":"scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/RedundantBraces.scala"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"71f928677b7ed59c7cbbf242f6d8d64fbe6086060743f26abc29b21ee77a141f"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatLocations.getAlignContainerParent (cognitive 25): FormatLocations.getAlignContainerParent has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (19 pts), match/switch 3 (5 pts), boolean chains 1 (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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatWriter.scala"},"region":{"startLine":1359}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ff8daec2cd80bd1a483dbd3453940bfa99395e333f79fa0a6e927ddc66088e0"}},{"ruleId":"D2","level":"warning","message":{"text":"SplitsAfterLeftParen.getLambdaAsSingleArg (cognitive 25): SplitsAfterLeftParen.getLambdaAsSingleArg has cognitive complexity 25 (threshold 15). Drivers by points: if/else 17 (19 pts), boolean chains 4, match/switch 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala"},"region":{"startLine":2174}}}],"partialFingerprints":{"codehealthFindingId/v1":"b52491effe48deb016253444f0c5b0f75e0eb4e30727341c05f97ee05b8149f7"}},{"ruleId":"D2","level":"warning","message":{"text":"ConvertToNewScala3Syntax.onRight (cognitive 25): ConvertToNewScala3Syntax.onRight has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (21 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 10). 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/ConvertToNewScala3Syntax.scala"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"161b5d98b8a9bc5715ac469ae1819a620a1ce085f99bc7c3be331949c249f464"}},{"ruleId":"D2","level":"warning","message":{"text":"OptimizerCore.fold3WayComparison (cognitive 24): OptimizerCore.fold3WayComparison has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (24 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":"scalafmt-benchmarks/src/resources/scala-js/OptimizerCore.scala"},"region":{"startLine":2873}}}],"partialFingerprints":{"codehealthFindingId/v1":"846fc4b75ce4d0df6d8b4abfe1cac2a544446759db010c59daf4294977a2cebf"}},{"ruleId":"D2","level":"warning","message":{"text":"OptimizerCore.returnable (cognitive 24): OptimizerCore.returnable has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (16 pts), match/switch 2 (6 pts), boolean chains 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":"scalafmt-benchmarks/src/resources/scala-js/OptimizerCore.scala"},"region":{"startLine":3011}}}],"partialFingerprints":{"codehealthFindingId/v1":"49ff6e90ded7dfe0136b0c7572c97598a552a38879e266cd86fdd59dfba79e23"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatWriter.getFormatLocations (cognitive 24): FormatWriter.getFormatLocations has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (22 pts), boolean chains 1, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatWriter.scala"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"0200ddc2db75c184b2b2508d35a1ad7873601efbbb6a2ce160744616be510537"}},{"ruleId":"D2","level":"warning","message":{"text":"SplitsBeforeCommentLowPriority.get (cognitive 24): SplitsBeforeCommentLowPriority.get has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (16 pts), match/switch 3 (6 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala"},"region":{"startLine":3711}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2649b34d73bf8d3f760014d01e6198db4f3d87bb318b6a4dfea9d900516525b"}},{"ruleId":"D2","level":"warning","message":{"text":"RemoveScala3OptionalBraces.onRightFromBraces (cognitive 24): RemoveScala3OptionalBraces.onRightFromBraces has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9, boolean chains 8, match/switch 5 (7 pts) (nesting depth added 2). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/RemoveScala3OptionalBraces.scala"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5ab37598b8230c02107ee370f615b36e64ba3840fdf9e9f98c8d44087a6cc9f"}},{"ruleId":"D2","level":"warning","message":{"text":"JSCodePhase.apply (cognitive 23): JSCodePhase.apply has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 5, loops 2, match/switch 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":"scalafmt-benchmarks/src/resources/scala-js/GenJSCode.scala"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"7498215b2eb07205edcba9abcfe45d3fbaf40ddb323f4efbe2620f200d97c44b"}},{"ruleId":"D2","level":"warning","message":{"text":"Entry.formatMarginized (cognitive 23): Entry.formatMarginized has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 1 (2 pts), match/switch 2, boolean chains 1 (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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatWriter.scala"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"d31da3823333621e9fa7be5fe6833c19f066b38da71fab677094a595d9f47b10"}},{"ruleId":"D2","level":"warning","message":{"text":"EndpointWriter.sendBufferedMessages (cognitive 22): EndpointWriter.sendBufferedMessages has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 4, match/switch 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":"scalafmt-benchmarks/src/resources/Endpoint.scala"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa4a72ad3c29cfa03b7f6e56c9ceb317d0488800f7bb3f28b8f87a8fe219e64c"}},{"ruleId":"D2","level":"warning","message":{"text":"CreateTables.apply (cognitive 22): CreateTables.apply has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 2, match/switch 1 (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":"scalafmt-benchmarks/src/resources/spark/HiveMetastoreCatalog.scala"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a634fb0e030ece6da5588c07b215e17462a6113e32ffcd819b3f57812da4a6e"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatWriter.replaceRedundantBraces (cognitive 22): FormatWriter.replaceRedundantBraces has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (17 pts), boolean chains 4, 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatWriter.scala"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"32c52d8add73da4bcee2b8e808bb43d7c2ec084a7e4c52dbd7b7668aeeeaadf7"}},{"ruleId":"D2","level":"warning","message":{"text":"ExtraBlankTokens.setTopStats (cognitive 22): ExtraBlankTokens.setTopStats has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15 (17 pts), match/switch 3 (4 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatWriter.scala"},"region":{"startLine":1501}}}],"partialFingerprints":{"codehealthFindingId/v1":"84f5aea16a1cfe537109c86d0017bbbf8f65c7e800a84094bf1eed4e6d23b950"}},{"ruleId":"D2","level":"warning","message":{"text":"SplitsWithOptionalNL.get (cognitive 22): SplitsWithOptionalNL.get has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (16 pts), match/switch 2 (4 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala"},"region":{"startLine":3804}}}],"partialFingerprints":{"codehealthFindingId/v1":"08155a7ab430cbe605047c156051447d992354d57d014716ebaa0f670d9a1e46"}},{"ruleId":"D2","level":"warning","message":{"text":"MarkdownParser.transformMdoc (cognitive 22): MarkdownParser.transformMdoc has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 2 (5 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/util/MarkdownParser.scala"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa472b84054301a831526b10d75aa22a9084ab2f3f39a15f6bd5f1ed24949648"}},{"ruleId":"D2","level":"warning","message":{"text":"Division.slidingWindow (cognitive 21): Division.slidingWindow has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 4 (8 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":"scalafmt-benchmarks/src/resources/scala-js/Division.scala"},"region":{"startLine":835}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd3cdb5abae49d235c9e71d73bcc4a9b4ac3e3a0c4764f7cb7229e29fca8ac77"}},{"ruleId":"D2","level":"warning","message":{"text":"JSCodePhase.genClass (cognitive 21): JSCodePhase.genClass has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 6, match/switch 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":"scalafmt-benchmarks/src/resources/scala-js/GenJSCode.scala"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d58d4ce49877259f3221ca7ed0ff968dd5760ab20e1bd556b62eef1f5380a37"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatOps.getForceConfigStyle (cognitive 21): FormatOps.getForceConfigStyle has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 2 (5 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatOps.scala"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc592356b21adda22b8f7d41f43d13c4d5c54980e2351822b94a246089bd0248"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatWriter.mkString (cognitive 21): FormatWriter.mkString has cognitive complexity 21 (threshold 15). Drivers by points: if/else 15 (20 pts), match/switch 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatWriter.scala"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"e95d9f90e19d0d326dc8ff230322c7637ea5237673f600b0ec2583693bcaa645"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatMlDoc.formatTerm (cognitive 21): FormatMlDoc.formatTerm has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (15 pts), match/switch 2 (4 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatWriter.scala"},"region":{"startLine":930}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0111c83d5d31b6259c2eac0f4cc678508ac3bd3cfe4b5cc783ae282ddf5ea9b"}},{"ruleId":"D2","level":"warning","message":{"text":"Base.getImporteesToKeep (cognitive 21): Base.getImporteesToKeep has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (19 pts), 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/Imports.scala"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"498538f6a577b9af9a74c97416247861a137af7ce81c76f94d39d4f268a5d3d6"}},{"ruleId":"D2","level":"warning","message":{"text":"RedundantBraces.getBlockToReplaceAsFuncBodyInSingleArgApply (cognitive 21): RedundantBraces.getBlockToReplaceAsFuncBodyInSingleArgApply has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 3 (6 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/RedundantBraces.scala"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"a35e22de56779104b9a4d5459ef1c45b88cda94969858c42ec4dff14f16130dd"}},{"ruleId":"D2","level":"warning","message":{"text":"BaseLinker.linkInternal (cognitive 20): BaseLinker.linkInternal has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (17 pts), match/switch 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":"scalafmt-benchmarks/src/resources/scala-js/BaseLinker.scala"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"87b2352735465d383fe81f63cef4887d7d902b2beb34fb384316fde63491f859"}},{"ruleId":"D2","level":"warning","message":{"text":"BaseLinker.linkedClassDef (cognitive 20): BaseLinker.linkedClassDef has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (16 pts), match/switch 2 (3 pts), 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":"scalafmt-benchmarks/src/resources/scala-js/BaseLinker.scala"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcd76080be91a7dc1702715973156460caeb48f994560b538094dd14813a00e2"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassInfo.instantiated (cognitive 19): ClassInfo.instantiated has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (6 pts), boolean chains 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":"scalafmt-benchmarks/src/resources/scala-js/Analyzer.scala"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"13510a2ced0e6e94d59792674245750bbde54d8fdd3a76c3329b5011f1a2811e"}},{"ruleId":"D2","level":"warning","message":{"text":"JSCodePhase.genTry (cognitive 19): JSCodePhase.genTry has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (11 pts), match/switch 4 (7 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, 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":"scalafmt-benchmarks/src/resources/scala-js/GenJSCode.scala"},"region":{"startLine":1681}}}],"partialFingerprints":{"codehealthFindingId/v1":"f26b82cf9182eba8512f8866bc459ad5526b1e183586d184abd250e2dfd35474"}},{"ruleId":"D2","level":"warning","message":{"text":"JSCodePhase.genJSCallGeneric (cognitive 19): JSCodePhase.genJSCallGeneric has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 5, match/switch 3 (5 pts) (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":"scalafmt-benchmarks/src/resources/scala-js/GenJSCode.scala"},"region":{"startLine":3581}}}],"partialFingerprints":{"codehealthFindingId/v1":"191a0ce4609246933857df2f1843e9206fe9035d7ea213789b971fca066b9c82"}},{"ruleId":"D2","level":"warning","message":{"text":"CtrlBodySplits.unfoldedNonComment (cognitive 19): CtrlBodySplits.unfoldedNonComment has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatOps.scala"},"region":{"startLine":1169}}}],"partialFingerprints":{"codehealthFindingId/v1":"44ee936c942c1540e90cd614a25b81ffb97ee03b5fe53495abd7b463fd9245bb"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatMlDoc.formatNoWrap (cognitive 19): FormatMlDoc.formatNoWrap has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (19 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatWriter.scala"},"region":{"startLine":1159}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab9cded3b720dcc30ae7ba39c21dd93618d29efefe534bc81fce801fcc4ed7eb"}},{"ruleId":"D2","level":"warning","message":{"text":"SplitsAfterRightArrow.caseTree (cognitive 19): SplitsAfterRightArrow.caseTree has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 4, match/switch 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala"},"region":{"startLine":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"e952ca6cb840243f65c73e932ad591d27c461f298e11a39b578e7dc91b383229"}},{"ruleId":"D2","level":"warning","message":{"text":"SplitsAfterTryCatchFinally.getOneLineTry (cognitive 19): SplitsAfterTryCatchFinally.getOneLineTry has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3, match/switch 1 (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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala"},"region":{"startLine":3536}}}],"partialFingerprints":{"codehealthFindingId/v1":"89a5f51e24b261bb12baa88f25cea55c149db8a590ffff240a18e7dfe0a2b751"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatTokensRewrite.mergeWhitespaceLeftToRight (cognitive 19): FormatTokensRewrite.mergeWhitespaceLeftToRight has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (18 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/FormatTokensRewrite.scala"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"94d0fa8eae4e55e7d6ab1ca64c3b931eaa38127e0504d4e011c2ddc26f8384b0"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeOps.getSingleArgOnLeftBraceOnLeft (cognitive 19): TreeOps.getSingleArgOnLeftBraceOnLeft has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (11 pts), match/switch 4 (8 pts) (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-core/shared/src/main/scala/org/scalafmt/util/TreeOps.scala"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"1715df07bc225886b426e32920dab81f21d52b150d90c5ea36401435e6830e9f"}},{"ruleId":"D2","level":"warning","message":{"text":"Division.divideArrayByInt (cognitive 18): Division.divideArrayByInt has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 1 (nesting depth added 10). 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":"scalafmt-benchmarks/src/resources/scala-js/Division.scala"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0b8656b2171bdc946f41efda549d32eca7f002d14bfdff23536c008547981c0"}},{"ruleId":"D2","level":"warning","message":{"text":"ScalaJSClassEmitter.genTypeData (cognitive 18): ScalaJSClassEmitter.genTypeData has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 3 (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":"scalafmt-benchmarks/src/resources/scala-js/ScalaJSClassEmitter.scala"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"a52a379d467a2df3125ef8c5760a8145b0374c1b70eb0e287194155185f89d43"}},{"ruleId":"D2","level":"warning","message":{"text":"Utils.printEscapeJS (cognitive 18): Utils.printEscapeJS has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-benchmarks/src/resources/scala-js/Utils.scala"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fb5bdb36fcfe0b6e18f5c287b7e4cafd4240122ccf8c623c203e548ae94fb85"}},{"ruleId":"D2","level":"warning","message":{"text":"ScalafmtRunner.runInputs (cognitive 18): ScalafmtRunner.runInputs has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-cli/shared/src/main/scala/org/scalafmt/cli/ScalafmtRunner.scala"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcf63cd0ee3f9c66e6bf54f5a9c77f55a5b47e2218e2249afd73880d1338203a"}},{"ruleId":"D2","level":"warning","message":{"text":"BestFirstSearch.processOptimalToken (cognitive 18): BestFirstSearch.processOptimalToken has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (14 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/BestFirstSearch.scala"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"90e0bf47b5fcaefc09565aa77a60195cf6d87cd29f26b331c52d757232e3b7b1"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatOps.binPackParentConstructorSplits (cognitive 18): FormatOps.binPackParentConstructorSplits has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (13 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatOps.scala"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"032e5d36cd007af1d90f996616cad70947aa418940ac5d956205f029ec995e75"}},{"ruleId":"D2","level":"warning","message":{"text":"CatchImpl.create (cognitive 18): CatchImpl.create has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 4 (10 pts), boolean chains 4, if/else 4 (nesting depth added 6). 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/OptionalBraces.scala"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"38fc228e0e0cfb1ea2afd42d2d6e8f2e48095e6c58c85cec73ea2f541d3262a1"}},{"ruleId":"D2","level":"warning","message":{"text":"SplitsBeforeColon.get (cognitive 18): SplitsBeforeColon.get has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 5). 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala"},"region":{"startLine":2314}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa4fef0013edcc1a4805ca08df574f2bcc96e3f5459b1e465b63378f425f4478"}},{"ruleId":"D2","level":"warning","message":{"text":"OptimizerCore.pretransformStaticApply (cognitive 17): OptimizerCore.pretransformStaticApply has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-benchmarks/src/resources/scala-js/OptimizerCore.scala"},"region":{"startLine":1230}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b16feb01d54cd1738cc3590f0efb74e88f48357e7047795f5e72435fe1f4120"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatOps.insideBracesBlockIfBracesToParens (cognitive 17): FormatOps.insideBracesBlockIfBracesToParens has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (10 pts), match/switch 2 (4 pts), boolean chains 3 (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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatOps.scala"},"region":{"startLine":1641}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e0f9e87adb808511284d355f98f4c3de8d5f4b55d478718cf335e494ee99267"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatMlDoc.formatCodeBlock (cognitive 17): FormatMlDoc.formatCodeBlock has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (15 pts), match/switch 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatWriter.scala"},"region":{"startLine":1054}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3caf6a7a201c9fe84faf8f6804906b11520a159cd8904ac9ac48cc1116718c4"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatWriter.getEndMarkerLabel (cognitive 17): FormatWriter.getEndMarkerLabel has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (10 pts), match/switch 4 (7 pts) (nesting depth added 5). 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatWriter.scala"},"region":{"startLine":2155}}}],"partialFingerprints":{"codehealthFindingId/v1":"88216b4b5d323a06075ca8aada4db86b2d0f877cfac732e63a2204b878512219"}},{"ruleId":"D2","level":"warning","message":{"text":"SplitsAfterElse.get (cognitive 17): SplitsAfterElse.get has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 3 (6 pts), boolean chains 1 (nesting depth added 6). 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala"},"region":{"startLine":3340}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aa459c177623b9293d8a840c7299a1f83b1b768f8cfa2427968cd2351b4860b"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatTokensRewrite.rewrite (cognitive 17): FormatTokensRewrite.rewrite has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (16 pts), match/switch 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/FormatTokensRewrite.scala"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d19235f59c3df1795f439eb1754534eece2200760fdce39272403149be60db3"}},{"ruleId":"D2","level":"warning","message":{"text":"RedundantBraces.checkValidInfixParent (cognitive 17): RedundantBraces.checkValidInfixParent has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (7 pts), boolean chains 5, match/switch 3 (5 pts) (nesting depth added 4). 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/RedundantBraces.scala"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"6daa4b755864ac3a1805e73a9a8fefb07230fa43011ec261a15c5f05f089f3af"}},{"ruleId":"D2","level":"warning","message":{"text":"RedundantBraces.okToRemoveBlock (cognitive 17): RedundantBraces.okToRemoveBlock has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (6 pts), match/switch 3 (6 pts), boolean chains 5 (nesting depth added 4). 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/RedundantBraces.scala"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad0adf1a86af0a8e74cbd8813ad61a34d28211e83ef836c61999c83eef48497c"}},{"ruleId":"D2","level":"warning","message":{"text":"Division.modInverseMontgomery (cognitive 16): Division.modInverseMontgomery has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (13 pts), loops 2 (3 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"scalafmt-benchmarks/src/resources/scala-js/Division.scala"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a2b4cdc6a07890f05cb9e362f04bccfd05552fe381cfd0a737759796ddd62d2"}},{"ruleId":"D2","level":"warning","message":{"text":"JSCodePhase.genMethodDef (cognitive 16): JSCodePhase.genMethodDef has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 2 (3 pts), 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":"scalafmt-benchmarks/src/resources/scala-js/GenJSCode.scala"},"region":{"startLine":1234}}}],"partialFingerprints":{"codehealthFindingId/v1":"661438b13a861dc28561468ed7af8c01abea5d0b46ec425fcf5f7bf3e22e2a98"}},{"ruleId":"D2","level":"warning","message":{"text":"JSCodePhase.genApplyTypeApply (cognitive 16): JSCodePhase.genApplyTypeApply has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 1, match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-benchmarks/src/resources/scala-js/GenJSCode.scala"},"region":{"startLine":1827}}}],"partialFingerprints":{"codehealthFindingId/v1":"056d367cfd9db2885dfe820e3e4d881a1377f187327c276665390c5e9b9c5eb1"}},{"ruleId":"D2","level":"warning","message":{"text":"JSCodePhase.genEqEqPrimitive (cognitive 16): JSCodePhase.genEqEqPrimitive has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-benchmarks/src/resources/scala-js/GenJSCode.scala"},"region":{"startLine":2784}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff29e170e869a33d37bdc2cf8dc77ff6e9179364f610593afdc0586b08add5db"}},{"ruleId":"D2","level":"warning","message":{"text":"OptimizerCore.pretransformSelectCommon (cognitive 16): OptimizerCore.pretransformSelectCommon has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), match/switch 3 (6 pts), boolean chains 2 (nesting depth added 5). 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":"scalafmt-benchmarks/src/resources/scala-js/OptimizerCore.scala"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cce23380feef659c892d4dc57e6e1087f5b9a7fac3c9a725f0c79929e5b53bc"}},{"ruleId":"D2","level":"warning","message":{"text":"HiveMetastoreCatalog.createDataSourceTable (cognitive 16): HiveMetastoreCatalog.createDataSourceTable has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 4, error handling 1 (2 pts), match/switch 2 (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":"scalafmt-benchmarks/src/resources/spark/HiveMetastoreCatalog.scala"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"39f08cbbda280c4e920dc65d5955f2fd83d2fc4bf65e1cb6f8fcbfd329842e93"}},{"ruleId":"D2","level":"warning","message":{"text":"CliOptions.auto (cognitive 16): CliOptions.auto has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-cli/shared/src/main/scala/org/scalafmt/cli/CliOptions.scala"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c5f82f7cb5fabd76aa03430fcefbc2670990d99017354684354379b86a68d69"}},{"ruleId":"D2","level":"warning","message":{"text":"BestFirstSearch.getActiveSplits (cognitive 16): BestFirstSearch.getActiveSplits has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 3, loops 2 (3 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/BestFirstSearch.scala"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd8d4907adb7d92828d3957906a35710f76e9b15c167e0f9de5ba74f52dc0fa9"}},{"ruleId":"D2","level":"warning","message":{"text":"RightParenImpl.create (cognitive 16): RightParenImpl.create has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (7 pts), boolean chains 6, match/switch 2 (3 pts) (nesting depth added 2). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/OptionalBraces.scala"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f0be5857bf157b4a162268971508d2fc243bd7952cbc758993c19c66b414150"}},{"ruleId":"D2","level":"warning","message":{"text":"SplitsAfterEquals.getSplitsDefValEquals (cognitive 16): SplitsAfterEquals.getSplitsDefValEquals has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, boolean chains 4, match/switch 2 (3 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"08606a36866b744f0bbca6f1d57a594c556f2053224d001ff3120e61dfd280a6"}},{"ruleId":"D2","level":"warning","message":{"text":"SplitsAfterDo.get (cognitive 16): SplitsAfterDo.get has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 4, match/switch 1 (nesting depth added 4). 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala"},"region":{"startLine":3251}}}],"partialFingerprints":{"codehealthFindingId/v1":"c580fdfced0a60c784f34c5f977be8358932110d53114a10f862608df1782881"}},{"ruleId":"D2","level":"warning","message":{"text":"RedundantBraces.canRewriteStatWithParens (cognitive 16): RedundantBraces.canRewriteStatWithParens has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 3 (4 pts), boolean chains 2 (nesting depth added 4). 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/RedundantBraces.scala"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"24cf5da03947b03d1db60ec4c9e61cf447b41d9f479039d91bf671ca4ee0db45"}},{"ruleId":"D2","level":"warning","message":{"text":"RedundantBraces.onRightParen (cognitive 16): RedundantBraces.onRightParen has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 3 (5 pts) (nesting depth added 6). 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/RedundantBraces.scala"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"eed0a756cdc6002bc6d3eb104f842fc77ca02d25c265fb416a30fb70079fcad7"}},{"ruleId":"D2","level":"warning","message":{"text":"PlatformPathMatcher.glob (cognitive 16): PlatformPathMatcher.glob has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 2, match/switch 1 (2 pts), 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":"scalafmt-sysops/js/src/main/scala/org/scalafmt/sysops/PlatformPathMatcher.scala"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad7d6e2bd4fde0fa912dc5f3a528d0d2ff7835fc2ec12694b4af989b23c11e58"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: GenJSCode: ClassTooLong \u2014 2707 significant lines (blank, comment-only and punctuation-only lines excluded), 18 methods. The bar is 400 significant lines; this is 2307 over it, 6.77\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-benchmarks/src/resources/scala-js/GenJSCode.scala"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae824f13ee631fecda3af15636df1b5ca09a9fde9d6db0ba2063d558cef47845"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: internal/Splits.scala: FileTooLong \u2014 3025 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2525 over it, 6.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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cff336bef0e40e51bfda05e75b2a4568eb693d858b4527348d30ecc3835c575a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scala-js/OptimizerCore.scala: FileTooLong \u2014 2750 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2250 over it, 5.50\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":"scalafmt-benchmarks/src/resources/scala-js/OptimizerCore.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"debae0374de1f35749975dd745ad931c5d90368ca3c455b4585d35595dd6ef8b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scala-js/GenJSCode.scala: FileTooLong \u2014 2719 significant lines (blank, comment-only and punctuation-only lines excluded), about 100% of them inside a single declaration: GenJSCode (30-4664). The bar is 500 significant lines; this is 2219 over it, 5.44\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-benchmarks/src/resources/scala-js/GenJSCode.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae3eab136f7e6c8e0fa81cd8a2dde63d841eb1322ca9cdffd5808296e6bdf27b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TreeOps: TooManyMethods \u2014 116 methods. The bar is 30 methods; this is 86 over it, 3.87\u00D7 the bar. This type is on a published API surface \u2014 a MiMa binary-compatibility gate (build.sbt) declares its compatibility contractual \u2014 so moving members onto a smaller type is a breaking change for every consumer, not a local refactor. To reduce it, treat the split as an API migration: move each cohesive group onto its own published type and keep the old members as deprecated forwards for a deprecation period, removing them at the next compatibility break. Where the surface has to stay as it is, that is a decision to record rather than a change to make."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-core/shared/src/main/scala/org/scalafmt/util/TreeOps.scala"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fcbcdcac6304b89bf0a709a9156bb1ac963897b4c649becc2c7c32799dc09eb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: internal/FormatWriter.scala: FileTooLong \u2014 1683 significant lines (blank, comment-only and punctuation-only lines excluded), about 78% of them inside a single declaration: FormatWriter (23-1727). The bar is 500 significant lines; this is 1183 over it, 3.37\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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatWriter.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3926a746c6eb8dafa8ac4170e0756155873483be7b672db88952e1c34bd09cc"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: FormatTokens: TooManyMethods \u2014 90 methods. The bar is 30 methods; this is 60 over it, 3.00\u00D7 the bar. This type is on a published API surface \u2014 a MiMa binary-compatibility gate (build.sbt) declares its compatibility contractual \u2014 so moving members onto a smaller type is a breaking change for every consumer, not a local refactor. To reduce it, treat the split as an API migration: move each cohesive group onto its own published type and keep the old members as deprecated forwards for a deprecation period, removing them at the next compatibility break. Where the surface has to stay as it is, that is a decision to record rather than a change to make."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatTokens.scala"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ef9cdc013580cdd76f91cab636fd16e7d33817e1b4c3b9dd045b743368d0d21"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: JSCodePhase: TooManyMethods \u2014 87 methods. The bar is 30 methods; this is 57 over it, 2.90\u00D7 the bar. This type is on a published API surface \u2014 a MiMa binary-compatibility gate (build.sbt) declares its compatibility contractual \u2014 so moving members onto a smaller type is a breaking change for every consumer, not a local refactor. To reduce it, treat the split as an API migration: move each cohesive group onto its own published type and keep the old members as deprecated forwards for a deprecation period, removing them at the next compatibility break. Where the surface has to stay as it is, that is a decision to record rather than a change to make."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-benchmarks/src/resources/scala-js/GenJSCode.scala"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5572f3fc83e8efc5c4e10dfa3660ea473d42fc0e0a0c91d261285d10ee6d32d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: internal/FormatOps.scala: FileTooLong \u2014 1367 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 867 over it, 2.73\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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatOps.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bc310c1aa01f9a9f553fa5355184f4053629601dcae20f09ce18e9b5b4f5561"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: OptimizerCore: TooManyMethods \u2014 76 methods. The bar is 30 methods; this is 46 over it, 2.53\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-benchmarks/src/resources/scala-js/OptimizerCore.scala"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"02050ef26111f32fa02bb3657c5ae3b18bb8f1c455a14c2492c1ae6f58aeecbd"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: FormatOps: TooManyMethods \u2014 65 methods. The bar is 30 methods; this is 35 over it, 2.17\u00D7 the bar. This type is on a published API surface \u2014 a MiMa binary-compatibility gate (build.sbt) declares its compatibility contractual \u2014 so moving members onto a smaller type is a breaking change for every consumer, not a local refactor. To reduce it, treat the split as an API migration: move each cohesive group onto its own published type and keep the old members as deprecated forwards for a deprecation period, removing them at the next compatibility break. Where the surface has to stay as it is, that is a decision to record rather than a change to make."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatOps.scala"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"683d10e5c785ea571e9ac6f36d54c6e80307dc5482346cd197c0cc00163ad15d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: util/TreeOps.scala: FileTooLong \u2014 867 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 367 over it, 1.73\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":"scalafmt-core/shared/src/main/scala/org/scalafmt/util/TreeOps.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecfc8743f1a683782e161e7e5a80fd9b1b94ba19b5b4249ebfd7a07afacb7227"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: resources/Endpoint.scala: FileTooLong \u2014 699 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 199 over it, 1.40\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-benchmarks/src/resources/Endpoint.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d689ef7595e4fcf87ed0849217356e574b1a91b800ae2997137221d4ea9db8d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: internal/OptionalBraces.scala: FileTooLong \u2014 669 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 169 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/OptionalBraces.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9434092462e331ae6ab07922df01bb8b556943da2bc7d5f959928b9fdf6b211d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: rewrite/Imports.scala: FileTooLong \u2014 667 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 167 over it, 1.33\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":"scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/Imports.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cf2e9cab3b3c630b459188f5d634ff5a56afb42fac7b3865d73881dc04f053d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CopyOnWriteArrayList: TooManyMethods \u2014 38 methods. The bar is 30 methods; this is 8 over it, 1.27\u00D7 the bar. This type is on a published API surface \u2014 a MiMa binary-compatibility gate (build.sbt) declares its compatibility contractual \u2014 so moving members onto a smaller type is a breaking change for every consumer, not a local refactor. To reduce it, treat the split as an API migration: move each cohesive group onto its own published type and keep the old members as deprecated forwards for a deprecation period, removing them at the next compatibility break. Where the surface has to stay as it is, that is a decision to record rather than a change to make."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-benchmarks/src/resources/scala-js/CopyOnWriteArrayList.scala"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd6add25a0babd0d006f6e7d593d86586ef1471c6ab6822f498b7faff3b42b5c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ScalaJSClassEmitter: TooManyMethods \u2014 38 methods. The bar is 30 methods; this is 8 over it, 1.27\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":"scalafmt-benchmarks/src/resources/scala-js/ScalaJSClassEmitter.scala"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0d2b79c1ad3049a5b49765c5828976d251e208682d5ff0b148dd3dfa1bfdb31"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: spark/HiveMetastoreCatalog.scala: FileTooLong \u2014 630 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 130 over it, 1.26\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":"scalafmt-benchmarks/src/resources/spark/HiveMetastoreCatalog.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a204903cd71c6ff427f2894903c741e7b32651d4d53dba4ee972e4a0dd93b7d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Readme: TooManyMethods \u2014 36 methods. The bar is 30 methods; this is 6 over it, 1.20\u00D7 the bar. This type is on a published API surface \u2014 a MiMa binary-compatibility gate (build.sbt) declares its compatibility contractual \u2014 so moving members onto a smaller type is a breaking change for every consumer, not a local refactor. To reduce it, treat the split as an API migration: move each cohesive group onto its own published type and keep the old members as deprecated forwards for a deprecation period, removing them at the next compatibility break. Where the surface has to stay as it is, that is a decision to record rather than a change to make."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"readme/src/main/scala/org/scalafmt/readme/Readme.scala"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"5293b61edab06e767f2036c462fa24d544ed9fb8f45bc872d6e3d4d089ba2fa0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: rewrite/RedundantBraces.scala: FileTooLong \u2014 594 significant lines (blank, comment-only and punctuation-only lines excluded), about 82% of them inside a single declaration: RedundantBraces (152-819). The bar is 500 significant lines; this is 94 over it, 1.19\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/RedundantBraces.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"365369432660df7692c700fb073179d46e3d3f3e350ff876d968ca338131c403"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scala-js/ScalaJSClassEmitter.scala: FileTooLong \u2014 588 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 88 over it, 1.18\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-benchmarks/src/resources/scala-js/ScalaJSClassEmitter.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"44395e59d8f14a804114df8e22d8cbb6f0d9b74c3661ef47a4dec62312f5ec25"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: LoggerOps: TooManyMethods \u2014 33 methods. The bar is 30 methods; this is 3 over it, 1.10\u00D7 the bar. This type is on a published API surface \u2014 a MiMa binary-compatibility gate (build.sbt) declares its compatibility contractual \u2014 so moving members onto a smaller type is a breaking change for every consumer, not a local refactor. To reduce it, treat the split as an API migration: move each cohesive group onto its own published type and keep the old members as deprecated forwards for a deprecation period, removing them at the next compatibility break. Where the surface has to stay as it is, that is a decision to record rather than a change to make."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-core/shared/src/main/scala/org/scalafmt/util/LoggerOps.scala"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"520896a2253dd1838695eedee5c62e5c590c0f25759a0059d278111c83172081"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scala-js/Division.scala: FileTooLong \u2014 522 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 22 over it, 1.04\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-benchmarks/src/resources/scala-js/Division.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5253284b1e8eed786a7b71a58cf4caa0ab3f6391d9dcd07ac712331cca727a53"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scala-js/Analyzer.scala: FileTooLong \u2014 505 significant lines (blank, comment-only and punctuation-only lines excluded), about 96% of them inside a single declaration: Analyzer (22-828). The bar is 500 significant lines; this is 5 over it, 1.01\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":"scalafmt-benchmarks/src/resources/scala-js/Analyzer.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"680df29c986a9d0ee05a61f1e2c966c9ea5ce3d634451c097bc4f07ce01022ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (44 corresponding lines): scalafmt-benchmarks/src/resources/scala-js/GenJSCode.scala:2508-2551 | scalafmt-benchmarks/src/resources/scala-js/OptimizerCore.scala:3095-3142 \u2014 These two members are one piece of code written twice and then edited apart: 44 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":"scalafmt-benchmarks/src/resources/scala-js/GenJSCode.scala"},"region":{"startLine":2508}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a51b704653f0f02150bdf95eac9ac0296e20a3ead32fecfbea9dfde97e7dc25"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): scalafmt-benchmarks/src/resources/scala-js/OptimizerCore.scala:1233-1280 | scalafmt-benchmarks/src/resources/scala-js/OptimizerCore.scala:1285-1323 \u2014 These two members are one piece of code written twice and then edited apart: 39 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":"scalafmt-benchmarks/src/resources/scala-js/OptimizerCore.scala"},"region":{"startLine":1233}}}],"partialFingerprints":{"codehealthFindingId/v1":"c28cd6813f871225b9b1cedd3873563a9fd751d63d8e5d42630c75b7aa23db30"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): scalafmt-benchmarks/src/resources/scala-js/Division.scala:228-268 | scalafmt-benchmarks/src/resources/scala-js/Division.scala:279-312 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-benchmarks/src/resources/scala-js/Division.scala"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3c7903b5575597a35be480d0c68477d9355a79224d1357aa383cd3aa8694c5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): scalafmt-benchmarks/src/resources/scala-js/GenJSCode.scala:517-542 | scalafmt-benchmarks/src/resources/scala-js/GenJSCode.scala:548-579 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-benchmarks/src/resources/scala-js/GenJSCode.scala"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"e446693a0d57a13db17c1a57b8bfd559b83e525dd15a3fdf0f8dce665a3fd976"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): scalafmt-core/shared/src/main/scala/org/scalafmt/internal/OptionalBraces.scala:405-422 | scalafmt-core/shared/src/main/scala/org/scalafmt/internal/OptionalBraces.scala:602-619 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/OptionalBraces.scala"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"0514868f4739163afe9efe4bbc9ba3ae442978ce070377b53c81a90e27fa55c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): scalafmt-core/shared/src/main/scala/org/scalafmt/util/TreeOps.scala:1025-1037 | scalafmt-core/shared/src/main/scala/org/scalafmt/util/TreeOps.scala:1043-1054 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-core/shared/src/main/scala/org/scalafmt/util/TreeOps.scala"},"region":{"startLine":1025}}}],"partialFingerprints":{"codehealthFindingId/v1":"d959318b95960a48291760d9eb6222df518493a6124d3e985c91dd9dc641e3e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): scalafmt-benchmarks/src/resources/scala-js/GenJSCode.scala:764-775 | scalafmt-benchmarks/src/resources/scala-js/GenJSCode.scala:810-822 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-benchmarks/src/resources/scala-js/GenJSCode.scala"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccd6f39dbc1f7c0968bba0a3ab99297bba336889bded120379177de74213b6a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): scalafmt-core/shared/src/main/scala/org/scalafmt/util/TokenOps.scala:61-72 | scalafmt-core/shared/src/main/scala/org/scalafmt/util/TokenOps.scala:73-83 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-core/shared/src/main/scala/org/scalafmt/util/TokenOps.scala"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"6041ebc4d00cf99e45a21c76b925848be49bec96deeb855efa4f048c36029c39"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala:2544-2555 | scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala:2563-2574 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala"},"region":{"startLine":2544}}}],"partialFingerprints":{"codehealthFindingId/v1":"645e6dcf9c348691e56c56b673ca85045efaa8285cc1d5652f5c72c600f39906"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): scalafmt-benchmarks/src/resources/scala-js/JSDependency.scala:61-69 | scalafmt-benchmarks/src/resources/scala-js/Semantics.scala:56-64 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-benchmarks/src/resources/scala-js/JSDependency.scala"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5ed1fe012ee565765bca541adf4692bc24667395f47d81ae1ac99341052f30d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): scalafmt-benchmarks/src/resources/scala-js/GenJSCode.scala:3244-3260 | scalafmt-benchmarks/src/resources/scala-js/GenJSCode.scala:3264-3280 \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":"scalafmt-benchmarks/src/resources/scala-js/GenJSCode.scala"},"region":{"startLine":3244}}}],"partialFingerprints":{"codehealthFindingId/v1":"05e84fea40c7d4d7fa3d9521421bb877884ba920ff0c22aebf8f74949846e4ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): scalafmt-benchmarks/src/resources/scala-js/Division.scala:251-263 | scalafmt-benchmarks/src/resources/scala-js/Division.scala:298-310 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060scalafmt-benchmarks/src/resources/scala-js/Division.scala:251\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":"scalafmt-benchmarks/src/resources/scala-js/Division.scala"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5be6881cc8039f0be517136af53853d5dcd255fd9598747a5115cb0300d0930"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): scalafmt-benchmarks/src/resources/scala-js/GenJSCode.scala:328-337 | scalafmt-benchmarks/src/resources/scala-js/GenJSCode.scala:418-427 \u2014 both copies are in the same file, so extract the block 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 \u0060scalafmt-benchmarks/src/resources/scala-js/GenJSCode.scala: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-benchmarks/src/resources/scala-js/GenJSCode.scala"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea86a8349d093ec93ba678629eb6932a100afb3ab773257fe1ded0d30f0f28b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): scalafmt-core/shared/src/main/scala/org/scalafmt/internal/State.scala:99-107 | scalafmt-core/shared/src/main/scala/org/scalafmt/internal/State.scala:113-121 \u2014 both copies are in the same file, so extract the block 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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/State.scala"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cc3d9ed33b3d483796089f5ee10286da90b29ca9fa7eb109a484ecf305ac0c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): scalafmt-benchmarks/src/resources/scala-js/OptimizerCore.scala:411-417 | scalafmt-benchmarks/src/resources/scala-js/OptimizerCore.scala:783-789 \u2014 both copies are in the same file, so extract the block 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 \u0060scalafmt-benchmarks/src/resources/scala-js/OptimizerCore.scala:411\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":"scalafmt-benchmarks/src/resources/scala-js/OptimizerCore.scala"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a1a7843fb6a2f1a0bc0c0a06c0e286874474f4cfe129fce7b5c468e3dac852b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): scalafmt-core/shared/src/main/scala/org/scalafmt/config/ReflectOps.scala:9-37 | scalafmt-dynamic-core/src/main/scala/org/scalafmt/dynamic/utils/ReflectUtils.scala:9-37 \u2014 before extracting anything, compare \u0060scalafmt-core/shared/src/main/scala/org/scalafmt/config/ReflectOps.scala\u0060 and \u0060scalafmt-dynamic-core/src/main/scala/org/scalafmt/dynamic/utils/ReflectUtils.scala\u0060 as WHOLE FILES: 88% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. 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 \u0060scalafmt-core/shared/src/main/scala/org/scalafmt/config/ReflectOps.scala:9\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":"scalafmt-core/shared/src/main/scala/org/scalafmt/config/ReflectOps.scala"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"c951a4f1e28a8c1d2b81a2589e75edcc8350e641df7828c6c9b186c1f6dcb39e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): scalafmt-interfaces/js/src/main/scala/org/scalafmt/interfaces/ScalafmtReporter.scala:40-64 | scalafmt-interfaces/native/src/main/java/org/scalafmt/interfaces/ScalafmtReporter.scala:40-64 \u2014 before extracting anything, compare \u0060scalafmt-interfaces/js/src/main/scala/org/scalafmt/interfaces/ScalafmtReporter.scala\u0060 and \u0060scalafmt-interfaces/native/src/main/java/org/scalafmt/interfaces/ScalafmtReporter.scala\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-interfaces/js/src/main/scala/org/scalafmt/interfaces/ScalafmtReporter.scala"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"d359d12bb107673a3df03b7087443a6e19efb38dfc2176e7971b17d5692c0d1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): scalafmt-cli/shared/src/main/scala/org/scalafmt/cli/CliOptions.scala:173-178 | scalafmt-core/shared/src/main/scala/org/scalafmt/config/FilterMatcher.scala:40-45 \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":"scalafmt-cli/shared/src/main/scala/org/scalafmt/cli/CliOptions.scala"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"0afba88b541b460d3ab3175e91bdac6ac960a46f82bd0ef3bac3d8bf8ad3cc00"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): scalafmt-core/shared/src/main/scala/org/scalafmt/internal/MissingBraces.scala:109-114 | scalafmt-core/shared/src/main/scala/org/scalafmt/internal/MissingBraces.scala:126-131 \u2014 both copies are in the same file, so extract the block 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 \u0060scalafmt-core/shared/src/main/scala/org/scalafmt/internal/MissingBraces.scala:109\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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/MissingBraces.scala"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"822ae26b9e364a867ce991a2baa5e3f3d3a42ae8845f2cdeae3e850e97b3e983"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: FormatOps (LCOM4 17): FormatOps\u0027s methods fall into 17 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 17 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatOps.scala"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad434f77e1e1ce0aaf422241bc70147646ad3f87ba09e62c2f12dde603753324"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: CopyOnWriteArrayList (LCOM4 4): CopyOnWriteArrayList\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-benchmarks/src/resources/scala-js/CopyOnWriteArrayList.scala"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"316d9344661c66a4d09cd56b1a3f32e9b8b30225dee34d6fec78b971edead6f0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala: scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 76 in SplitsAfterLeftBrace.getRest at line 278. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-16..2026-10-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-16 18:49:19 -07:00\u0027 --until=\u00272026-10-14 18:49:19 -07:00\u0027 --full-history --no-merges -- scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"40274c1da583bea1793c739dafe11552f4c2312e147f1deaf05bb9f65026686a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatWriter.scala: scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatWriter.scala changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in FormatLocations.alignmentTokens at line 1211. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-16..2026-10-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-16 18:49:19 -07:00\u0027 --until=\u00272026-10-14 18:49:19 -07:00\u0027 --full-history --no-merges -- scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatWriter.scala\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatWriter.scala"},"region":{"startLine":1211}}}],"partialFingerprints":{"codehealthFindingId/v1":"3afbe9aa2e38dd28a9f5f22ef02a134d20ed83bb1e34e55e132205c4fbee2d8d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/RemoveScala3OptionalBraces.scala: scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/RemoveScala3OptionalBraces.scala changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in RemoveScala3OptionalBraces.onRightFromBraces at line 164. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-16..2026-10-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-16 18:49:19 -07:00\u0027 --until=\u00272026-10-14 18:49:19 -07:00\u0027 --full-history --no-merges -- scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/RemoveScala3OptionalBraces.scala\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/RemoveScala3OptionalBraces.scala"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"704a99aa85443edbb638e9f74acee55ebe2454a8a62be8ab5a1fedb1b8b9e133"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scalafmt-core/shared/src/main/scala/org/scalafmt/config/ScalafmtConfig.scala: scalafmt-core/shared/src/main/scala/org/scalafmt/config/ScalafmtConfig.scala changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in ScalafmtConfig.checkErrors at line 371. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-16..2026-10-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-16 18:49:19 -07:00\u0027 --until=\u00272026-10-14 18:49:19 -07:00\u0027 --full-history --no-merges -- scalafmt-core/shared/src/main/scala/org/scalafmt/config/ScalafmtConfig.scala\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-core/shared/src/main/scala/org/scalafmt/config/ScalafmtConfig.scala"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad15ff19db62b49348c287ec2beed189dd4466a6df34caf1235a24afaefc428d"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 76 significant file(s) lose their only recent owner: scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala, scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatWriter.scala, scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatOps.scala, scalafmt-core/shared/src/main/scala/org/scalafmt/util/TreeOps.scala, scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/Imports.scala, scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/RedundantBraces.scala, scalafmt-core/shared/src/main/scala/org/scalafmt/config/Newlines.scala, scalafmt-core/shared/src/main/scala/org/scalafmt/internal/OptionalBraces.scala (\u002B68 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8d3e16115558f7e6f2756d0d7d9116ac2a6ef4b9531f3a648330407fa8375c10"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(olafur) property test: same solution without optimization or timeout. \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":"scalafmt-tests/shared/src/test/scala/org/scalafmt/FormatTests.scala"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d11a29b5ccd2182397063343a51631e47f5fe22d773eadf27f643200ba31e62"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(olafur) make possible to limit states per unit test. \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":"scalafmt-tests/shared/src/test/scala/org/scalafmt/UnitTests.scala"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a385fdc97691a1c301f7569001d8d507f7cbc8c027fd5a782a478f9c26e7f1b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(olafur) move this to scala.meta? \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":"scalafmt-tests/shared/src/test/scala/org/scalafmt/util/FormatAssertions.scala"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"77600742f49c73a39a620e8c3d52fe19bf02ba5367e2de4fa7d9469af02a552c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: the class does not exist for version old versions, e.g. v0.2.8 \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":"scalafmt-dynamic-core/src/main/scala/org/scalafmt/dynamic/ScalafmtReflect.scala"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"912d38d8bf937ae222918433d1ca8723a4e7701fd2fecc5838351245b6f08691"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: make this pretty \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":"scalafmt-docs/src/main/scala/website/package.scala"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4412d1ab3d3cb39adbe25e711e45eede46c98c140983338596f4422b4a8c62b"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: don\u0027t modify signature, scalafmt-dynamic expects it via reflection \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":"scalafmt-core/shared/src/main/scala/org/scalafmt/Scalafmt.scala"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8402906655577400355f85e0dc0dee5c51d82aa9a163531afdd8b801e020a5b"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: don\u0027t modify signature, scalafmt-dynamic expects it via reflection \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":"scalafmt-core/shared/src/main/scala/org/scalafmt/Scalafmt.scala"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0c13542f03c379e1c165d6d02a5a5e28ef27dbf105663ce20e4adc27cbba3bd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(olafur) parameterize \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":"scalafmt-core/shared/src/main/scala/org/scalafmt/util/LoggerOps.scala"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd094c4bb5fe87dd0f3833966eadab86a130620aae5ca433f2e8dbdf95c83fc5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(olafur) inefficient, precalculate? \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":"scalafmt-core/shared/src/main/scala/org/scalafmt/util/TreeOps.scala"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"e85527f864355552a0db34dba22d3ebb2ec4732afdacfc5e52fba5daed0b3959"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(olafur) document why/how this optimization works. \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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/BestFirstSearch.scala"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"df577a55cac0c89747d7634ba7354a4d68ba9a7e0cbba2d8b931feb3cad73ea5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(olafur) clear queue between arguments, they are independent. \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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatOps.scala"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"27892c1958b71abc9475b07bc592df2735da9b633bf507e395cb684697fe64f3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(olafur) what the right { decides to be single line? \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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatOps.scala"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"891437dbdb34d00ab93399612048be539c8f43f0e7787ce28794de4f777c858e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: if that ever changes, modify how rewrite rules handle infix \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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatOps.scala"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"27bbf0664b1d0a9a9c4be48403ee9776f443150403ce9380b82f4acac767859b"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // Hack to allow any annotations with arguments like @foo(1) \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatOps.scala"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"84c8df6a42df7872823b45b8c77db8370c6f1a7ba2369e33ab25284cd291dbd6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(olafur) Refactor implementation to make it maintainable. It\u0027s super \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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatWriter.scala"},"region":{"startLine":1209}}}],"partialFingerprints":{"codehealthFindingId/v1":"f31f91a0542acca489de498260b28d0109d898d48c3e9b2044d3eaeafbcb016c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: amend for additional cases when the parser supports them \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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/OptionalBraces.scala"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bcf29b435ab812ee71e9697810d7ff40b8011974a1fcf999ce202b6e29c324c"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: sometimes we have zero args, so multipleArgs != !singleArgument \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":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala"},"region":{"startLine":1793}}}],"partialFingerprints":{"codehealthFindingId/v1":"99c5f9ac3c097458727b47f8c6c3c58274916dc35f1a91cb73202c56c3d93298"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(olafur) expire policy, see #18."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/State.scala"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f92b10a77f77e6652e9d6b11e50c5267bd7907c627bf0e915769a05e88ab3d3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We need to pass customFiles information to ProjectFiles \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":"scalafmt-cli/shared/src/test/scala/org/scalafmt/cli/CliTest.scala"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"54dc7245dd651cb0e1df189468e9025f4e6a134b60b166f6bf009c8a22e81a48"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME remove these counters when tuning/testing is completed \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":"scalafmt-benchmarks/src/resources/Endpoint.scala"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1813077ed702caa70ccbf435e1f7a666fa76af816f1ac7bc6cc9b12452bacf1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME remove this when testing/tuning is completed \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":"scalafmt-benchmarks/src/resources/Endpoint.scala"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcffc819b7648347754dcf86c6abe3aaa0ee843423ffe86961526d426228cb83"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: replace this with o.a.s.sql.hive.HiveCatalog once we merge SQLContext and HiveContext \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":"scalafmt-benchmarks/src/resources/spark/HiveMetastoreCatalog.scala"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"2830da9f437ec9a66204ea3851cb1664a1eb0170c14b7c50e4a2bc75efa45c7d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We need to place the SQL string here \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":"scalafmt-benchmarks/src/resources/spark/HiveMetastoreCatalog.scala"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3e9ab9650a9c855b7e1b4baccb61509a4a07786b6e3307c6d780810c720308a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Support persisting partitioned data source relations in Hive compatible format \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":"scalafmt-benchmarks/src/resources/spark/HiveMetastoreCatalog.scala"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"51cb06cc181c30ad9fda0c1acb076f301d0a21bc583dbe58b031d2d18cae9e22"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: merge this with HiveClientImpl#toHiveTable \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":"scalafmt-benchmarks/src/resources/spark/HiveMetastoreCatalog.scala"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"d44514079fd3189e2615d5dfbe021eb2162c977809ab0390c108c7ed32911f44"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: check if this estimate is valid for tables after partition pruning. \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":"scalafmt-benchmarks/src/resources/spark/HiveMetastoreCatalog.scala"},"region":{"startLine":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9d12732ce1df79bfe8bfddb2e913e2b653c04ac9944363b10a243911a699fdc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO In theory we should filter out protected methods \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":"scalafmt-benchmarks/src/resources/scala-js/Analyzer.scala"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"44aa37401ef19d9742dcd42e7bc090d9e8de777b753521d8f521ad6604a64f16"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Make it always fatal when we can get rid of bypassLinkingErrors \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":"scalafmt-benchmarks/src/resources/scala-js/BaseLinker.scala"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc793fcbc3b459218b811fbce15c20a6433746b02b592ac1d7cb9422c9acc575"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO This cast is suspicious \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":"scalafmt-benchmarks/src/resources/scala-js/OptimizerCore.scala"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"450ed024a7c7ad379e46cf7d711f7389013cc13f7759cbef2d2a133fc82cf16e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO This cast is suspicious \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":"scalafmt-benchmarks/src/resources/scala-js/OptimizerCore.scala"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"d033f9e30ce7a355c244a1b10220e23b7b669501eafcd732be29e6a40d9599a0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO? Inline multiple non-trait-impl-forwarder with the exact same body? \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":"scalafmt-benchmarks/src/resources/scala-js/OptimizerCore.scala"},"region":{"startLine":1208}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c1079aa389bca34d6dafd236175de59a6f8222cd7387693b47f19c8eaf511ca"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Support assignment of record \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":"scalafmt-benchmarks/src/resources/scala-js/OptimizerCore.scala"},"region":{"startLine":1472}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b42160fc74d6f1a34426cf6dc6827ddb4d8cc2c1c82523ffae24f4b617f7814"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Improve 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":"scalafmt-benchmarks/src/resources/scala-js/OptimizerCore.scala"},"region":{"startLine":3337}}}],"partialFingerprints":{"codehealthFindingId/v1":"331fe2d2fa7f504c3480f15286b192544bafcd0e61cb3cee872009348738a49e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(olafur) remove once testkit 1.7 is 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":"scalafmt-benchmarks/src/main/scala-2.12/benchmarks/MacroBenchmark.scala"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"870eca9ae9ebbf0d7af892a34d99b4ba9bc9eecd05b3822b220341faff1fb8f0"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060. ADRs are expected here because \u0060build.sbt\u0060 makes this repository a deployable product (line 211)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"build.sbt"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd68206750b9082481e467d0cbe3dfec67ae9c3d9cd1c233910d9e71014b6f29"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060addStmtFT\u0060 spells \u0060FT\u0060 where 14 names in the project spell it \u0060Ft\u0060: 14 of 15 names in project repository spell the token \u0060Ft\u0060 (14 of 15; unit: names in project repository containing \u0060Ft\u0060). Peers: FormatOps.binPackParentConstructorSplits(lastFt) (scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatOps.scala:526); CtrlBodySplits.getWithIndent(endFt) (scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatOps.scala:1261); CtrlBodySplits.withIndent(endFt) (scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatOps.scala:1272); CtrlBodySplits.withIndent(endFt) (scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatOps.scala:1284); FormatOps.withNLPolicy(endFt) (scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatOps.scala:1293). Rename to \u0060addStmtFt\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/OptimizationEntities.scala"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"14ca2a008cd762be35b33374f35d1debc53622532afc9e5c64f4ba862debb204"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 1 of 2 project(s) overshoot their size bounds, lowering Project Cohesion to 0.0/10. The most over is \u0060(repository root)\u0060 (42215 LoC, 984 module-visible types across 40 directories). Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d5a94650dc74886a0f1f08eb9fb6775f1fc395279ef7e901c970c9d26f767a72"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d5b8f11381d61a58459ffc7c595fd52d09c03c711894a63a9578043d2338412b"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"613343d1b752f35745826fe8d15b453cf20383607c0f92f58d6658c1e8f77558"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b084deba18fe695fd181ce54d9bc60c94af417f07daf68e37cdadef3853e8975"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ece6fb8c1250b91116d39d591455c6a6cb3d348a2231c54206ee82f005ad3ab2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2b50d6185f231a28fa9959e31861b0be76667502f1a2f794cc5c60d4fa797cb7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7e2647a6950b61b93f138b3e912ccdd0abe8c4fcc40b37e5726a20e18a0e2d5d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"96f88121b035a898a6759141862415469563ae4858d3bd2449d90d5e5ba04a57"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"6ef688db1599899e86827325950d1d0a15b9324b0ba2820b56c8cede048ea1e6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"887622ce229e870ddf34d09405c3c64bc35c608c4df9f929db3d929316039138"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"758db291eb6affb8befb20d70412b6c80993e60a0462a2aa4ff22facac51d61b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b938b4c7756a32f3a61765469fa9a69e1f9e3834a4f8ff08f92cd87aed52a5e3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4a274ef8a901300f4a1cc52ebdf194cd757b387b455ea0e2c76b0a5666a6a5f2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"59cf0738aa9b5f8e021a44f41dc4ab52c7592a3d04c782896b341324c69d44dd"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3639c0d806bbb465e22be478f24f9a78c8bc61d186d3a03aac1acf0e7f02e800"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cce8b96a917822f5704a3b6dd0bc7a3c27a625d0be686c66f4699363a2851d5c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7035936f4df57a688c157a76839448af515ebf8e96c170848d1652da56822aba"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f8b888dde4f0deea72273593bb518325a420daa162687c81aabf6394763a900a"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"678f5e44c2ac2709af221d46fac013f5790ddc74e5f6d5e590310a2d8c21310b"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"3fcb079521cb415bc083f094f20448b3b29effce45b028c0075ab233c83685a6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2d2acf014278303fa09a8adfbc3fb6e7788b2f8c71e9d2a9c1d1e38b20242ba5"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"453ceabf794bd57db4d5cca6a80c7cc1fc8d568aa66728f8b6773eb2f9992e02"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"249ea29135ef69712621f6d07ca7e0e714f39d17e84ac0c60f1dbe9a443313fa"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c24680e24cbf4dcc1c16033560cc7dab48e242e0e1f9e54268ad7680a35b9d29"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"20b53c9905353231a2882775e4aac87ae02b20081e17be51ee2597587256fc0d"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"fb57a5968564d4619cc939f18b0250358a7d56c61511f5effcbff49cfd0b2bf6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b56745f6b30e37aec1488b8be17c30f0a534639472f3b543d3e5556489d3d44d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2ffa70399018fc7d60e5859975065197ffa8ebc2a319620f01f8c4cb7b57548b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b21ef51d97f04d1a8b921e635aca9ef4e877341aa2c3b0f6eaeabc61234774b6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dd0a3404dccd0a070fe4feb6708831003b30eb18e69b0c5c4a375147384eff39"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b5e5427f34e5b9193d0020def8fe13295a34b4e672b24869b3149b8a84aca992"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6504d8d1633fd2629c17cb911821ef9d4b240f323d5e1ebac2df01ac4726a04a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f9da445e482aad92005903840419edcdf03d0d51b46c5e58761c8801ee6cbf38"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2ff7c6bbc2cb8cfbf30210bd569d43f26f3ec6badc499c4360d22f545d272e1c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b389489bc2a12477564ca8f55bcfc8fd0ab1489d7dc23059a812cf4edbc72199"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"ec98ea06b2ce65b7fb9bb08dd04c4478921f17af6634793444d3bb334423a19f"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-552","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8c35445bee2e83cea25a413c3cbc6815d872e1b92fb16d33aa7c23301bf149d1"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"33dd56d25dfb53a18f3c5a05dbe5c6fa37de43fc85a966aa1eabefeea0e8a3c2"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fe2d688610b51e0a5a02c7c5dd1724a4986e40f2689fb84510e2ec0164c27d6a"}},{"ruleId":"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":"be9c57e2fb625c43c271d051f76b97f27b6976f4ec358ef8fea1d9cb5205f460"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"becbc5502f94878197b05d70c7ef15f1353fd99a90efcb824b9c43f11ae5ce7a"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-benchmarks/src/resources/scala-js/GenJSCode.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1565b2385d9287659e8bb797697ded6d407f5c084acb9fe99bb6b43fba21d4e"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-benchmarks/src/resources/scala-js/OptimizerCore.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8894215256ea12ea9166cc0777e47238ae6c35033975e8c3a153bfdde66cf14b"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-benchmarks/src/resources/spark/HiveMetastoreCatalog.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b30387b9fb07e378b1dc61ed699e66e82104d639c2f456aba94417a520ece02c"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-benchmarks/src/resources/Endpoint.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa89970e261b09af8f7f20cc6eea93ddf2a07e1b6fb2cc78d12e173ed28afe44"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-benchmarks/src/resources/scala-js/ScalaJSClassEmitter.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"043b9b24427ed7007a470ea866c6bb5b9fe07af0bfd1f01a1a135fb789065ee1"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-benchmarks/src/resources/scala-js/Division.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"130de046a7a3f40d097d2bb8ca031f8264245d04912464e5ffc9bdf01b04264b"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-benchmarks/src/resources/scala-js/Analyzer.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf3f518ca77a76889e645de72f8d59641f056eeb4103b320e425647f1bcc2c0f"}},{"ruleId":"D34","level":"note","message":{"text":"Further orphaned files (smaller): 12 smaller file(s) also have no living knowledge \u2014 folded into the freshness score and metrics rather than raised one row each \u2014 most significant first: scalafmt-benchmarks/src/resources/scala-js/BaseLinker.scala, scalafmt-benchmarks/src/resources/scala-js/Primality.scala, scalafmt-benchmarks/src/resources/scala-js/SourceMapWriter.scala, scalafmt-benchmarks/src/resources/scala-js/TypeKinds.scala, scalafmt-benchmarks/src/resources/scala-js/CopyOnWriteArrayList.scala, scalafmt-benchmarks/src/resources/scala-js/Trees.scala, scalafmt-benchmarks/src/resources/scala-js/JavaLangString.scala, scalafmt-benchmarks/src/resources/scala-js/Utils.scala (and 4 more) (19 orphaned of 110 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 110 of the 248 production source files in this repository met that bar). Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ce861fd78f6935114d3a342cb90ad25870f984e1042954fcbbe27c0e23be3658"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-benchmarks/src/resources/scala-js/BaseLinker.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cde08df335144c0039cb77ded5cad9957675688a380a3358eb4a69243f673aa"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-benchmarks/src/resources/scala-js/Primality.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1295337312d4d18dc0c929ced5dfe613927d5ee2c22b9e042c7e4033af69fc71"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-benchmarks/src/resources/scala-js/SourceMapWriter.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f73653ceddfd3983ce18b930b9ee8d9a78679e5d811a1661ac2d1a33738b6feb"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-benchmarks/src/resources/scala-js/TypeKinds.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3575e5d8001005b4b89003650a95be1cf3d5e7ae70454ad6605787d2da41b210"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-benchmarks/src/resources/scala-js/CopyOnWriteArrayList.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3eb540fbb0c4a4d432854f5850978803674c36a05f60ef4b8294206cdee353e"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-benchmarks/src/resources/scala-js/Trees.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5141b4553adb22777942219a8c365dcf828042db74dda398263b12a1aeb99a7"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-benchmarks/src/resources/scala-js/JavaLangString.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e05f8355a519efa3858c39778e4fcafac6990fe955f950e3932d6b314f6bc66"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-benchmarks/src/resources/scala-js/Utils.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5aaa889803a085a3c8d0c0d241e656d099d153c42c32e2306a360eb465a3135"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-benchmarks/src/resources/scala-js/Semantics.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e961946aa82c4b247337fffae8dd12d26eda4369a0f9589f1b4796063fb8cee9"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-benchmarks/src/resources/scala-js/JSDependency.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a5560bd57f32d3356da1e361b02016d4a15113641011c6290a487ce942e896e"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-interfaces/jvm/src/main/java/org/scalafmt/interfaces/ScalafmtReporter.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"612f4d01d9fffc941d8c9b0227785aec8adfe4e308f2d7e30d59d85f68f0b171"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-interfaces/native/src/main/java/org/scalafmt/interfaces/ScalafmtReporter.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"76c1ea1e7581399df0bf2eb9451e22f99a54add97b1da310de258f1347c8ebf3"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: Router.scala \u2194 TokenClasses.scala: \u0060scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Router.scala\u0060 and \u0060scalafmt-core/shared/src/main/scala/org/scalafmt/util/TokenClasses.scala\u0060 change together 80% of the time (12 of the 15 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 12 shared commits counted here, the most recent 3 are \u006083f68e03\u0060 Router: remove overlapping match rules; \u00601e3bcd4c\u0060 Use new tree/token implicit extensions; \u00606edbb3ea\u0060 TokenClasses: add matches/apply, to join unapply \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Router.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"45c32c2715fd41ee6d7ce01b1ef8a72831a12a2e278fee8db394f35949c965a7"}},{"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":"1b213f6eedd4b140d0bc37bdf1496f72811a643f34064f12518b32e9e83bcfc7"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"759dca709f1a032fb6f624ce672e6afb5558fce53ecf01fb73618c4d33923164"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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"},"taxa":[{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"7ad4701c91f7eaa24aa7b7536975da3068c18dd1ab098025ae5c285286432c8e"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"IC1","level":"note","message":{"text":"Blanket warning suppression: A bare \u0060// scalastyle:off\u0060, \u0060// scalafix:off\u0060 or \u0060@nowarn\u0060 (or Wartremover\u0027s \u0060warts.All\u0060) switches every rule or warning off \u2014 hidden debt. Suppress the specific rule on the specific line, with a justification, instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-cli/shared/src/main/scala/org/scalafmt/cli/CliArgParser.scala"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"e29e8ef04718b42c23bb8249aa3b459af3e8ff47e8d9435b4459283707023a44"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"M2","level":"note","message":{"text":"No architecture diagram/doc: No C4/Structurizr/PlantUML/Mermaid/Graphviz/D2 diagram, no drawn diagram named for the architecture, no file named \u0060architecture\u0060 or \u0060design\u0060 in any markup this check reads, and nothing in the README, docs or contributor guides that announces the shape \u2014 no \u0060## Architecture\u0060 heading, no \u0022architecture overview\u0022/\u0022high-level design\u0022 phrasing, no \u0022the architecture is \u2026\u0022 introduction, no guided code tour. A shape laid out in prose that never names itself as the architecture is not visible to this check, and neither is one kept outside the repository, so this row reports the absence of a re-findable shape document \u2014 not evidence that nobody wrote the shape down."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0c190e7c159d1850ee706c3ac4486e151e8a4fe169de4bf61436b9f399654f06"}},{"ruleId":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add scalafix or scapegoat (or \u0060semgrep --config=auto\u0060, which runs on any language) as a CI step. What was searched, so you can tell an absence from a miss: the 4 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge\u0027s web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen \u2014 if that is your case the row is wrong, and saying so is more useful than adding a second scanner."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/ci.yml"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P3","level":"note","message":{"text":"Dependabot does not watch npm: \u0060.github/dependabot.yml\u0060 schedules updates, but no \u0060package-ecosystem\u0060 entry covers \u0060npm\u0060, which this tree depends on \u2014 so those dependencies get no update pull requests and no advisory pressure, however complete the dep-scan credit looks. Add the missing entry to the \u0060updates:\u0060 list."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/dependabot.yml"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"da14c5e8fb421b8614b797a2517de829b3c94f3b85263a50e3283dfd26519afe"}},{"ruleId":"P4","level":"note","message":{"text":"No release approval gate: The release is automated and no gate that pauses it for a human is DECLARED IN THIS REPOSITORY\u0027S PIPELINE FILES. What was read: every file under \u0060.github/workflows/\u0060, \u0060.forgejo/workflows/\u0060, \u0060.gitea/workflows/\u0060, \u0060.azuredevops/\u0060 and \u0060.azure-pipelines/\u0060, plus \u0060.gitlab-ci*\u0060 and \u0060azure-pipelines*\u0060 \u2014 with comment text stripped, so documenting a gate is not declaring one. What would have counted: GitLab\u0027s \u0060when: manual\u0060, CircleCI\u0027s \u0060type: approval\u0060, an Azure \u0060ManualValidation@\u0060 task or an \u0060approvals:\u0060 block, a Jenkins \u0060input\u0060 step, a \u0060uses:\u0060 step naming an approval action, an \u0060environment:\u0060 paired with \u0060reviewers\u0060 / \u0060required_reviewers\u0060 / \u0060protection\u0060 / \u0060wait-timer\u0060 / \u0060deployment_branch_policy\u0060, a draft-release step, a \u0060workflow_dispatch\u0060 promotion, or a release-event gate. \u2605 What this cannot see, because none of it is a file: a GitHub environment whose required reviewers are configured in repo SETTINGS, a branch protection rule, or an organisation deployment policy \u2014 all of them real, enforced gates that live outside the repository. If yours is one of those, this row is wrong and nothing in the tree could have told us. Otherwise: whatever the release trigger points at is published to users unreviewed, so a mistagged or unverified commit ships and the only remedy is a follow-up release."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6c11e2dbd483b4b423b95ac61bfcc7af1d55351b28a20d2b1105b31cfe38cc60"}},{"ruleId":"PF1","level":"note","message":{"text":"Benchmarks don\u0027t track allocations: A JMH/Jetpack Benchmark suite exists but nothing turns on its allocation measurement \u2014 allocations (the main way hot code pressures a garbage collector or allocator) aren\u0027t being measured."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-benchmarks/src/main/scala-2.12/benchmarks/MacroBenchmark.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e15db9a06401b780e3726b1928bb2348f86779e7e2e1f32ab8a0a365c69e675e"}},{"ruleId":"S1","level":"warning","message":{"text":"Weak hash algorithm: MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything \u2014 a signature, an integrity or tamper check, a credential, or any value an attacker can influence \u2014 that is a real weakness: use SHA-256\u002B (\u0060MessageDigest.getInstance(\u0022SHA-256\u0022)\u0060) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead \u2014 a non-cryptographic hash such as xxhash or murmurhash says it in code \u2014 since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-dynamic/src/main/scala/org/scalafmt/dynamic/coursier/ClasspathCache.scala"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"053a8ba5e9f1a99b66a360128fb33bd73a2e120134bbcd124e416e507b533f5e"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: website/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/package.json"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"26d810553590416334562b2f9b960beddf010b586837f971865cb50acf922ca3"}},{"ruleId":"X23","level":"note","message":{"text":"Diagnostic log message is built whether or not it is wanted: \u0060debug\u0060 at line 79 is called with an argument built by \u0060sel.elements.mkString(\u0022\u2026\u0022, \u0022\u2026\u0022, \u0022\u2026\u0022)\u0060 (line 81), whose cost grows with the collection it walks. Scala evaluates a call\u0027s arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached \u2014 and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: the logger takes a built \u0060String\u0060 (SLF4J, Akka/Pekko \u0060LoggingAdapter\u0060, \u0060context.log\u0060), and there is no \u0060isDebugEnabled\u0060/\u0060isTraceEnabled\u0060 test and no debug flag."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scalafmt-benchmarks/src/resources/Endpoint.scala"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"1112e5f096e13e00287886dc082b103cc6e4b9bf4e0f8f558a362ac4871fa10c"}},{"ruleId":"X5","level":"note","message":{"text":"Scala\u0027s null is not held to the type system everywhere: No build over this repository\u0027s 229 Scala product file(s) passes \u0060-Yexplicit-nulls\u0060, enables WartRemover\u0027s \u0060Null\u0060 wart or runs Scalafix\u0027s \u0060DisableSyntax.noNulls\u0060, so every reference type admits null and nothing reports a \u0060null\u0060 written into the code or returned from a Java API \u2014 the first one to reach a method call is a \u0060NullPointerException\u0060. \u0060Option\u0060 by convention is a habit no tool here holds the code to."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"23e7c3c6da50151f07723c64ca4f881fd5903e713d143161a7c0594ad7ba29cc"}}],"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-1104","guid":"4c918cb5-b2a6-6c55-9963-a44ee464305e","name":"Use of Unmaintained Third Party Components","shortDescription":{"text":"Use of Unmaintained Third Party Components"},"helpUri":"https://cwe.mitre.org/data/definitions/1104.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-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-522","guid":"71fb233e-ce6a-ae57-9419-ef8373540b09","name":"Insufficiently Protected Credentials","shortDescription":{"text":"Insufficiently Protected Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/522.html"},{"id":"CWE-552","guid":"3492436b-eca2-9c54-9ba3-5dade427c903","name":"Files or Directories Accessible to External Parties","shortDescription":{"text":"Files or Directories Accessible to External Parties"},"helpUri":"https://cwe.mitre.org/data/definitions/552.html"},{"id":"CWE-732","guid":"1da27e8f-b330-7650-ab63-bd61953eae5d","name":"Incorrect Permission Assignment for Critical Resource","shortDescription":{"text":"Incorrect Permission Assignment for Critical Resource"},"helpUri":"https://cwe.mitre.org/data/definitions/732.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A06:2025","guid":"491554d7-b8e4-9652-91a9-53700dc92ece","name":"Insecure Design","shortDescription":{"text":"Insecure Design"},"helpUri":"https://top10.owasp.org/2025/A06_2025-Insecure_Design/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-6","guid":"f2ee2486-b260-2952-a41f-6b67fa713940","name":"Insufficient Credential Hygiene","shortDescription":{"text":"Insufficient Credential Hygiene"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-06-Insufficient-Credential-Hygiene"},{"id":"CICD-SEC-8","guid":"b6b2dacf-a168-4957-876e-a8c73ee00eb0","name":"Ungoverned Usage of 3rd Party Services","shortDescription":{"text":"Ungoverned Usage of 3rd Party Services"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-08-Ungoverned-Usage-of-3rd-Party-Services"},{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"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":45,"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."]}]}