{"$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":"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":"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":"D24","name":"Comment Value","shortDescription":{"text":"Comment Value"},"helpUri":"https://codehealth.canine.dev/dimensions/D24"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D31","name":"IaC \u0026 Container Security","shortDescription":{"text":"IaC \u0026 Container Security"},"helpUri":"https://codehealth.canine.dev/dimensions/D31","relationships":[{"target":{"id":"CWE-1032","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-16","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1032","CWE-732","CWE-16"],"owasp":"A02:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D37","name":"Vulnerability-disclosure Policy","shortDescription":{"text":"Vulnerability-disclosure Policy"},"helpUri":"https://codehealth.canine.dev/dimensions/D37","relationships":[{"target":{"id":"CWE-1059","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1059"],"owasp":"A02:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX2","name":"Stateful singletons","shortDescription":{"text":"Stateful singletons"},"helpUri":"https://codehealth.canine.dev/dimensions/AX2"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX6","name":"Interface segregation","shortDescription":{"text":"Interface segregation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX6"},{"id":"AX8","name":"Test isolation","shortDescription":{"text":"Test isolation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX8"},{"id":"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":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"R1","name":"Type Safety","shortDescription":{"text":"Type Safety"},"helpUri":"https://codehealth.canine.dev/dimensions/R1"},{"id":"R10","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/R10"},{"id":"R2","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/R2"},{"id":"R3","name":"Large Files","shortDescription":{"text":"Large Files"},"helpUri":"https://codehealth.canine.dev/dimensions/R3"},{"id":"R9","name":"Circular Imports","shortDescription":{"text":"Circular Imports"},"helpUri":"https://codehealth.canine.dev/dimensions/R9"},{"id":"S1","name":"Web-Security Posture","shortDescription":{"text":"Web-Security Posture"},"helpUri":"https://codehealth.canine.dev/dimensions/S1"},{"id":"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":"TypeComparer.recur (cyclomatic 421): TypeComparer.recur has cyclomatic complexity 421 (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":"compiler/src/dotty/tools/dotc/core/TypeComparer.scala"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b2c53c72f49ba64133549df21d6f37d26c5ddf4e6c9b1a6ac662213d1eac52e"}},{"ruleId":"D1","level":"warning","message":{"text":"Typer.adapt1 (cyclomatic 188): Typer.adapt1 has cyclomatic complexity 188 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/Typer.scala"},"region":{"startLine":4580}}}],"partialFingerprints":{"codehealthFindingId/v1":"270808e5bf57d1f89a278d042f09a4bde254b48262bad5140e2f54db26b2309c"}},{"ruleId":"D1","level":"warning","message":{"text":"RefChecks.checkAllOverrides (cyclomatic 187): RefChecks.checkAllOverrides has cyclomatic complexity 187 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/RefChecks.scala"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6255a7160a2eaf05b65b4a52efe0c87ef2a3a066c1488aa50075a5aaebfb0da"}},{"ruleId":"D1","level":"warning","message":{"text":"RefinedPrinter.toTextCore (cyclomatic 182): RefinedPrinter.toTextCore has cyclomatic complexity 182 (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":"compiler/src/dotty/tools/dotc/printing/RefinedPrinter.scala"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"c91843de0f85e99e7aeabca764d6c81b442806424b7f716223c6f0cfe503829f"}},{"ruleId":"D1","level":"warning","message":{"text":"SourceCodePrinter.printTree (cyclomatic 139): SourceCodePrinter.printTree has cyclomatic complexity 139 (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":"compiler/src/scala/quoted/runtime/impl/printers/SourceCode.scala"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef8066527581d508ad3e824736d80904f2d44ffa2c72a74b207edcb3df5e3bae"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeEval.tryCompiletimeConstantFold (cyclomatic 132): TypeEval.tryCompiletimeConstantFold has cyclomatic complexity 132 (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":"compiler/src/dotty/tools/dotc/core/TypeEval.scala"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"89d2159d48859dc89fadf9180a0d2e74828e3dc4fa0fbc9cd89872fa25f68c47"}},{"ruleId":"D1","level":"warning","message":{"text":"CheckUnused.warnings (cyclomatic 124): CheckUnused.warnings has cyclomatic complexity 124 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/CheckUnused.scala"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c20e86d40484b6d48a01d1c81e94b3a904cc341dacda112e82fef0ec00abe2b"}},{"ruleId":"D1","level":"warning","message":{"text":"Typer.findRef (cyclomatic 107): Typer.findRef has cyclomatic complexity 107 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/Typer.scala"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"69a969e9069ed5a1bc33059f811be4ed5de1e510cc7931709096331de66df42c"}},{"ruleId":"D1","level":"warning","message":{"text":"desugar.classDef (cyclomatic 105): desugar.classDef has cyclomatic complexity 105 (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":"compiler/src/dotty/tools/dotc/ast/Desugar.scala"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b520e8c6c82b08bafe1c06cc6dce27cf16a40b5ae3b18d7cba40fa7be1fc8de"}},{"ruleId":"D1","level":"warning","message":{"text":"TreePickler.pickleTree (cyclomatic 105): TreePickler.pickleTree has cyclomatic complexity 105 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/tasty/TreePickler.scala"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"909c209430a535dd22cf2f41f18476e90d9cbae7e8bfc2e356d1d2f4fc849625"}},{"ruleId":"D1","level":"warning","message":{"text":"TypesSupport.inner (cyclomatic 104): TypesSupport.inner has cyclomatic complexity 104 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scaladoc/src/dotty/tools/scaladoc/tasty/TypesSupport.scala"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"2df52393bf62bb2e0d09332642359a367d366f56f9d8cdf8d3f637a85da4e34a"}},{"ruleId":"D1","level":"warning","message":{"text":"TreeReader.readTree (cyclomatic 102): TreeReader.readTree has cyclomatic complexity 102 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/tasty/TreeUnpickler.scala"},"region":{"startLine":1326}}}],"partialFingerprints":{"codehealthFindingId/v1":"88aab5394c4987c7d8159c0855d8e8c7d3881d5615018832908b94a9fb00de2f"}},{"ruleId":"D1","level":"warning","message":{"text":"InstructionStackEffect.computeConsProd (cyclomatic 96): InstructionStackEffect.computeConsProd has cyclomatic complexity 96 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/backend/jvm/analysis/InstructionStackEffect.scala"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"4612675d959f1c64c3d5dddf56ed49d945f29b500f9ca0a78fe52bae7148d5c4"}},{"ruleId":"D1","level":"warning","message":{"text":"JSCodeGen.genSimpleBinaryOp (cyclomatic 85): JSCodeGen.genSimpleBinaryOp has cyclomatic complexity 85 (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":"compiler/src/dotty/tools/backend/sjs/JSCodeGen.scala"},"region":{"startLine":2754}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e04d10bdf84165fead25e719bb1b1b4d2ec0d5d7de6a84ea78cd2563908e901"}},{"ruleId":"D1","level":"warning","message":{"text":"Checking.checkWellFormed (cyclomatic 84): Checking.checkWellFormed has cyclomatic complexity 84 (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":"compiler/src/dotty/tools/dotc/typer/Checking.scala"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"469301717e8ba314dbf076117e2d1895df92b3346703b3e5fb7331302f2117de"}},{"ruleId":"D1","level":"warning","message":{"text":"ClassCompleter.exportForwarders (cyclomatic 84): ClassCompleter.exportForwarders has cyclomatic complexity 84 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/Namer.scala"},"region":{"startLine":1252}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7fb730840e7b8655faf77a9d8f2555096bf6e4035900cb6553537395036f0ab"}},{"ruleId":"D1","level":"warning","message":{"text":"GenericSignatures.javaSig0 (cyclomatic 83): GenericSignatures.javaSig0 has cyclomatic complexity 83 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/backend/jvm/GenericSignatures.scala"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"a69e1b111273693f95cc4ff51b16d9b4cab780f5496d6c8bf44912f6885baa61"}},{"ruleId":"D1","level":"warning","message":{"text":"MatchReducer.matchCases (cyclomatic 83): MatchReducer.matchCases has cyclomatic complexity 83 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/TypeComparer.scala"},"region":{"startLine":3689}}}],"partialFingerprints":{"codehealthFindingId/v1":"8724307a3d107d4b9564951b59ae90b0de306697601ea6a08565ced7db87237e"}},{"ruleId":"D1","level":"warning","message":{"text":"Typer.typedUnadapted (cyclomatic 73): Typer.typedUnadapted has cyclomatic complexity 73 (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":"compiler/src/dotty/tools/dotc/typer/Typer.scala"},"region":{"startLine":3976}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8b2536daf31ccf797b1fbf0d48e3404ed1badd335a742c9b625c6c89f5f6dd9"}},{"ruleId":"D1","level":"warning","message":{"text":"JavaScanner.fetchToken (cyclomatic 72): JavaScanner.fetchToken has cyclomatic complexity 72 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/parsing/JavaScanners.scala"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"cea400549b70a314619c2acd83bb074a5097bcdecc2cf1b9e760128a6fe247fd"}},{"ruleId":"D1","level":"warning","message":{"text":"Setup.setupTraverser (cyclomatic 71): Setup.setupTraverser has cyclomatic complexity 71 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/cc/Setup.scala"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"10de95e3fdac5fee08e5e6e69a7606286763b19adf1b21eede820fc794c32210"}},{"ruleId":"D1","level":"warning","message":{"text":"desugar.apply (cyclomatic 70): desugar.apply has cyclomatic complexity 70 (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":"compiler/src/dotty/tools/dotc/ast/Desugar.scala"},"region":{"startLine":2125}}}],"partialFingerprints":{"codehealthFindingId/v1":"41391bd4b4bdc79aea88635c253db89e1031d0847367a68e62f82b9e8fdae98f"}},{"ruleId":"D1","level":"warning","message":{"text":"ImplicitSearch.searchImplicit (cyclomatic 70): ImplicitSearch.searchImplicit has cyclomatic complexity 70 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/Implicits.scala"},"region":{"startLine":1337}}}],"partialFingerprints":{"codehealthFindingId/v1":"d207b861c39818f2610dfd68ef43086482711bf395fe4d53fade6701652a6959"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeErasure.apply (cyclomatic 68): TypeErasure.apply has cyclomatic complexity 68 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/TypeErasure.scala"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8f9bbd78d2f13a3361120430ff3099593d89f091c8106d980aa004e7e467ca3"}},{"ruleId":"D1","level":"warning","message":{"text":"PostTyperTransformer.transform (cyclomatic 67): PostTyperTransformer.transform has cyclomatic complexity 67 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/PostTyper.scala"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"c034fe462d500cf55ac0c1e941bd4d2064875d29f818c78ffec44dd40f282fc0"}},{"ruleId":"D1","level":"warning","message":{"text":"Typer.typedClassDef (cyclomatic 67): Typer.typedClassDef has cyclomatic complexity 67 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/Typer.scala"},"region":{"startLine":3341}}}],"partialFingerprints":{"codehealthFindingId/v1":"66afe1b4378e5caaa7ef1acf685eaf321b90663d0f59fa3baab7f6ea17136355"}},{"ruleId":"D1","level":"warning","message":{"text":"Extractor.traverse (cyclomatic 66): Extractor.traverse has cyclomatic complexity 66 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/semanticdb/ExtractSemanticDB.scala"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c281c10de3b667fa953b22e09813d0b6cd0ff8d9e0cb024691080d750e785c0"}},{"ruleId":"D1","level":"warning","message":{"text":"ScalaJSPrepJSInteropTransformer.transformValOrDefDefInJSType (cyclomatic 63): ScalaJSPrepJSInteropTransformer.transformValOrDefDefInJSType has cyclomatic complexity 63 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/sjs/PrepJSInterop.scala"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f2aca350fb92a7ab344287ec98470b223afb1a1f47b1d548a492e9adc81bb3f"}},{"ruleId":"D1","level":"warning","message":{"text":"InlineReducer.reduceInlineMatch (cyclomatic 60): InlineReducer.reduceInlineMatch has cyclomatic complexity 60 (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":"compiler/src/dotty/tools/dotc/inlines/InlineReducer.scala"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"6752cf9c50ed4a94fd8cabf5ed693d8d4d705da029974d81029f0f3f3184c563"}},{"ruleId":"D1","level":"warning","message":{"text":"Constructors.transformTemplate (cyclomatic 58): Constructors.transformTemplate has cyclomatic complexity 58 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/Constructors.scala"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5853dc22362229a03ce1de74400d9f7c4311591bcfde80d7042abd8c073f174"}},{"ruleId":"D1","level":"warning","message":{"text":"PrepJSExports.exportsOf (cyclomatic 58): PrepJSExports.exportsOf has cyclomatic complexity 58 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/sjs/PrepJSExports.scala"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"96832d2bcc0824651aa3156c7bf25153d9024be02861859ec4218424b29dd9f8"}},{"ruleId":"D1","level":"warning","message":{"text":"GlobalOptimizer.inlineCallsite (cyclomatic 57): GlobalOptimizer.inlineCallsite has cyclomatic complexity 57 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/backend/jvm/opt/Inliner.scala"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceb5c482c46a8836eab057d3afce528714e0d29b2d21f656862aae106d24edd2"}},{"ruleId":"D1","level":"warning","message":{"text":"LocalOptimizer.nullnessOptimizations (cyclomatic 57): LocalOptimizer.nullnessOptimizations has cyclomatic complexity 57 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/backend/jvm/opt/LocalOptimizer.scala"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"1db955d14759e84d0f52a4445162f49c95c28ee7cefcf6646eb6a6f750948a6e"}},{"ruleId":"D1","level":"warning","message":{"text":"Setting.tryToSet (cyclomatic 56): Setting.tryToSet has cyclomatic complexity 56 (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":"compiler/src/dotty/tools/dotc/config/Settings.scala"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccec14df5c9b4c95c58a7d4adef22c8c69b81620114fb6c9745d03c526839066"}},{"ruleId":"D1","level":"warning","message":{"text":"Denotation.meet (cyclomatic 56): Denotation.meet has cyclomatic complexity 56 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/Denotations.scala"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"4791b746d84704667ac08ebcdfa825f14a3a6879938e00b0af2f55365dc20112"}},{"ruleId":"D1","level":"warning","message":{"text":"PlainPrinter.toText (cyclomatic 56): PlainPrinter.toText has cyclomatic complexity 56 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/printing/PlainPrinter.scala"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ee405edd3604ec5aca42a824276516efcdd8e1f1e8af47a82b3ef80f384b392"}},{"ruleId":"D1","level":"warning","message":{"text":"Typer.typedFunctionValue (cyclomatic 56): Typer.typedFunctionValue has cyclomatic complexity 56 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/Typer.scala"},"region":{"startLine":1917}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f6c5f02421358c8acb845692d8cdf7d966688be582be9899236bbbf6570962b"}},{"ruleId":"D1","level":"warning","message":{"text":"CopyProp.eliminatePushPop (cyclomatic 55): CopyProp.eliminatePushPop has cyclomatic complexity 55 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/backend/jvm/opt/CopyProp.scala"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"54794e83cc55fa29aca1dd5999527733bdaf2d41e80547ab7a33ed0a03e6bd1f"}},{"ruleId":"D1","level":"warning","message":{"text":"JSCodeGen.genStatOrExpr (cyclomatic 55): JSCodeGen.genStatOrExpr has cyclomatic complexity 55 (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":"compiler/src/dotty/tools/backend/sjs/JSCodeGen.scala"},"region":{"startLine":1898}}}],"partialFingerprints":{"codehealthFindingId/v1":"669c82c2b6c4c8c7168417f7f60d4f37a10881e7d2f331e033377c6c09f2fc31"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeComparer.provablyDisjoint (cyclomatic 55): TypeComparer.provablyDisjoint has cyclomatic complexity 55 (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":"compiler/src/dotty/tools/dotc/core/TypeComparer.scala"},"region":{"startLine":3103}}}],"partialFingerprints":{"codehealthFindingId/v1":"825b5e966de4bc44dbfb4f9f5249ddf29be247d3123188246ab25cf04cb9d482"}},{"ruleId":"D1","level":"warning","message":{"text":"Type.findMember (cyclomatic 55): Type.findMember has cyclomatic complexity 55 (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":"compiler/src/dotty/tools/dotc/core/Types.scala"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"c655f668892494ae783ebb695e229df0d9d7d09d3199e9ff1185ed701b303607"}},{"ruleId":"D1","level":"warning","message":{"text":"BoxUnbox.boxUnboxElimination (cyclomatic 54): BoxUnbox.boxUnboxElimination has cyclomatic complexity 54 (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":"compiler/src/dotty/tools/backend/jvm/opt/BoxUnbox.scala"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a61ca0c8c5605455f1869d51b83c361a4f8e61c8849c3ee0d6de054f2d813d5"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeOps.orDominator (cyclomatic 54): TypeOps.orDominator has cyclomatic complexity 54 (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":"compiler/src/dotty/tools/dotc/core/TypeOps.scala"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"951e61c12de24e2a5f1019239183f36aab7e96a49f6da607aaf68294969ab09e"}},{"ruleId":"D1","level":"warning","message":{"text":"ClassfileParser.sigToType (cyclomatic 53): ClassfileParser.sigToType has cyclomatic complexity 53 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/classfile/ClassfileParser.scala"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"49c84e55cd5a1a0e4b69c1f321797ea647065c76e34695fa595a7c6625e38cbf"}},{"ruleId":"D1","level":"warning","message":{"text":"SourceCodePrinter.printType (cyclomatic 53): SourceCodePrinter.printType has cyclomatic complexity 53 (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":"compiler/src/scala/quoted/runtime/impl/printers/SourceCode.scala"},"region":{"startLine":1099}}}],"partialFingerprints":{"codehealthFindingId/v1":"885f47ca07c075733fe146f924ac8c4404336898d9ba3cc78a95c21e59a418a2"}},{"ruleId":"D1","level":"warning","message":{"text":"CommentExtractor.extract (cyclomatic 53): CommentExtractor.extract has cyclomatic complexity 53 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"directives-parser/src/main/scala/dotty/tools/directives/CommentExtractor.scala"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"e16448d121fb435635354b582c79658337e3e3ad8fb733c6aaa8c2bddcc297e5"}},{"ruleId":"D1","level":"warning","message":{"text":"TreeMap.transform (cyclomatic 52): TreeMap.transform 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":"compiler/src/dotty/tools/dotc/ast/Trees.scala"},"region":{"startLine":1555}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a7ea94d350feb0e5533ce04f3913ac2077dedadc7711d3d5f6efbab60680013"}},{"ruleId":"D1","level":"warning","message":{"text":"RefinedPrinter.toText (cyclomatic 52): RefinedPrinter.toText has cyclomatic complexity 52 (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":"compiler/src/dotty/tools/dotc/printing/RefinedPrinter.scala"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b2370138110c85119f303d40b3c2cf198b1dd6c3831700ee587ca912fa1b401"}},{"ruleId":"D1","level":"warning","message":{"text":"TreePickler.pickleNewType (cyclomatic 51): TreePickler.pickleNewType has cyclomatic complexity 51 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/tasty/TreePickler.scala"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"eba748f2ddb4d10d5f0258a61c31331f6b2f9cb0ed9cef2dc64cb25f5c067eb5"}},{"ruleId":"D1","level":"warning","message":{"text":"Translator.patternPlan (cyclomatic 51): Translator.patternPlan has cyclomatic complexity 51 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/PatternMatcher.scala"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"08528c5594a6fe899eb0006ab14c8527ce19122de133690879a5771413a7a6bb"}},{"ruleId":"D1","level":"warning","message":{"text":"Objects.cases (cyclomatic 51): Objects.cases has cyclomatic complexity 51 (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":"compiler/src/dotty/tools/dotc/transform/init/Objects.scala"},"region":{"startLine":1607}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9b8a2bbf01abf6496452000a8f94e94bdbfff9881638635fd6ac9d312f2c4d6"}},{"ruleId":"D1","level":"warning","message":{"text":"ReplDriver.interpretCommand (cyclomatic 51): ReplDriver.interpretCommand has cyclomatic complexity 51 (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":"repl/src/dotty/tools/repl/ReplDriver.scala"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"14bdda0ffe85e386214b27f5b7d3445b976a0fd4b8ec179a376c9616c2776106"}},{"ruleId":"D1","level":"warning","message":{"text":"TreeReader.readType (cyclomatic 50): TreeReader.readType has cyclomatic complexity 50 (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":"compiler/src/dotty/tools/dotc/core/tasty/TreeUnpickler.scala"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a39ead4ba6c9c84582daa4ca072b94c49aa16f22177504dded9ef43542abdaf"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser.termParamClause (cyclomatic 50): Parser.termParamClause has cyclomatic complexity 50 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/parsing/Parsers.scala"},"region":{"startLine":3951}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4a4f13f153cfae6d428b7d23b9f2843ea78a112cb44c18fb5abbba64a12999d"}},{"ruleId":"D1","level":"warning","message":{"text":"Namer.index (cyclomatic 50): Namer.index has cyclomatic complexity 50 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/Namer.scala"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4e910c578e3611edf0715bd4e53dbf2e56e5df1cbe8bed6c2ec5e4fb56ccefe"}},{"ruleId":"D1","level":"warning","message":{"text":"Scala2Unpickler.readDisambiguatedSymbol (cyclomatic 49): Scala2Unpickler.readDisambiguatedSymbol has cyclomatic complexity 49 (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":"compiler/src/dotty/tools/dotc/core/unpickleScala2/Scala2Unpickler.scala"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfc2485987d6e110a95f63b8b1bdb3a837679c4c613cafb99d846c3ef219b9ae"}},{"ruleId":"D1","level":"warning","message":{"text":"Scala2Unpickler.readTree (cyclomatic 49): Scala2Unpickler.readTree has cyclomatic complexity 49 (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":"compiler/src/dotty/tools/dotc/core/unpickleScala2/Scala2Unpickler.scala"},"region":{"startLine":1101}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e1dd83c893333971eeb0d733ff01b0b6f0fe171f0448c069f9cb59d04f9e37c"}},{"ruleId":"D1","level":"warning","message":{"text":"SyntheticMembers.caseAndValueMethods (cyclomatic 49): SyntheticMembers.caseAndValueMethods has cyclomatic complexity 49 (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":"compiler/src/dotty/tools/dotc/transform/SyntheticMembers.scala"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"248fe1edb53d998f291ef1ff2248216ab353683f577f9257a9b72fc28c58cdf8"}},{"ruleId":"D1","level":"warning","message":{"text":"StringParsers.checkFloatFormat (cyclomatic 49): StringParsers.checkFloatFormat has cyclomatic complexity 49 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/collection/StringParsers.scala"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"49079ccc3d18bf0789e96c3735bf622a7547009ef1218334651b522516e07cd0"}},{"ruleId":"D1","level":"warning","message":{"text":"PlainBodyBuilder.genLoadTo (cyclomatic 48): PlainBodyBuilder.genLoadTo has cyclomatic complexity 48 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/backend/jvm/BCodeBodyBuilder.scala"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"21b3ca95d9e7f2ca28103b508d81bdc7173649efa4101602128eb44d4f6ee10e"}},{"ruleId":"D1","level":"warning","message":{"text":"ClassDenotation.baseTypeOf (cyclomatic 48): ClassDenotation.baseTypeOf has cyclomatic complexity 48 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/SymDenotations.scala"},"region":{"startLine":2372}}}],"partialFingerprints":{"codehealthFindingId/v1":"2af592cbce381df40ef1e47ad7033813ebcf013363c4a00fe40035cb8bcd4b4e"}},{"ruleId":"D1","level":"warning","message":{"text":"TreeReader.readModifiers (cyclomatic 47): TreeReader.readModifiers has cyclomatic complexity 47 (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":"compiler/src/dotty/tools/dotc/core/tasty/TreeUnpickler.scala"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ded11f771193a84ae37939ce95eb8118ec215e2cadd0d22a9536a843cfe921e"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser.givenDef (cyclomatic 47): Parser.givenDef has cyclomatic complexity 47 (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":"compiler/src/dotty/tools/dotc/parsing/Parsers.scala"},"region":{"startLine":4719}}}],"partialFingerprints":{"codehealthFindingId/v1":"b13b103f5fead61af2012586fc16356ce4b03d28930f42dd2bf50392b300c19c"}},{"ruleId":"D1","level":"warning","message":{"text":"Scanner.fetchToken (cyclomatic 47): Scanner.fetchToken has cyclomatic complexity 47 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/parsing/Scanners.scala"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f5da26846e96e65cb42a6111e41089ece0420af3db45990e459fcb093276b86"}},{"ruleId":"D1","level":"warning","message":{"text":"TailRecElimination.transform (cyclomatic 47): TailRecElimination.transform has cyclomatic complexity 47 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/TailRec.scala"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"61a1c1332b51eecde0f5a8f659f028f718fcda3b6df7a5480998eb8e2aeeaf47"}},{"ruleId":"D1","level":"warning","message":{"text":"LocalOptimizer.methodOptimizations (cyclomatic 46): LocalOptimizer.methodOptimizations has cyclomatic complexity 46 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/backend/jvm/opt/LocalOptimizer.scala"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d96d24225ec927f06e612558847311114bc7c949004713373e4ee3c20811164"}},{"ruleId":"D1","level":"warning","message":{"text":"JSCodeGen.genJSPrimitive (cyclomatic 46): JSCodeGen.genJSPrimitive has cyclomatic complexity 46 (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":"compiler/src/dotty/tools/backend/sjs/JSCodeGen.scala"},"region":{"startLine":4037}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e39594ce92af1879944244412f2aa8cab86cdb02c516f13a7a81df4330f59de"}},{"ruleId":"D1","level":"warning","message":{"text":"MetalsInteractive.enclosingSymbolsWithExpressionType (cyclomatic 46): MetalsInteractive.enclosingSymbolsWithExpressionType has cyclomatic complexity 46 (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":"presentation-compiler/src/main/dotty/tools/pc/MetalsInteractive.scala"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"e94967dd436c6aac918102cba0f5da7b8c61fe521b095829da1e1c6db9c37788"}},{"ruleId":"D1","level":"warning","message":{"text":"Semantic.cases (cyclomatic 45): Semantic.cases has cyclomatic complexity 45 (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":"compiler/src/dotty/tools/dotc/transform/init/Semantic.scala"},"region":{"startLine":1256}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7602564afe0053f11654954bced1cc8a8f8bf6696922e1090fed4d63538c54c"}},{"ruleId":"D1","level":"warning","message":{"text":"CheckUnused.resolveUsage (cyclomatic 44): CheckUnused.resolveUsage has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/CheckUnused.scala"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"6873a2364684ac16cbe7404339145412fb69221ba4159479c0fa71b014c24b5d"}},{"ruleId":"D1","level":"warning","message":{"text":"Typer.typedDefDef (cyclomatic 44): Typer.typedDefDef has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/Typer.scala"},"region":{"startLine":3173}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6099e885281a5cfa56bbf889a187d2b4902ee2223ad59351ac13ec587ec5e04"}},{"ruleId":"D1","level":"warning","message":{"text":"TreePickler.pickleFlags (cyclomatic 43): TreePickler.pickleFlags 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":"compiler/src/dotty/tools/dotc/core/tasty/TreePickler.scala"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"0590abd766ea45f750fd3b4355ceb30f92ddf37774872f21f51c99f6ee4b7a77"}},{"ruleId":"D1","level":"warning","message":{"text":"ProtoTypes.wildApprox (cyclomatic 43): ProtoTypes.wildApprox 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":"compiler/src/dotty/tools/dotc/typer/ProtoTypes.scala"},"region":{"startLine":952}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7b0e8d0539edbad53ac3965a73482b5d2cae530276e548e99b72e5f6d533909"}},{"ruleId":"D1","level":"warning","message":{"text":"Mixin.transformTemplate (cyclomatic 42): Mixin.transformTemplate has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/Mixin.scala"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"a793403b9ad3fc45fb1ab8bc43adb34a02115b37c10a6e6070b8df0396a0d29a"}},{"ruleId":"D1","level":"warning","message":{"text":"PickleQuotes.pickle (cyclomatic 41): PickleQuotes.pickle 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":"compiler/src/dotty/tools/dotc/transform/PickleQuotes.scala"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"064b8820869f1aee44c0cb39a6f051cbcf097e8a9614f4181ecb0594f438fc57"}},{"ruleId":"D1","level":"warning","message":{"text":"ShowPickled.printFile (cyclomatic 41): ShowPickled.printFile 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. This is NOT this file\u0027s highest cyclomatic complexity: ShowPickled.tag2string (cyclomatic 45) 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":"compiler/src/dotty/tools/dotc/util/ShowPickled.scala"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"09736e061364f52afbd181f9e832bc52ffec93cb907c25de0f1638eba283fe8f"}},{"ruleId":"D1","level":"warning","message":{"text":"Extractors.showFlags (cyclomatic 41): Extractors.showFlags has cyclomatic complexity 41 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: ExtractorsPrinter.visitTree (cyclomatic 52) 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":"compiler/src/scala/quoted/runtime/impl/printers/Extractors.scala"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"af68415db74a43504c6f3e7281628fa0bfda3bcbcc6c8c730ae4990b4d707645"}},{"ruleId":"D1","level":"warning","message":{"text":"Preparser.preparse (cyclomatic 41): Preparser.preparse 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":"scaladoc/src/dotty/tools/scaladoc/tasty/comments/Preparser.scala"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dc9b2ebbd4b5a061e5af96abf5b35df820d7f5c941424534fba49e087311d88"}},{"ruleId":"D1","level":"warning","message":{"text":"PatternTypeConstrainer.constrainPatternType (cyclomatic 40): PatternTypeConstrainer.constrainPatternType has cyclomatic complexity 40 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/PatternTypeConstrainer.scala"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5c1f43c6eafe6cefced9504074c4282aee179c2bf90b8e2299b11557be8fe8e"}},{"ruleId":"D1","level":"warning","message":{"text":"Scanner.handleNewLine (cyclomatic 40): Scanner.handleNewLine has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/parsing/Scanners.scala"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"3416c65e7b9c23ce8c0b5bf0ca7165fd527e4beabb2dadfdfc985ab998857d9b"}},{"ruleId":"D1","level":"warning","message":{"text":"MegaPhase.transformTree (cyclomatic 40): MegaPhase.transformTree has cyclomatic complexity 40 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/MegaPhase.scala"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eff10fabd279d6ae6e6f944420a14555e3cab3730346658fec9a340abb7199c"}},{"ruleId":"D1","level":"warning","message":{"text":"SourceCode.showFlags (cyclomatic 40): SourceCode.showFlags has cyclomatic complexity 40 (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":"compiler/src/scala/quoted/runtime/impl/printers/SourceCode.scala"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"833f7ae491e8d2b3bb8ee902af8465dde93ae24cdab4073117bc994063f25518"}},{"ruleId":"D1","level":"warning","message":{"text":"Completions.completionOrdering (cyclomatic 40): Completions.completionOrdering has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"presentation-compiler/src/main/dotty/tools/pc/completions/Completions.scala"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"b770aa35e9c91cbadc89fafbfd52c59baca9806282243c8a6be9bf4506d12faf"}},{"ruleId":"D1","level":"warning","message":{"text":"CopyProp.eliminateStaleStoresAndRewriteSomeIntrinsics (cyclomatic 39): CopyProp.eliminateStaleStoresAndRewriteSomeIntrinsics has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/backend/jvm/opt/CopyProp.scala"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"375827d6e76d556f13d2c7a1653aa4db761ba9c3141329c9b280afd62407e159"}},{"ruleId":"D1","level":"warning","message":{"text":"LocalOptImpls.simplifyJumps (cyclomatic 39): LocalOptImpls.simplifyJumps has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/backend/jvm/opt/LocalOptimizer.scala"},"region":{"startLine":1035}}}],"partialFingerprints":{"codehealthFindingId/v1":"0326df12100727622ae58aba752c0e7280787e20449ce83d7ec202c5f27f0746"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeOps.instantiateToSubType (cyclomatic 39): TypeOps.instantiateToSubType has cyclomatic complexity 39 (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":"compiler/src/dotty/tools/dotc/core/TypeOps.scala"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c172b237648da001c290db66a33777b0e28cb40f1addde04adec62a3d52df3d"}},{"ruleId":"D1","level":"warning","message":{"text":"InfoPrinter.pprint (cyclomatic 39): InfoPrinter.pprint has cyclomatic complexity 39 (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":"compiler/src/dotty/tools/dotc/semanticdb/PPrint.scala"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9c55c0cd2b50bc64689af3c7da85511a1b9c5fc4158e6ac179efcf03e5b6b89"}},{"ruleId":"D1","level":"warning","message":{"text":"Typer.typedIdent (cyclomatic 39): Typer.typedIdent has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/Typer.scala"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"641b498d3acc3cf9d7a20521e6507771d0525b74b635f69d207f0d17c0c5cd36"}},{"ruleId":"D1","level":"warning","message":{"text":"InferredMethodProvider.inferredMethodEdits (cyclomatic 39): InferredMethodProvider.inferredMethodEdits has cyclomatic complexity 39 (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":"presentation-compiler/src/main/dotty/tools/pc/InferredMethodProvider.scala"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f23d80e133153e9f815cfbca71964f9227131ef085c3429631e92f307ba64ae"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser.typ (cyclomatic 38): Parser.typ 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":"compiler/src/dotty/tools/dotc/parsing/Parsers.scala"},"region":{"startLine":1860}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f2953614e421aafdbb3d78706029b303c5f06e601b3fb4df706ec7b14d03091"}},{"ruleId":"D1","level":"warning","message":{"text":"Objects.call (cyclomatic 38): Objects.call 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":"compiler/src/dotty/tools/dotc/transform/init/Objects.scala"},"region":{"startLine":1057}}}],"partialFingerprints":{"codehealthFindingId/v1":"2547845fa8e5f4f25ae5afc6f41b013555e384c59f6c7b5452a850cafeb8b174"}},{"ruleId":"D1","level":"warning","message":{"text":"ImplicitRunInfo.computeIScope (cyclomatic 38): ImplicitRunInfo.computeIScope 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":"compiler/src/dotty/tools/dotc/typer/Implicits.scala"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4188ca79c0f8a1bf6ddf17fa9edadceb3babb667b261623ddb85699a467c66d"}},{"ruleId":"D1","level":"warning","message":{"text":"Namer.createSymbol (cyclomatic 38): Namer.createSymbol 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":"compiler/src/dotty/tools/dotc/typer/Namer.scala"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac67bd8484209b8120e85ad99069215fd3ef1b5cfc6ac5b4679099d8853edf45"}},{"ruleId":"D1","level":"warning","message":{"text":"ClassCompleter.completeInCreationContext (cyclomatic 38): ClassCompleter.completeInCreationContext 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":"compiler/src/dotty/tools/dotc/typer/Namer.scala"},"region":{"startLine":1683}}}],"partialFingerprints":{"codehealthFindingId/v1":"659120b59307b3e826812f30d44bfaa754c602ec71c146c9fc8089f7a55571c8"}},{"ruleId":"D1","level":"warning","message":{"text":"NavigateAST.pathTo (cyclomatic 37): NavigateAST.pathTo has cyclomatic complexity 37 (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":"compiler/src/dotty/tools/dotc/ast/NavigateAST.scala"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"b06ea4b73fc97bcc4741e6548b6de3d5e9ecc4d5231c9c726b6b170cac7d346f"}},{"ruleId":"D1","level":"warning","message":{"text":"Setup.transformExplicitType (cyclomatic 37): Setup.transformExplicitType has cyclomatic complexity 37 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/cc/Setup.scala"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c6a58ba8ffeab2d3b6bea5c5cffd13aabace87b5c394f94d4adaa992d431c94"}},{"ruleId":"D1","level":"warning","message":{"text":"SpaceEngine.decompose (cyclomatic 37): SpaceEngine.decompose 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":"compiler/src/dotty/tools/dotc/transform/patmat/Space.scala"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"57d6dec45549eb1f065bbe1144856e76a8c9b2c3a2680d9187e12b55db2b7c93"}},{"ruleId":"D1","level":"warning","message":{"text":"Checking.checkIrrefutable (cyclomatic 37): Checking.checkIrrefutable has cyclomatic complexity 37 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/Checking.scala"},"region":{"startLine":1054}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c4622bc67325e5133569aba199f903515c8a92ea185c573f48232d8ee1daacd"}},{"ruleId":"D1","level":"warning","message":{"text":"ImplicitRefs.filterMatching (cyclomatic 37): ImplicitRefs.filterMatching 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":"compiler/src/dotty/tools/dotc/typer/Implicits.scala"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"68eee6b729a973edf9162e78e1e26ecf9c4596881cee4ee94c1b94e079387809"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer.tokenize (cyclomatic 37): Lexer.tokenize has cyclomatic complexity 37 (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":"directives-parser/src/main/scala/dotty/tools/directives/Lexer.scala"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c64ff4e1774eaa2ce3dea5d601577686f7d72b19ae44a450cc78a443ea8c5ed"}},{"ruleId":"D1","level":"warning","message":{"text":"GlobalOptimizer.findIllegalAccess (cyclomatic 36): GlobalOptimizer.findIllegalAccess 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":"compiler/src/dotty/tools/backend/jvm/opt/Inliner.scala"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3d75155feba592f9c413e590d79be777527ca7ca5da5ed4a7a03f841f072051"}},{"ruleId":"D1","level":"warning","message":{"text":"Scala2Unpickler.readType (cyclomatic 36): Scala2Unpickler.readType 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":"compiler/src/dotty/tools/dotc/core/unpickleScala2/Scala2Unpickler.scala"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc13e7af0adc3d2f38f770e3256f44c6c5428cc93dc9e5661d8a0b9ad496e33"}},{"ruleId":"D1","level":"warning","message":{"text":"SyncAndTryBuilder.genLoadTry (cyclomatic 35): SyncAndTryBuilder.genLoadTry 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":"compiler/src/dotty/tools/backend/jvm/BCodeSyncAndTry.scala"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ab6d365ce8258316cc099e60c416c4f16c1196816e3b1f00cf00c8ab0a8664c"}},{"ruleId":"D1","level":"warning","message":{"text":"Rechecker.recheckStart (cyclomatic 35): Rechecker.recheckStart 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":"compiler/src/dotty/tools/dotc/transform/Recheck.scala"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"f23263c0efcc99882615d7bc92d64a57311a09157df3084d08bb288a2124fc5f"}},{"ruleId":"D1","level":"warning","message":{"text":"Namer.inferredResultType (cyclomatic 35): Namer.inferredResultType 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":"compiler/src/dotty/tools/dotc/typer/Namer.scala"},"region":{"startLine":2170}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eb12a78265926e34ca551ea4edbb65fa286687e6ec75b777b51f080dff3ba33"}},{"ruleId":"D1","level":"warning","message":{"text":"ClassfileParser.parseAttributes (cyclomatic 34): ClassfileParser.parseAttributes has cyclomatic complexity 34 (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":"compiler/src/dotty/tools/dotc/core/classfile/ClassfileParser.scala"},"region":{"startLine":1038}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa1f13d34cf70a9d65cd453c30f6c04a49225e466c62dcf1530a1e180988f2d2"}},{"ruleId":"D1","level":"warning","message":{"text":"CheckNonCyclicMap.apply (cyclomatic 34): CheckNonCyclicMap.apply has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/Checking.scala"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"018fb606e2b48908627db51b7017c6c38d547d233b50971f691a9e37a5bfab50"}},{"ruleId":"D1","level":"warning","message":{"text":"CaseKeywordCompletion.contribute (cyclomatic 34): CaseKeywordCompletion.contribute has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"presentation-compiler/src/main/dotty/tools/pc/completions/MatchCaseCompletions.scala"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"29304903820977d8a942814aa773a320f6676f2fd43601fd45cc7d36b721dff3"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeComparer.isSubArgs (cyclomatic 33): TypeComparer.isSubArgs has cyclomatic complexity 33 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/TypeComparer.scala"},"region":{"startLine":1847}}}],"partialFingerprints":{"codehealthFindingId/v1":"44312d05ef81404ed0253a30307457fb70e3e9d1328eba5a45706cdb82a1ce8b"}},{"ruleId":"D1","level":"warning","message":{"text":"CrossStageSafety.transform (cyclomatic 33): CrossStageSafety.transform 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":"compiler/src/dotty/tools/dotc/staging/CrossStageSafety.scala"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ff2907b0fbba4c556d5c5fe6233a04b01e54d00d0d071118a8d72fbd22bb453"}},{"ruleId":"D1","level":"warning","message":{"text":"Typer.typedSelect (cyclomatic 33): Typer.typedSelect has cyclomatic complexity 33 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/Erasure.scala"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"48eeb8966297e0410a2899ec3584160ebff61a9af3b63a3b7d4cb22bd0701943"}},{"ruleId":"D1","level":"warning","message":{"text":"ScalaJSPrepJSInteropTransformer.transformJSClassDef (cyclomatic 33): ScalaJSPrepJSInteropTransformer.transformJSClassDef 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":"compiler/src/dotty/tools/dotc/transform/sjs/PrepJSInterop.scala"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3acebffad25d522b20b602b547efb4ab7514aa18b97cb50903656a583c23dac"}},{"ruleId":"D1","level":"warning","message":{"text":"AppToMain.wrapIntoMain (cyclomatic 33): AppToMain.wrapIntoMain 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":"compiler/src/dotty/tools/dotc/typer/Migrations.scala"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"19391e80a5de2bf67b3cc3d6cc401bc69174906776bd815a41efe64d9aff4c74"}},{"ruleId":"D1","level":"warning","message":{"text":"ExprMap.transformChildren (cyclomatic 33): ExprMap.transformChildren has cyclomatic complexity 33 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/quoted/ExprMap.scala"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"29df913f829ac434d9f04454e3ebcb80e28e2104a63ac8229b857c6c60972d9e"}},{"ruleId":"D1","level":"warning","message":{"text":"PlainBodyBuilder.genApply (cyclomatic 32): PlainBodyBuilder.genApply has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/backend/jvm/BCodeBodyBuilder.scala"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf854d6fef20cf39c76ed3eaf2e7f1bdb5a1ad18246f84c5ca06a520ccc47adb"}},{"ruleId":"D1","level":"warning","message":{"text":"ProdConsAnalyzer.copyOperationSourceValue (cyclomatic 32): ProdConsAnalyzer.copyOperationSourceValue has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/backend/jvm/analysis/ProdConsAnalyzer.scala"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e67bd8d7bee5a9eccea06c81c27e1d66c9e8ffb46c3fecaf03039816289e142"}},{"ruleId":"D1","level":"warning","message":{"text":"ProdConsAnalyzer.copyOperationProducedValueSlots (cyclomatic 32): ProdConsAnalyzer.copyOperationProducedValueSlots has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/backend/jvm/analysis/ProdConsAnalyzer.scala"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fce72d48f128430173dae24591d94cb8248b600a3e31afa8cd452a27d9d57e6"}},{"ruleId":"D1","level":"warning","message":{"text":"GlobalOptimizer.runInliner (cyclomatic 32): GlobalOptimizer.runInliner has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/backend/jvm/opt/Inliner.scala"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"04837c6e8230f3ff07ec6af03bda330c7bf1b051af468e4a4d5df9c13cc6f536"}},{"ruleId":"D1","level":"warning","message":{"text":"CoverageTransformer.transform (cyclomatic 32): CoverageTransformer.transform 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":"compiler/src/dotty/tools/dotc/transform/InstrumentCoverage.scala"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5d73363cafe564a09dd843440843a601d8bb41ce83af6eef32a57843399d3e2"}},{"ruleId":"D1","level":"warning","message":{"text":"ApplyArgsExtractor.getArgsAndParams (cyclomatic 32): ApplyArgsExtractor.getArgsAndParams 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":"presentation-compiler/src/main/dotty/tools/pc/ApplyArgsExtractor.scala"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"e27314e63e7bdc429f7ced96d363f11ef0c4da9ae0ddbd349163fb065bf90d38"}},{"ruleId":"D1","level":"warning","message":{"text":"InlinerHeuristics.inlineRequest (cyclomatic 31): InlinerHeuristics.inlineRequest has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/backend/jvm/opt/InlinerHeuristics.scala"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"09e2cfa8029d593b786379f073aa77e90ff72582b260495e5126f184f662de6a"}},{"ruleId":"D1","level":"warning","message":{"text":"LocalOptimizer.eliminateRedundantCastsAndRewriteSomeIntrinsics (cyclomatic 31): LocalOptimizer.eliminateRedundantCastsAndRewriteSomeIntrinsics has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/backend/jvm/opt/LocalOptimizer.scala"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff816aaf0071210d1ee838f7ffd583c9160abed9d6c4480d1f8dc4f9d14d2adc"}},{"ruleId":"D1","level":"warning","message":{"text":"ExpressionTransformer.transform (cyclomatic 31): ExpressionTransformer.transform has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/debug/ExtractExpression.scala"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2bb4a04d8eb8e4204ceb0b05b7567d4564ef45458e18502ee04f06350427ef1"}},{"ruleId":"D1","level":"warning","message":{"text":"desugar.makePatDef (cyclomatic 31): desugar.makePatDef has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/ast/Desugar.scala"},"region":{"startLine":1516}}}],"partialFingerprints":{"codehealthFindingId/v1":"83d6437d26e96cad27fa6412b8e6060cde2e562fc328895b9a21c085590467d8"}},{"ruleId":"D1","level":"warning","message":{"text":"desugar.getVariables (cyclomatic 31): desugar.getVariables 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":"compiler/src/dotty/tools/dotc/ast/Desugar.scala"},"region":{"startLine":2632}}}],"partialFingerprints":{"codehealthFindingId/v1":"12b287120d3ba72d9822919d84c175d6856e641de3c4c822aca331fe1ba0e382"}},{"ruleId":"D1","level":"warning","message":{"text":"InlineCall.expand (cyclomatic 31): InlineCall.expand has cyclomatic complexity 31 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/inlines/Inlines.scala"},"region":{"startLine":760}}}],"partialFingerprints":{"codehealthFindingId/v1":"d208becd594601113d4121c259310928459dd42ef3f666c8e046da4af4a821e1"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser.literal (cyclomatic 31): Parser.literal has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/parsing/Parsers.scala"},"region":{"startLine":1403}}}],"partialFingerprints":{"codehealthFindingId/v1":"20d26e0c9ab7f66d0b3a015609e42be1e90da23ef1befd097d0d4fb095ed3982"}},{"ruleId":"D1","level":"warning","message":{"text":"Typer.typedSelectWithAdapt (cyclomatic 31): Typer.typedSelectWithAdapt has cyclomatic complexity 31 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/Typer.scala"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"eccba189cf83366a9a17dccefa6f6472347ff5b6b36df4d1105f6e7b4b9f8660"}},{"ruleId":"D1","level":"warning","message":{"text":"CaptureChecker.adaptBoxed (cyclomatic 30): CaptureChecker.adaptBoxed has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/cc/CheckCaptures.scala"},"region":{"startLine":2007}}}],"partialFingerprints":{"codehealthFindingId/v1":"28841291ff64394b24a914bc50a21242665786449b16ca6aa5ebfb1459f05125"}},{"ruleId":"D1","level":"warning","message":{"text":"JavaScanner.getTextBlock (cyclomatic 30): JavaScanner.getTextBlock has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/parsing/JavaScanners.scala"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"38e1d2d2bd7feb9562c33fb26a688490b1ac2e184a04e82e1c6c420ba62384db"}},{"ruleId":"D1","level":"warning","message":{"text":"Hoister.hoistSuperArg (cyclomatic 30): Hoister.hoistSuperArg has cyclomatic complexity 30 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/HoistSuperArgs.scala"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8eaf0b6c5c93c6d2046597ab7f0c104e99bcdf27663310dd7559e586270d3f5"}},{"ruleId":"D1","level":"warning","message":{"text":"Cleaner.cleanHtml (cyclomatic 30): Cleaner.cleanHtml has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scaladoc/src/dotty/tools/scaladoc/tasty/comments/Cleaner.scala"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c5b26921595539f0e25dc5ba2878fb21e25686debf231345caddfb031ef599c"}},{"ruleId":"D1","level":"warning","message":{"text":"PlainSkelBuilder.genDefDef (cyclomatic 29): PlainSkelBuilder.genDefDef has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/backend/jvm/BCodeSkelBuilder.scala"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a420eb0b00b5951f90b28a619cbd590664e8d5e8dad1949e9f827c7c0807f78"}},{"ruleId":"D1","level":"warning","message":{"text":"CopyProp.eliminateStoreLoad (cyclomatic 29): CopyProp.eliminateStoreLoad has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/backend/jvm/opt/CopyProp.scala"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"7115b971ed24025ec9e0e80a38a2556594dd9bf7cd80c0a0e906001c2da4cdc1"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeOps.simplify (cyclomatic 29): TypeOps.simplify has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/TypeOps.scala"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"0db02108148b8329be05a7e057dee1a9d379915ce717ad134536565567a1b454"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeOps.boundsViolations (cyclomatic 29): TypeOps.boundsViolations has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/TypeOps.scala"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c49001b013bbdb4ab438b9f17c36200c0ec3f5f78dbd43f10b8684fa30482a3"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeAccumulator.foldOver (cyclomatic 29): TypeAccumulator.foldOver has cyclomatic complexity 29 (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":"compiler/src/dotty/tools/dotc/core/Types.scala"},"region":{"startLine":6836}}}],"partialFingerprints":{"codehealthFindingId/v1":"4efcd1d0dd42ef2fe815152c81cd67dde9ebd4e7ae2878e2bc879ea25786ad16"}},{"ruleId":"D1","level":"warning","message":{"text":"SyntaxHighlighting.highlight (cyclomatic 29): SyntaxHighlighting.highlight has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/printing/SyntaxHighlighting.scala"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"e154ccba24764eedeb2769c933649005af584a2bd548c4977e69bbccfaef5e25"}},{"ruleId":"D1","level":"warning","message":{"text":"ExtractAPICollector.computeType (cyclomatic 29): ExtractAPICollector.computeType has cyclomatic complexity 29 (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":"compiler/src/dotty/tools/dotc/sbt/ExtractAPI.scala"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"75d6431af3f19b5231710b1007427bf3ebb5af7487570d939e03b89566ca5cdc"}},{"ruleId":"D1","level":"warning","message":{"text":"Conversion.verify (cyclomatic 29): Conversion.verify has cyclomatic complexity 29 (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":"compiler/src/dotty/tools/dotc/transform/localopt/FormatChecker.scala"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b164591b2222897f2c18cc57e10db9ea060c05fbba58968580c5686f88ad6cf"}},{"ruleId":"D1","level":"warning","message":{"text":"StringInterpolatorOpt.transformApply (cyclomatic 29): StringInterpolatorOpt.transformApply has cyclomatic complexity 29 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/localopt/StringInterpolatorOpt.scala"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"15f1e603216ee91bef0b0feedbb8454ccaa24ef76c6c559135898764644ae3ef"}},{"ruleId":"D1","level":"warning","message":{"text":"Completions.computeRelevancePenalty (cyclomatic 29): Completions.computeRelevancePenalty has cyclomatic complexity 29 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"presentation-compiler/src/main/dotty/tools/pc/completions/Completions.scala"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bfe2e747f0351bbfa6f7f48a82e44ac37111bd2b763a2d128fec546a23c0b13"}},{"ruleId":"D1","level":"warning","message":{"text":"CaptureChecker.recheckClosureBlock (cyclomatic 28): CaptureChecker.recheckClosureBlock has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/cc/CheckCaptures.scala"},"region":{"startLine":1147}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c7779ee255d661a219f724d555a2a19a30b70d99a47f21fa77df7dc6be36223"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeMap.mapOver (cyclomatic 28): TypeMap.mapOver 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":"compiler/src/dotty/tools/dotc/core/Types.scala"},"region":{"startLine":6321}}}],"partialFingerprints":{"codehealthFindingId/v1":"98a8c4de064e37aae62cd0868212f1624a4d8ddaacef1308ab81ad10f7e65372"}},{"ruleId":"D1","level":"warning","message":{"text":"TreeReader.readNewDef (cyclomatic 28): TreeReader.readNewDef has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/tasty/TreeUnpickler.scala"},"region":{"startLine":909}}}],"partialFingerprints":{"codehealthFindingId/v1":"22c360e7a139161951c20516a0533b9b72e32e02c3503587a192fc477209cbdf"}},{"ruleId":"D1","level":"warning","message":{"text":"Inlines.inlineCall (cyclomatic 28): Inlines.inlineCall has cyclomatic complexity 28 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/inlines/Inlines.scala"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"21739d559d0df85877503afe1f7cb070a8b924d1a0b8740585057f1de7cc1800"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser.importExpr (cyclomatic 28): Parser.importExpr has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/parsing/Parsers.scala"},"region":{"startLine":4197}}}],"partialFingerprints":{"codehealthFindingId/v1":"23751e4e78d1baabb39e1fce168250571564a504004bf1f715f9eb51b092bd5f"}},{"ruleId":"D1","level":"warning","message":{"text":"Objects.select (cyclomatic 28): Objects.select has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/init/Objects.scala"},"region":{"startLine":1265}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcf59ca3848ee720c8d45dd28676671dba7741b0eb4fd1ded3bc34ebdb8ad8bc"}},{"ruleId":"D1","level":"warning","message":{"text":"Objects.patternMatch (cyclomatic 28): Objects.patternMatch has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/init/Objects.scala"},"region":{"startLine":1827}}}],"partialFingerprints":{"codehealthFindingId/v1":"28b74f0c4a0ba9a20fd0483dcde7007677336d1f0a1c4aa92e37a6cd9a3e0abd"}},{"ruleId":"D1","level":"warning","message":{"text":"Inferencing.instantiateTypeVars (cyclomatic 28): Inferencing.instantiateTypeVars has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/Inferencing.scala"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"5efb8399e332be81ebdb55ab524d3f4604e88ec49e0018389fd50a766a07c8d0"}},{"ruleId":"D1","level":"warning","message":{"text":"InferredTypeProvider.inferredTypeEdits (cyclomatic 28): InferredTypeProvider.inferredTypeEdits has cyclomatic complexity 28 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"presentation-compiler/src/main/dotty/tools/pc/InferredTypeProvider.scala"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"51ba2b35757fb7828c5a652aadb90e7dd5ce5336a8a364a11f26158b4e05beeb"}},{"ruleId":"D1","level":"warning","message":{"text":"PlainBodyBuilder.genMatchTo (cyclomatic 27): PlainBodyBuilder.genMatchTo 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":"compiler/src/dotty/tools/backend/jvm/BCodeBodyBuilder.scala"},"region":{"startLine":980}}}],"partialFingerprints":{"codehealthFindingId/v1":"14795b182d48ba33aa0a09e8d407239e69bbb1505e09aa358d8ba607805f445f"}},{"ruleId":"D1","level":"warning","message":{"text":"PrimitiveBType.maxValueType (cyclomatic 27): PrimitiveBType.maxValueType 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":"compiler/src/dotty/tools/backend/jvm/BTypes.scala"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"6189a9c69eeaabf11a7347b2f5ed36f0fe2b17027b981e1441ecac3370199463"}},{"ruleId":"D1","level":"warning","message":{"text":"BCodeRepository.methodNode (cyclomatic 27): BCodeRepository.methodNode 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":"compiler/src/dotty/tools/backend/jvm/opt/BCodeRepository.scala"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"17ec3c2e6586b16155fe543029deceac2499cd259840b773b8fffb8f898e6e7c"}},{"ruleId":"D1","level":"warning","message":{"text":"LocalOptImpls.removeUnreachableCodeImpl (cyclomatic 27): LocalOptImpls.removeUnreachableCodeImpl 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":"compiler/src/dotty/tools/backend/jvm/opt/LocalOptimizer.scala"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"f39c2922d4c928e7e7ac5d2fee63fb508eb328306d4f45a5806b33ebaf94d2bd"}},{"ruleId":"D1","level":"warning","message":{"text":"Run.compileUnits (cyclomatic 27): Run.compileUnits 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":"compiler/src/dotty/tools/dotc/Run.scala"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f5d99e2a790b342601ea7557ff0e0afa74c29581d333d3f2e6a077758254883"}},{"ruleId":"D1","level":"warning","message":{"text":"SepCheck.checkType (cyclomatic 27): SepCheck.checkType 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":"compiler/src/dotty/tools/dotc/cc/SepCheck.scala"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbcc66872c3fef7d36ccb2aed996b3ca8da379770645f1eb89f1e91f16b04585"}},{"ruleId":"D1","level":"warning","message":{"text":"ImplicitSearch.searchImplicit (cyclomatic 27): ImplicitSearch.searchImplicit 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":"compiler/src/dotty/tools/dotc/typer/Implicits.scala"},"region":{"startLine":1696}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2ff623871163d6a3dbfa335e6660d644c5cd47e6aebc08b5ec73cfe7824ea75"}},{"ruleId":"D1","level":"warning","message":{"text":"Typer.typedNumber (cyclomatic 27): Typer.typedNumber 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":"compiler/src/dotty/tools/dotc/typer/Typer.scala"},"region":{"startLine":1208}}}],"partialFingerprints":{"codehealthFindingId/v1":"4566096b17b7d4c0cdf506a38eadca9563f5c5f7a751dbd56dfc4b892a17bd91"}},{"ruleId":"D1","level":"warning","message":{"text":"PcSemanticTokensProvider.makeNode (cyclomatic 27): PcSemanticTokensProvider.makeNode 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":"presentation-compiler/src/main/dotty/tools/pc/PcSemanticTokensProvider.scala"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f2565d1aed823a57d9cd42e7795e12ac679b4a9d06f85062109f955442c2b07"}},{"ruleId":"D1","level":"warning","message":{"text":"MethodMax.computeMaxLocalsMaxStack (cyclomatic 26): MethodMax.computeMaxLocalsMaxStack has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/backend/jvm/opt/MethodMax.scala"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1c02184d06da957000c818d84772d46eae950638f5b19b3d5848b9a6f9b4a39"}},{"ruleId":"D1","level":"warning","message":{"text":"JSCodeGen.genCompilationUnit (cyclomatic 26): JSCodeGen.genCompilationUnit has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/backend/sjs/JSCodeGen.scala"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"789657853547143156c532969da5cae3e97ad7ab30f92f8a4de8a0dba2457e9d"}},{"ruleId":"D1","level":"warning","message":{"text":"JSCodeGen.genLinkTimeExpr (cyclomatic 26): JSCodeGen.genLinkTimeExpr has cyclomatic complexity 26 (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":"compiler/src/dotty/tools/backend/sjs/JSCodeGen.scala"},"region":{"startLine":4403}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c78466a9ce9fbeb4587fc9a9e1b9051f752c08b70566ebd63c2b75dd5cfcc0e"}},{"ruleId":"D1","level":"warning","message":{"text":"SepCheck.traverse (cyclomatic 26): SepCheck.traverse has cyclomatic complexity 26 (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":"compiler/src/dotty/tools/dotc/cc/SepCheck.scala"},"region":{"startLine":1074}}}],"partialFingerprints":{"codehealthFindingId/v1":"457cdcb58284f82fb59e3d9298a15fb9123056a19ddcb53627f915d2f4abeafe"}},{"ruleId":"D1","level":"warning","message":{"text":"JavaParser.annotation (cyclomatic 26): JavaParser.annotation has cyclomatic complexity 26 (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":"compiler/src/dotty/tools/dotc/parsing/JavaParsers.scala"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"b41ff3fa0ea61719dee0f181c9e85f23ff81e6dedbc959ea9eeba6049bcf3b5c"}},{"ruleId":"D1","level":"warning","message":{"text":"Dependencies.process (cyclomatic 26): Dependencies.process has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/Dependencies.scala"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d526135fd283b39934a14e1178f6471d16c1a2b3c269bd3447f90244bc514c4"}},{"ruleId":"D1","level":"warning","message":{"text":"ScalaJSPrepJSInteropTransformer.transformStatOrExpr (cyclomatic 26): ScalaJSPrepJSInteropTransformer.transformStatOrExpr has cyclomatic complexity 26 (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":"compiler/src/dotty/tools/dotc/transform/sjs/PrepJSInterop.scala"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a9b94f57df1e9f9ef13199c3d9da81784a6480541d4d2cadd8cd9d5bc60a809"}},{"ruleId":"D1","level":"warning","message":{"text":"MirrorSource.reduce (cyclomatic 26): MirrorSource.reduce has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/Synthesizer.scala"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc194f8119f18b30f96044b9fa56c23d7e8b53d6763002bd153531a02329fbab"}},{"ruleId":"D1","level":"warning","message":{"text":"NumericRange.count (cyclomatic 26): NumericRange.count has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library-js/src/scala/collection/immutable/NumericRange.scala"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"361d839851f903b2d034fa8fda08a9818504cdac66578960ceafe34ad8ab015e"}},{"ruleId":"D1","level":"warning","message":{"text":"NumericRange.count (cyclomatic 26): NumericRange.count has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/collection/immutable/NumericRange.scala"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"211b66446edb0f831a710fdfae2dbdfcd9de8b2ab23f1c7c48ba245dd4b8b555"}},{"ruleId":"D1","level":"warning","message":{"text":"InkuireSupport.inner (cyclomatic 26): InkuireSupport.inner has cyclomatic complexity 26 (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":"scaladoc/src/dotty/tools/scaladoc/tasty/InkuireSupport.scala"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dcf94d00eb6f860fbd6d6a60c0730de343eda484fc3fcb7580446de1f3dc99a"}},{"ruleId":"D1","level":"warning","message":{"text":"JCodeMethodN.emitT2T (cyclomatic 25): JCodeMethodN.emitT2T 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":"compiler/src/dotty/tools/backend/jvm/BCodeIdiomatic.scala"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"d353827b6685342c86fd9c53ff637963aff528e7c0d253b17e23b8df2a68185f"}},{"ruleId":"D1","level":"warning","message":{"text":"AliasingFrame.execute (cyclomatic 25): AliasingFrame.execute 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":"compiler/src/dotty/tools/backend/jvm/analysis/AliasingAnalyzer.scala"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"75c39170b26002ecc1aca487b8e94b92a7a85934e99c8af9a4c1a2e58c749b61"}},{"ruleId":"D1","level":"warning","message":{"text":"ExpressionTransformer.transform (cyclomatic 25): ExpressionTransformer.transform 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":"compiler/src/dotty/tools/debug/ResolveReflectEval.scala"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e7da0e47ce2ac4b13d46a6f68bf72a23da9153b770a772f058665e8b672ef78"}},{"ruleId":"D1","level":"warning","message":{"text":"CaptureChecker.checkOverrides (cyclomatic 25): CaptureChecker.checkOverrides 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":"compiler/src/dotty/tools/dotc/cc/CheckCaptures.scala"},"region":{"startLine":2194}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd436f3cda5d5a188bf02bb9b8183611fa6203eadb912d839aad597efdd6bf1b"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeApplications.appliedTo (cyclomatic 25): TypeApplications.appliedTo 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":"compiler/src/dotty/tools/dotc/core/TypeApplications.scala"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f7848b98542a37edf9abf108189567dd02e61c146544865bc8dc1ae9644a728"}},{"ruleId":"D1","level":"warning","message":{"text":"Inliner.dropUnusedDefs (cyclomatic 25): Inliner.dropUnusedDefs has cyclomatic complexity 25 (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":"compiler/src/dotty/tools/dotc/inlines/Inliner.scala"},"region":{"startLine":1306}}}],"partialFingerprints":{"codehealthFindingId/v1":"52765517a01ec61bc626521a22955c019cccaa8d32f907804bd1d8ab12a688d4"}},{"ruleId":"D1","level":"warning","message":{"text":"Scanner.getStringPart (cyclomatic 25): Scanner.getStringPart 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":"compiler/src/dotty/tools/dotc/parsing/Scanners.scala"},"region":{"startLine":1253}}}],"partialFingerprints":{"codehealthFindingId/v1":"d43c692aa5d9ea7b8dc80024d06d49dcef47bd925e1b4aecb0c7cd959505a103"}},{"ruleId":"D1","level":"warning","message":{"text":"CheckLoopingImplicits.transform (cyclomatic 25): CheckLoopingImplicits.transform 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":"compiler/src/dotty/tools/dotc/transform/CheckLoopingImplicits.scala"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"a849bd16cdc3fca734c91f274cc8e31fe98e3efc1ee80fa1820559384e6d3040"}},{"ruleId":"D1","level":"warning","message":{"text":"ExplicitOuter.referencesOuter (cyclomatic 25): ExplicitOuter.referencesOuter 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":"compiler/src/dotty/tools/dotc/transform/ExplicitOuter.scala"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e30dd3ba0800dbf10d3e2f8a6ae0995c31447215cddce49d77ebe14effb97d4"}},{"ruleId":"D1","level":"warning","message":{"text":"SpaceEngine.computeIsSubspace (cyclomatic 25): SpaceEngine.computeIsSubspace 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":"compiler/src/dotty/tools/dotc/transform/patmat/Space.scala"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2c54c552186f50a025da5f3e42d9c294f4b6c3aa73ef3b87ca66c2e786c6925"}},{"ruleId":"D1","level":"warning","message":{"text":"SpaceEngine.minus (cyclomatic 25): SpaceEngine.minus 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":"compiler/src/dotty/tools/dotc/transform/patmat/Space.scala"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"77060dd16c8e0b0f2fc4940305da519ca2461e427a8b2ebf36f875dc1ede1a86"}},{"ruleId":"D1","level":"warning","message":{"text":"Typer.typedMatch (cyclomatic 25): Typer.typedMatch 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":"compiler/src/dotty/tools/dotc/typer/Typer.scala"},"region":{"startLine":2229}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2b052930bd7b9d3a13ebf58ac39315798c23c76e3fa7441bbf07f54813f404e"}},{"ruleId":"D1","level":"warning","message":{"text":"Transformation.run (cyclomatic 25): Transformation.run 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":"library/src/scala/concurrent/impl/Promise.scala"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"d253c69c3f646d27d5e2c973a1dd9125df464f65c1aba3daea31a4b7a47685e1"}},{"ruleId":"D1","level":"warning","message":{"text":"Resources.searchData (cyclomatic 25): Resources.searchData 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":"scaladoc/src/dotty/tools/scaladoc/renderers/Resources.scala"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"d03bf6b02c5d629c02cc56bfa8921126e014ce03651c989c7323f81d45077993"}},{"ruleId":"D1","level":"warning","message":{"text":"JSCodeGen.genScalaClass (cyclomatic 24): JSCodeGen.genScalaClass 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":"compiler/src/dotty/tools/backend/sjs/JSCodeGen.scala"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e40b61d9f951edfe23c5e0370bcbd2dec8a7bf4a4fa37fef8a1cb0942fa0416"}},{"ruleId":"D1","level":"warning","message":{"text":"JSCodeGen.genConversion (cyclomatic 24): JSCodeGen.genConversion 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":"compiler/src/dotty/tools/backend/sjs/JSCodeGen.scala"},"region":{"startLine":2915}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ed85ad8d70e84735c02bec5e7ea6eccecbc7ab1b304e282d379e39fa7260cf0"}},{"ruleId":"D1","level":"warning","message":{"text":"Constant.convertTo (cyclomatic 24): Constant.convertTo 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":"compiler/src/dotty/tools/dotc/core/Constants.scala"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ee0c0a35d165c572c2dd1d673d750b5ea1e7ea7b6881263e06598decf778a6d"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeErasure.isGenericArrayElement (cyclomatic 24): TypeErasure.isGenericArrayElement 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":"compiler/src/dotty/tools/dotc/core/TypeErasure.scala"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"a64724af5a12b4088c184225b37e41f27c7a4b8eeca908c65b420df664c27b15"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser.checkEndMarker (cyclomatic 24): Parser.checkEndMarker 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":"compiler/src/dotty/tools/dotc/parsing/Parsers.scala"},"region":{"startLine":1726}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4fd171e85a950ee65c98e2e8607a15ad44869e94791c536f5ed8fe3c1fc7068"}},{"ruleId":"D1","level":"warning","message":{"text":"SemanticSymbolBuilder.addSymName (cyclomatic 24): SemanticSymbolBuilder.addSymName 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":"compiler/src/dotty/tools/dotc/semanticdb/SemanticSymbolBuilder.scala"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"91ae30e0787f64061b38db71061095776a1b1340c5491da378252848b6936184"}},{"ruleId":"D1","level":"warning","message":{"text":"CheckUnused.transformOther (cyclomatic 24): CheckUnused.transformOther 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":"compiler/src/dotty/tools/dotc/transform/CheckUnused.scala"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ada92ee19921d31d265fa99f3e81bca0da87f27bbee48ac7c16e175ebf6a8da"}},{"ruleId":"D1","level":"warning","message":{"text":"Splicer.checkValidMacroBody (cyclomatic 24): Splicer.checkValidMacroBody 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":"compiler/src/dotty/tools/dotc/transform/Splicer.scala"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d692e222d2b06aac77e2340e51c18aef599b21578491c7db5176e8b2304bac6"}},{"ruleId":"D1","level":"warning","message":{"text":"TailRec.transformDefDef (cyclomatic 24): TailRec.transformDefDef 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":"compiler/src/dotty/tools/dotc/transform/TailRec.scala"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"f006228b2f9397cb3e1c91178856c49cbc210980251e00a3a18006a28207e62b"}},{"ruleId":"D1","level":"warning","message":{"text":"SpaceEngine.display (cyclomatic 24): SpaceEngine.display 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":"compiler/src/dotty/tools/dotc/transform/patmat/Space.scala"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"7181a221eaa2256e25533df2b46214b5b93d24e80a534eebd1a77c438a9d73b3"}},{"ruleId":"D1","level":"warning","message":{"text":"Implicits.typedImplicit (cyclomatic 24): Implicits.typedImplicit 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":"compiler/src/dotty/tools/dotc/typer/Implicits.scala"},"region":{"startLine":1179}}}],"partialFingerprints":{"codehealthFindingId/v1":"c65420605e4a73234388e7140b6d014d6887c0afe9f303f04afafd3d8fa427de"}},{"ruleId":"D1","level":"warning","message":{"text":"Typer.typedAppliedTypeTree (cyclomatic 24): Typer.typedAppliedTypeTree 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":"compiler/src/dotty/tools/dotc/typer/Typer.scala"},"region":{"startLine":2784}}}],"partialFingerprints":{"codehealthFindingId/v1":"01bd11b13871352149b0d0c68f5c259078ac34ba93c1812bf328e474daff1ab6"}},{"ruleId":"D1","level":"warning","message":{"text":"SourceCodePrinter.printTypeTree (cyclomatic 24): SourceCodePrinter.printTypeTree 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":"compiler/src/scala/quoted/runtime/impl/printers/SourceCode.scala"},"region":{"startLine":1005}}}],"partialFingerprints":{"codehealthFindingId/v1":"58c61ca0f16cba5a4ab859e381c81184ca826ca498e01f529eb2485f3277dd0f"}},{"ruleId":"D1","level":"warning","message":{"text":"HoverProvider.hover (cyclomatic 24): HoverProvider.hover 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":"presentation-compiler/src/main/dotty/tools/pc/HoverProvider.scala"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"8965ac48078089c35821740e3378833ba10fc6b28412a9f593c5eff982a86fd6"}},{"ruleId":"D1","level":"warning","message":{"text":"PcCollector.traverseSought (cyclomatic 24): PcCollector.traverseSought 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":"presentation-compiler/src/main/dotty/tools/pc/PcCollector.scala"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"296e5079d96111607238c88da5cb856796e3480ead314d1eb4b2da85586f54c1"}},{"ruleId":"D1","level":"warning","message":{"text":"CompletionProvider.completionItems (cyclomatic 24): CompletionProvider.completionItems 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":"presentation-compiler/src/main/dotty/tools/pc/completions/CompletionProvider.scala"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"b95ad0f959b264ab5ffd3725d0ef07bdb229982e1f5b8ef96676da10f226b137"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser.table (cyclomatic 24): Parser.table 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":"scaladoc/src/dotty/tools/scaladoc/tasty/comments/wiki/Parser.scala"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d4bf4dde50f010bc047e8ff04aed175dc535af15e6800fbaeabd286a2d70f8d"}},{"ruleId":"D1","level":"warning","message":{"text":"Origin.explanation (cyclomatic 23): Origin.explanation 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":"compiler/src/dotty/tools/dotc/cc/Capability.scala"},"region":{"startLine":1168}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ca8fb2d9e272561b748413f20bd88e7661c1623392ed58b481870496b902e83"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeErasure.sigName (cyclomatic 23): TypeErasure.sigName 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":"compiler/src/dotty/tools/dotc/core/TypeErasure.scala"},"region":{"startLine":1116}}}],"partialFingerprints":{"codehealthFindingId/v1":"a03d06be6b850e52ac38f62ca9a5bb618e3f48d469b7461c3c3ab9c723e64a3b"}},{"ruleId":"D1","level":"warning","message":{"text":"ClassfileParser.unpickleOrParseInnerClasses (cyclomatic 23): ClassfileParser.unpickleOrParseInnerClasses 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":"compiler/src/dotty/tools/dotc/core/classfile/ClassfileParser.scala"},"region":{"startLine":1254}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9858f769f24921a55a1dae4f0a1201b4f57fcef485afec042b6cb5040b6e430"}},{"ruleId":"D1","level":"warning","message":{"text":"isElideableExpr.apply (cyclomatic 23): isElideableExpr.apply has cyclomatic complexity 23 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/inlines/Inliner.scala"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"22f913bc7ab901c65c644719045dc2e6adfb0264daa1e2f7862028bc0714ba7e"}},{"ruleId":"D1","level":"warning","message":{"text":"JavaScanner.getlitch (cyclomatic 23): JavaScanner.getlitch 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":"compiler/src/dotty/tools/dotc/parsing/JavaScanners.scala"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"b05e29109030c49fb17b2928489dd102d6df559c1351ec0d99b4e0b457cdf959"}},{"ruleId":"D1","level":"warning","message":{"text":"RefinedPrinter.toText (cyclomatic 23): RefinedPrinter.toText 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":"compiler/src/dotty/tools/dotc/printing/RefinedPrinter.scala"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eeb362a42a0c8325a74ee0035c6d7cc775ded1f5aec498eb7661173f3a369f1"}},{"ruleId":"D1","level":"warning","message":{"text":"InfoPrinter.pprint (cyclomatic 23): InfoPrinter.pprint 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":"compiler/src/dotty/tools/dotc/semanticdb/PPrint.scala"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3f3d85b13de75e6e477fb930119157ac622a4015eea7d7a135a80c2de92ee5f"}},{"ruleId":"D1","level":"warning","message":{"text":"DesugarSpecializedTraits.generatedVariantStats (cyclomatic 23): DesugarSpecializedTraits.generatedVariantStats 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":"compiler/src/dotty/tools/dotc/transform/DesugarSpecializedTraits.scala"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"2833a4050035760faedb08a15de85ad28908b9fc79a998e97ea50e37244dc511"}},{"ruleId":"D1","level":"warning","message":{"text":"PrepJSExports.checkExportTarget (cyclomatic 23): PrepJSExports.checkExportTarget 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":"compiler/src/dotty/tools/dotc/transform/sjs/PrepJSExports.scala"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb8963eb922e43a7e6f280dfd9864be0639eabd18971948198cb9bbcc95f31de"}},{"ruleId":"D1","level":"warning","message":{"text":"Checking.checkEnum (cyclomatic 23): Checking.checkEnum 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":"compiler/src/dotty/tools/dotc/typer/Checking.scala"},"region":{"startLine":1564}}}],"partialFingerprints":{"codehealthFindingId/v1":"b43e478c10d0fa71bc1e217fba4fc20ae1a19e84c978ca3b2564960aa4463904"}},{"ruleId":"D1","level":"warning","message":{"text":"Dynamic.handleStructural (cyclomatic 23): Dynamic.handleStructural 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":"compiler/src/dotty/tools/dotc/typer/Dynamic.scala"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"72e4821d5d02dabda9ad1b6434a96e4bc335256c44cfbdfae15aa51aad45b951"}},{"ruleId":"D1","level":"warning","message":{"text":"Typer.typedAssign (cyclomatic 23): Typer.typedAssign 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":"compiler/src/dotty/tools/dotc/typer/Typer.scala"},"region":{"startLine":1488}}}],"partialFingerprints":{"codehealthFindingId/v1":"efd85fa23a4323a963ed43d82e2393cd5ce2eeb95f66dcd87fe7d8afb0dfcf24"}},{"ruleId":"D1","level":"warning","message":{"text":"Typer.tryExtensionOrConversion (cyclomatic 23): Typer.tryExtensionOrConversion 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":"compiler/src/dotty/tools/dotc/typer/Typer.scala"},"region":{"startLine":4447}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cb274ae1590f300f1b4b1acf1b20f8e5b28efda748e9f237817bd91a96023d0"}},{"ruleId":"D1","level":"warning","message":{"text":"Signatures.toApplySignature (cyclomatic 23): Signatures.toApplySignature 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":"compiler/src/dotty/tools/dotc/util/Signatures.scala"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"a150c82e31165d03d0176e6312fdc68583a8d0eaf9759529f57a26f2d8ecddd7"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser.parse (cyclomatic 23): Parser.parse 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":"directives-parser/src/main/scala/dotty/tools/directives/Parser.scala"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cdbe248e12d3bf23ad255df76e56623f7f8c0f7fa12eb6e9f6f07c4d9e8d6b9"}},{"ruleId":"D1","level":"warning","message":{"text":"ScalaRunTime.stringOf (cyclomatic 23): ScalaRunTime.stringOf 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":"library-js/src/scala/runtime/ScalaRunTime.scala"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f7894d3d5fe590d538b470f2bf080ebdcd6f4a72f8f4e083a89c5d92a963df8"}},{"ruleId":"D1","level":"warning","message":{"text":"NameTransformer.decode (cyclomatic 23): NameTransformer.decode 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":"library/src/scala/reflect/NameTransformer.scala"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7f72f5e56923367b514eed36e320f7e2fe619903786eec02ee1dd8e93146241"}},{"ruleId":"D1","level":"warning","message":{"text":"AutoImports.autoImportPosition (cyclomatic 23): AutoImports.autoImportPosition 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":"presentation-compiler/src/main/dotty/tools/pc/AutoImports.scala"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d49e0c8f9e5625d0659240e14d72c2833167c57501a28f2aa41e147f31d9a42"}},{"ruleId":"D1","level":"warning","message":{"text":"InferCompletionType.inferType (cyclomatic 23): InferCompletionType.inferType 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":"presentation-compiler/src/main/dotty/tools/pc/InferExpectedType.scala"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f64f2fd4da29c8d5f2406903015a7381b846e6b376a527b4cd5d1b7e7929089"}},{"ruleId":"D1","level":"warning","message":{"text":"MemberLookup.downwardLookup (cyclomatic 23): MemberLookup.downwardLookup 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":"scaladoc/src/dotty/tools/scaladoc/tasty/comments/MemberLookup.scala"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7a7bf398608b14f2a6a6712d6de5e507521c1c732ea6d899eca6533add9a318"}},{"ruleId":"D1","level":"warning","message":{"text":"CopyProp.classTagNewArrayInstr (cyclomatic 22): CopyProp.classTagNewArrayInstr 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":"compiler/src/dotty/tools/backend/jvm/opt/CopyProp.scala"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"72792f12512698a80d790807006b7ef5e35b2166d9083248b668118d8088b1eb"}},{"ruleId":"D1","level":"warning","message":{"text":"IncludeFailure.render (cyclomatic 22): IncludeFailure.render 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":"compiler/src/dotty/tools/dotc/cc/CaptureSet.scala"},"region":{"startLine":1488}}}],"partialFingerprints":{"codehealthFindingId/v1":"55a9b500ef6251faffc49c0a9e1b9f771a656d10ec5ece90e613090eef5dfa86"}},{"ruleId":"D1","level":"warning","message":{"text":"Mutability.adaptReadOnlyToExpected (cyclomatic 22): Mutability.adaptReadOnlyToExpected 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":"compiler/src/dotty/tools/dotc/cc/Mutability.scala"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"7243ba99cddadc7ee4da89dbbf967ee5f6f2b380e00e0dc931b717f85ca7bcae"}},{"ruleId":"D1","level":"warning","message":{"text":"CommentExpander.expandVariables (cyclomatic 22): CommentExpander.expandVariables 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":"compiler/src/dotty/tools/dotc/core/Comments.scala"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8b80c92e9a05207d0473a0975ab4bdf81fd4df0e0e45ebe899db4c26af1d5c8"}},{"ruleId":"D1","level":"warning","message":{"text":"ImplicitNullMap.apply (cyclomatic 22): ImplicitNullMap.apply has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/ImplicitNullInterop.scala"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"24f18cbec856ae2841ac595f00a04af4ea63f04b333d85aa3003c5b107c462ca"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeComparer.lub (cyclomatic 22): TypeComparer.lub 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":"compiler/src/dotty/tools/dotc/core/TypeComparer.scala"},"region":{"startLine":2617}}}],"partialFingerprints":{"codehealthFindingId/v1":"46b8339029e98ae58eea1dbb28e9098a4d899cab2474df5c1ef1c5f8846173c7"}},{"ruleId":"D1","level":"warning","message":{"text":"MatchTypeCaseSpec.tryConvertToSpecPattern (cyclomatic 22): MatchTypeCaseSpec.tryConvertToSpecPattern 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":"compiler/src/dotty/tools/dotc/core/Types.scala"},"region":{"startLine":5397}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bf7ec32543521f995876129d0a0c46f393f97b155e69a47a2a7b3bb3d976991"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser.expr1 (cyclomatic 22): Parser.expr1 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":"compiler/src/dotty/tools/dotc/parsing/Parsers.scala"},"region":{"startLine":2663}}}],"partialFingerprints":{"codehealthFindingId/v1":"e37b2413f8676c25f17aef5c7ed54537637b68602cf2593083d9716a1f43fe91"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser.forExpr (cyclomatic 22): Parser.forExpr 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":"compiler/src/dotty/tools/dotc/parsing/Parsers.scala"},"region":{"startLine":3337}}}],"partialFingerprints":{"codehealthFindingId/v1":"d20df557fe567ca8b3a8f1959258a132600b1fd974004c40bb885a5f271a77f4"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser.defDefOrDcl (cyclomatic 22): Parser.defDefOrDcl 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":"compiler/src/dotty/tools/dotc/parsing/Parsers.scala"},"region":{"startLine":4385}}}],"partialFingerprints":{"codehealthFindingId/v1":"0046961bae13e79b8303ef199c79f6d37876221e8fef415229b7a44da75e43b9"}},{"ruleId":"D1","level":"warning","message":{"text":"Scanner.postProcessToken (cyclomatic 22): Scanner.postProcessToken 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":"compiler/src/dotty/tools/dotc/parsing/Scanners.scala"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"d39d4d965537ce31796a7dde95df1c283b767bfff33cce0429a288818fe860e0"}},{"ruleId":"D1","level":"warning","message":{"text":"PlainPrinter.kindString (cyclomatic 22): PlainPrinter.kindString 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":"compiler/src/dotty/tools/dotc/printing/PlainPrinter.scala"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"1be328488ffd1d2813cbd3fcac01ed120bbd83fc3dcf95812cd4ba12cb8767b3"}},{"ruleId":"D1","level":"warning","message":{"text":"Interpreter.paramsSig (cyclomatic 22): Interpreter.paramsSig 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":"compiler/src/dotty/tools/dotc/quoted/Interpreter.scala"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e22a8b954cda83130053f81b4ab45647e909ebba47b19cf017b6ab8c6d17d43"}},{"ruleId":"D1","level":"warning","message":{"text":"QuotePatterns.checkPattern (cyclomatic 22): QuotePatterns.checkPattern 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":"compiler/src/dotty/tools/dotc/quoted/QuotePatterns.scala"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"3497bfd5ddd108a9d5fa0612195af52d388699a494517646d322a9a729d96ba2"}},{"ruleId":"D1","level":"warning","message":{"text":"SpliceTransformer.transform (cyclomatic 22): SpliceTransformer.transform 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":"compiler/src/dotty/tools/dotc/transform/Splicing.scala"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"e40242aef78b3b58c28cb5603c94e92db558716a72d754dcfd3fe56e52325e9a"}},{"ruleId":"D1","level":"warning","message":{"text":"SuperAccessors.transformSuperSelect (cyclomatic 22): SuperAccessors.transformSuperSelect 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":"compiler/src/dotty/tools/dotc/transform/SuperAccessors.scala"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1dd27c8e3c1878a923947facce9236908af7869db7273034e9cbac96f00f854"}},{"ruleId":"D1","level":"warning","message":{"text":"ScalaJSPrepJSInteropTransformer.checkJSNativeLoadSpecOf (cyclomatic 22): ScalaJSPrepJSInteropTransformer.checkJSNativeLoadSpecOf 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":"compiler/src/dotty/tools/dotc/transform/sjs/PrepJSInterop.scala"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa71479349efa3462d3c7f9944c54ee6df1ed57d0abb75f7c6df16cbd1f73daf"}},{"ruleId":"D1","level":"warning","message":{"text":"NameTransformer.decode (cyclomatic 22): NameTransformer.decode 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":"compiler/src/dotty/tools/dotc/util/NameTransformer.scala"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e2a795583ef53e9c376cdd920923b5c97dbd2bf5eabf229c11f0263d7fca8e6"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser.tokenize (cyclomatic 22): Parser.tokenize 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":"library/src/scala/sys/process/Parser.scala"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6851d3c27fc4e13a66dacdda3d6c81f00f1470cd7ff0160e4d8b68faa7dcf40"}},{"ruleId":"D1","level":"warning","message":{"text":"ExtractMethodProvider.extractMethod (cyclomatic 22): ExtractMethodProvider.extractMethod has cyclomatic complexity 22 (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":"presentation-compiler/src/main/dotty/tools/pc/ExtractMethodProvider.scala"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ae0274e4ec22e36d7fe1c62bdebe68794767f74b746973955ae530d653240d6"}},{"ruleId":"D1","level":"warning","message":{"text":"Scaladoc2AnchorCreator.signatureAnchor (cyclomatic 22): Scaladoc2AnchorCreator.signatureAnchor has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scaladoc/src/dotty/tools/scaladoc/tasty/Scaladoc2AnchorCreator.scala"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"728ecc7df0699dbd26010df25eec5406ebedcfcb6b1ba3dc531437d30935a1c8"}},{"ruleId":"D1","level":"warning","message":{"text":"InlineSourceMatcher.parse (cyclomatic 21): InlineSourceMatcher.parse has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/backend/jvm/opt/InlinerHeuristics.scala"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2ee0d8c32b280c7c0cbeb39d5993a2a36ec016432cae2f85b5f4e638e68d0da"}},{"ruleId":"D1","level":"warning","message":{"text":"CaptureChecker.checkEscapingUses (cyclomatic 21): CaptureChecker.checkEscapingUses 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":"compiler/src/dotty/tools/dotc/cc/CheckCaptures.scala"},"region":{"startLine":2413}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a87cfe05445158e028c1073b2a097919c1924ed1a6fa1cdfd04ec650eca67a4"}},{"ruleId":"D1","level":"warning","message":{"text":"CommandLineParser.tokenize (cyclomatic 21): CommandLineParser.tokenize has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/config/CommandLineParser.scala"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"108c4b93b98e8b7396ebfbc322640dde83b3d944dd229ab2ca1ad57b5e75cdf1"}},{"ruleId":"D1","level":"warning","message":{"text":"TermLambda.depStatus (cyclomatic 21): TermLambda.depStatus 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":"compiler/src/dotty/tools/dotc/core/Types.scala"},"region":{"startLine":4050}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bab5228ac29c6bd16ed6842f93e49e21733a61120b033f0fb7c645d6b374b60"}},{"ruleId":"D1","level":"warning","message":{"text":"MatchType.reduced (cyclomatic 21): MatchType.reduced 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":"compiler/src/dotty/tools/dotc/core/Types.scala"},"region":{"startLine":5196}}}],"partialFingerprints":{"codehealthFindingId/v1":"de69391cba2da665633499569d7efb8bb2d826a147aabd0b953cf4e31b3d7058"}},{"ruleId":"D1","level":"warning","message":{"text":"PositionPickler.picklePositions (cyclomatic 21): PositionPickler.picklePositions 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":"compiler/src/dotty/tools/dotc/core/tasty/PositionPickler.scala"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"e441ef5a9f71d691c6c9b81823ba95a38d59122f73c5bcc0bf0633dd02466b6f"}},{"ruleId":"D1","level":"warning","message":{"text":"TreeReader.createMemberSymbol (cyclomatic 21): TreeReader.createMemberSymbol has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/tasty/TreeUnpickler.scala"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"32c4f55fb659560e60c97fe58b8d399d8533c458ab9161931b8baea5378fabd9"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser.indentedToBraces (cyclomatic 21): Parser.indentedToBraces has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/parsing/Parsers.scala"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb81a766aa16aac13406d5679a3867fd3114ce6e829c45628fef8763d49a0910"}},{"ruleId":"D1","level":"warning","message":{"text":"Interpreter.interpretTree (cyclomatic 21): Interpreter.interpretTree has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/quoted/Interpreter.scala"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"424b6db4a76d77de8baaaf01b5df9f1a6f0fe6b4294c57d8b7d14be62423bfd0"}},{"ruleId":"D1","level":"warning","message":{"text":"DidYouMean.inScopeCandidates (cyclomatic 21): DidYouMean.inScopeCandidates 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":"compiler/src/dotty/tools/dotc/reporting/DidYouMean.scala"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbf981a8e6facbd1cc647c604b95e269c865670c67a7f9522c2be6f861eb6731"}},{"ruleId":"D1","level":"warning","message":{"text":"Erasure.transform (cyclomatic 21): Erasure.transform 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":"compiler/src/dotty/tools/dotc/transform/Erasure.scala"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"757a26e7ed9b0c92f42f9601467b8b1499f5921a6a9fed90a1e946c676ccd493"}},{"ruleId":"D1","level":"warning","message":{"text":"ConstFold.foldLongOp (cyclomatic 21): ConstFold.foldLongOp has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/ConstFold.scala"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"e03863a18b0762bd21d80d1a6be88f9ed001e3b34a1ad30c584535a615319e11"}},{"ruleId":"D1","level":"warning","message":{"text":"ImportSuggestions.suggestionRoots (cyclomatic 21): ImportSuggestions.suggestionRoots 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":"compiler/src/dotty/tools/dotc/typer/ImportSuggestions.scala"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"11c31ec7306b79a9638ee0e5ed7204987f7fdca145ab4fc79a687e6ffbf9c61f"}},{"ruleId":"D1","level":"warning","message":{"text":"QuotesAndSplices.typedQuotePattern (cyclomatic 21): QuotesAndSplices.typedQuotePattern has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/QuotesAndSplices.scala"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"043f899be8bd1da1866f0724d750cb2e28c63f62301fcf74ac19393c95adf0fc"}},{"ruleId":"D1","level":"warning","message":{"text":"Synthesizer.sumMirror (cyclomatic 21): Synthesizer.sumMirror 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":"compiler/src/dotty/tools/dotc/typer/Synthesizer.scala"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"70be89b31e1a01fb36a67c883ad80cfe7ca84b212489c5daf33e621d8bb74181"}},{"ruleId":"D1","level":"warning","message":{"text":"Typer.typedSelect (cyclomatic 21): Typer.typedSelect 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":"compiler/src/dotty/tools/dotc/typer/Typer.scala"},"region":{"startLine":1102}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f43fe32142f76b04035943a4a64cbb849c969d6215390c32ea7ba8508cd9790"}},{"ruleId":"D1","level":"warning","message":{"text":"PcSymbolSearch.soughtSymbols (cyclomatic 21): PcSymbolSearch.soughtSymbols 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":"presentation-compiler/src/main/dotty/tools/pc/PcSymbolSearch.scala"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"65675c44c845dd67f811f4b9a32911a8e2a789755e341e33c519018fb4e27725"}},{"ruleId":"D1","level":"warning","message":{"text":"NamedArgCompletions.contribute (cyclomatic 21): NamedArgCompletions.contribute has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"presentation-compiler/src/main/dotty/tools/pc/completions/NamedArgCompletions.scala"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"19d3cb464ca1255edc92803ecf47addadc8baede6c6aaf2bb1887ba0266eb219"}},{"ruleId":"D1","level":"warning","message":{"text":"PlainBodyBuilder.genArithmeticOp (cyclomatic 20): PlainBodyBuilder.genArithmeticOp 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":"compiler/src/dotty/tools/backend/jvm/BCodeBodyBuilder.scala"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9593da45751c9f893df3737f823384f0a803089f997cec4863dd606e7d3a8e3"}},{"ruleId":"D1","level":"warning","message":{"text":"JSCodeGen.genMethodWithCurrentLocalNameScope (cyclomatic 20): JSCodeGen.genMethodWithCurrentLocalNameScope 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":"compiler/src/dotty/tools/backend/sjs/JSCodeGen.scala"},"region":{"startLine":1615}}}],"partialFingerprints":{"codehealthFindingId/v1":"658aaa13165be6ab156f95177b26236eb3ab3f09910a3c22c1ee5e2a9a17c46f"}},{"ruleId":"D1","level":"warning","message":{"text":"TypedTreeInfo.exprPurity (cyclomatic 20): TypedTreeInfo.exprPurity has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/ast/TreeInfo.scala"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cefd6210a491eb75237a35cb33acb356aead8f56cee6ec8a717439b685ee222"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeErasure.compareErasedGlb (cyclomatic 20): TypeErasure.compareErasedGlb has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/TypeErasure.scala"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d7ac48702fdabd780bc2af59a0b663bbb33d32e4fd2d506c40abc065d9866ad"}},{"ruleId":"D1","level":"warning","message":{"text":"MethodOrPoly.signature (cyclomatic 20): MethodOrPoly.signature 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":"compiler/src/dotty/tools/dotc/core/Types.scala"},"region":{"startLine":3962}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7c8696f0370bab5f8dd75170a18ebb295142829b473f91bbab7a39b157c6ffd"}},{"ruleId":"D1","level":"warning","message":{"text":"SAMType.deconstruct (cyclomatic 20): SAMType.deconstruct 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":"compiler/src/dotty/tools/dotc/core/Types.scala"},"region":{"startLine":6033}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bb642ebbbd1d676b05b6bd9f67c4a7f77add64331498464df0963ba20041720"}},{"ruleId":"D1","level":"warning","message":{"text":"InlineTyper.typedMatchFinish (cyclomatic 20): InlineTyper.typedMatchFinish 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":"compiler/src/dotty/tools/dotc/inlines/Inliner.scala"},"region":{"startLine":1160}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7007d2497ddfef89b73b7355303ff607549aab42b60fae36f34eae4f7a1a0fa"}},{"ruleId":"D1","level":"warning","message":{"text":"JavaParser.modifiers (cyclomatic 20): JavaParser.modifiers 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":"compiler/src/dotty/tools/dotc/parsing/JavaParsers.scala"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a60df4bed4d0fda2b8d8bf23b8e63f220df58d2ef44fa31990669cd5ad4e9b2"}},{"ruleId":"D1","level":"warning","message":{"text":"Scanner.getFraction (cyclomatic 20): Scanner.getFraction 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":"compiler/src/dotty/tools/dotc/parsing/Scanners.scala"},"region":{"startLine":1488}}}],"partialFingerprints":{"codehealthFindingId/v1":"363aaef214845790c8aae9eba0fd597aca4d85495af73308e140fb6676c4e950"}},{"ruleId":"D1","level":"warning","message":{"text":"PlainPrinter.toTextCapability (cyclomatic 20): PlainPrinter.toTextCapability 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":"compiler/src/dotty/tools/dotc/printing/PlainPrinter.scala"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"73b67e68e3771baddbf12ad226145b6598497ac971ade5f565ca52787ace564d"}},{"ruleId":"D1","level":"warning","message":{"text":"PlainPrinter.toTextRHS (cyclomatic 20): PlainPrinter.toTextRHS 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":"compiler/src/dotty/tools/dotc/printing/PlainPrinter.scala"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"d68504656ba8ee184d819b30c4ca9d357efda87e30f52605819e61b0b28feefc"}},{"ruleId":"D1","level":"warning","message":{"text":"ActiveProfile.printSummary (cyclomatic 20): ActiveProfile.printSummary has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/reporting/Profile.scala"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"189d52de9604cfcafc96b069a0d6e70a40db39466ae0df6f70c1daa4ce0c66b1"}},{"ruleId":"D1","level":"warning","message":{"text":"SemanticSymbolBuilder.inverseSymbol (cyclomatic 20): SemanticSymbolBuilder.inverseSymbol 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":"compiler/src/dotty/tools/dotc/semanticdb/SemanticSymbolBuilder.scala"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"6039ef551307e94b153b9379bbb78b0215bfd5e41ed16eb7da90c0f3922be6c0"}},{"ruleId":"D1","level":"warning","message":{"text":"BetaReduce.reduceApplication (cyclomatic 20): BetaReduce.reduceApplication 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":"compiler/src/dotty/tools/dotc/transform/BetaReduce.scala"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8451a10b9ea24665860f85cdf22e91e8b7a559660ee096c10e425c6ca9ec4c0"}},{"ruleId":"D1","level":"warning","message":{"text":"DesugarSpecializedTraits.collectReferencedSpecializations (cyclomatic 20): DesugarSpecializedTraits.collectReferencedSpecializations 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":"compiler/src/dotty/tools/dotc/transform/DesugarSpecializedTraits.scala"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"09059fc035a713cb149597393523ad374487c83fd163a0008dc95a6ed7c1bf69"}},{"ruleId":"D1","level":"warning","message":{"text":"Memoize.transformDefDef (cyclomatic 20): Memoize.transformDefDef 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":"compiler/src/dotty/tools/dotc/transform/Memoize.scala"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"f73281ff94f5bec2493bbaa1f362c7397bf3d87611f73a302c4cac0127d019a2"}},{"ruleId":"D1","level":"warning","message":{"text":"Checking.checkNoPrivateLeaks (cyclomatic 20): Checking.checkNoPrivateLeaks 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":"compiler/src/dotty/tools/dotc/typer/Checking.scala"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"587b7d360b3f44fb7ee29873a3671126de2c16fec28dc40066056ec1b22adfeb"}},{"ruleId":"D1","level":"warning","message":{"text":"Typer.typedBind (cyclomatic 20): Typer.typedBind 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":"compiler/src/dotty/tools/dotc/typer/Typer.scala"},"region":{"startLine":2973}}}],"partialFingerprints":{"codehealthFindingId/v1":"3066a4e7c72264d1e844501055488bf4d4cad967275514b8127dd03d1e3a07ce"}},{"ruleId":"D1","level":"warning","message":{"text":"Typer.typedStats (cyclomatic 20): Typer.typedStats 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":"compiler/src/dotty/tools/dotc/typer/Typer.scala"},"region":{"startLine":4199}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fc9dd6ad1057cd82b4ad05f134d9a7b289e4de31f0dfeb70e54b5364b9f05a9"}},{"ruleId":"D1","level":"warning","message":{"text":"PcInlayHintsProvider.collectDecorationsImpl (cyclomatic 20): PcInlayHintsProvider.collectDecorationsImpl 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":"presentation-compiler/src/main/dotty/tools/pc/PcInlayHintsProvider.scala"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"37c877b3b9f8b11621a587725894da4f5cd71aec8bd726be7edea912451d9420"}},{"ruleId":"D1","level":"warning","message":{"text":"Parameters.unapply (cyclomatic 20): Parameters.unapply 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":"presentation-compiler/src/main/dotty/tools/pc/PcInlayHintsProvider.scala"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eaeea0a185bf788d87ff93e651e927affe49b2408c436ef7098350218c47d85"}},{"ruleId":"D1","level":"warning","message":{"text":"BCAnnotGen.emitArgument (cyclomatic 19): BCAnnotGen.emitArgument has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/backend/jvm/BCodeHelpers.scala"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed0b310c5b9320b5b091a9925f350a40a50b443e1fd907fcf06ed2b639bcc5b1"}},{"ruleId":"D1","level":"warning","message":{"text":"AliasSet.-= (cyclomatic 19): AliasSet.-= 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":"compiler/src/dotty/tools/backend/jvm/analysis/AliasingAnalyzer.scala"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"21fb0d71c69c9967d466e2175c8603a4e3f631a6e742c402e8c1b893749f3420"}},{"ruleId":"D1","level":"warning","message":{"text":"BTypesFromClassfile.computeClassInfoFromClassNode (cyclomatic 19): BTypesFromClassfile.computeClassInfoFromClassNode has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/backend/jvm/opt/BTypesFromClassfile.scala"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ed587210d2054a4adb32e4a0013b4ca5c73784039a878c09be362023623d70a"}},{"ruleId":"D1","level":"warning","message":{"text":"checker.traverse (cyclomatic 19): checker.traverse has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/cc/SafeRefs.scala"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d508865650688f11e3cb135aa8d9927a1f5ecf3e9c04a4bf1c11b2f3a1429d1"}},{"ruleId":"D1","level":"warning","message":{"text":"SepCheck.checkConsumedRefs (cyclomatic 19): SepCheck.checkConsumedRefs 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":"compiler/src/dotty/tools/dotc/cc/SepCheck.scala"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c65de29bf39b9368f0d878b6daaa86c8d27946a36fce933c0bf2e20e6cea871"}},{"ruleId":"D1","level":"warning","message":{"text":"Setup.transformSym (cyclomatic 19): Setup.transformSym 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":"compiler/src/dotty/tools/dotc/cc/Setup.scala"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2a4e450b22fddbe608c23a02cec43e1f83bc23b442001d8dcbec949a6e5092f"}},{"ruleId":"D1","level":"warning","message":{"text":"Synthetics.transform (cyclomatic 19): Synthetics.transform has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/cc/Synthetics.scala"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbee7c808461549b3238d95b35bfc22c1611e1234f87e680fce80a8673435e18"}},{"ruleId":"D1","level":"warning","message":{"text":"Denotations.infoMeet (cyclomatic 19): Denotations.infoMeet 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":"compiler/src/dotty/tools/dotc/core/Denotations.scala"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"08c9fde95c7514b7fad8846a0816bbc79c7d35b034a44b19de958ec499f80059"}},{"ruleId":"D1","level":"warning","message":{"text":"OrderingConstraint.checkWellFormed (cyclomatic 19): OrderingConstraint.checkWellFormed 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":"compiler/src/dotty/tools/dotc/core/OrderingConstraint.scala"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"65c68095416d10c5c85074b700383ba2b8c2b33ab93d5301022826e9bbdfad5d"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeErasure.erasedLub (cyclomatic 19): TypeErasure.erasedLub 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":"compiler/src/dotty/tools/dotc/core/TypeErasure.scala"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e0532503599361f55f4914e088db5028b4e2e2b536d1f3c3ba2dc5fc20b9752"}},{"ruleId":"D1","level":"warning","message":{"text":"ClassfileParser.parseAnnotArg (cyclomatic 19): ClassfileParser.parseAnnotArg 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":"compiler/src/dotty/tools/dotc/core/classfile/ClassfileParser.scala"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"94e9f3086d203621e44121fc5e4c547fa02301b529e76a7455b544b6a383b9fd"}},{"ruleId":"D1","level":"warning","message":{"text":"TreeSectionUnpickler.unpickle0 (cyclomatic 19): TreeSectionUnpickler.unpickle0 has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/tasty/TastyPrinter.scala"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"b55b4473a497105f631cd647c642990134b2669fcac2231dcc4d76d06d7c6492"}},{"ruleId":"D1","level":"warning","message":{"text":"Inliner.inlined (cyclomatic 19): Inliner.inlined 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":"compiler/src/dotty/tools/dotc/inlines/Inliner.scala"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"54f048cf0d3672cd601b88557550a00fb574ef882c40d5af48cc2af883654ffc"}},{"ruleId":"D1","level":"warning","message":{"text":"AlreadyDefined.msg (cyclomatic 19): AlreadyDefined.msg 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":"compiler/src/dotty/tools/dotc/reporting/messages.scala"},"region":{"startLine":2169}}}],"partialFingerprints":{"codehealthFindingId/v1":"11dde5ee6f5c5ee8df6519250b514f07d4dced77cb00ec9c39bdfda2c8ef0948"}},{"ruleId":"D1","level":"warning","message":{"text":"DoubleDefinition.msg (cyclomatic 19): DoubleDefinition.msg 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":"compiler/src/dotty/tools/dotc/reporting/messages.scala"},"region":{"startLine":2458}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5bd874bb93c3c65e7e141d59d8b68f035765254f92c6c616eba7c48fb87612f"}},{"ruleId":"D1","level":"warning","message":{"text":"CannotBeIncluded.msg (cyclomatic 19): CannotBeIncluded.msg 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":"compiler/src/dotty/tools/dotc/reporting/messages.scala"},"region":{"startLine":3846}}}],"partialFingerprints":{"codehealthFindingId/v1":"a037e580b58bf9a13a160934a991a84544a231e267fa2ef41ccb16b089c5f4f7"}},{"ruleId":"D1","level":"warning","message":{"text":"RefInfos.register (cyclomatic 19): RefInfos.register 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":"compiler/src/dotty/tools/dotc/transform/CheckUnused.scala"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"97c07017c1b3ff69818d2e8b4f72b1a8fd4cb9546ba5aa0c24c1f99a7118242c"}},{"ruleId":"D1","level":"warning","message":{"text":"Translator.emitCondition (cyclomatic 19): Translator.emitCondition 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":"compiler/src/dotty/tools/dotc/transform/PatternMatcher.scala"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"116eb3d364933b292dd93574fa2322606384abe9bf3b9547b11da90286e8b4bd"}},{"ruleId":"D1","level":"warning","message":{"text":"Objects.init (cyclomatic 19): Objects.init 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":"compiler/src/dotty/tools/dotc/transform/init/Objects.scala"},"region":{"startLine":2112}}}],"partialFingerprints":{"codehealthFindingId/v1":"162c5e7da3e9f15ad3ed58f6016061d882a7c05ee6d0537bf53a10e5f39cd03c"}},{"ruleId":"D1","level":"warning","message":{"text":"Semantic.init (cyclomatic 19): Semantic.init 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":"compiler/src/dotty/tools/dotc/transform/init/Semantic.scala"},"region":{"startLine":1542}}}],"partialFingerprints":{"codehealthFindingId/v1":"4937b01c70a48490b530c7d8807c81f790781b71d076f086e61aebdc8f4b93a1"}},{"ruleId":"D1","level":"warning","message":{"text":"Implicits.inferImplicit (cyclomatic 19): Implicits.inferImplicit 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":"compiler/src/dotty/tools/dotc/typer/Implicits.scala"},"region":{"startLine":1110}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f169c10ce94777bb2004d997b2aaa200f6965cec7f4633f129ddd92c925d6bd"}},{"ruleId":"D1","level":"warning","message":{"text":"Namer.valOrDefDefSig (cyclomatic 19): Namer.valOrDefDefSig 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":"compiler/src/dotty/tools/dotc/typer/Namer.scala"},"region":{"startLine":1943}}}],"partialFingerprints":{"codehealthFindingId/v1":"51411cbee1e87f83e0df58f400fd57198b2a465e5d6d1568d91d7a4a64e9145d"}},{"ruleId":"D1","level":"warning","message":{"text":"Symbol.newClass (cyclomatic 19): Symbol.newClass 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":"compiler/src/scala/quoted/runtime/impl/QuotesImpl.scala"},"region":{"startLine":2802}}}],"partialFingerprints":{"codehealthFindingId/v1":"962dde66d73744120564d8573d9eba49c654f68e7727c87c28e258add9c45cda"}},{"ruleId":"D1","level":"warning","message":{"text":"FromDigits.integerFromDigits (cyclomatic 19): FromDigits.integerFromDigits 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":"library/src/scala/util/FromDigits.scala"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"7993ecdc165b00b283595559c75ebe2552b4c9b2d4a8da52f5fa7823574c9c3e"}},{"ruleId":"D1","level":"warning","message":{"text":"Completions.findSuffix (cyclomatic 19): Completions.findSuffix 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":"presentation-compiler/src/main/dotty/tools/pc/completions/Completions.scala"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"48fb7a443245503c3505a4cfba58e29d03a4ba33085abfd2d2bd9aaa46ed999d"}},{"ruleId":"D1","level":"warning","message":{"text":"InkuireSupport.doInkuireStuff (cyclomatic 19): InkuireSupport.doInkuireStuff has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scaladoc/src/dotty/tools/scaladoc/tasty/InkuireSupport.scala"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"a323d5dd7481310ec117a1e7111e467a89dff03d08ba59abee194caaf5b0ead8"}},{"ruleId":"D1","level":"warning","message":{"text":"PlainBodyBuilder.genCond (cyclomatic 18): PlainBodyBuilder.genCond 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":"compiler/src/dotty/tools/backend/jvm/BCodeBodyBuilder.scala"},"region":{"startLine":1589}}}],"partialFingerprints":{"codehealthFindingId/v1":"f05c61f74f197f7a3984a18dbbfa0257b09f45706e02a464c6c2e7ae714ec7ee"}},{"ruleId":"D1","level":"warning","message":{"text":"PlainBodyBuilder.genInvokeDynamicLambda (cyclomatic 18): PlainBodyBuilder.genInvokeDynamicLambda 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":"compiler/src/dotty/tools/backend/jvm/BCodeBodyBuilder.scala"},"region":{"startLine":1760}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fa40151abd8f33bfb7dea68b9aecf40d00a777c6ccc2f18e121309cdb224240"}},{"ruleId":"D1","level":"warning","message":{"text":"InlineRequest.logText (cyclomatic 18): InlineRequest.logText has cyclomatic complexity 18 (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":"compiler/src/dotty/tools/backend/jvm/opt/InlinerHeuristics.scala"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"152d7f45b574acb91b94b0184762c6335e17787b69f8dee2c2b54039e76be8c2"}},{"ruleId":"D1","level":"warning","message":{"text":"JSCodeGen.genClosure (cyclomatic 18): JSCodeGen.genClosure 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":"compiler/src/dotty/tools/backend/sjs/JSCodeGen.scala"},"region":{"startLine":3673}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a65c52239f49f3471a87ac4b5b4755f9f32abc844e6a379907edc2d939fc9f3"}},{"ruleId":"D1","level":"warning","message":{"text":"Capability.subsumes (cyclomatic 18): Capability.subsumes has cyclomatic complexity 18 (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":"compiler/src/dotty/tools/dotc/cc/Capability.scala"},"region":{"startLine":847}}}],"partialFingerprints":{"codehealthFindingId/v1":"489fa4055735105b23c6af08b48bbdc70f704305148086d16a10267ec019df02"}},{"ruleId":"D1","level":"warning","message":{"text":"SepCheck.sepApplyError (cyclomatic 18): SepCheck.sepApplyError 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":"compiler/src/dotty/tools/dotc/cc/SepCheck.scala"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3dca04e3acd74d235c2b2a4f4cee83a531888734f5464c4862c15b9e7f5663e"}},{"ruleId":"D1","level":"warning","message":{"text":"SepCheck.checkApply (cyclomatic 18): SepCheck.checkApply 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":"compiler/src/dotty/tools/dotc/cc/SepCheck.scala"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee87a8fc4d1f03bff997e7ae756eae16265c530d8972b012e89ee50d5e454c82"}},{"ruleId":"D1","level":"warning","message":{"text":"SymDenotation.isAccessibleFrom (cyclomatic 18): SymDenotation.isAccessibleFrom has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/SymDenotations.scala"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc03e92489bf8b4493041a4ebbce636195b8ae6980e8929982342eae63ac4b27"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeComparer.glb (cyclomatic 18): TypeComparer.glb 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":"compiler/src/dotty/tools/dotc/core/TypeComparer.scala"},"region":{"startLine":2570}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac261b1624324230c5eb9c72bd9470a2b503f0703e2de85b34bcc07c04237c8d"}},{"ruleId":"D1","level":"warning","message":{"text":"Type.testProvisional (cyclomatic 18): Type.testProvisional 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":"compiler/src/dotty/tools/dotc/core/Types.scala"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf889ceaa842a36c781e0ad9cefc129bfa978cb509408d7805166b4204462bf4"}},{"ruleId":"D1","level":"warning","message":{"text":"NamedType.computeDenot (cyclomatic 18): NamedType.computeDenot 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":"compiler/src/dotty/tools/dotc/core/Types.scala"},"region":{"startLine":2479}}}],"partialFingerprints":{"codehealthFindingId/v1":"63c80a97c4c5521ce4b87da531163e1c9d40a57b32edff4563da2bc904500039"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeMap.mapCapability (cyclomatic 18): TypeMap.mapCapability has cyclomatic complexity 18 (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":"compiler/src/dotty/tools/dotc/core/Types.scala"},"region":{"startLine":6269}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4ce532d40eb03e74c9fd44d28f327006e86145cca3d7483647e8df46cfa49c0"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser.simpleExprRest (cyclomatic 18): Parser.simpleExprRest has cyclomatic complexity 18 (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. This is NOT this file\u0027s highest cyclomatic complexity: Parser.modOfToken (cyclomatic 20) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/parsing/Parsers.scala"},"region":{"startLine":3060}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dd2653e38415730d7b608faf457ea9e97221acd692f97584b05a9086d76fdb6"}},{"ruleId":"D1","level":"warning","message":{"text":"Seen.record (cyclomatic 18): Seen.record has cyclomatic complexity 18 (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":"compiler/src/dotty/tools/dotc/reporting/Message.scala"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"559e33985ff4a3715e629e88215368fc0ee2797ff47add988936aa2d74ae70fb"}},{"ruleId":"D1","level":"warning","message":{"text":"WConf.parseFilter (cyclomatic 18): WConf.parseFilter has cyclomatic complexity 18 (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":"compiler/src/dotty/tools/dotc/reporting/WConf.scala"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"f613e8e0be8faf9414095829c5015cf1de86fddeaa6b0402a3d3012478715e42"}},{"ruleId":"D1","level":"warning","message":{"text":"CoverageTransformer.needsLift (cyclomatic 18): CoverageTransformer.needsLift has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/InstrumentCoverage.scala"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"50ed32b1beb36315efe63efd16c2a4de68ab2151424931e0cb64514c8b9f7aa7"}},{"ruleId":"D1","level":"warning","message":{"text":"SpaceEngine.project (cyclomatic 18): SpaceEngine.project 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":"compiler/src/dotty/tools/dotc/transform/patmat/Space.scala"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed772feeb004253be44f906bbd3282a1ead1cdb4619c6561618b624881076538"}},{"ruleId":"D1","level":"warning","message":{"text":"SpaceEngine.checkReachability (cyclomatic 18): SpaceEngine.checkReachability 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":"compiler/src/dotty/tools/dotc/transform/patmat/Space.scala"},"region":{"startLine":1124}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0acb9f4e75583fc3679a740897dd702fc19b0725b2d7071b8daeb94a25b5f3d"}},{"ruleId":"D1","level":"warning","message":{"text":"Implicits.assumedCanEqual (cyclomatic 18): Implicits.assumedCanEqual 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":"compiler/src/dotty/tools/dotc/typer/Implicits.scala"},"region":{"startLine":1051}}}],"partialFingerprints":{"codehealthFindingId/v1":"55fe8d6b8a99237e8c476bbf29bc5c8135c9c7f444e467e2d4149c0c9b67f4da"}},{"ruleId":"D1","level":"warning","message":{"text":"Namer.checkDefName (cyclomatic 18): Namer.checkDefName has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/Namer.scala"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"cee59a876ad9dfba95d64da14769865d96c2d3f75b195aa6e0be6b16fb2017bc"}},{"ruleId":"D1","level":"warning","message":{"text":"RefChecks.checkExtensionMethods (cyclomatic 18): RefChecks.checkExtensionMethods 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":"compiler/src/dotty/tools/dotc/typer/RefChecks.scala"},"region":{"startLine":1188}}}],"partialFingerprints":{"codehealthFindingId/v1":"a236b03010feb0baa527720c51ec8a170358c2eaafb54f160c15f44ea8b51746"}},{"ruleId":"D1","level":"warning","message":{"text":"Typer.typedTyped (cyclomatic 18): Typer.typedTyped 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":"compiler/src/dotty/tools/dotc/typer/Typer.scala"},"region":{"startLine":1340}}}],"partialFingerprints":{"codehealthFindingId/v1":"441c258f2f27687ab1eacecc2e44fe926b89d5bf5b3cfb390bd6f85da195fb9b"}},{"ruleId":"D1","level":"warning","message":{"text":"WithCompilationUnit.symbolAlternatives (cyclomatic 18): WithCompilationUnit.symbolAlternatives 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":"presentation-compiler/src/main/dotty/tools/pc/WithCompilationUnit.scala"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5d02983e3bf946f73a230966f2e51bc2f58db85561a203f3f9a346559e2806a"}},{"ruleId":"D1","level":"warning","message":{"text":"Completions.completionsWithAffix (cyclomatic 18): Completions.completionsWithAffix 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":"presentation-compiler/src/main/dotty/tools/pc/completions/Completions.scala"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"941714959edfcecdbd8dcd0597efb6b06e1393713dcc710d0fb5d675655f700e"}},{"ruleId":"D1","level":"warning","message":{"text":"Completions.enrichWithSymbolSearch (cyclomatic 18): Completions.enrichWithSymbolSearch 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":"presentation-compiler/src/main/dotty/tools/pc/completions/Completions.scala"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"f11b0ea13b28bad51e5c767c512b27c3d6831638eae8b3b5c66d31e6c4773f8c"}},{"ruleId":"D1","level":"warning","message":{"text":"BType.conformsTo (cyclomatic 17): BType.conformsTo 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":"compiler/src/dotty/tools/backend/jvm/BTypes.scala"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"80dde81bcc80d7acecadae82d3a8b0774666ab5b82c4966fd376dd1e9d5918d1"}},{"ruleId":"D1","level":"warning","message":{"text":"JSCodeGen.genApplyJSMethodGeneric (cyclomatic 17): JSCodeGen.genApplyJSMethodGeneric 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":"compiler/src/dotty/tools/backend/sjs/JSCodeGen.scala"},"region":{"startLine":3286}}}],"partialFingerprints":{"codehealthFindingId/v1":"c61c85b76c376ce349bde9d36419def2f670011ddf6c3549b7a5bb1f5191dbad"}},{"ruleId":"D1","level":"warning","message":{"text":"CheckCaptures.checkWellformedRetains (cyclomatic 17): CheckCaptures.checkWellformedRetains has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/cc/CheckCaptures.scala"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b808f9e2fce667af272060580d3210266fe914cf99eb7b6aa015b9ccd0ffb69"}},{"ruleId":"D1","level":"warning","message":{"text":"ConstraintHandling.addConstraint (cyclomatic 17): ConstraintHandling.addConstraint has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/ConstraintHandling.scala"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"f468cc83e68bf8180e94e19e175481d0fb2ad43e087862e56047dbc682cc6a09"}},{"ruleId":"D1","level":"warning","message":{"text":"SingleDenotation.current (cyclomatic 17): SingleDenotation.current 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":"compiler/src/dotty/tools/dotc/core/Denotations.scala"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dd8cbf4b5284bee3575e4c9da7bbcc2da920f991d04b7a91a0e7158e3afc173"}},{"ruleId":"D1","level":"warning","message":{"text":"OrderingConstraint.validBoundFor (cyclomatic 17): OrderingConstraint.validBoundFor 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":"compiler/src/dotty/tools/dotc/core/OrderingConstraint.scala"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"73116ac068144b21c48e5a08095f543ea559ed376a15f812e96a41a4254c5975"}},{"ruleId":"D1","level":"warning","message":{"text":"OrderingConstraint.replace (cyclomatic 17): OrderingConstraint.replace 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":"compiler/src/dotty/tools/dotc/core/OrderingConstraint.scala"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"97964ab6fe20c9bd0b35140abbe94fa713e5cc638d6c96cb3c0a3adf043f0853"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeComparer.liftToThis (cyclomatic 17): TypeComparer.liftToThis has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/TypeComparer.scala"},"region":{"startLine":1740}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5ee427cf40d1dc633b00d37b6980f970cf731ea7aee821dcd9183ac68e70a88"}},{"ruleId":"D1","level":"warning","message":{"text":"AsSeenFromMap.apply (cyclomatic 17): AsSeenFromMap.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":"compiler/src/dotty/tools/dotc/core/TypeOps.scala"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"252f1fd4b12b33675564d1d61216d9cd4954e6d88b5a5cff3d966c3db263998c"}},{"ruleId":"D1","level":"warning","message":{"text":"Type.derivesFrom (cyclomatic 17): Type.derivesFrom has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/Types.scala"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"50f48876a46597761f9a8f9852e74b82b4dafb2c34f359b1a085b1550bc087af"}},{"ruleId":"D1","level":"warning","message":{"text":"Type.classSymbol (cyclomatic 17): Type.classSymbol 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":"compiler/src/dotty/tools/dotc/core/Types.scala"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"32ea85355be9ce1b982b310c7d271b4f3616c98d0b9e856663a941253c37b114"}},{"ruleId":"D1","level":"warning","message":{"text":"NamedType.infoDependsOnPrefix (cyclomatic 17): NamedType.infoDependsOnPrefix 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":"compiler/src/dotty/tools/dotc/core/Types.scala"},"region":{"startLine":2684}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf2b0d49498bdb0f6403f228458949236e339fce19c85e381285f2c9b6b780e3"}},{"ruleId":"D1","level":"warning","message":{"text":"TreeReader.normalizeFlags (cyclomatic 17): TreeReader.normalizeFlags 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":"compiler/src/dotty/tools/dotc/core/tasty/TreeUnpickler.scala"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"73a990c15e4a8c15c0847b8403ed11dd9f147d6654af4dc4ab13276c3b14bd49"}},{"ruleId":"D1","level":"warning","message":{"text":"Interactive.contextOfPath (cyclomatic 17): Interactive.contextOfPath has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/interactive/Interactive.scala"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"b91df4082551cd75a3eb30f7d3599a1d4062f91c08a943aefa4845316c857483"}},{"ruleId":"D1","level":"warning","message":{"text":"JavaParser.termDecl (cyclomatic 17): JavaParser.termDecl 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":"compiler/src/dotty/tools/dotc/parsing/JavaParsers.scala"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae5c915c6ad58f5a1f338f873283bda25074096c47c5450079defd8373cd77a7"}},{"ruleId":"D1","level":"warning","message":{"text":"JavaParser.compilationUnit (cyclomatic 17): JavaParser.compilationUnit has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/parsing/JavaParsers.scala"},"region":{"startLine":1119}}}],"partialFingerprints":{"codehealthFindingId/v1":"50f504017dddb1c15ec8bdc7baa24085550c1f398a651b888a26366e230c58c9"}},{"ruleId":"D1","level":"warning","message":{"text":"JavaScanner.getFraction (cyclomatic 17): JavaScanner.getFraction 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":"compiler/src/dotty/tools/dotc/parsing/JavaScanners.scala"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d1b73801e33b9d73ef07296cc26aab51b950e7d1e56e63b96adc0b8abab8263"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser.patDefOrDcl (cyclomatic 17): Parser.patDefOrDcl has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: Parser.modOfToken (cyclomatic 20) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/parsing/Parsers.scala"},"region":{"startLine":4323}}}],"partialFingerprints":{"codehealthFindingId/v1":"a97e96e006db85192c14197b66706e6daaf9d057c792346ee941dfd32157a62e"}},{"ruleId":"D1","level":"warning","message":{"text":"Scanner.isLeadingInfixOperator (cyclomatic 17): Scanner.isLeadingInfixOperator has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/parsing/Scanners.scala"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"76d84bc00d87f86e3b21294e2048a455dafc241f8eb4dd264b8eeccb5f9bdefc"}},{"ruleId":"D1","level":"warning","message":{"text":"RefinedPrinter.toTextTemplate (cyclomatic 17): RefinedPrinter.toTextTemplate has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/printing/RefinedPrinter.scala"},"region":{"startLine":1088}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c4d8ddf4633cb34bf692fcee3d5e0b4dfdad492ffcc669da0796b739824c869"}},{"ruleId":"D1","level":"warning","message":{"text":"QuotePatterns.decode (cyclomatic 17): QuotePatterns.decode 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":"compiler/src/dotty/tools/dotc/quoted/QuotePatterns.scala"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"79ee679944fc823b9b8dee69871b54ce8f41d2d218951af3c931756cb5853a19"}},{"ruleId":"D1","level":"warning","message":{"text":"CannotBeAccessed.msg (cyclomatic 17): CannotBeAccessed.msg 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":"compiler/src/dotty/tools/dotc/reporting/messages.scala"},"region":{"startLine":3314}}}],"partialFingerprints":{"codehealthFindingId/v1":"08507f16d7bd45a7f56a80af1f1c48532d802a791f045d4f3c83ffe348fc91ff"}},{"ruleId":"D1","level":"warning","message":{"text":"InfoPrinter.pprint (cyclomatic 17): InfoPrinter.pprint 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":"compiler/src/dotty/tools/dotc/semanticdb/PPrint.scala"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"faa2d1717b69d357b5b4196d83b19fe2b9df43a84d6c0c081003cc4c7418a22c"}},{"ruleId":"D1","level":"warning","message":{"text":"SyntheticsExtractor.tryFindSynthetic (cyclomatic 17): SyntheticsExtractor.tryFindSynthetic 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":"compiler/src/dotty/tools/dotc/semanticdb/SyntheticsExtractor.scala"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"7292165b6dc8a900fb169bed4535e02a9c7345afdefd4f4f7b20b9e209443260"}},{"ruleId":"D1","level":"warning","message":{"text":"Dependencies.markFree (cyclomatic 17): Dependencies.markFree 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":"compiler/src/dotty/tools/dotc/transform/Dependencies.scala"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bea89e4cacb7f60e45cfa1135ded73fd9deb22e9718dec9e8ce44d4cd6214c3"}},{"ruleId":"D1","level":"warning","message":{"text":"Deriver.processDerivedInstance (cyclomatic 17): Deriver.processDerivedInstance has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/Deriving.scala"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"42cd603a319cde3ffa4e9200501bb58b7c72a7e4f682fc582e130d2d850fb37c"}},{"ruleId":"D1","level":"warning","message":{"text":"Linter.warnOnImplausiblePattern (cyclomatic 17): Linter.warnOnImplausiblePattern has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/Linter.scala"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c8bf66d1281f0840a4bdb917019e81d4c03743a8fc1fc608a13cfe2570bb281"}},{"ruleId":"D1","level":"warning","message":{"text":"ClassCompleter.processExports (cyclomatic 17): ClassCompleter.processExports 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":"compiler/src/dotty/tools/dotc/typer/Namer.scala"},"region":{"startLine":1588}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b974a5b59c4e131fca08c299ffb9d7b03331ebdb6f6de26b1568e26ddfe7842"}},{"ruleId":"D1","level":"warning","message":{"text":"Nullables.postProcessByNameArgs (cyclomatic 17): Nullables.postProcessByNameArgs 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":"compiler/src/dotty/tools/dotc/typer/Nullables.scala"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"5073b8a0d1003298b8f99115d49631753b656fcb66071319db43123024dd48f7"}},{"ruleId":"D1","level":"warning","message":{"text":"Synthesizer.manifestFactoryOf (cyclomatic 17): Synthesizer.manifestFactoryOf has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/Synthesizer.scala"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0c856557f87bd852be9c809e995e517c348688cd3c9b4ac6505bd3f10730547"}},{"ruleId":"D1","level":"warning","message":{"text":"Stream.addStringNoForce (cyclomatic 17): Stream.addStringNoForce 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":"library/src/scala/collection/immutable/Stream.scala"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"430b0eb5a26de8553a1816d4b8e716e44410c7ae193de2588cc908e9c1351009"}},{"ruleId":"D1","level":"warning","message":{"text":"HoverProvider.fallbackToDynamics (cyclomatic 17): HoverProvider.fallbackToDynamics 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":"presentation-compiler/src/main/dotty/tools/pc/HoverProvider.scala"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"d282e7ff7ac604e61fb70c350e9a4a2358b1750ebf732aa67e84bfc605b237b5"}},{"ruleId":"D1","level":"warning","message":{"text":"ReplDriver.renderDefinitions (cyclomatic 17): ReplDriver.renderDefinitions 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":"repl/src/dotty/tools/repl/ReplDriver.scala"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"535ad6a1d8b90ca29814afade5a83ae4b8b8401c15e1f6e0e1742d92206be175"}},{"ruleId":"D1","level":"warning","message":{"text":"HtmlRenderer.buildNavigation (cyclomatic 17): HtmlRenderer.buildNavigation has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scaladoc/src/dotty/tools/scaladoc/renderers/HtmlRenderer.scala"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b4315164101b6f3d9590128da913f108f3fa8cc997738fdb0229f6fd7fe1a79"}},{"ruleId":"D1","level":"warning","message":{"text":"ClassLikeSupport.parseMember (cyclomatic 17): ClassLikeSupport.parseMember 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":"scaladoc/src/dotty/tools/scaladoc/tasty/ClassLikeSupport.scala"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"06035c4facd82ee9dac95edddd97f56a65827c7ab371f7c53e10688824705d0d"}},{"ruleId":"D1","level":"warning","message":{"text":"ScaladocTastyInspector.inspect (cyclomatic 17): ScaladocTastyInspector.inspect has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scaladoc/src/dotty/tools/scaladoc/tasty/TastyParser.scala"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"44c84e0becf7ca89175034be06220df0611b1e8d87cc99d4bc459792a1571d7c"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser.getInline (cyclomatic 17): Parser.getInline has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scaladoc/src/dotty/tools/scaladoc/tasty/comments/wiki/Parser.scala"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee58063e3eca47d97ac31c53968c85b212fff9377f4d3a648a4657a7a11877d4"}},{"ruleId":"D1","level":"warning","message":{"text":"PlainBodyBuilder.genConstant (cyclomatic 16): PlainBodyBuilder.genConstant 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":"compiler/src/dotty/tools/backend/jvm/BCodeBodyBuilder.scala"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6d6c984345ea927fb1bb50651b22558d9c786ec74057e083be34b13c62b77b2"}},{"ruleId":"D1","level":"warning","message":{"text":"BCodeUtils.substituteLabel (cyclomatic 16): BCodeUtils.substituteLabel has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: BCodeUtils.negateJumpOpcode (cyclomatic 17) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/backend/jvm/BCodeUtils.scala"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ca5f58f42c8955f68c7c566061b83453baa965079eb16b49b72846bc13981b0"}},{"ruleId":"D1","level":"warning","message":{"text":"ClosureOptimizer.rewriteClosureApplyInvocation (cyclomatic 16): ClosureOptimizer.rewriteClosureApplyInvocation 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":"compiler/src/dotty/tools/backend/jvm/opt/ClosureOptimizer.scala"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"91c72163e117f15bdeaf7de29378c10015137d9c00fdc46333ed0b33ee66fc91"}},{"ruleId":"D1","level":"warning","message":{"text":"OptimizerCallGraph.addMethod (cyclomatic 16): OptimizerCallGraph.addMethod has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/backend/jvm/opt/OptimizerCallGraph.scala"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"65f8b03707e6d935a05ae6a3ef3720f281104ed01ce56c3c4fc1d679d843aa80"}},{"ruleId":"D1","level":"warning","message":{"text":"JSCodeGen.genNonNativeJSClass (cyclomatic 16): JSCodeGen.genNonNativeJSClass 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":"compiler/src/dotty/tools/backend/sjs/JSCodeGen.scala"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a501a4404d6f163abceac12a0f6091672f442773e0b54d08402e70ad7881cc7"}},{"ruleId":"D1","level":"warning","message":{"text":"JSEncoding.toTypeRefInternal (cyclomatic 16): JSEncoding.toTypeRefInternal has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/backend/sjs/JSEncoding.scala"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"037d8b707e38b74e1a7f723e9e7fd63ca76a0431dde665ec97b6742b95906e92"}},{"ruleId":"D1","level":"warning","message":{"text":"TreeTypeMap.transform (cyclomatic 16): TreeTypeMap.transform 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":"compiler/src/dotty/tools/dotc/ast/TreeTypeMap.scala"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"dba6341f795262239c9612ff4c97107192df02972a30fa052cfa557ffeec88ef"}},{"ruleId":"D1","level":"warning","message":{"text":"Capability.maxSubsumes (cyclomatic 16): Capability.maxSubsumes has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/cc/Capability.scala"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b5d36abbddf1155312281d73da03308e4dd452efed2d7d78e784e4913aeed2f"}},{"ruleId":"D1","level":"warning","message":{"text":"CaptureSet.map (cyclomatic 16): CaptureSet.map 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":"compiler/src/dotty/tools/dotc/cc/CaptureSet.scala"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"11a75d09af83167ec94e6eb1489aa7667e185ac70eb89bda31ac04c86fc7bf38"}},{"ruleId":"D1","level":"warning","message":{"text":"CaptureSet.ofType (cyclomatic 16): CaptureSet.ofType 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":"compiler/src/dotty/tools/dotc/cc/CaptureSet.scala"},"region":{"startLine":1819}}}],"partialFingerprints":{"codehealthFindingId/v1":"d97284c859b5928de941b868df38b325e6180f98b11b3cbaa4b66338d259cdd4"}},{"ruleId":"D1","level":"warning","message":{"text":"Denotations.staticRef (cyclomatic 16): Denotations.staticRef 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":"compiler/src/dotty/tools/dotc/core/Denotations.scala"},"region":{"startLine":1342}}}],"partialFingerprints":{"codehealthFindingId/v1":"df3a8efc6613cedd8bb9ee53c115afe1f613b3240a535c6529bd066a5e365527"}},{"ruleId":"D1","level":"warning","message":{"text":"PackageClassDenotation.computeMembersNamed (cyclomatic 16): PackageClassDenotation.computeMembersNamed has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: SymDenotation.hasSkolems (cyclomatic 17) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/SymDenotations.scala"},"region":{"startLine":2690}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d75088f6205062a9945ed09fa31e782b5b3764a3bdb81431e1c96fa979c1f0f"}},{"ruleId":"D1","level":"warning","message":{"text":"SymbolLoaders.enterToplevelsFromSource (cyclomatic 16): SymbolLoaders.enterToplevelsFromSource 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":"compiler/src/dotty/tools/dotc/core/SymbolLoaders.scala"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1b51dc5cbbf75c09147220d1eb978288ac873ed96ef3f67be78b72627460a78"}},{"ruleId":"D1","level":"warning","message":{"text":"SymbolLoader.complete (cyclomatic 16): SymbolLoader.complete has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/SymbolLoaders.scala"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0a0aacae34c7e0e85291ea9f4115833ce2630592930c12a5b16b8763dba4dbe"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeApplications.typeParams (cyclomatic 16): TypeApplications.typeParams 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":"compiler/src/dotty/tools/dotc/core/TypeApplications.scala"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba2f1ef64452d90b127ec42ad12574618cc30d155ac6a1c8b60b700486e9b500"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeComparer.hasMatchingMember (cyclomatic 16): TypeComparer.hasMatchingMember has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/TypeComparer.scala"},"region":{"startLine":2265}}}],"partialFingerprints":{"codehealthFindingId/v1":"e267154066e18cf82c9907536f1ef0b9f8749978ed7416bac7c93948b0023f05"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeComparer.distributeAnd (cyclomatic 16): TypeComparer.distributeAnd 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":"compiler/src/dotty/tools/dotc/core/TypeComparer.scala"},"region":{"startLine":2861}}}],"partialFingerprints":{"codehealthFindingId/v1":"9376e2e2e64e6737b3307afcd2b9ceae3262c150759c344f2f65f6d132f287ab"}},{"ruleId":"D1","level":"warning","message":{"text":"TyperState.mergeConstraintWith (cyclomatic 16): TyperState.mergeConstraintWith has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/TyperState.scala"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cf3c9ebca8fde8668ea700f873fc664d6af41285b61678f1cc0b87a464f132b"}},{"ruleId":"D1","level":"warning","message":{"text":"Type.atoms (cyclomatic 16): Type.atoms 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":"compiler/src/dotty/tools/dotc/core/Types.scala"},"region":{"startLine":1508}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8fcc8bf3d68ec47e5544835b070d946794cbcb6a151d09fc87c74c0d74dbe5e"}},{"ruleId":"D1","level":"warning","message":{"text":"ApproximatingTypeMap.derivedAppliedType (cyclomatic 16): ApproximatingTypeMap.derivedAppliedType 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":"compiler/src/dotty/tools/dotc/core/Types.scala"},"region":{"startLine":6654}}}],"partialFingerprints":{"codehealthFindingId/v1":"82052400ada054a583a30d8dd53abecdc5aed30b51b9b866c20ea6ebcd97cedb"}},{"ruleId":"D1","level":"warning","message":{"text":"LocalUnpickler.complete (cyclomatic 16): LocalUnpickler.complete 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":"compiler/src/dotty/tools/dotc/core/unpickleScala2/Scala2Unpickler.scala"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b9e4e602bc051905089c3407bf8da923355d23ea86a214eb90694dd19d98694"}},{"ruleId":"D1","level":"warning","message":{"text":"Inliner.paramBindingDef (cyclomatic 16): Inliner.paramBindingDef has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/inlines/Inliner.scala"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"83f3ba09107c794028347b406ad2f9ac13ccd0c8fd343a6eb9cdd98fd16ec12e"}},{"ruleId":"D1","level":"warning","message":{"text":"Intrinsics.compileForErrors (cyclomatic 16): Intrinsics.compileForErrors 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":"compiler/src/dotty/tools/dotc/inlines/Inlines.scala"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"644d08ac7a4ca22624f54768c26ac814b2edb95eb322aeb873335c206a2fc19d"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser.bracesToIndented (cyclomatic 16): Parser.bracesToIndented has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This is NOT this file\u0027s highest cyclomatic complexity: Parser.modOfToken (cyclomatic 20) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/parsing/Parsers.scala"},"region":{"startLine":847}}}],"partialFingerprints":{"codehealthFindingId/v1":"023de8252c709aedf18edb33da2f9adb4de7675dedc2e9cfeebe07448c11163b"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser.followingIsLambdaAfterColon (cyclomatic 16): Parser.followingIsLambdaAfterColon has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: Parser.modOfToken (cyclomatic 20) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/parsing/Parsers.scala"},"region":{"startLine":1105}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ee98697cd8e777882e8dee1678321031bc58c26c08b3928188de4e94674c04c"}},{"ruleId":"D1","level":"warning","message":{"text":"PlainPrinter.homogenize (cyclomatic 16): PlainPrinter.homogenize 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":"compiler/src/dotty/tools/dotc/printing/PlainPrinter.scala"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3bb1e2a18274ea6e1ccb61cc1bcd376b8914eee5362985dca8bae6d1d27dd43"}},{"ruleId":"D1","level":"warning","message":{"text":"AbstractExtractDependenciesCollector.recordTree (cyclomatic 16): AbstractExtractDependenciesCollector.recordTree 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":"compiler/src/dotty/tools/dotc/sbt/ExtractDependencies.scala"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"b63e7767bf0e357b27bf7566a7c94b3e6f69106ceaf103854771c08f4efa3798"}},{"ruleId":"D1","level":"warning","message":{"text":"Translator.emit (cyclomatic 16): Translator.emit 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":"compiler/src/dotty/tools/dotc/transform/PatternMatcher.scala"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"47096fad2ba8b66b716d6b696ebd3425f06b18a257d47952a4c44e47445b8410"}},{"ruleId":"D1","level":"warning","message":{"text":"Pickler.run (cyclomatic 16): Pickler.run 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":"compiler/src/dotty/tools/dotc/transform/Pickler.scala"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b6da7770a4718e906700c97c315b8b69a5aa4722266b0c963ab0587d631c7f6"}},{"ruleId":"D1","level":"warning","message":{"text":"Objects.readLocal (cyclomatic 16): Objects.readLocal 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":"compiler/src/dotty/tools/dotc/transform/init/Objects.scala"},"region":{"startLine":1463}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ace049aa4ec938dc592332d9fd7fe74ebc1417e617278727ac069f9d6d47a4d"}},{"ruleId":"D1","level":"warning","message":{"text":"TypedFormatChecker.checked (cyclomatic 16): TypedFormatChecker.checked has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/localopt/FormatChecker.scala"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"c85ace34ce4a34c32ded4f2ce41ee9d2f812eb85a0dc1a367b757ac8dd937570"}},{"ruleId":"D1","level":"warning","message":{"text":"SpaceEngine.intersect (cyclomatic 16): SpaceEngine.intersect 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":"compiler/src/dotty/tools/dotc/transform/patmat/Space.scala"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b09248aa422ad431cd288b1cf978d42af44d457454709fcf9748ead84480025"}},{"ruleId":"D1","level":"warning","message":{"text":"Checking.checkAndAdaptExperimentalImports (cyclomatic 16): Checking.checkAndAdaptExperimentalImports has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/Checking.scala"},"region":{"startLine":932}}}],"partialFingerprints":{"codehealthFindingId/v1":"1716a75205bd70549f9690b267265be66b48ba9f27799f7a389c87aa6695ab42"}},{"ruleId":"D1","level":"warning","message":{"text":"ImplicitRunInfo.implicitScope (cyclomatic 16): ImplicitRunInfo.implicitScope 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":"compiler/src/dotty/tools/dotc/typer/Implicits.scala"},"region":{"startLine":823}}}],"partialFingerprints":{"codehealthFindingId/v1":"1693e48cc4ebf64c01bab089c1b4c90f239291d2c845984c2c240b928370a226"}},{"ruleId":"D1","level":"warning","message":{"text":"Implicits.missingArgMsg (cyclomatic 16): Implicits.missingArgMsg has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/Implicits.scala"},"region":{"startLine":973}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ee53800f9c1306d96c6e08e00ecf1cefb91099ce7d29f4125a3cde557a84aa3"}},{"ruleId":"D1","level":"warning","message":{"text":"ImportSuggestions.importSuggestions (cyclomatic 16): ImportSuggestions.importSuggestions has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/ImportSuggestions.scala"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b7ee597903f908983bdda65c3802df17dcbe2d010335ba91a0c215e62f431a9"}},{"ruleId":"D1","level":"warning","message":{"text":"Inferencing.instDecision (cyclomatic 16): Inferencing.instDecision 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":"compiler/src/dotty/tools/dotc/typer/Inferencing.scala"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa85122aab74b5c7f109e1968a210a32076fc680513574f54ad48008db77bb4b"}},{"ruleId":"D1","level":"warning","message":{"text":"AppToMain.rewrite (cyclomatic 16): AppToMain.rewrite has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/Migrations.scala"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"0290b2611dd31f72fb0b64af0749e0835a023969490cfec4f40edf95f09400c5"}},{"ruleId":"D1","level":"warning","message":{"text":"Namer.checkNoConflict (cyclomatic 16): Namer.checkNoConflict has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/Namer.scala"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"55694b25ac88aeb0dcd0a024368b37c95f71013fc4205e3ceae7749d063a0975"}},{"ruleId":"D1","level":"warning","message":{"text":"Typer.typedCBSelect (cyclomatic 16): Typer.typedCBSelect 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":"compiler/src/dotty/tools/dotc/typer/Typer.scala"},"region":{"startLine":1039}}}],"partialFingerprints":{"codehealthFindingId/v1":"3224034aabcceb73415a81088e47202b3b59ed8229992464832f2baa75dea51b"}},{"ruleId":"D1","level":"warning","message":{"text":"Signatures.applyCallInfo (cyclomatic 16): Signatures.applyCallInfo 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":"compiler/src/dotty/tools/dotc/util/Signatures.scala"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea8b6b2f67644056ccb12ad8cc6aeafc61bb167b339894058325ca04d86396a9"}},{"ruleId":"D1","level":"warning","message":{"text":"NumericRange.crossesTheEndAfterN (cyclomatic 16): NumericRange.crossesTheEndAfterN 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":"library-js/src/scala/collection/immutable/NumericRange.scala"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a0b87c3425bc4be58136f2ac55e7e91a99bcaa7bc6564619e1ecc8702c2f790"}},{"ruleId":"D1","level":"warning","message":{"text":"StringContext.replace (cyclomatic 16): StringContext.replace 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":"library/src/scala/StringContext.scala"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fa5a3477ccfe55eb3689477f10063c6a6f0bac35c70be04efab70e0cf9813b4"}},{"ruleId":"D1","level":"warning","message":{"text":"NumericRange.crossesTheEndAfterN (cyclomatic 16): NumericRange.crossesTheEndAfterN 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":"library/src/scala/collection/immutable/NumericRange.scala"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"c28023ca8929eb704fff024689c35f7e947135468de3e2146cb115d1788a153d"}},{"ruleId":"D1","level":"warning","message":{"text":"PropertiesTrait.isJavaAtLeast (cyclomatic 16): PropertiesTrait.isJavaAtLeast has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/util/Properties.scala"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"348b7f14e7dc37de3cf4cc30d18f36a3351dd2282eaeaa4e3085be851c51187d"}},{"ruleId":"D1","level":"warning","message":{"text":"CompletionItemResolver.fullDocstring (cyclomatic 16): CompletionItemResolver.fullDocstring has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"presentation-compiler/src/main/dotty/tools/pc/CompletionItemResolver.scala"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"7db1c9b3e465456965b7b1000d9ba74ef70988cbe775f3bd8f28b9f389f17d6a"}},{"ruleId":"D1","level":"warning","message":{"text":"ReplBytecodeAnalysis.isScalaRunTimeProductToString (cyclomatic 16): ReplBytecodeAnalysis.isScalaRunTimeProductToString has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"repl/src/dotty/tools/repl/ReplBytecodeAnalysis.scala"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d6c257b031415af4a3ce15f2381ae76d7b689736bfd928ca3f895e6c81b417c"}},{"ruleId":"D1","level":"warning","message":{"text":"ClassLikeSupport.parseMethod (cyclomatic 16): ClassLikeSupport.parseMethod 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":"scaladoc/src/dotty/tools/scaladoc/tasty/ClassLikeSupport.scala"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbf7f15d75d42dcf010525ecf47ef1a6cfe191769898a294c0702ee35be4ccee"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeComparer.recur (cognitive 614): TypeComparer.recur has cognitive complexity 614 (threshold 15). Drivers by points: if/else 186 (294 pts), boolean chains 184, match/switch 66 (134 pts), error handling 1 (2 pts) (nesting depth added 177). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/TypeComparer.scala"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"8856595db218cdfe1fc4c404a9174f9396a89ec2fe5ad09ecfda66e6e230a11f"}},{"ruleId":"D2","level":"warning","message":{"text":"Typer.adapt1 (cognitive 357): Typer.adapt1 has cognitive complexity 357 (threshold 15). Drivers by points: if/else 141 (201 pts), match/switch 50 (103 pts), boolean chains 51, error handling 1 (2 pts) (nesting depth added 114). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/Typer.scala"},"region":{"startLine":4580}}}],"partialFingerprints":{"codehealthFindingId/v1":"e409c97aed6bcde39a9ae6235969e7d96e1a47f5fef41ed538a80934aebc68d5"}},{"ruleId":"D2","level":"warning","message":{"text":"RefChecks.checkAllOverrides (cognitive 322): RefChecks.checkAllOverrides has cognitive complexity 322 (threshold 15). Drivers by points: if/else 116 (184 pts), boolean chains 69, loops 16 (41 pts), match/switch 10 (27 pts), error handling 1 (nesting depth added 110). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/RefChecks.scala"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8c7a6f0406ac650b30e6dd0a47653125a8bc3eabf38dbd87ca56f491ed44031"}},{"ruleId":"D2","level":"warning","message":{"text":"CheckUnused.warnings (cognitive 258): CheckUnused.warnings has cognitive complexity 258 (threshold 15). Drivers by points: if/else 89 (192 pts), boolean chains 37, loops 7 (19 pts), match/switch 6 (10 pts) (nesting depth added 119). 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":"compiler/src/dotty/tools/dotc/transform/CheckUnused.scala"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"71ad68af204f4e9fd7705790c2bfc690448bc86c92a41fbc22cd87b1f17607d0"}},{"ruleId":"D2","level":"warning","message":{"text":"Typer.findRef (cognitive 222): Typer.findRef has cognitive complexity 222 (threshold 15). Drivers by points: if/else 81 (159 pts), boolean chains 46, match/switch 8 (17 pts) (nesting depth added 87). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/Typer.scala"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"6502d0ab03d9b4cf1f9464c59be4928e4225206f82ce333da332c225c5e54fef"}},{"ruleId":"D2","level":"warning","message":{"text":"TreePickler.pickleTree (cognitive 215): TreePickler.pickleTree has cognitive complexity 215 (threshold 15). Drivers by points: if/else 67 (154 pts), match/switch 11 (42 pts), loops 3 (11 pts), boolean chains 4, error handling 2 (4 pts) (nesting depth added 128). 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":"compiler/src/dotty/tools/dotc/core/tasty/TreePickler.scala"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a1834a7c2c88ad590574e01f7f5a1e108afcf839a887541afe28111fec37513"}},{"ruleId":"D2","level":"warning","message":{"text":"RefinedPrinter.toTextCore (cognitive 205): RefinedPrinter.toTextCore has cognitive complexity 205 (threshold 15). Drivers by points: if/else 97 (132 pts), match/switch 24 (44 pts), boolean chains 27, error handling 1 (2 pts) (nesting depth added 56). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/printing/RefinedPrinter.scala"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9d6e7390aa10d2606f7d1a7ee59133606cf5b01c8129712268e544837db48dc"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassCompleter.exportForwarders (cognitive 193): ClassCompleter.exportForwarders has cognitive complexity 193 (threshold 15). Drivers by points: if/else 69 (125 pts), match/switch 15 (36 pts), boolean chains 19, loops 5 (13 pts) (nesting depth added 85). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/Namer.scala"},"region":{"startLine":1252}}}],"partialFingerprints":{"codehealthFindingId/v1":"d83ae22b55968c0faf1884273303c0fef13ed72dc9306777e1310f3c387822f4"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceCodePrinter.printTree (cognitive 172): SourceCodePrinter.printTree has cognitive complexity 172 (threshold 15). Drivers by points: if/else 54 (92 pts), match/switch 27 (61 pts), boolean chains 12, loops 3 (7 pts) (nesting depth added 76). 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":"compiler/src/scala/quoted/runtime/impl/printers/SourceCode.scala"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eb6a71cd7b0186d32cff8a3f92c4b20c03efcac6987c3764ef41a35e43e6d86"}},{"ruleId":"D2","level":"warning","message":{"text":"desugar.classDef (cognitive 168): desugar.classDef has cognitive complexity 168 (threshold 15). Drivers by points: if/else 93 (109 pts), match/switch 23 (30 pts), boolean chains 19, loops 5 (10 pts) (nesting depth added 28). 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":"compiler/src/dotty/tools/dotc/ast/Desugar.scala"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9a9ec379d32df9a105ed135a8e368daea6624dd5d566ff1e18a1683558d06d2"}},{"ruleId":"D2","level":"warning","message":{"text":"TypesSupport.inner (cognitive 159): TypesSupport.inner has cognitive complexity 159 (threshold 15). Drivers by points: if/else 56 (93 pts), match/switch 21 (51 pts), boolean chains 13, error handling 1 (2 pts) (nesting depth added 68). 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":"scaladoc/src/dotty/tools/scaladoc/tasty/TypesSupport.scala"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"c81c5f2465f629bfd15336915917ddffed776532adb0bf60118d15092236c6e6"}},{"ruleId":"D2","level":"warning","message":{"text":"MatchReducer.matchCases (cognitive 155): MatchReducer.matchCases has cognitive complexity 155 (threshold 15). Drivers by points: if/else 62 (89 pts), match/switch 25 (59 pts), boolean chains 7 (nesting depth added 61). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/TypeComparer.scala"},"region":{"startLine":3689}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d497ad4245ff27a38ad0f3d4924df468aa862933a19cf48c4394faf1c7912c0"}},{"ruleId":"D2","level":"warning","message":{"text":"ImplicitSearch.searchImplicit (cognitive 142): ImplicitSearch.searchImplicit has cognitive complexity 142 (threshold 15). Drivers by points: if/else 52 (92 pts), match/switch 13 (30 pts), boolean chains 11, loops 4 (7 pts), error handling 1 (2 pts) (nesting depth added 61). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/Implicits.scala"},"region":{"startLine":1337}}}],"partialFingerprints":{"codehealthFindingId/v1":"3140fbd27f83eb776daf0e7f15621a73de144a8cf4282a1402f07149d22a04f4"}},{"ruleId":"D2","level":"warning","message":{"text":"GenericSignatures.javaSig0 (cognitive 139): GenericSignatures.javaSig0 has cognitive complexity 139 (threshold 15). Drivers by points: if/else 61 (96 pts), match/switch 11 (24 pts), boolean chains 14, loops 3 (5 pts) (nesting depth added 50). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/backend/jvm/GenericSignatures.scala"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e81ee858964babf86022c1f6c77bacc48eda6ef003b50c6e4b043c76220f94d"}},{"ruleId":"D2","level":"warning","message":{"text":"Typer.typedDefDef (cognitive 131): Typer.typedDefDef has cognitive complexity 131 (threshold 15). Drivers by points: if/else 30 (83 pts), loops 7 (29 pts), match/switch 4 (14 pts), boolean chains 5 (nesting depth added 85). 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":"compiler/src/dotty/tools/dotc/typer/Typer.scala"},"region":{"startLine":3173}}}],"partialFingerprints":{"codehealthFindingId/v1":"774fddb3bf5a085bc6ff8dcc4bf4df9472878b104d74e3b4a5214f6879a20c91"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassfileParser.sigToType (cognitive 130): ClassfileParser.sigToType has cognitive complexity 130 (threshold 15). Drivers by points: if/else 44 (88 pts), loops 10 (20 pts), match/switch 5 (17 pts), boolean chains 5 (nesting depth added 66). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/classfile/ClassfileParser.scala"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"56272f53942e4742464907b7312cdd2bbddd85fefcbc4c54320ed06dc641975b"}},{"ruleId":"D2","level":"warning","message":{"text":"Extractor.traverse (cognitive 122): Extractor.traverse has cognitive complexity 122 (threshold 15). Drivers by points: if/else 32 (65 pts), match/switch 12 (29 pts), loops 4 (12 pts), boolean chains 10, error handling 1 (6 pts) (nesting depth added 63). 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":"compiler/src/dotty/tools/dotc/semanticdb/ExtractSemanticDB.scala"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"1702d6b9e45fe9556091321e1f74207da544b8ee34abf5621516a1257931630d"}},{"ruleId":"D2","level":"warning","message":{"text":"Setup.setupTraverser (cognitive 120): Setup.setupTraverser has cognitive complexity 120 (threshold 15). Drivers by points: if/else 44 (76 pts), match/switch 11 (19 pts), boolean chains 16, loops 4 (8 pts), error handling 1 (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":"compiler/src/dotty/tools/dotc/cc/Setup.scala"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"1378288c1591561a86cd2820bb6a3dc666c753652766ea6c3e954a6d671d0783"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeReader.readTree (cognitive 119): TreeReader.readTree has cognitive complexity 119 (threshold 15). Drivers by points: if/else 65 (91 pts), match/switch 12 (22 pts), boolean chains 6 (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/tasty/TreeUnpickler.scala"},"region":{"startLine":1326}}}],"partialFingerprints":{"codehealthFindingId/v1":"4459033624dce7f8436f5f9221938ad7aebae351dad7429559951d50fe26cf1c"}},{"ruleId":"D2","level":"warning","message":{"text":"CopyProp.eliminatePushPop (cognitive 118): CopyProp.eliminatePushPop has cognitive complexity 118 (threshold 15). Drivers by points: if/else 39 (82 pts), match/switch 7 (21 pts), loops 4 (8 pts), boolean chains 7 (nesting depth added 61). 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":"compiler/src/dotty/tools/backend/jvm/opt/CopyProp.scala"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"88064c47493280decbff66f156a5fd78f4dba160e41af40edffa40f2b6ecb864"}},{"ruleId":"D2","level":"warning","message":{"text":"Typer.typedClassDef (cognitive 117): Typer.typedClassDef has cognitive complexity 117 (threshold 15). Drivers by points: if/else 50 (70 pts), boolean chains 21, match/switch 9 (19 pts), loops 3 (7 pts) (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":"compiler/src/dotty/tools/dotc/typer/Typer.scala"},"region":{"startLine":3341}}}],"partialFingerprints":{"codehealthFindingId/v1":"91ff3dcf99cf6011956ff2d20468b373fc177197eacae594faa0e2b980ffa9e4"}},{"ruleId":"D2","level":"warning","message":{"text":"PostTyperTransformer.transform (cognitive 116): PostTyperTransformer.transform has cognitive complexity 116 (threshold 15). Drivers by points: if/else 37 (79 pts), match/switch 8 (19 pts), loops 4 (13 pts), boolean chains 5 (nesting depth added 62). 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":"compiler/src/dotty/tools/dotc/transform/PostTyper.scala"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"71bab99bf74ead3e90c0645b14d30b67a38a2d3e6ba6258cd1d739675b0ebb22"}},{"ruleId":"D2","level":"warning","message":{"text":"JavaScanner.fetchToken (cognitive 114): JavaScanner.fetchToken has cognitive complexity 114 (threshold 15). Drivers by points: if/else 44 (102 pts), boolean chains 5, loops 1 (4 pts), match/switch 2 (3 pts) (nesting depth added 62). 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":"compiler/src/dotty/tools/dotc/parsing/JavaScanners.scala"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"2781e45594af0aac9ad03cd810000d649e5fd54218c5b99c5966b6bb15cfa4d4"}},{"ruleId":"D2","level":"warning","message":{"text":"InstructionStackEffect.computeConsProd (cognitive 113): InstructionStackEffect.computeConsProd has cognitive complexity 113 (threshold 15). Drivers by points: if/else 62 (101 pts), boolean chains 8, match/switch 2 (4 pts) (nesting depth added 41). 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":"compiler/src/dotty/tools/backend/jvm/analysis/InstructionStackEffect.scala"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed2bef2b7a76a452a5f8e90b8171e62668e8fd45f0afe2f43a44e1f95b05e5e6"}},{"ruleId":"D2","level":"warning","message":{"text":"LocalOptimizer.nullnessOptimizations (cognitive 113): LocalOptimizer.nullnessOptimizations has cognitive complexity 113 (threshold 15). Drivers by points: if/else 20 (57 pts), boolean chains 28, loops 8 (25 pts), match/switch 2 (3 pts) (nesting depth added 55). 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":"compiler/src/dotty/tools/backend/jvm/opt/LocalOptimizer.scala"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dfd7456ae20d54d56fb81fe43f3757bdb14099ff6fff8dbc2de513591bb3e49"}},{"ruleId":"D2","level":"warning","message":{"text":"PrepJSExports.exportsOf (cognitive 111): PrepJSExports.exportsOf has cognitive complexity 111 (threshold 15). Drivers by points: if/else 41 (80 pts), boolean chains 19, loops 3 (6 pts), match/switch 2 (6 pts) (nesting depth added 46). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/sjs/PrepJSExports.scala"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"353cc780aba89e184896d0f382026de6c4fa8521325e0ab18e50d9f9a2fb220b"}},{"ruleId":"D2","level":"warning","message":{"text":"BoxUnbox.boxUnboxElimination (cognitive 109): BoxUnbox.boxUnboxElimination has cognitive complexity 109 (threshold 15). Drivers by points: if/else 27 (49 pts), match/switch 13 (28 pts), loops 12 (25 pts), boolean chains 7 (nesting depth added 50). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/backend/jvm/opt/BoxUnbox.scala"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad054eb91d6d11a251e935740e4c11810443ead4788f1d1b56468eee5feb7873"}},{"ruleId":"D2","level":"warning","message":{"text":"Typer.typedFunctionValue (cognitive 108): Typer.typedFunctionValue has cognitive complexity 108 (threshold 15). Drivers by points: if/else 46 (71 pts), match/switch 11 (19 pts), boolean chains 11, loops 3 (7 pts) (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/Typer.scala"},"region":{"startLine":1917}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f5b84ce925db8d1b159e11580f8ef8b6acd2ded5db081d2537b758e5e3750a3"}},{"ruleId":"D2","level":"warning","message":{"text":"Namer.index (cognitive 106): Namer.index has cognitive complexity 106 (threshold 15). Drivers by points: if/else 29 (61 pts), match/switch 9 (23 pts), loops 8 (15 pts), boolean chains 7 (nesting depth added 53). 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":"compiler/src/dotty/tools/dotc/typer/Namer.scala"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"650b203f731775aa4bbbde57a618010fb63672008a64a1983edf571910153dd6"}},{"ruleId":"D2","level":"warning","message":{"text":"GlobalOptimizer.runInliner (cognitive 105): GlobalOptimizer.runInliner has cognitive complexity 105 (threshold 15). Drivers by points: if/else 22 (62 pts), match/switch 7 (28 pts), loops 4 (11 pts), boolean chains 4 (nesting depth added 68). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/backend/jvm/opt/Inliner.scala"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"c085c8e3752168f7bbf6d587d6e3dc6ffd1aab6aa4976312e7de7a2d947d46d4"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeEval.tryCompiletimeConstantFold (cognitive 103): TypeEval.tryCompiletimeConstantFold has cognitive complexity 103 (threshold 15). Drivers by points: if/else 33 (43 pts), match/switch 13 (35 pts), loops 6 (19 pts), boolean chains 4, error handling 1 (2 pts) (nesting depth added 46). 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":"compiler/src/dotty/tools/dotc/core/TypeEval.scala"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2d9674e9b338928feeb5a5d96c7cf842829d87786ddd84bf694486e3538c4b7"}},{"ruleId":"D2","level":"warning","message":{"text":"Constructors.transformTemplate (cognitive 103): Constructors.transformTemplate has cognitive complexity 103 (threshold 15). Drivers by points: if/else 42 (72 pts), boolean chains 17, match/switch 9 (12 pts), loops 2 (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/Constructors.scala"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"c248fa7fc6c93447f9f116683c6fe0ec80972fb17f5294eba004604e9213d2cb"}},{"ruleId":"D2","level":"warning","message":{"text":"Checking.checkWellFormed (cognitive 102): Checking.checkWellFormed has cognitive complexity 102 (threshold 15). Drivers by points: if/else 53 (67 pts), boolean chains 33, loops 1 (2 pts) (nesting depth added 15). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/Checking.scala"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"532de312cc8b4c302b8754fd7ab42de68607f3df3bb3d2fcbd7431281b4cc892"}},{"ruleId":"D2","level":"warning","message":{"text":"GlobalOptimizer.inlineCallsite (cognitive 99): GlobalOptimizer.inlineCallsite has cognitive complexity 99 (threshold 15). Drivers by points: if/else 49 (76 pts), match/switch 6 (10 pts), loops 5 (7 pts), boolean chains 6 (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/backend/jvm/opt/Inliner.scala"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"c32792f6dfdedb88ae238430b99ed397b66d71c4455663504abbee0605a96145"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeErasure.apply (cognitive 99): TypeErasure.apply has cognitive complexity 99 (threshold 15). Drivers by points: if/else 41 (68 pts), boolean chains 18, match/switch 5 (13 pts) (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":"compiler/src/dotty/tools/dotc/core/TypeErasure.scala"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f33dca6b87b8b7c7d606c44fdebca10540707cdb3d58ab52efaac00c7811c58"}},{"ruleId":"D2","level":"warning","message":{"text":"CommentExtractor.extract (cognitive 99): CommentExtractor.extract has cognitive complexity 99 (threshold 15). Drivers by points: if/else 32 (67 pts), boolean chains 20, loops 6 (12 pts) (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"directives-parser/src/main/scala/dotty/tools/directives/CommentExtractor.scala"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4873b6181039207fff736636fa55d877446a280666fa15171b04caaa70c60c5"}},{"ruleId":"D2","level":"warning","message":{"text":"Completions.completionOrdering (cognitive 98): Completions.completionOrdering has cognitive complexity 98 (threshold 15). Drivers by points: if/else 39 (87 pts), boolean chains 7, match/switch 4 (nesting depth added 48). 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":"presentation-compiler/src/main/dotty/tools/pc/completions/Completions.scala"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"56bb58d9fc6605414dbd6ef62d185af21521b2d3d42058e4687275aee7dccc0a"}},{"ruleId":"D2","level":"warning","message":{"text":"CopyProp.eliminateStaleStoresAndRewriteSomeIntrinsics (cognitive 97): CopyProp.eliminateStaleStoresAndRewriteSomeIntrinsics has cognitive complexity 97 (threshold 15). Drivers by points: if/else 23 (57 pts), match/switch 5 (18 pts), loops 6 (14 pts), boolean chains 8 (nesting depth added 55). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/backend/jvm/opt/CopyProp.scala"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"a668db50000000311b94fc2c39a8d12e5afce72db35b040fe1102b6227a8fd8b"}},{"ruleId":"D2","level":"warning","message":{"text":"CaseKeywordCompletion.contribute (cognitive 96): CaseKeywordCompletion.contribute has cognitive complexity 96 (threshold 15). Drivers by points: if/else 29 (66 pts), match/switch 9 (24 pts), boolean chains 6 (nesting depth added 52). 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":"presentation-compiler/src/main/dotty/tools/pc/completions/MatchCaseCompletions.scala"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1025d3f26bb778ebd890806394983a750936a4738d25159c9052301a51bcdde"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.termParamClause (cognitive 94): Parser.termParamClause has cognitive complexity 94 (threshold 15). Drivers by points: if/else 41 (71 pts), boolean chains 13, match/switch 4 (7 pts), loops 1 (3 pts) (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/parsing/Parsers.scala"},"region":{"startLine":3951}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8d67229420bc290172da3b2c692838c62c63df9b41d90b1d0ae65f6f6d30b8e"}},{"ruleId":"D2","level":"warning","message":{"text":"InlineReducer.reduceInlineMatch (cognitive 93): InlineReducer.reduceInlineMatch has cognitive complexity 93 (threshold 15). Drivers by points: if/else 32 (47 pts), match/switch 16 (27 pts), boolean chains 13, loops 3 (6 pts) (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/inlines/InlineReducer.scala"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1949e7ce9b5ca16078a3eb897ee7ab40e8f6b190ebfa4764467ec9eb4589b73"}},{"ruleId":"D2","level":"warning","message":{"text":"Translator.patternPlan (cognitive 93): Translator.patternPlan has cognitive complexity 93 (threshold 15). Drivers by points: if/else 44 (63 pts), match/switch 11 (19 pts), boolean chains 11 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/PatternMatcher.scala"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6f98787775cd4f5511429c1ace3338e5374eae7c8198dc551ebd59bfc262891"}},{"ruleId":"D2","level":"warning","message":{"text":"Setting.tryToSet (cognitive 91): Setting.tryToSet has cognitive complexity 91 (threshold 15). Drivers by points: if/else 43 (53 pts), match/switch 14 (27 pts), boolean chains 11 (nesting depth added 23). 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":"compiler/src/dotty/tools/dotc/config/Settings.scala"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"297cbc231fc341efa75de9862c8142f391d988ccdf5281295d81e67c8b2c5428"}},{"ruleId":"D2","level":"warning","message":{"text":"Denotation.meet (cognitive 91): Denotation.meet has cognitive complexity 91 (threshold 15). Drivers by points: if/else 52 (73 pts), boolean chains 14, match/switch 3 (4 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":"compiler/src/dotty/tools/dotc/core/Denotations.scala"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6a2a5c05ec79cdefd66edd0b98c49d648fe829d917363791d5c90a5777df1fa"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassDenotation.baseTypeOf (cognitive 89): ClassDenotation.baseTypeOf has cognitive complexity 89 (threshold 15). Drivers by points: if/else 36 (59 pts), match/switch 10 (20 pts), boolean chains 9, error handling 1 (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/SymDenotations.scala"},"region":{"startLine":2372}}}],"partialFingerprints":{"codehealthFindingId/v1":"9247f9c9c064c2027a4a287e1d68b62a0a6be0bf8428ece0c079698922d0bd55"}},{"ruleId":"D2","level":"warning","message":{"text":"ScalaJSPrepJSInteropTransformer.transformValOrDefDefInJSType (cognitive 87): ScalaJSPrepJSInteropTransformer.transformValOrDefDefInJSType has cognitive complexity 87 (threshold 15). Drivers by points: if/else 32 (56 pts), match/switch 6 (16 pts), boolean chains 15 (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":"compiler/src/dotty/tools/dotc/transform/sjs/PrepJSInterop.scala"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"e52ee146c30a8154c5dde641cb333e4e1272fc0af3e59d79b34f2425be23bf05"}},{"ruleId":"D2","level":"warning","message":{"text":"desugar.apply (cognitive 84): desugar.apply has cognitive complexity 84 (threshold 15). Drivers by points: if/else 38 (52 pts), match/switch 17 (22 pts), boolean chains 10 (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":"compiler/src/dotty/tools/dotc/ast/Desugar.scala"},"region":{"startLine":2125}}}],"partialFingerprints":{"codehealthFindingId/v1":"622ad34ffe97d717901127d2c3fa6e40ca57cfb4ca559e0280133c7cd2ddc8d5"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeOps.orDominator (cognitive 80): TypeOps.orDominator has cognitive complexity 80 (threshold 15). Drivers by points: if/else 37 (41 pts), match/switch 17 (31 pts), boolean chains 8 (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":"compiler/src/dotty/tools/dotc/core/TypeOps.scala"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ccc0351c6875113b6f0643286b0047c2162b44d985344f2ccdec57b08cc6ff9"}},{"ruleId":"D2","level":"warning","message":{"text":"Mixin.transformTemplate (cognitive 80): Mixin.transformTemplate has cognitive complexity 80 (threshold 15). Drivers by points: if/else 37 (59 pts), match/switch 7 (10 pts), boolean chains 8, loops 3 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/Mixin.scala"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed12c1632a68cc815dbfb298fb63a29b283e1363fae1ee0183eed71389210de2"}},{"ruleId":"D2","level":"warning","message":{"text":"ImplicitSearch.searchImplicit (cognitive 80): ImplicitSearch.searchImplicit has cognitive complexity 80 (threshold 15). Drivers by points: if/else 26 (44 pts), match/switch 8 (31 pts), boolean chains 5 (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/Implicits.scala"},"region":{"startLine":1696}}}],"partialFingerprints":{"codehealthFindingId/v1":"9da4162ca18a79f8fcf910766ef2c34842e745c3115ac771ebfde7e1aa07a9d4"}},{"ruleId":"D2","level":"warning","message":{"text":"PlainBodyBuilder.genMatchTo (cognitive 78): PlainBodyBuilder.genMatchTo has cognitive complexity 78 (threshold 15). Drivers by points: if/else 16 (32 pts), match/switch 6 (24 pts), loops 7 (22 pts) (nesting depth added 49). 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":"compiler/src/dotty/tools/backend/jvm/BCodeBodyBuilder.scala"},"region":{"startLine":980}}}],"partialFingerprints":{"codehealthFindingId/v1":"d29f698acd288293a8b6365e2b9c5065aff812bf23fc75a0695e890750d8179d"}},{"ruleId":"D2","level":"warning","message":{"text":"Namer.inferredResultType (cognitive 78): Namer.inferredResultType has cognitive complexity 78 (threshold 15). Drivers by points: if/else 36 (51 pts), match/switch 9 (22 pts), boolean chains 5 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/Namer.scala"},"region":{"startLine":2170}}}],"partialFingerprints":{"codehealthFindingId/v1":"9db397db0add1ba5160887bf81eb3bb3c8e4ed13a012f48f82213f2060a65edd"}},{"ruleId":"D2","level":"warning","message":{"text":"ReplDriver.interpretCommand (cognitive 77): ReplDriver.interpretCommand has cognitive complexity 77 (threshold 15). Drivers by points: if/else 25 (40 pts), error handling 5 (15 pts), match/switch 7 (13 pts), loops 3 (8 pts), boolean chains 1 (nesting depth added 36). 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":"repl/src/dotty/tools/repl/ReplDriver.scala"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"307eac6ff70e54c6f07afd28a812bec240435ce87415db116ad6f465edca1d90"}},{"ruleId":"D2","level":"warning","message":{"text":"Type.findMember (cognitive 76): Type.findMember has cognitive complexity 76 (threshold 15). Drivers by points: if/else 40 (53 pts), match/switch 9 (14 pts), boolean chains 8, error handling 1 (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":"compiler/src/dotty/tools/dotc/core/Types.scala"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ddb14d70615a1355a47a1aaf0b86445e429d363365d43a4503228ff7706de1c"}},{"ruleId":"D2","level":"warning","message":{"text":"desugar.makePatDef (cognitive 75): desugar.makePatDef has cognitive complexity 75 (threshold 15). Drivers by points: if/else 23 (36 pts), match/switch 12 (31 pts), loops 2 (6 pts), boolean chains 2 (nesting depth added 36). 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":"compiler/src/dotty/tools/dotc/ast/Desugar.scala"},"region":{"startLine":1516}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d2e31e197a2b7a7b51536034029542cbb5f3a01d0f65e7293abf4c6f3f82f29"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.givenDef (cognitive 75): Parser.givenDef has cognitive complexity 75 (threshold 15). Drivers by points: if/else 39 (51 pts), boolean chains 21, match/switch 2 (3 pts) (nesting depth added 13). 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":"compiler/src/dotty/tools/dotc/parsing/Parsers.scala"},"region":{"startLine":4719}}}],"partialFingerprints":{"codehealthFindingId/v1":"083d2387b5ffe18ab154b700ea706ee7bbc63006fda6fc29f1dd809b8ccd7d1d"}},{"ruleId":"D2","level":"warning","message":{"text":"SyncAndTryBuilder.genLoadTry (cognitive 73): SyncAndTryBuilder.genLoadTry has cognitive complexity 73 (threshold 15). Drivers by points: if/else 20 (41 pts), match/switch 5 (15 pts), loops 5 (13 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":"compiler/src/dotty/tools/backend/jvm/BCodeSyncAndTry.scala"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"457706a6f118ba352a31ea36913fa7d59e2dc0909d54ac2eb97cf2c34f7fe5b1"}},{"ruleId":"D2","level":"warning","message":{"text":"MethodMax.computeMaxLocalsMaxStack (cognitive 73): MethodMax.computeMaxLocalsMaxStack has cognitive complexity 73 (threshold 15). Drivers by points: if/else 17 (48 pts), loops 4 (14 pts), match/switch 2 (8 pts), boolean chains 3 (nesting depth added 47). 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":"compiler/src/dotty/tools/backend/jvm/opt/MethodMax.scala"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"71c9d6eccce7282a7ae2e6623fa8568c5708241a61b9e9939a13e7f15ab0c15a"}},{"ruleId":"D2","level":"warning","message":{"text":"TreePickler.pickleNewType (cognitive 73): TreePickler.pickleNewType has cognitive complexity 73 (threshold 15). Drivers by points: if/else 33 (62 pts), match/switch 3 (6 pts), boolean chains 5 (nesting depth added 32). 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":"compiler/src/dotty/tools/dotc/core/tasty/TreePickler.scala"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"17a5b20099c5b83a6ba5dbb544c466dcea4786f3a67a9a4f9baafbc613a6c56e"}},{"ruleId":"D2","level":"warning","message":{"text":"LocalOptimizer.eliminateRedundantCastsAndRewriteSomeIntrinsics (cognitive 72): LocalOptimizer.eliminateRedundantCastsAndRewriteSomeIntrinsics has cognitive complexity 72 (threshold 15). Drivers by points: if/else 16 (48 pts), boolean chains 9, match/switch 3 (8 pts), loops 3 (7 pts) (nesting depth added 41). 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":"compiler/src/dotty/tools/backend/jvm/opt/LocalOptimizer.scala"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ce2fb646707393e92ea75cca7085bf1efaf4e8ad7be09135bf50a59b3a47ce8"}},{"ruleId":"D2","level":"warning","message":{"text":"CheckUnused.resolveUsage (cognitive 72): CheckUnused.resolveUsage has cognitive complexity 72 (threshold 15). Drivers by points: if/else 25 (50 pts), boolean chains 20, loops 1, match/switch 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/CheckUnused.scala"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"e811338cbcb36c176946f0497909bc0b57aa37eda4ad89528eb5b928a26f7794"}},{"ruleId":"D2","level":"warning","message":{"text":"Objects.call (cognitive 72): Objects.call has cognitive complexity 72 (threshold 15). Drivers by points: if/else 36 (60 pts), match/switch 3 (9 pts), boolean chains 3 (nesting depth added 30). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/init/Objects.scala"},"region":{"startLine":1057}}}],"partialFingerprints":{"codehealthFindingId/v1":"c10fc9621d0ec7ba5404eff7d5d72b8ad5528c1477fafa410ca3a08d990b104b"}},{"ruleId":"D2","level":"warning","message":{"text":"NumericRange.count (cognitive 71): NumericRange.count has cognitive complexity 71 (threshold 15). Drivers by points: if/else 32 (65 pts), boolean chains 6 (nesting depth added 33). 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":"library-js/src/scala/collection/immutable/NumericRange.scala"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"41e1d70ff55ec163910d5d54e61e765bfd71acc9fb25614f1e29d59018486f73"}},{"ruleId":"D2","level":"warning","message":{"text":"NumericRange.count (cognitive 71): NumericRange.count has cognitive complexity 71 (threshold 15). Drivers by points: if/else 32 (65 pts), boolean chains 6 (nesting depth added 33). 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":"library/src/scala/collection/immutable/NumericRange.scala"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c4e9bf1833f1f27f4ffaa429257b4c8bfe82260f0659e47b13cb252cb6fa724"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeOps.boundsViolations (cognitive 70): TypeOps.boundsViolations has cognitive complexity 70 (threshold 15). Drivers by points: if/else 19 (34 pts), match/switch 11 (28 pts), loops 2 (6 pts), boolean chains 2 (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/TypeOps.scala"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"630238296d3f9511dd85a3b3aa2ba6bd7a719176019a37af25ab001f7489b50b"}},{"ruleId":"D2","level":"warning","message":{"text":"TailRecElimination.transform (cognitive 70): TailRecElimination.transform has cognitive complexity 70 (threshold 15). Drivers by points: if/else 29 (39 pts), match/switch 8 (18 pts), loops 2 (7 pts), boolean chains 6 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/TailRec.scala"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"76416c456c6141776facb58e9d43c48d6108a1f603bf29d00c68f8b0e827b5c5"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer.tokenize (cognitive 70): Lexer.tokenize has cognitive complexity 70 (threshold 15). Drivers by points: if/else 19 (29 pts), match/switch 4 (17 pts), loops 4 (10 pts), boolean chains 8, error handling 1 (6 pts) (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":"directives-parser/src/main/scala/dotty/tools/directives/Lexer.scala"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"91dd376264d9b4ec512eedde0d2a235c0c0b479be12706e591bbe4a8ec4beeb1"}},{"ruleId":"D2","level":"warning","message":{"text":"ImplicitRefs.filterMatching (cognitive 69): ImplicitRefs.filterMatching has cognitive complexity 69 (threshold 15). Drivers by points: if/else 38 (53 pts), match/switch 7 (10 pts), boolean chains 6 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/Implicits.scala"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ef52552959f52cec85d760ecdcc8fc85ac1e2f05e52388116359039e7332ff1"}},{"ruleId":"D2","level":"warning","message":{"text":"Scanner.handleNewLine (cognitive 68): Scanner.handleNewLine has cognitive complexity 68 (threshold 15). Drivers by points: if/else 23 (45 pts), boolean chains 17, match/switch 3 (6 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/parsing/Scanners.scala"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7d1075faf2badda0755b8d20d3f36e5899fb7de719137d6ee8af3f4d90f8886"}},{"ruleId":"D2","level":"warning","message":{"text":"Namer.createSymbol (cognitive 68): Namer.createSymbol has cognitive complexity 68 (threshold 15). Drivers by points: if/else 30 (47 pts), match/switch 6 (12 pts), boolean chains 9 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/Namer.scala"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"2632647feac88205d51f38f8923a06fa14aca03cb3df740cd6a702dea847bb30"}},{"ruleId":"D2","level":"warning","message":{"text":"LocalOptImpls.simplifyJumps (cognitive 67): LocalOptImpls.simplifyJumps has cognitive complexity 67 (threshold 15). Drivers by points: if/else 27 (37 pts), match/switch 11 (16 pts), boolean chains 12, loops 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":"compiler/src/dotty/tools/backend/jvm/opt/LocalOptimizer.scala"},"region":{"startLine":1035}}}],"partialFingerprints":{"codehealthFindingId/v1":"daaedf5df5f0dc4cf5a6c113a4c4d383016097058f1363b4949d986aea2bfc23"}},{"ruleId":"D2","level":"warning","message":{"text":"Typer.typedMatch (cognitive 67): Typer.typedMatch has cognitive complexity 67 (threshold 15). Drivers by points: if/else 18 (32 pts), match/switch 12 (32 pts), boolean chains 3 (nesting depth added 34). 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":"compiler/src/dotty/tools/dotc/typer/Typer.scala"},"region":{"startLine":2229}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcefae823a7a83568381e129fd916b08bf1dd22f70fd629103844a3d93189c4b"}},{"ruleId":"D2","level":"warning","message":{"text":"RefinedPrinter.toText (cognitive 65): RefinedPrinter.toText has cognitive complexity 65 (threshold 15). Drivers by points: if/else 27 (35 pts), match/switch 8 (15 pts), boolean chains 11, error handling 2 (4 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":"compiler/src/dotty/tools/dotc/printing/RefinedPrinter.scala"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"e926e9119bdf7e346b722485dc552fe3d3589ff47fa8fc587a891a718fb719e2"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassCompleter.completeInCreationContext (cognitive 65): ClassCompleter.completeInCreationContext has cognitive complexity 65 (threshold 15). Drivers by points: if/else 32 (44 pts), match/switch 6 (11 pts), boolean chains 9, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/Namer.scala"},"region":{"startLine":1683}}}],"partialFingerprints":{"codehealthFindingId/v1":"db84a6d959dc088ee85f022c15a143e3d5ffe9724aa07d87ffb72342290aa752"}},{"ruleId":"D2","level":"warning","message":{"text":"StringParsers.checkFloatFormat (cognitive 65): StringParsers.checkFloatFormat has cognitive complexity 65 (threshold 15). Drivers by points: boolean chains 34, if/else 24 (31 pts) (nesting depth added 7). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/collection/StringParsers.scala"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"59d5cca048ce98238d42a342e81cc947dd669d39a9d5a784a1387b95184c1a1e"}},{"ruleId":"D2","level":"warning","message":{"text":"InlineSourceMatcher.parse (cognitive 64): InlineSourceMatcher.parse has cognitive complexity 64 (threshold 15). Drivers by points: if/else 18 (49 pts), loops 3 (9 pts), boolean chains 6 (nesting depth added 37). 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":"compiler/src/dotty/tools/backend/jvm/opt/InlinerHeuristics.scala"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"f77acd268ee694bab64457533b2738f02db52bd505699315ce8d43b69a2923a1"}},{"ruleId":"D2","level":"warning","message":{"text":"Scala2Unpickler.readDisambiguatedSymbol (cognitive 64): Scala2Unpickler.readDisambiguatedSymbol has cognitive complexity 64 (threshold 15). Drivers by points: if/else 38 (47 pts), boolean chains 14, match/switch 3 (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":"compiler/src/dotty/tools/dotc/core/unpickleScala2/Scala2Unpickler.scala"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"a645afd44cbef67abe1362efe8a543531b678a4b02c12ddd26d506755a7fdaca"}},{"ruleId":"D2","level":"warning","message":{"text":"PlainPrinter.toText (cognitive 64): PlainPrinter.toText has cognitive complexity 64 (threshold 15). Drivers by points: if/else 28 (44 pts), match/switch 5 (10 pts), boolean chains 8, error handling 1 (2 pts) (nesting depth added 22). 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":"compiler/src/dotty/tools/dotc/printing/PlainPrinter.scala"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8795e12bd4da0ced4fc0b4b7bde1e0c29ab8fe9a7331ccdffbcd4d8a29ff35b"}},{"ruleId":"D2","level":"warning","message":{"text":"Typer.typedIdent (cognitive 64): Typer.typedIdent has cognitive complexity 64 (threshold 15). Drivers by points: if/else 32 (43 pts), match/switch 7 (12 pts), boolean chains 9 (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":"compiler/src/dotty/tools/dotc/typer/Typer.scala"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"2334717c0f98970fedf84dc31ff59925cafcced9c062b2060f45361e537e6e8c"}},{"ruleId":"D2","level":"warning","message":{"text":"Typer.typedSelectWithAdapt (cognitive 64): Typer.typedSelectWithAdapt has cognitive complexity 64 (threshold 15). Drivers by points: if/else 41 (48 pts), match/switch 4 (10 pts), boolean chains 6 (nesting depth added 13). 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":"compiler/src/dotty/tools/dotc/typer/Typer.scala"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c401c2513c59e76d70765969e69fd54f421a48bf2a511d44b9f6ac665eef50d"}},{"ruleId":"D2","level":"warning","message":{"text":"ProdConsAnalyzer.copyOperationProducedValueSlots (cognitive 62): ProdConsAnalyzer.copyOperationProducedValueSlots has cognitive complexity 62 (threshold 15). Drivers by points: if/else 18 (42 pts), match/switch 6 (20 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":"compiler/src/dotty/tools/backend/jvm/analysis/ProdConsAnalyzer.scala"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"38a8f23bf50d61311edf9b16e107cfe41acb3219ed45a34db3e58ded8d20d364"}},{"ruleId":"D2","level":"warning","message":{"text":"JSCodeGen.genStatOrExpr (cognitive 62): JSCodeGen.genStatOrExpr has cognitive complexity 62 (threshold 15). Drivers by points: if/else 29 (43 pts), match/switch 8 (15 pts), boolean chains 4 (nesting depth added 21). 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":"compiler/src/dotty/tools/backend/sjs/JSCodeGen.scala"},"region":{"startLine":1898}}}],"partialFingerprints":{"codehealthFindingId/v1":"facbda4f3faaa382e53f965ab0466ff8347cec610c2ae9fc9792030dc36a103e"}},{"ruleId":"D2","level":"warning","message":{"text":"Implicits.typedImplicit (cognitive 62): Implicits.typedImplicit has cognitive complexity 62 (threshold 15). Drivers by points: if/else 23 (47 pts), match/switch 3 (9 pts), boolean chains 6 (nesting depth added 30). 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":"compiler/src/dotty/tools/dotc/typer/Implicits.scala"},"region":{"startLine":1179}}}],"partialFingerprints":{"codehealthFindingId/v1":"c16e19a1209556cfdedda3ba391299a58231b568f6eac5acd99ecaf07d377241"}},{"ruleId":"D2","level":"warning","message":{"text":"InlinerHeuristics.inlineRequest (cognitive 61): InlinerHeuristics.inlineRequest has cognitive complexity 61 (threshold 15). Drivers by points: if/else 25 (43 pts), match/switch 4 (11 pts), boolean chains 7 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/backend/jvm/opt/InlinerHeuristics.scala"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"41290e50f9babb080444eb0392bbd42425d14987ac80695d3273e0a3f29292cb"}},{"ruleId":"D2","level":"warning","message":{"text":"CaptureChecker.checkOverrides (cognitive 61): CaptureChecker.checkOverrides has cognitive complexity 61 (threshold 15). Drivers by points: match/switch 9 (27 pts), if/else 18 (26 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/cc/CheckCaptures.scala"},"region":{"startLine":2194}}}],"partialFingerprints":{"codehealthFindingId/v1":"18ef7d45253658e084e64d6921d7dec7e3bb8cd8db031e7b814742e2d8de7fac"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.typ (cognitive 61): Parser.typ has cognitive complexity 61 (threshold 15). Drivers by points: if/else 34 (48 pts), boolean chains 6, match/switch 3 (5 pts), loops 1 (2 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/parsing/Parsers.scala"},"region":{"startLine":1860}}}],"partialFingerprints":{"codehealthFindingId/v1":"08bcb92e1b4f649f1dc7390c137fb29b2586147ec68238209b15c3689d469a6d"}},{"ruleId":"D2","level":"warning","message":{"text":"ScalaJSPrepJSInteropTransformer.transformJSClassDef (cognitive 61): ScalaJSPrepJSInteropTransformer.transformJSClassDef has cognitive complexity 61 (threshold 15). Drivers by points: if/else 27 (50 pts), boolean chains 7, loops 2, match/switch 1 (2 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/sjs/PrepJSInterop.scala"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"819d3eeff9a51f2d2294bc04bab33ccacbda77bc4e40c1bb4f3d11bd68f5532e"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeComparer.provablyDisjoint (cognitive 59): TypeComparer.provablyDisjoint has cognitive complexity 59 (threshold 15). Drivers by points: if/else 22 (37 pts), boolean chains 13, match/switch 5 (9 pts) (nesting depth added 19). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/TypeComparer.scala"},"region":{"startLine":3103}}}],"partialFingerprints":{"codehealthFindingId/v1":"9885c583e5fec1927b5d20696604e4ec3a301fda5128508fc667f54109194985"}},{"ruleId":"D2","level":"warning","message":{"text":"TreePickler.pickleFlags (cognitive 59): TreePickler.pickleFlags has cognitive complexity 59 (threshold 15). Drivers by points: if/else 43 (59 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":"compiler/src/dotty/tools/dotc/core/tasty/TreePickler.scala"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"36dd85c96c7a44f5a68388ac6402a36e35dfb17c3763e35f9707a7873e120620"}},{"ruleId":"D2","level":"warning","message":{"text":"Scanner.fetchToken (cognitive 59): Scanner.fetchToken has cognitive complexity 59 (threshold 15). Drivers by points: if/else 32 (46 pts), match/switch 4 (8 pts), boolean chains 5 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/parsing/Scanners.scala"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"88bdfa4baac41901eddf8f1096c85f1ed4ff2859eb13fc05c8876866bb5da10d"}},{"ruleId":"D2","level":"warning","message":{"text":"DidYouMean.inScopeCandidates (cognitive 59): DidYouMean.inScopeCandidates has cognitive complexity 59 (threshold 15). Drivers by points: if/else 14 (28 pts), loops 5 (24 pts), boolean chains 4, match/switch 1 (3 pts) (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/reporting/DidYouMean.scala"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b8422d39c21b46459a6b08ea9ecb2b56536758eee6e8e7b2d22f07e95d72895"}},{"ruleId":"D2","level":"warning","message":{"text":"Mutability.adaptReadOnlyToExpected (cognitive 58): Mutability.adaptReadOnlyToExpected has cognitive complexity 58 (threshold 15). Drivers by points: if/else 16 (30 pts), loops 2 (13 pts), match/switch 6 (13 pts), boolean chains 2 (nesting depth added 32). 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":"compiler/src/dotty/tools/dotc/cc/Mutability.scala"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"30ec22a2fdcfe9f9d7c74c1331612a9728d63ccc1fb58def1474986c4c9ca999"}},{"ruleId":"D2","level":"warning","message":{"text":"InlineCall.expand (cognitive 58): InlineCall.expand has cognitive complexity 58 (threshold 15). Drivers by points: if/else 30 (39 pts), match/switch 7 (15 pts), boolean chains 4 (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":"compiler/src/dotty/tools/dotc/inlines/Inlines.scala"},"region":{"startLine":760}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b39b43b9f2f5c26c7c2e8615e2754f5c816f7a872099ec7d455091c9fa31701"}},{"ruleId":"D2","level":"warning","message":{"text":"GlobalOptimizer.findIllegalAccess (cognitive 57): GlobalOptimizer.findIllegalAccess has cognitive complexity 57 (threshold 15). Drivers by points: if/else 13 (33 pts), loops 7 (13 pts), match/switch 5 (9 pts), boolean chains 2 (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":"compiler/src/dotty/tools/backend/jvm/opt/Inliner.scala"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cb62b8b6ee8cc4d400c0cc69a905a9b6ab5e6f5b9f7dfbc596d77df24ca1628"}},{"ruleId":"D2","level":"warning","message":{"text":"CaptureChecker.adaptBoxed (cognitive 57): CaptureChecker.adaptBoxed has cognitive complexity 57 (threshold 15). Drivers by points: if/else 32 (44 pts), match/switch 5 (7 pts), boolean chains 6 (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":"compiler/src/dotty/tools/dotc/cc/CheckCaptures.scala"},"region":{"startLine":2007}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce7704ea14138b1176c660a369d5fc7ecaf07845599c2fad73ae38c49049fadd"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeComparer.isSubArgs (cognitive 57): TypeComparer.isSubArgs has cognitive complexity 57 (threshold 15). Drivers by points: if/else 16 (22 pts), boolean chains 17, match/switch 5 (14 pts), error handling 1 (4 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/TypeComparer.scala"},"region":{"startLine":1847}}}],"partialFingerprints":{"codehealthFindingId/v1":"346fb23582af2c04163f031137449960930810e153824baddc4f13967f0c7203"}},{"ruleId":"D2","level":"warning","message":{"text":"PlainBodyBuilder.genApply (cognitive 55): PlainBodyBuilder.genApply has cognitive complexity 55 (threshold 15). Drivers by points: if/else 20 (40 pts), boolean chains 8, match/switch 4 (7 pts) (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":"compiler/src/dotty/tools/backend/jvm/BCodeBodyBuilder.scala"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ec71e2e168bf5be650d076a640aa6d8ac718e931b77d4a813391da068d5ccc0"}},{"ruleId":"D2","level":"warning","message":{"text":"LocalOptimizer.methodOptimizations (cognitive 55): LocalOptimizer.methodOptimizations has cognitive complexity 55 (threshold 15). Drivers by points: boolean chains 31, if/else 21 (23 pts), match/switch 1 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/backend/jvm/opt/LocalOptimizer.scala"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb1343ff65ae5a6284a4575fde412ab17107c9755803bd9dd53863daf33b987d"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeApplications.appliedTo (cognitive 55): TypeApplications.appliedTo has cognitive complexity 55 (threshold 15). Drivers by points: if/else 16 (35 pts), match/switch 4 (15 pts), boolean chains 5 (nesting depth added 30). 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":"compiler/src/dotty/tools/dotc/core/TypeApplications.scala"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"068f6d0cf9d23353931c1f1fae5561e21845421c25bdc5724057af09054ab92f"}},{"ruleId":"D2","level":"warning","message":{"text":"ImplicitRunInfo.computeIScope (cognitive 55): ImplicitRunInfo.computeIScope has cognitive complexity 55 (threshold 15). Drivers by points: if/else 19 (32 pts), match/switch 6 (9 pts), boolean chains 7, loops 2 (7 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/Implicits.scala"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e9b17538b18a617683286cdbb7522477516fe4681328efb253bfdaf9ba9f125"}},{"ruleId":"D2","level":"warning","message":{"text":"MetalsInteractive.enclosingSymbolsWithExpressionType (cognitive 55): MetalsInteractive.enclosingSymbolsWithExpressionType has cognitive complexity 55 (threshold 15). Drivers by points: if/else 20 (29 pts), boolean chains 14, match/switch 5 (9 pts), loops 1 (3 pts) (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":"presentation-compiler/src/main/dotty/tools/pc/MetalsInteractive.scala"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"058e136dfcc566046da9236748b6081e5a9ef5395643e4600cb0bafe60a123f9"}},{"ruleId":"D2","level":"warning","message":{"text":"NameTransformer.decode (cognitive 54): NameTransformer.decode has cognitive complexity 54 (threshold 15). Drivers by points: if/else 13 (35 pts), boolean chains 8, loops 2 (6 pts), error handling 1 (5 pts) (nesting depth added 30). 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":"library/src/scala/reflect/NameTransformer.scala"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b248847a4709764797911d94f359df9f67284744404246c3d16be3e4129fa31"}},{"ruleId":"D2","level":"warning","message":{"text":"LocalOptImpls.removeUnreachableCodeImpl (cognitive 53): LocalOptImpls.removeUnreachableCodeImpl has cognitive complexity 53 (threshold 15). Drivers by points: if/else 14 (28 pts), loops 6 (13 pts), match/switch 3 (9 pts), boolean chains 3 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/backend/jvm/opt/LocalOptimizer.scala"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"184cfb7561a77f0350cc9653f61b67fae0434f40922146f8a3e481ffaf1dc3f4"}},{"ruleId":"D2","level":"warning","message":{"text":"Setup.transformExplicitType (cognitive 53): Setup.transformExplicitType has cognitive complexity 53 (threshold 15). Drivers by points: if/else 27 (34 pts), match/switch 8 (12 pts), boolean chains 5, error handling 1 (2 pts) (nesting depth added 12). 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":"compiler/src/dotty/tools/dotc/cc/Setup.scala"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"46dab8110ea97cbe9756e163e3f3c3fbb17592103bf99f6cb15b8653ad9db0dc"}},{"ruleId":"D2","level":"warning","message":{"text":"Typer.typedAppliedTypeTree (cognitive 53): Typer.typedAppliedTypeTree has cognitive complexity 53 (threshold 15). Drivers by points: if/else 24 (38 pts), match/switch 5 (12 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":"compiler/src/dotty/tools/dotc/typer/Typer.scala"},"region":{"startLine":2784}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9d40093c1d9f0e19c11c303f6c480f6dd00b1f5b31f09f044e50b65064087cb"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceCodePrinter.printType (cognitive 53): SourceCodePrinter.printType has cognitive complexity 53 (threshold 15). Drivers by points: if/else 14 (30 pts), match/switch 7 (17 pts), boolean chains 6 (nesting depth added 26). 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":"compiler/src/scala/quoted/runtime/impl/printers/SourceCode.scala"},"region":{"startLine":1099}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7b307289221f2ec664d9928a34c971977e7770e11ab7f83659dac638ed97a1c"}},{"ruleId":"D2","level":"warning","message":{"text":"Stream.addStringNoForce (cognitive 53): Stream.addStringNoForce has cognitive complexity 53 (threshold 15). Drivers by points: if/else 12 (34 pts), loops 4 (17 pts), boolean chains 2 (nesting depth added 35). 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":"library/src/scala/collection/immutable/Stream.scala"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"2130f5197a5e2d00cebcfc46bead1b78a0438819233fbb4cd3d3a86d64972372"}},{"ruleId":"D2","level":"warning","message":{"text":"InferredMethodProvider.inferredMethodEdits (cognitive 53): InferredMethodProvider.inferredMethodEdits has cognitive complexity 53 (threshold 15). Drivers by points: if/else 21 (25 pts), match/switch 11 (21 pts), boolean chains 7 (nesting depth added 14). 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":"presentation-compiler/src/main/dotty/tools/pc/InferredMethodProvider.scala"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"c88bb94e4118f56a033e2047dc4bd873df9cd83a53b3f9c147cc7859cbe531e5"}},{"ruleId":"D2","level":"warning","message":{"text":"SepCheck.checkType (cognitive 52): SepCheck.checkType has cognitive complexity 52 (threshold 15). Drivers by points: if/else 22 (36 pts), match/switch 7 (14 pts), loops 2 (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":"compiler/src/dotty/tools/dotc/cc/SepCheck.scala"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"382aed9b69ac6305f565b8b993ec112d5c5a6322f111652e9ebe5dada1baafa7"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeOps.instantiateToSubType (cognitive 52): TypeOps.instantiateToSubType has cognitive complexity 52 (threshold 15). Drivers by points: if/else 26 (31 pts), match/switch 8 (13 pts), boolean chains 7, loops 1 (nesting depth added 10). 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":"compiler/src/dotty/tools/dotc/core/TypeOps.scala"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"03a2f6359d2898784e509980356028d7e6fc645fac59fa3240ae7780b9b8d828"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.importExpr (cognitive 52): Parser.importExpr has cognitive complexity 52 (threshold 15). Drivers by points: if/else 25 (42 pts), match/switch 4 (6 pts), boolean chains 4 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/parsing/Parsers.scala"},"region":{"startLine":4197}}}],"partialFingerprints":{"codehealthFindingId/v1":"d64dfe4d33d44de342b2f54cb1f3d0749f84f82fa76c6823504c2f2a645eb56f"}},{"ruleId":"D2","level":"warning","message":{"text":"SyntheticMembers.caseAndValueMethods (cognitive 52): SyntheticMembers.caseAndValueMethods has cognitive complexity 52 (threshold 15). Drivers by points: if/else 38 (41 pts), boolean chains 6, match/switch 3 (4 pts), loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/SyntheticMembers.scala"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"2766fe0bd205fbd27777a9341cece422d51d351397f948273fe222814b98e544"}},{"ruleId":"D2","level":"warning","message":{"text":"ProtoTypes.wildApprox (cognitive 52): ProtoTypes.wildApprox has cognitive complexity 52 (threshold 15). Drivers by points: if/else 26 (37 pts), match/switch 4 (8 pts), boolean chains 7 (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":"compiler/src/dotty/tools/dotc/typer/ProtoTypes.scala"},"region":{"startLine":952}}}],"partialFingerprints":{"codehealthFindingId/v1":"230dfe1a74bc6eebe2e4fbce029bb4f1ec65cd8d49fafe6e783b3f2e2b4b8067"}},{"ruleId":"D2","level":"warning","message":{"text":"NameTransformer.decode (cognitive 52): NameTransformer.decode has cognitive complexity 52 (threshold 15). Drivers by points: if/else 11 (33 pts), boolean chains 8, loops 2 (6 pts), error handling 1 (5 pts) (nesting depth added 30). 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":"compiler/src/dotty/tools/dotc/util/NameTransformer.scala"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3cff3be56c279b30b0c8354f3137551facefa0de72a49bb063ae0394eb6b354"}},{"ruleId":"D2","level":"warning","message":{"text":"PlainSkelBuilder.genDefDef (cognitive 51): PlainSkelBuilder.genDefDef has cognitive complexity 51 (threshold 15). Drivers by points: if/else 23 (32 pts), boolean chains 8, match/switch 3 (7 pts), loops 2 (4 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/backend/jvm/BCodeSkelBuilder.scala"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"292f0c4b946da6ebaa9cf386cee81ca5cbab4faf3dc891137228ab258521d7fb"}},{"ruleId":"D2","level":"warning","message":{"text":"CopyProp.classTagNewArrayInstr (cognitive 51): CopyProp.classTagNewArrayInstr has cognitive complexity 51 (threshold 15). Drivers by points: match/switch 4 (24 pts), if/else 9 (23 pts), boolean chains 4 (nesting depth added 34). 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":"compiler/src/dotty/tools/backend/jvm/opt/CopyProp.scala"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"68ad8ab8f8de20047daf878d5e0ae774631089310a3f1ffb42824213c91a2c83"}},{"ruleId":"D2","level":"warning","message":{"text":"Objects.patternMatch (cognitive 51): Objects.patternMatch has cognitive complexity 51 (threshold 15). Drivers by points: if/else 21 (36 pts), match/switch 4 (7 pts), loops 3 (6 pts), boolean chains 2 (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":"compiler/src/dotty/tools/dotc/transform/init/Objects.scala"},"region":{"startLine":1827}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dddfda136053e08bd5e9eb19d3a591e273445a2df373b0eaa34209d1911d908"}},{"ruleId":"D2","level":"warning","message":{"text":"Preparser.preparse (cognitive 51): Preparser.preparse has cognitive complexity 51 (threshold 15). Drivers by points: match/switch 9 (24 pts), if/else 15 (20 pts), boolean chains 5, loops 1 (2 pts) (nesting depth added 21). 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":"scaladoc/src/dotty/tools/scaladoc/tasty/comments/Preparser.scala"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"122398847eec32e7686e08f944e861fac34ee2f571080963cf0d0e65d18b36ae"}},{"ruleId":"D2","level":"warning","message":{"text":"JavaScanner.getTextBlock (cognitive 50): JavaScanner.getTextBlock has cognitive complexity 50 (threshold 15). Drivers by points: if/else 14 (29 pts), boolean chains 11, loops 5 (7 pts), match/switch 1 (3 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":"compiler/src/dotty/tools/dotc/parsing/JavaScanners.scala"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"aed985443041e07129095b4d1a822cc52a4a6b109452755241f6ec9288bb3bbd"}},{"ruleId":"D2","level":"warning","message":{"text":"Inferencing.instantiateTypeVars (cognitive 50): Inferencing.instantiateTypeVars has cognitive complexity 50 (threshold 15). Drivers by points: if/else 22 (39 pts), boolean chains 8, match/switch 2, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/Inferencing.scala"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b8211a1b60793d00393a0e383a6559d7b1b937e637f13e0bf54576b5200fc3f"}},{"ruleId":"D2","level":"warning","message":{"text":"InferredTypeProvider.inferredTypeEdits (cognitive 50): InferredTypeProvider.inferredTypeEdits has cognitive complexity 50 (threshold 15). Drivers by points: if/else 24 (31 pts), match/switch 8 (13 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 13). 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":"presentation-compiler/src/main/dotty/tools/pc/InferredTypeProvider.scala"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"25efd45d2475abeb600256d2de6b4cd75240a45601f0aa30a7aa3049ff273e34"}},{"ruleId":"D2","level":"warning","message":{"text":"Run.compileUnits (cognitive 49): Run.compileUnits has cognitive complexity 49 (threshold 15). Drivers by points: if/else 19 (30 pts), loops 4 (9 pts), boolean chains 6, error handling 1 (3 pts), match/switch 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/Run.scala"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbdc24b4af69f9d5d8b5520afea4e25164ba459c81cf62b9ed529201b500b624"}},{"ruleId":"D2","level":"warning","message":{"text":"PatternTypeConstrainer.constrainPatternType (cognitive 49): PatternTypeConstrainer.constrainPatternType has cognitive complexity 49 (threshold 15). Drivers by points: if/else 17 (21 pts), boolean chains 14, match/switch 9 (14 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":"compiler/src/dotty/tools/dotc/core/PatternTypeConstrainer.scala"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3638fe753bdfc911326b6d39aeb26b9f3ee668068692a16204a3cf6ef80f28d"}},{"ruleId":"D2","level":"warning","message":{"text":"Inliner.dropUnusedDefs (cognitive 49): Inliner.dropUnusedDefs has cognitive complexity 49 (threshold 15). Drivers by points: match/switch 9 (21 pts), if/else 14 (17 pts), loops 3 (6 pts), boolean chains 5 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/inlines/Inliner.scala"},"region":{"startLine":1306}}}],"partialFingerprints":{"codehealthFindingId/v1":"349007c083f096e87f7034ec45ccc6d7efbe38590d7a484e6d7eb22a95ac4154"}},{"ruleId":"D2","level":"warning","message":{"text":"Intrinsics.compileForErrors (cognitive 49): Intrinsics.compileForErrors has cognitive complexity 49 (threshold 15). Drivers by points: if/else 13 (26 pts), match/switch 5 (14 pts), loops 1 (7 pts), boolean chains 2 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/inlines/Inlines.scala"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6c00572f595c8a179f5cdd256519a3d1ddb1cceeeef38f684d41221660b3c02"}},{"ruleId":"D2","level":"warning","message":{"text":"Memoize.transformDefDef (cognitive 49): Memoize.transformDefDef has cognitive complexity 49 (threshold 15). Drivers by points: if/else 27 (47 pts), boolean chains 2 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/Memoize.scala"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ace6d00e5c5079c54400111809b09de1facf010ce9a170b40d6a92ba542c443"}},{"ruleId":"D2","level":"warning","message":{"text":"StringInterpolatorOpt.transformApply (cognitive 49): StringInterpolatorOpt.transformApply has cognitive complexity 49 (threshold 15). Drivers by points: if/else 22 (29 pts), match/switch 9 (14 pts), boolean chains 5, loops 1 (nesting depth added 12). 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":"compiler/src/dotty/tools/dotc/transform/localopt/StringInterpolatorOpt.scala"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a12e8da4b15822e68562a3ff35e5c8c3366d658083ebb67584058e9b74ab265"}},{"ruleId":"D2","level":"warning","message":{"text":"Checking.checkIrrefutable (cognitive 49): Checking.checkIrrefutable has cognitive complexity 49 (threshold 15). Drivers by points: if/else 22 (28 pts), match/switch 7 (12 pts), boolean chains 9 (nesting depth added 11). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/Checking.scala"},"region":{"startLine":1054}}}],"partialFingerprints":{"codehealthFindingId/v1":"6606493fba3f28c5e0c642cdc8643db8d2cc799d8774621b4fbd3f801f4697d2"}},{"ruleId":"D2","level":"warning","message":{"text":"AppToMain.wrapIntoMain (cognitive 49): AppToMain.wrapIntoMain has cognitive complexity 49 (threshold 15). Drivers by points: if/else 17 (24 pts), loops 8 (13 pts), boolean chains 11, match/switch 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":"compiler/src/dotty/tools/dotc/typer/Migrations.scala"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cf9d79b02c32febecc16588d6deb3e13be184b8cb31064009f4a8e5f051c00a"}},{"ruleId":"D2","level":"warning","message":{"text":"MirrorSource.reduce (cognitive 49): MirrorSource.reduce has cognitive complexity 49 (threshold 15). Drivers by points: if/else 18 (29 pts), loops 3 (9 pts), match/switch 4 (8 pts), boolean chains 3 (nesting depth added 21). 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":"compiler/src/dotty/tools/dotc/typer/Synthesizer.scala"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb222d858cc0cf40ecf8ef3a1dd867ce78b718b9d7dbbf6d22b7e27369ed0819"}},{"ruleId":"D2","level":"warning","message":{"text":"Typer.typedAssign (cognitive 49): Typer.typedAssign has cognitive complexity 49 (threshold 15). Drivers by points: match/switch 9 (26 pts), if/else 14 (20 pts), boolean chains 3 (nesting depth added 23). 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":"compiler/src/dotty/tools/dotc/typer/Typer.scala"},"region":{"startLine":1488}}}],"partialFingerprints":{"codehealthFindingId/v1":"25fdcd72168b89781d93d41d5b4c60c391f18b3e7871279f810daac0b979e603"}},{"ruleId":"D2","level":"warning","message":{"text":"ApplyArgsExtractor.getArgsAndParams (cognitive 49): ApplyArgsExtractor.getArgsAndParams has cognitive complexity 49 (threshold 15). Drivers by points: if/else 22 (27 pts), match/switch 10 (15 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"presentation-compiler/src/main/dotty/tools/pc/ApplyArgsExtractor.scala"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"1096065a203cc74741edd8060fc60bdffbdebd83e26d2e96cabb15bcd39b158e"}},{"ruleId":"D2","level":"warning","message":{"text":"AliasingFrame.execute (cognitive 48): AliasingFrame.execute has cognitive complexity 48 (threshold 15). Drivers by points: if/else 22 (42 pts), match/switch 2 (3 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 22). 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":"compiler/src/dotty/tools/backend/jvm/analysis/AliasingAnalyzer.scala"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f11fe8a06bec237783360339ff994035dca85f85e66f5a8b54beb22dd8c1f56"}},{"ruleId":"D2","level":"warning","message":{"text":"CommentExpander.expandVariables (cognitive 48): CommentExpander.expandVariables has cognitive complexity 48 (threshold 15). Drivers by points: if/else 14 (23 pts), loops 3 (11 pts), match/switch 3 (11 pts), boolean chains 3 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/Comments.scala"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8ca3917a774c0dbb6a0e3e5a0ed470de0d84937aef2765b7d5b258829f93231"}},{"ruleId":"D2","level":"warning","message":{"text":"Hoister.hoistSuperArg (cognitive 48): Hoister.hoistSuperArg has cognitive complexity 48 (threshold 15). Drivers by points: if/else 21 (27 pts), match/switch 10 (15 pts), boolean chains 6 (nesting depth added 11). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/HoistSuperArgs.scala"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7f122e16f63189b4eee95c5b323700693e5b3cd9354c37000c11380872a7e84"}},{"ruleId":"D2","level":"warning","message":{"text":"Typer.typedNumber (cognitive 48): Typer.typedNumber has cognitive complexity 48 (threshold 15). Drivers by points: if/else 17 (23 pts), match/switch 9 (18 pts), error handling 2 (4 pts), boolean chains 3 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/Typer.scala"},"region":{"startLine":1208}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8c531ea2fc9c3e1db960c844e54f468850ca60e8cf75c38e08f6abed65a4bc5"}},{"ruleId":"D2","level":"warning","message":{"text":"PlainBodyBuilder.genLoadTo (cognitive 47): PlainBodyBuilder.genLoadTo has cognitive complexity 47 (threshold 15). Drivers by points: if/else 23 (38 pts), match/switch 3 (6 pts), boolean chains 3 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/backend/jvm/BCodeBodyBuilder.scala"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"746013cdfefe786be0676f4775c9f0031a01815f9834ba345ea75df962ad28b1"}},{"ruleId":"D2","level":"warning","message":{"text":"ProdConsAnalyzer.copyOperationSourceValue (cognitive 47): ProdConsAnalyzer.copyOperationSourceValue has cognitive complexity 47 (threshold 15). Drivers by points: if/else 17 (33 pts), match/switch 6 (14 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/backend/jvm/analysis/ProdConsAnalyzer.scala"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"84ade0139d8cb138ebda831c6014ae9fa44b93392c8b2b355fc68397772c82e9"}},{"ruleId":"D2","level":"warning","message":{"text":"CaptureChecker.recheckClosureBlock (cognitive 47): CaptureChecker.recheckClosureBlock has cognitive complexity 47 (threshold 15). Drivers by points: if/else 14 (27 pts), match/switch 6 (13 pts), boolean chains 4, loops 1 (3 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/cc/CheckCaptures.scala"},"region":{"startLine":1147}}}],"partialFingerprints":{"codehealthFindingId/v1":"adee6de28a5d71bff1b3bbbac1c1fe5dbc206562e4a93980f726644e1edc3004"}},{"ruleId":"D2","level":"warning","message":{"text":"SepCheck.traverse (cognitive 47): SepCheck.traverse has cognitive complexity 47 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 5 (19 pts), match/switch 3 (8 pts), boolean chains 1 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/cc/SepCheck.scala"},"region":{"startLine":1074}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfe0e24b137b29eca2560544069f9c241496f04cc0151e9165186c73eb24782f"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeErasure.erasedLub (cognitive 47): TypeErasure.erasedLub has cognitive complexity 47 (threshold 15). Drivers by points: if/else 13 (24 pts), match/switch 5 (16 pts), boolean chains 7 (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":"compiler/src/dotty/tools/dotc/core/TypeErasure.scala"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"da7d374923f0480feb0d9bfe8bed28f4d3f2103650174c2842d21b822594711c"}},{"ruleId":"D2","level":"warning","message":{"text":"InlineTyper.typedMatchFinish (cognitive 47): InlineTyper.typedMatchFinish has cognitive complexity 47 (threshold 15). Drivers by points: match/switch 8 (24 pts), if/else 15 (22 pts), boolean chains 1 (nesting depth added 23). 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":"compiler/src/dotty/tools/dotc/inlines/Inliner.scala"},"region":{"startLine":1160}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6c054d8dd53ce49b780e2eed5970c5e745f07c3675e6424e1c2f103411227f1"}},{"ruleId":"D2","level":"warning","message":{"text":"CrossStageSafety.transform (cognitive 47): CrossStageSafety.transform has cognitive complexity 47 (threshold 15). Drivers by points: if/else 18 (32 pts), match/switch 4 (12 pts), boolean chains 3 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/staging/CrossStageSafety.scala"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3d5b8eca9979ff2a63d593cefe7ba430e80c536e968fb320f454df3805c85a7"}},{"ruleId":"D2","level":"warning","message":{"text":"Typer.typedSelect (cognitive 47): Typer.typedSelect has cognitive complexity 47 (threshold 15). Drivers by points: if/else 26 (33 pts), boolean chains 11, match/switch 2 (3 pts) (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/Erasure.scala"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"efce0983f60dc45acd8667573f87f6e1d468bbc0e332838091e7adb960192ac5"}},{"ruleId":"D2","level":"warning","message":{"text":"BCodeRepository.methodNode (cognitive 46): BCodeRepository.methodNode has cognitive complexity 46 (threshold 15). Drivers by points: if/else 18 (26 pts), match/switch 7 (10 pts), boolean chains 8, loops 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/backend/jvm/opt/BCodeRepository.scala"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"60f9f5ebf6ec88a2ebcfa292536406c54b9fd1bd687560bf663b3c1430b20ecf"}},{"ruleId":"D2","level":"warning","message":{"text":"CopyProp.eliminateStoreLoad (cognitive 46): CopyProp.eliminateStoreLoad has cognitive complexity 46 (threshold 15). Drivers by points: if/else 16 (27 pts), match/switch 5 (11 pts), loops 4 (5 pts), boolean chains 3 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/backend/jvm/opt/CopyProp.scala"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"509971b2d7c232c00456509b3ff6ea889c5f3374130ac5a5c399530a64efe468"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.expr1 (cognitive 46): Parser.expr1 has cognitive complexity 46 (threshold 15). Drivers by points: if/else 20 (32 pts), match/switch 5 (13 pts), boolean chains 1 (nesting depth added 20). 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":"compiler/src/dotty/tools/dotc/parsing/Parsers.scala"},"region":{"startLine":2663}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b20c03e66bb0f92789595d49d9f13b906f2243bc35a7a62a07761343e904305"}},{"ruleId":"D2","level":"warning","message":{"text":"ScalaJSPrepJSInteropTransformer.checkJSNativeLoadSpecOf (cognitive 46): ScalaJSPrepJSInteropTransformer.checkJSNativeLoadSpecOf has cognitive complexity 46 (threshold 15). Drivers by points: if/else 16 (34 pts), match/switch 2 (6 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/sjs/PrepJSInterop.scala"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"4092877b5473cebde55e1c649f94e835ff109826a79ba3196305ed453babe545"}},{"ruleId":"D2","level":"warning","message":{"text":"Synthesizer.sumMirror (cognitive 46): Synthesizer.sumMirror has cognitive complexity 46 (threshold 15). Drivers by points: if/else 20 (31 pts), match/switch 5 (14 pts), boolean chains 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":"compiler/src/dotty/tools/dotc/typer/Synthesizer.scala"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"b02c773b59601a7e4359b4a977cefde0f68dcd6369be2f0232f6d54e8a4f9ab1"}},{"ruleId":"D2","level":"warning","message":{"text":"Typer.typedSelect (cognitive 46): Typer.typedSelect has cognitive complexity 46 (threshold 15). Drivers by points: if/else 21 (32 pts), match/switch 6 (11 pts), boolean chains 3 (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":"compiler/src/dotty/tools/dotc/typer/Typer.scala"},"region":{"startLine":1102}}}],"partialFingerprints":{"codehealthFindingId/v1":"11201e8278cad999cfa9ca1d2a9e102f3679fcf8f0d8758b04f668aae78ff608"}},{"ruleId":"D2","level":"warning","message":{"text":"JSCodeGen.genScalaClass (cognitive 45): JSCodeGen.genScalaClass has cognitive complexity 45 (threshold 15). Drivers by points: if/else 24 (37 pts), boolean chains 5, match/switch 1 (2 pts), loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/backend/sjs/JSCodeGen.scala"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"86e5c4a81882e30702bbdb64a006b4ffe7d5ea56efff9c9c6e80da2d68d29a84"}},{"ruleId":"D2","level":"warning","message":{"text":"Denotations.infoMeet (cognitive 45): Denotations.infoMeet has cognitive complexity 45 (threshold 15). Drivers by points: if/else 15 (24 pts), match/switch 7 (20 pts), boolean chains 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/Denotations.scala"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"0712d32a3c85ed253874381f4d762888fc081c2e6325ffbfe86d5966dbbe19b2"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.literal (cognitive 45): Parser.literal has cognitive complexity 45 (threshold 15). Drivers by points: if/else 20 (33 pts), match/switch 4 (9 pts), boolean chains 2, error handling 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/parsing/Parsers.scala"},"region":{"startLine":1403}}}],"partialFingerprints":{"codehealthFindingId/v1":"88f62eb4df61281d9251c8af6dc672ac693888224829c585ea7cb36d887f8723"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.forExpr (cognitive 45): Parser.forExpr has cognitive complexity 45 (threshold 15). Drivers by points: if/else 20 (37 pts), boolean chains 8 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/parsing/Parsers.scala"},"region":{"startLine":3337}}}],"partialFingerprints":{"codehealthFindingId/v1":"d47b5726a830f568e904857ef07f1c6abf5f91875ea41e4d166f3f0b617b6362"}},{"ruleId":"D2","level":"warning","message":{"text":"Erasure.transform (cognitive 45): Erasure.transform has cognitive complexity 45 (threshold 15). Drivers by points: if/else 16 (31 pts), boolean chains 7, loops 1 (3 pts), match/switch 2 (3 pts), error handling 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/Erasure.scala"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3f8e94b25a17a6dcf23bfb389d883116444334a0d35a0a895b216e2a35da28c"}},{"ruleId":"D2","level":"warning","message":{"text":"Pickler.run (cognitive 45): Pickler.run has cognitive complexity 45 (threshold 15). Drivers by points: if/else 12 (37 pts), error handling 1 (3 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 28). 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":"compiler/src/dotty/tools/dotc/transform/Pickler.scala"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"665ebab630ebe0259232db762f92bf056b8249d6d047ee45966dc7f539c46c7b"}},{"ruleId":"D2","level":"warning","message":{"text":"ImportSuggestions.suggestionRoots (cognitive 45): ImportSuggestions.suggestionRoots has cognitive complexity 45 (threshold 15). Drivers by points: if/else 25 (36 pts), boolean chains 5, match/switch 2 (4 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/ImportSuggestions.scala"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"f66b07d0f9e957716dd3a4c7af938c9811f4d0789a604ddd457be5b37e3843ad"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeReader.readType (cognitive 44): TreeReader.readType has cognitive complexity 44 (threshold 15). Drivers by points: if/else 21 (28 pts), match/switch 9 (15 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/tasty/TreeUnpickler.scala"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"d489cd927e8c76757d1df5e3970c05ac844e3e5023d1856562e8b3f17f794b09"}},{"ruleId":"D2","level":"warning","message":{"text":"Objects.cases (cognitive 44): Objects.cases has cognitive complexity 44 (threshold 15). Drivers by points: if/else 17 (28 pts), match/switch 7 (16 pts) (nesting depth added 20). 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":"compiler/src/dotty/tools/dotc/transform/init/Objects.scala"},"region":{"startLine":1607}}}],"partialFingerprints":{"codehealthFindingId/v1":"61be9f994e6d53f8b4990fc5646ff91c64bc20274c891be1d3195662638d6c78"}},{"ruleId":"D2","level":"warning","message":{"text":"Nullables.postProcessByNameArgs (cognitive 44): Nullables.postProcessByNameArgs has cognitive complexity 44 (threshold 15). Drivers by points: if/else 15 (29 pts), match/switch 5 (12 pts), boolean chains 3 (nesting depth added 21). 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":"compiler/src/dotty/tools/dotc/typer/Nullables.scala"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"edccbd254d8d82e36e3b2ea8295d21ecfaa68ff657508ecd6f7afaf35eef62b0"}},{"ruleId":"D2","level":"warning","message":{"text":"NavigateAST.pathTo (cognitive 43): NavigateAST.pathTo has cognitive complexity 43 (threshold 15). Drivers by points: boolean chains 21, if/else 11 (12 pts), match/switch 5 (9 pts), loops 1 (nesting depth added 5). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/ast/NavigateAST.scala"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"69513088f958fcd4693b413ce015bf9185c7e2b88af6080d879357f498216da3"}},{"ruleId":"D2","level":"warning","message":{"text":"Inlines.inlineCall (cognitive 43): Inlines.inlineCall has cognitive complexity 43 (threshold 15). Drivers by points: if/else 22 (29 pts), match/switch 4 (6 pts), boolean chains 3, loops 1 (3 pts), error handling 1 (2 pts) (nesting depth added 12). 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":"compiler/src/dotty/tools/dotc/inlines/Inlines.scala"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb8f5a59764f08da8385ff5fbfb5720f65a62ece45670a3e536763458e0d6a03"}},{"ruleId":"D2","level":"warning","message":{"text":"SyntaxHighlighting.highlight (cognitive 43): SyntaxHighlighting.highlight has cognitive complexity 43 (threshold 15). Drivers by points: if/else 13 (25 pts), loops 4 (8 pts), boolean chains 5, match/switch 2 (5 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":"compiler/src/dotty/tools/dotc/printing/SyntaxHighlighting.scala"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"612cfd2fc62d6a17db0b8fefb3109e1ab1c922dd74ae753aab2f8327b5f3047b"}},{"ruleId":"D2","level":"warning","message":{"text":"SuperAccessors.transformSuperSelect (cognitive 43): SuperAccessors.transformSuperSelect has cognitive complexity 43 (threshold 15). Drivers by points: if/else 16 (30 pts), boolean chains 9, loops 1 (4 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/SuperAccessors.scala"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0df7f9de5c49e7d363db8c221c440475b4d4298118c31f0f99752b732a06a6c"}},{"ruleId":"D2","level":"warning","message":{"text":"Typer.tryExtensionOrConversion (cognitive 43): Typer.tryExtensionOrConversion has cognitive complexity 43 (threshold 15). Drivers by points: if/else 15 (27 pts), match/switch 3 (6 pts), loops 2 (4 pts), boolean chains 3, error handling 2 (3 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/Typer.scala"},"region":{"startLine":4447}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e18e333309065b080095d1cd53be8605fc02454d0f69d16020e72a1eb43cd26"}},{"ruleId":"D2","level":"warning","message":{"text":"CaptureChecker.checkEscapingUses (cognitive 42): CaptureChecker.checkEscapingUses has cognitive complexity 42 (threshold 15). Drivers by points: match/switch 6 (21 pts), if/else 11 (16 pts), boolean chains 4, loops 1 (nesting depth added 20). 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":"compiler/src/dotty/tools/dotc/cc/CheckCaptures.scala"},"region":{"startLine":2413}}}],"partialFingerprints":{"codehealthFindingId/v1":"c41a7274718ee703fc2c9d8cb9d0c5e3ba32fe420255c51ea9ade3f39b8c8671"}},{"ruleId":"D2","level":"warning","message":{"text":"OrderingConstraint.replace (cognitive 42): OrderingConstraint.replace has cognitive complexity 42 (threshold 15). Drivers by points: if/else 16 (27 pts), match/switch 4 (9 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/OrderingConstraint.scala"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"bca84b5db9080367fadfe48e1e8aa445f1cd6ee40e0c103904f121d9de361221"}},{"ruleId":"D2","level":"warning","message":{"text":"TermLambda.depStatus (cognitive 42): TermLambda.depStatus has cognitive complexity 42 (threshold 15). Drivers by points: if/else 18 (28 pts), match/switch 4 (12 pts), boolean chains 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/Types.scala"},"region":{"startLine":4050}}}],"partialFingerprints":{"codehealthFindingId/v1":"472384782d0f9114e9b0394ac8535b02d7e69fdec3d07807a4de2c74ad98c089"}},{"ruleId":"D2","level":"warning","message":{"text":"ApproximatingTypeMap.derivedAppliedType (cognitive 42): ApproximatingTypeMap.derivedAppliedType has cognitive complexity 42 (threshold 15). Drivers by points: if/else 16 (30 pts), match/switch 4 (10 pts), boolean chains 2 (nesting depth added 20). 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":"compiler/src/dotty/tools/dotc/core/Types.scala"},"region":{"startLine":6654}}}],"partialFingerprints":{"codehealthFindingId/v1":"b90b8a9807146470dd6a81114d3a8c1448b479b923f9000f74e2a5bd6ac2749d"}},{"ruleId":"D2","level":"warning","message":{"text":"TailRec.transformDefDef (cognitive 42): TailRec.transformDefDef has cognitive complexity 42 (threshold 15). Drivers by points: match/switch 6 (20 pts), if/else 12 (15 pts), boolean chains 7 (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":"compiler/src/dotty/tools/dotc/transform/TailRec.scala"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7cbfcf167175422cb207fc64ae6c766cbf3dabfc9a69308fd9012264a12bd15"}},{"ruleId":"D2","level":"warning","message":{"text":"Objects.select (cognitive 42): Objects.select has cognitive complexity 42 (threshold 15). Drivers by points: if/else 22 (37 pts), boolean chains 4, match/switch 1 (nesting depth added 15). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/init/Objects.scala"},"region":{"startLine":1265}}}],"partialFingerprints":{"codehealthFindingId/v1":"d266e82b0651c9b620875342cf9ebb954a4b171a9cd5aa7cb8d112b11be92551"}},{"ruleId":"D2","level":"warning","message":{"text":"Dynamic.handleStructural (cognitive 42): Dynamic.handleStructural has cognitive complexity 42 (threshold 15). Drivers by points: if/else 22 (28 pts), match/switch 5 (9 pts), boolean chains 5 (nesting depth added 10). 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":"compiler/src/dotty/tools/dotc/typer/Dynamic.scala"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"852095f851cd809c9c414ee84fac3a7ba0824f4868b4714b797a096c22b1a6c1"}},{"ruleId":"D2","level":"warning","message":{"text":"JSCodeGen.genCompilationUnit (cognitive 41): JSCodeGen.genCompilationUnit has cognitive complexity 41 (threshold 15). Drivers by points: if/else 13 (26 pts), loops 6 (7 pts), boolean chains 5, match/switch 2 (3 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":"compiler/src/dotty/tools/backend/sjs/JSCodeGen.scala"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e09468663736f9da895068d27a445121fc05f16e5bdf33eb7a35f242d617c14"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeReader.readNewDef (cognitive 41): TreeReader.readNewDef has cognitive complexity 41 (threshold 15). Drivers by points: if/else 20 (31 pts), boolean chains 5, match/switch 3 (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":"compiler/src/dotty/tools/dotc/core/tasty/TreeUnpickler.scala"},"region":{"startLine":909}}}],"partialFingerprints":{"codehealthFindingId/v1":"929af351596461b740fd858b9649f8b48d4ac734217b499996fe66ddb31cfdba"}},{"ruleId":"D2","level":"warning","message":{"text":"Scala2Unpickler.readType (cognitive 41): Scala2Unpickler.readType has cognitive complexity 41 (threshold 15). Drivers by points: if/else 18 (29 pts), match/switch 4 (7 pts), boolean chains 5 (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":"compiler/src/dotty/tools/dotc/core/unpickleScala2/Scala2Unpickler.scala"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b83003c2446d6b5fbb27f0d7522bbdf9641e7c858d2eb03a5ab5213393e5be4"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.defDefOrDcl (cognitive 41): Parser.defDefOrDcl has cognitive complexity 41 (threshold 15). Drivers by points: if/else 23 (35 pts), boolean chains 3, match/switch 1 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/parsing/Parsers.scala"},"region":{"startLine":4385}}}],"partialFingerprints":{"codehealthFindingId/v1":"98af4222593b5fcdb16ed04ead9cbf86c3c690577ced58a7816554797c4a1176"}},{"ruleId":"D2","level":"warning","message":{"text":"Scanner.getStringPart (cognitive 41): Scanner.getStringPart has cognitive complexity 41 (threshold 15). Drivers by points: if/else 22 (32 pts), boolean chains 9 (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":"compiler/src/dotty/tools/dotc/parsing/Scanners.scala"},"region":{"startLine":1253}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1197759a501621b472464ddcfed1d90d5670d8784063bf8bc1febb13c33233f"}},{"ruleId":"D2","level":"warning","message":{"text":"CheckNonCyclicMap.apply (cognitive 41): CheckNonCyclicMap.apply has cognitive complexity 41 (threshold 15). Drivers by points: if/else 15 (26 pts), boolean chains 10, match/switch 2 (3 pts), error handling 1 (2 pts) (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":"compiler/src/dotty/tools/dotc/typer/Checking.scala"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"763ea104ccb86b07cdb6e05dbbdeaa4b5fba82b04fb78ebd3f472794d6f1333e"}},{"ruleId":"D2","level":"warning","message":{"text":"LazyList.addStringNoForce (cognitive 41): LazyList.addStringNoForce has cognitive complexity 41 (threshold 15). Drivers by points: if/else 10 (25 pts), loops 4 (15 pts), boolean chains 1 (nesting depth added 26). 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":"library/src/scala/collection/immutable/LazyList.scala"},"region":{"startLine":1107}}}],"partialFingerprints":{"codehealthFindingId/v1":"43ecee414b386a8c1936e58dd73581cea9d76f6d11a5511a3009338978c0740c"}},{"ruleId":"D2","level":"warning","message":{"text":"Cleaner.cleanHtml (cognitive 41): Cleaner.cleanHtml has cognitive complexity 41 (threshold 15). Drivers by points: if/else 16 (31 pts), boolean chains 5, match/switch 1 (4 pts), loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scaladoc/src/dotty/tools/scaladoc/tasty/comments/Cleaner.scala"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"42d6ad8edaddcd9a4037449aaa38be8bd78317ff87d95ac8e25092784abf14fa"}},{"ruleId":"D2","level":"warning","message":{"text":"JSCodeGen.genSimpleBinaryOp (cognitive 40): JSCodeGen.genSimpleBinaryOp has cognitive complexity 40 (threshold 15). Drivers by points: match/switch 8 (22 pts), if/else 15 (17 pts), boolean chains 1 (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":"compiler/src/dotty/tools/backend/sjs/JSCodeGen.scala"},"region":{"startLine":2754}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7d2aa080b9fb0161117b23a05604cb005306b1fee680be62232a13e78abe55f"}},{"ruleId":"D2","level":"warning","message":{"text":"JSCodeGen.genJSPrimitive (cognitive 40): JSCodeGen.genJSPrimitive has cognitive complexity 40 (threshold 15). Drivers by points: if/else 17 (27 pts), match/switch 6 (10 pts), boolean chains 3 (nesting depth added 14). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/backend/sjs/JSCodeGen.scala"},"region":{"startLine":4037}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b435379d3d26d47f456e783fc6e3faf9a4006100677c3ad17c3b130c430f880"}},{"ruleId":"D2","level":"warning","message":{"text":"IncludeFailure.render (cognitive 40): IncludeFailure.render has cognitive complexity 40 (threshold 15). Drivers by points: if/else 20 (26 pts), match/switch 5 (10 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 12). 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":"compiler/src/dotty/tools/dotc/cc/CaptureSet.scala"},"region":{"startLine":1488}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb9730ba51465bb9a8ab3dfb3c0b1df15178c37845e2742b91e62d694196066f"}},{"ruleId":"D2","level":"warning","message":{"text":"PackageClassDenotation.computeMembersNamed (cognitive 40): PackageClassDenotation.computeMembersNamed has cognitive complexity 40 (threshold 15). Drivers by points: if/else 19 (28 pts), loops 1 (4 pts), match/switch 2 (4 pts), error handling 1 (3 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/SymDenotations.scala"},"region":{"startLine":2690}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee5c9094d1be275ba5a2eb15bd78229139dfb7136759ab93391b8814ad38801b"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeComparer.lub (cognitive 40): TypeComparer.lub has cognitive complexity 40 (threshold 15). Drivers by points: if/else 15 (27 pts), boolean chains 8, match/switch 2 (5 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":"compiler/src/dotty/tools/dotc/core/TypeComparer.scala"},"region":{"startLine":2617}}}],"partialFingerprints":{"codehealthFindingId/v1":"419a9c4e2b0930921586efc39b007b146b388804bcd16f7993bbb8bf78673273"}},{"ruleId":"D2","level":"warning","message":{"text":"RefinedPrinter.toText (cognitive 40): RefinedPrinter.toText has cognitive complexity 40 (threshold 15). Drivers by points: if/else 18 (28 pts), boolean chains 8, match/switch 3 (4 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":"compiler/src/dotty/tools/dotc/printing/RefinedPrinter.scala"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"91e091d8129af583dab14b925c20a58514da812ed757c67912594b9f1a7a2926"}},{"ruleId":"D2","level":"warning","message":{"text":"DesugarSpecializedTraits.collectReferencedSpecializations (cognitive 40): DesugarSpecializedTraits.collectReferencedSpecializations has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (24 pts), match/switch 6 (14 pts), boolean chains 2 (nesting depth added 18). 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":"compiler/src/dotty/tools/dotc/transform/DesugarSpecializedTraits.scala"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf1cb0160c3cf679d6f3f645c72624f4587b3a9e143d6a39881416e1368f17e2"}},{"ruleId":"D2","level":"warning","message":{"text":"Inferencing.constrainIfDependentParamRef (cognitive 40): Inferencing.constrainIfDependentParamRef has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (21 pts), match/switch 5 (19 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/Inferencing.scala"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba67ce39d8c413263f50fd5d23b6c2b34c29ed063a75a22cb72a568369f75f24"}},{"ruleId":"D2","level":"warning","message":{"text":"RefChecks.checkExtensionMethods (cognitive 40): RefChecks.checkExtensionMethods has cognitive complexity 40 (threshold 15). Drivers by points: if/else 18 (32 pts), boolean chains 4, match/switch 2 (4 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":"compiler/src/dotty/tools/dotc/typer/RefChecks.scala"},"region":{"startLine":1188}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ab850fdd8a61b707548487c3035a20c5a61e7208582a8c66bec5c8d6a66bf95"}},{"ruleId":"D2","level":"warning","message":{"text":"Extractors.showFlags (cognitive 40): Extractors.showFlags has cognitive complexity 40 (threshold 15). Drivers by points: if/else 40. 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":"compiler/src/scala/quoted/runtime/impl/printers/Extractors.scala"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ea058acbb6f8b9c70afa08e56d3752d652e8156f5f7235015eea51eb1b80b04"}},{"ruleId":"D2","level":"warning","message":{"text":"ExtractMethodProvider.extractMethod (cognitive 40): ExtractMethodProvider.extractMethod has cognitive complexity 40 (threshold 15). Drivers by points: if/else 13 (20 pts), match/switch 6 (9 pts), loops 3 (6 pts), boolean chains 5 (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":"presentation-compiler/src/main/dotty/tools/pc/ExtractMethodProvider.scala"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f45b948a61d2de54ea0d90015ca74c1a27e844267edf1f528798bf4b217caa6"}},{"ruleId":"D2","level":"warning","message":{"text":"Setup.transformSym (cognitive 39): Setup.transformSym has cognitive complexity 39 (threshold 15). Drivers by points: if/else 18 (30 pts), boolean chains 5, match/switch 1 (4 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/cc/Setup.scala"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d24aecf080ddeeacc27ebbef3592bbcb9c30a1c267325b52b8f0279f8ca3ad6"}},{"ruleId":"D2","level":"warning","message":{"text":"ReadTasty.readTASTY (cognitive 39): ReadTasty.readTASTY has cognitive complexity 39 (threshold 15). Drivers by points: if/else 12 (19 pts), match/switch 7 (18 pts), boolean chains 2 (nesting depth added 18). 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":"compiler/src/dotty/tools/dotc/fromtasty/ReadTasty.scala"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"eccf3466e97b1798e06af83f33fc0a7f1d2ca521c7b50e8687bee4a62bfe3995"}},{"ruleId":"D2","level":"warning","message":{"text":"BetaReduce.reduceApplication (cognitive 39): BetaReduce.reduceApplication has cognitive complexity 39 (threshold 15). Drivers by points: if/else 16 (26 pts), match/switch 4 (7 pts), boolean chains 4, loops 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/BetaReduce.scala"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ba546b673c52bdc365acfe31ce7a0fec9013fdffca8ac8e3c10862e5031582b"}},{"ruleId":"D2","level":"warning","message":{"text":"Typer.typedUnadapted (cognitive 39): Typer.typedUnadapted has cognitive complexity 39 (threshold 15). Drivers by points: if/else 15 (23 pts), match/switch 6 (12 pts), boolean chains 2, error handling 1 (2 pts) (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":"compiler/src/dotty/tools/dotc/typer/Typer.scala"},"region":{"startLine":3976}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a5e58fc798e74ace9b8034a96e64a4ccfecd2ddc0db015f80f693111dbc1ab0"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceCode.showFlags (cognitive 39): SourceCode.showFlags has cognitive complexity 39 (threshold 15). Drivers by points: if/else 39. 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":"compiler/src/scala/quoted/runtime/impl/printers/SourceCode.scala"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9e40c427516fb11104205b150b948e424a1f9af957fe3c248ff03208a9601cf"}},{"ruleId":"D2","level":"warning","message":{"text":"Transformation.run (cognitive 39): Transformation.run has cognitive complexity 39 (threshold 15). Drivers by points: if/else 22 (36 pts), boolean chains 1, error handling 1, match/switch 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/concurrent/impl/Promise.scala"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"33e88a462b1f721e4d138b9ea5aadeea36d17bcd9034f6db9840282b244ef719"}},{"ruleId":"D2","level":"warning","message":{"text":"HoverProvider.hover (cognitive 39): HoverProvider.hover has cognitive complexity 39 (threshold 15). Drivers by points: if/else 17 (20 pts), match/switch 7 (14 pts), boolean chains 5 (nesting depth added 10). 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":"presentation-compiler/src/main/dotty/tools/pc/HoverProvider.scala"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"13a245d0e27510e395bfb4804e18a28cb4be70e7084f4acf1df74b4772fb42bc"}},{"ruleId":"D2","level":"warning","message":{"text":"CaptureSet.map (cognitive 38): CaptureSet.map has cognitive complexity 38 (threshold 15). Drivers by points: if/else 15 (25 pts), match/switch 3 (8 pts), error handling 1 (4 pts), boolean chains 1 (nesting depth added 18). 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":"compiler/src/dotty/tools/dotc/cc/CaptureSet.scala"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"a844d0fe9fb90fec7335b26b811ec508fba58e5a02a848d127a81aea26330950"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassfileParser.unpickleOrParseInnerClasses (cognitive 38): ClassfileParser.unpickleOrParseInnerClasses has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (23 pts), loops 5 (9 pts), boolean chains 6 (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":"compiler/src/dotty/tools/dotc/core/classfile/ClassfileParser.scala"},"region":{"startLine":1254}}}],"partialFingerprints":{"codehealthFindingId/v1":"da6aa35f162564ae1b94d431936bcb8d0ae6f735ad6e0b6d2ac21c670be4d62d"}},{"ruleId":"D2","level":"warning","message":{"text":"SpliceTransformer.transform (cognitive 38): SpliceTransformer.transform has cognitive complexity 38 (threshold 15). Drivers by points: if/else 18 (26 pts), match/switch 4 (9 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":"compiler/src/dotty/tools/dotc/transform/Splicing.scala"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b5ec5baec64bc988d0efd0607fbbc236bc6192c6efbf4a00c75a1ee3953ea02"}},{"ruleId":"D2","level":"warning","message":{"text":"RefChecks.checkParents (cognitive 38): RefChecks.checkParents has cognitive complexity 38 (threshold 15). Drivers by points: if/else 10 (27 pts), loops 2 (5 pts), match/switch 2 (5 pts), boolean chains 1 (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":"compiler/src/dotty/tools/dotc/typer/RefChecks.scala"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdd30d3e5cc5aa7a764d2d2eb3c6b251882e1ec132ae79198c2577b75c148b3b"}},{"ruleId":"D2","level":"warning","message":{"text":"Typer.typedTyped (cognitive 38): Typer.typedTyped has cognitive complexity 38 (threshold 15). Drivers by points: if/else 21 (31 pts), boolean chains 4, match/switch 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/Typer.scala"},"region":{"startLine":1340}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fd56172c2bad77f3e42570b79caffc45f376ae1687c045fc54614c9f8653baa"}},{"ruleId":"D2","level":"warning","message":{"text":"LazyList.initState (cognitive 38): LazyList.initState has cognitive complexity 38 (threshold 15). Drivers by points: if/else 10 (27 pts), match/switch 2 (6 pts), error handling 1 (4 pts), loops 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/collection/immutable/LazyList.scala"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa15f67496acdda450d22645c6f632d37bb45c2f1c57868bd19c2a0065c43368"}},{"ruleId":"D2","level":"warning","message":{"text":"OptimizerCallGraph.addMethod (cognitive 37): OptimizerCallGraph.addMethod has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 4 (15 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/backend/jvm/opt/OptimizerCallGraph.scala"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"f174a437f1bac9235a091dea33cf8a54b91b2c47252046fae481f6e4a43f48de"}},{"ruleId":"D2","level":"warning","message":{"text":"JSCodeGen.genMethodWithCurrentLocalNameScope (cognitive 37): JSCodeGen.genMethodWithCurrentLocalNameScope has cognitive complexity 37 (threshold 15). Drivers by points: if/else 19 (28 pts), boolean chains 7, match/switch 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/backend/sjs/JSCodeGen.scala"},"region":{"startLine":1615}}}],"partialFingerprints":{"codehealthFindingId/v1":"22d92219dda04472ee2991acbd14d7ae2fecab14286e8c01fd6893be0a3db2e8"}},{"ruleId":"D2","level":"warning","message":{"text":"ExpressionTransformer.transform (cognitive 37): ExpressionTransformer.transform has cognitive complexity 37 (threshold 15). Drivers by points: if/else 15 (25 pts), boolean chains 6, match/switch 3 (6 pts) (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":"compiler/src/dotty/tools/debug/ExtractExpression.scala"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"658724dfc72ac3cc38ba7533e60a0b1875e77d50400afc607fe0ce43d0bcc2db"}},{"ruleId":"D2","level":"warning","message":{"text":"SepCheck.checkApply (cognitive 37): SepCheck.checkApply has cognitive complexity 37 (threshold 15). Drivers by points: if/else 13 (29 pts), loops 2 (3 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 18). 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":"compiler/src/dotty/tools/dotc/cc/SepCheck.scala"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"054132a17b418e61488d9a614d806d5f4c5cfdef7c90146317bd0b84c7e5b3dc"}},{"ruleId":"D2","level":"warning","message":{"text":"Setup.checkWellformed (cognitive 37): Setup.checkWellformed has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 2 (5 pts), match/switch 1 (4 pts), boolean chains 3, error handling 1 (nesting depth added 21). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/cc/Setup.scala"},"region":{"startLine":1054}}}],"partialFingerprints":{"codehealthFindingId/v1":"baaec25e44d88b629d847cc781c731a84808df30348c288b019d0cc459c44363"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeComparer.glb (cognitive 37): TypeComparer.glb has cognitive complexity 37 (threshold 15). Drivers by points: if/else 13 (16 pts), match/switch 3 (15 pts), boolean chains 6 (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":"compiler/src/dotty/tools/dotc/core/TypeComparer.scala"},"region":{"startLine":2570}}}],"partialFingerprints":{"codehealthFindingId/v1":"e28c02a78328c6c5569d5f6c35e040145ddbc5f72ba3ca3ee934c2b93f03e348"}},{"ruleId":"D2","level":"warning","message":{"text":"MatchTypeCaseSpec.tryConvertToSpecPattern (cognitive 37): MatchTypeCaseSpec.tryConvertToSpecPattern has cognitive complexity 37 (threshold 15). Drivers by points: if/else 15 (23 pts), match/switch 5 (10 pts), boolean chains 4 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/Types.scala"},"region":{"startLine":5397}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c12f10520ef3d9a845bb2a85367f562deca0bc11a4cf6d317b4dd57dc5c5986"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.simpleTypeRest (cognitive 37): Parser.simpleTypeRest has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (21 pts), match/switch 5 (16 pts) (nesting depth added 20). 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":"compiler/src/dotty/tools/dotc/parsing/Parsers.scala"},"region":{"startLine":2300}}}],"partialFingerprints":{"codehealthFindingId/v1":"69e3f76e41830d3756067aef1e7873452c7c494a65f25386999ec47f16abc5f5"}},{"ruleId":"D2","level":"warning","message":{"text":"Translator.emitCondition (cognitive 37): Translator.emitCondition has cognitive complexity 37 (threshold 15). Drivers by points: if/else 15 (28 pts), match/switch 4 (8 pts), boolean chains 1 (nesting depth added 17). 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":"compiler/src/dotty/tools/dotc/transform/PatternMatcher.scala"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f488064878a66fcd35b5a3ae877f7a4b4ed4583fc03965ce2fdc556de5eba16"}},{"ruleId":"D2","level":"warning","message":{"text":"SpaceEngine.decompose (cognitive 37): SpaceEngine.decompose has cognitive complexity 37 (threshold 15). Drivers by points: if/else 16 (22 pts), match/switch 4 (8 pts), boolean chains 7 (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":"compiler/src/dotty/tools/dotc/transform/patmat/Space.scala"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"4daffad1acdbaab16da5322ca81f78dc2441b2695f542a031d0fc88ac0bf80ae"}},{"ruleId":"D2","level":"warning","message":{"text":"MemberLookup.downwardLookup (cognitive 37): MemberLookup.downwardLookup has cognitive complexity 37 (threshold 15). Drivers by points: if/else 14 (22 pts), match/switch 4 (10 pts), boolean chains 5 (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":"scaladoc/src/dotty/tools/scaladoc/tasty/comments/MemberLookup.scala"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"66ed3d972702cad9b66b7c7474d1605e90f812f335f12228ecd44cd41dee601c"}},{"ruleId":"D2","level":"warning","message":{"text":"SepCheck.checkConsumedRefs (cognitive 36): SepCheck.checkConsumedRefs has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (25 pts), match/switch 3 (6 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/cc/SepCheck.scala"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"99e14f09d3febfe2146a224d2ab2799fb1ec847fda562b82978c7779e5b014a6"}},{"ruleId":"D2","level":"warning","message":{"text":"Symbols.mapSymbols (cognitive 36): Symbols.mapSymbols has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 3 (8 pts), match/switch 3 (8 pts), boolean chains 3 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/Symbols.scala"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b3689cd7d50f4630613ce68e79f28bb7f4281f2066c771b01b0a9c262502644"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeOps.simplify (cognitive 36): TypeOps.simplify has cognitive complexity 36 (threshold 15). Drivers by points: if/else 18 (24 pts), match/switch 4 (8 pts), boolean chains 4 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/TypeOps.scala"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"98c1d38e93c9ca4f46f087179f45e5cbf2d0586c7269ec84b5e6f0ab2a77260f"}},{"ruleId":"D2","level":"warning","message":{"text":"Semantic.cases (cognitive 36): Semantic.cases has cognitive complexity 36 (threshold 15). Drivers by points: if/else 14 (23 pts), match/switch 6 (13 pts) (nesting depth added 16). 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":"compiler/src/dotty/tools/dotc/transform/init/Semantic.scala"},"region":{"startLine":1256}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c7435e1c221c4b069f5dfcc4b7aff959848990947488970a5e07b228ce1aa8d"}},{"ruleId":"D2","level":"warning","message":{"text":"SpaceEngine.display (cognitive 36): SpaceEngine.display has cognitive complexity 36 (threshold 15). Drivers by points: if/else 20 (29 pts), match/switch 2 (4 pts), boolean chains 3 (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/patmat/Space.scala"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a53a869c4f75e28fc738e14a78573d9014a91cb9bcca7bfa87c779948c497a4"}},{"ruleId":"D2","level":"warning","message":{"text":"JavaParser.varDecl (cognitive 35): JavaParser.varDecl has cognitive complexity 35 (threshold 15). Drivers by points: if/else 18 (26 pts), match/switch 2 (5 pts), boolean chains 4 (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":"compiler/src/dotty/tools/dotc/parsing/JavaParsers.scala"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a38d226c0b2402de02a03ace7ccac7b90c19cc03373367484e03d570d61f18f"}},{"ruleId":"D2","level":"warning","message":{"text":"QuotePatterns.checkPattern (cognitive 35): QuotePatterns.checkPattern has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14 (24 pts), match/switch 4 (5 pts), loops 2 (4 pts), boolean chains 2 (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":"compiler/src/dotty/tools/dotc/quoted/QuotePatterns.scala"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0961c480175dfe3fd5a058d1a502127605acdba9495367df1c20a222e6b7fee"}},{"ruleId":"D2","level":"warning","message":{"text":"CannotBeAccessed.msg (cognitive 35): CannotBeAccessed.msg has cognitive complexity 35 (threshold 15). Drivers by points: if/else 19 (30 pts), boolean chains 3, loops 1, match/switch 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/reporting/messages.scala"},"region":{"startLine":3314}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1f329b87010ca81e509412f77269f267dd23550719033f0d52b23e37cdd951d"}},{"ruleId":"D2","level":"warning","message":{"text":"SymbolInformationProvider.info (cognitive 35): SymbolInformationProvider.info has cognitive complexity 35 (threshold 15). Drivers by points: if/else 16 (29 pts), match/switch 2 (4 pts), boolean chains 2 (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":"presentation-compiler/src/main/dotty/tools/pc/SymbolInformationProvider.scala"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"abfe7de857ca4f7fafe61ca2f780eed1690399fd8999a825304825c4407402de"}},{"ruleId":"D2","level":"warning","message":{"text":"ExpressionTransformer.transform (cognitive 34): ExpressionTransformer.transform has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (27 pts), match/switch 3 (6 pts), boolean chains 1 (nesting depth added 16). 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":"compiler/src/dotty/tools/debug/ResolveReflectEval.scala"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"01e738aae692fe921eb9327a656de2905e84c7f4ac9fbf5a92bf86e451cd9e5c"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassfileParser.parseAttributes (cognitive 34): ClassfileParser.parseAttributes has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 6 (8 pts), match/switch 4 (8 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/classfile/ClassfileParser.scala"},"region":{"startLine":1038}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1d160958538893f2b9fff3747741d7f9d6ca0d6e0c4acead4298fd07b2bb617"}},{"ruleId":"D2","level":"warning","message":{"text":"RefInfos.register (cognitive 34): RefInfos.register has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (30 pts), boolean chains 3, match/switch 1 (nesting depth added 16). 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":"compiler/src/dotty/tools/dotc/transform/CheckUnused.scala"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebbab2a7ee47acac041948c3334642522140b86374054170ae26363d5ab44fae"}},{"ruleId":"D2","level":"warning","message":{"text":"DesugarSpecializedTraits.generatedVariantStats (cognitive 34): DesugarSpecializedTraits.generatedVariantStats has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 8 (12 pts), boolean chains 5 (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/DesugarSpecializedTraits.scala"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"27ab96adc2e67422da118216bbd645e4935f9a582a257f002bc308f99ef8c428"}},{"ruleId":"D2","level":"warning","message":{"text":"Checking.checkEnum (cognitive 34): Checking.checkEnum has cognitive complexity 34 (threshold 15). Drivers by points: if/else 16 (24 pts), boolean chains 8, match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/Checking.scala"},"region":{"startLine":1564}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf534c3e0f20a40571599c606a61bc04aca0ac9131df383696d2ec94d78657ca"}},{"ruleId":"D2","level":"warning","message":{"text":"SearchRoot.emitDictionary (cognitive 34): SearchRoot.emitDictionary has cognitive complexity 34 (threshold 15). Drivers by points: match/switch 5 (17 pts), if/else 11 (16 pts), boolean chains 1 (nesting depth added 17). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/Implicits.scala"},"region":{"startLine":2080}}}],"partialFingerprints":{"codehealthFindingId/v1":"87a49d8f245c6648afc9220f6be37e3ae9a4d47445c3b145c3d5c24b8f78de6b"}},{"ruleId":"D2","level":"warning","message":{"text":"Typer.typedBind (cognitive 34): Typer.typedBind has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 10, match/switch 2 (5 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/Typer.scala"},"region":{"startLine":2973}}}],"partialFingerprints":{"codehealthFindingId/v1":"01687dd8bf14deca6fccaea3e7166430fd5d05087fe21e94e455f71271ae8b07"}},{"ruleId":"D2","level":"warning","message":{"text":"CompletionProvider.completionItems (cognitive 34): CompletionProvider.completionItems has cognitive complexity 34 (threshold 15). Drivers by points: if/else 16, match/switch 8 (13 pts), error handling 2 (3 pts), boolean chains 2 (nesting depth added 6). 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":"presentation-compiler/src/main/dotty/tools/pc/completions/CompletionProvider.scala"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec25c72e21096f316d9052acc45a499d2d192b6bc0735520ccb30f6593312cc3"}},{"ruleId":"D2","level":"warning","message":{"text":"VarInTypeTree.normalizeLocalCaps (cognitive 33): VarInTypeTree.normalizeLocalCaps has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (25 pts), match/switch 2 (5 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 18). 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":"compiler/src/dotty/tools/dotc/cc/CaptureSet.scala"},"region":{"startLine":1101}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca3a9d3a2bbdeb2bb61fb35e91f06609e7cb73e0ae3f6f6ad88d89323588ea99"}},{"ruleId":"D2","level":"warning","message":{"text":"PositionPickler.picklePositions (cognitive 33): PositionPickler.picklePositions has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (21 pts), loops 5 (6 pts), match/switch 3 (4 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/tasty/PositionPickler.scala"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c7f67af60e7635a8901c0f9682c1d10d77861387cd7d0798b7bd8f5d8d251c0"}},{"ruleId":"D2","level":"warning","message":{"text":"Interactive.contextOfPath (cognitive 33): Interactive.contextOfPath has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 4 (9 pts), loops 2 (7 pts), error handling 1 (2 pts) (nesting depth added 17). 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":"compiler/src/dotty/tools/dotc/interactive/Interactive.scala"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"898f5e75ecc2c3d7a277267d97a4fff829f64531bdfc458ce5940922f77f64ae"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.patDefOrDcl (cognitive 33): Parser.patDefOrDcl has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (19 pts), match/switch 5 (9 pts), boolean chains 5 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/parsing/Parsers.scala"},"region":{"startLine":4323}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef5978d4f463a408808cc814d34ab609aa9d49b61e32ecd27046ac94e9043973"}},{"ruleId":"D2","level":"warning","message":{"text":"PickleQuotes.pickle (cognitive 33): PickleQuotes.pickle has cognitive complexity 33 (threshold 15). Drivers by points: if/else 22 (23 pts), match/switch 6 (8 pts), boolean chains 2 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/PickleQuotes.scala"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d7cb61306b471e520eed08e4adcf9efa9a462833d76faa824dfa5a62b1010a7"}},{"ruleId":"D2","level":"warning","message":{"text":"Trace.buildStacktrace (cognitive 33): Trace.buildStacktrace has cognitive complexity 33 (threshold 15). Drivers by points: if/else 16 (26 pts), match/switch 1 (3 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/init/Trace.scala"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2149bbf2ceb4f7c9422c899f361a9ea45006e4a0defda2e8f5d3fec60d132b6"}},{"ruleId":"D2","level":"warning","message":{"text":"StringContext.glob (cognitive 33): StringContext.glob has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (18 pts), match/switch 4 (11 pts), boolean chains 3, 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":"library/src/scala/StringContext.scala"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bcd3ff5f30a53be8fedd2106129c0769a8d78e70285f5163da625f20ffd8ca8"}},{"ruleId":"D2","level":"warning","message":{"text":"HtmlRenderer.buildNavigation (cognitive 33): HtmlRenderer.buildNavigation has cognitive complexity 33 (threshold 15). Drivers by points: if/else 18 (21 pts), boolean chains 6, match/switch 6 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"scaladoc/src/dotty/tools/scaladoc/renderers/HtmlRenderer.scala"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"422a9735813ba7150606671eb072f8d9a6fa6e0215041ab300fb2f2670300ad9"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.table (cognitive 33): Parser.table has cognitive complexity 33 (threshold 15). Drivers by points: if/else 24 (27 pts), match/switch 2 (3 pts), boolean chains 2, loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scaladoc/src/dotty/tools/scaladoc/tasty/comments/wiki/Parser.scala"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"68f36cc45e1c266ee2eb0d46b3451a1864888d1e4cb843aba693fa6503186a0d"}},{"ruleId":"D2","level":"warning","message":{"text":"OrderingConstraint.validBoundFor (cognitive 32): OrderingConstraint.validBoundFor has cognitive complexity 32 (threshold 15). Drivers by points: if/else 16 (27 pts), match/switch 2 (4 pts), boolean chains 1 (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":"compiler/src/dotty/tools/dotc/core/OrderingConstraint.scala"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e07770bcb59981a8d9db2fba059f461ff2de62727e660d536c21d1f736d3aa4"}},{"ruleId":"D2","level":"warning","message":{"text":"OrderingConstraint.checkWellFormed (cognitive 32): OrderingConstraint.checkWellFormed has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (18 pts), match/switch 4 (8 pts), boolean chains 5, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/OrderingConstraint.scala"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f271a99b25bba3eac3236a32f7e2382b98546e46400429ab2526182f17796b2"}},{"ruleId":"D2","level":"warning","message":{"text":"InfoPrinter.pprint (cognitive 32): InfoPrinter.pprint has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (24 pts), match/switch 3 (7 pts), boolean chains 1 (nesting depth added 14). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/semanticdb/PPrint.scala"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d64a24a2d6ba8a5e1cd7b55192fb08a108a15fe92c7fb868d5cea3242bedc29"}},{"ruleId":"D2","level":"warning","message":{"text":"Implicits.inferImplicit (cognitive 32): Implicits.inferImplicit has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (19 pts), boolean chains 4, match/switch 2 (4 pts), loops 1 (3 pts), error handling 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/Implicits.scala"},"region":{"startLine":1110}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bd62536a2f3469a61be17b02bcc2ace065bfe486ba30df783ba81eb93e73aa1"}},{"ruleId":"D2","level":"warning","message":{"text":"ImportInfo.importedImplicits (cognitive 32): ImportInfo.importedImplicits has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (25 pts), loops 2 (5 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":"compiler/src/dotty/tools/dotc/typer/ImportInfo.scala"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"672d7d2b04d7ac626f038f85a3280e10ea678e44a8919984c32a860de3bb4502"}},{"ruleId":"D2","level":"warning","message":{"text":"Namer.valOrDefDefSig (cognitive 32): Namer.valOrDefDefSig has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (17 pts), match/switch 6 (12 pts), boolean chains 3 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/Namer.scala"},"region":{"startLine":1943}}}],"partialFingerprints":{"codehealthFindingId/v1":"bec5510c34ef299ffdc2ea896cab35acb3d80f52c09e586c0a2324a00177849a"}},{"ruleId":"D2","level":"warning","message":{"text":"DoubleAccumulatorStepper.spliterator (cognitive 32): DoubleAccumulatorStepper.spliterator has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (22 pts), loops 4 (8 pts), match/switch 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/jdk/DoubleAccumulator.scala"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0be7e458c5dd35e3bf33c1796a9fbce7397858b5b000e449b42c9c8305ad867"}},{"ruleId":"D2","level":"warning","message":{"text":"IntAccumulatorStepper.spliterator (cognitive 32): IntAccumulatorStepper.spliterator has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (22 pts), loops 4 (8 pts), match/switch 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/jdk/IntAccumulator.scala"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"656ce30cf438641b0a8dbd5b83d76104727f04c322f456da7b915bbceacaf215"}},{"ruleId":"D2","level":"warning","message":{"text":"LongAccumulatorStepper.spliterator (cognitive 32): LongAccumulatorStepper.spliterator has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (22 pts), loops 4 (8 pts), match/switch 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/jdk/LongAccumulator.scala"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"b960a390f74aa601e789d528f78217e81494172ef761499f539574163974308d"}},{"ruleId":"D2","level":"warning","message":{"text":"JSCodeGen.genLinkTimeExpr (cognitive 31): JSCodeGen.genLinkTimeExpr has cognitive complexity 31 (threshold 15). Drivers by points: match/switch 8 (26 pts), if/else 5 (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":"compiler/src/dotty/tools/backend/sjs/JSCodeGen.scala"},"region":{"startLine":4403}}}],"partialFingerprints":{"codehealthFindingId/v1":"756e28518cd7a8f6a4d4e64798a8fcbe0dec7c8f261fc62f27c35ab0c0e65916"}},{"ruleId":"D2","level":"warning","message":{"text":"MethodOrPoly.signature (cognitive 31): MethodOrPoly.signature has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (22 pts), match/switch 4 (6 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":"compiler/src/dotty/tools/dotc/core/Types.scala"},"region":{"startLine":3962}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaf9b7867e95afad2560c7e8c35cad6af0e6ce5043c001fa4152ebc736bfc583"}},{"ruleId":"D2","level":"warning","message":{"text":"ByteCodecs.decode7to8 (cognitive 31): ByteCodecs.decode7to8 has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (30 pts), loops 1 (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":"compiler/src/dotty/tools/dotc/core/classfile/ByteCodecs.scala"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"8001500f1f8d718071d536e2336ddb414e8301399bf80d95a309ef67d34d603a"}},{"ruleId":"D2","level":"warning","message":{"text":"PickledQuotes.spliceTypes (cognitive 31): PickledQuotes.spliceTypes has cognitive complexity 31 (threshold 15). Drivers by points: match/switch 6 (21 pts), if/else 7 (10 pts) (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":"compiler/src/dotty/tools/dotc/quoted/PickledQuotes.scala"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"790f3e22092d7d3e689c78e4569ed28778600f468338be5a4fac6b4b2f49a4a1"}},{"ruleId":"D2","level":"warning","message":{"text":"AlreadyDefined.msg (cognitive 31): AlreadyDefined.msg has cognitive complexity 31 (threshold 15). Drivers by points: if/else 21 (26 pts), boolean chains 4, match/switch 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":"compiler/src/dotty/tools/dotc/reporting/messages.scala"},"region":{"startLine":2169}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2a812309667967fb9cee57d3ec12a37625ebe13ada190ae524a47bf61c3f282"}},{"ruleId":"D2","level":"warning","message":{"text":"SemanticSymbolBuilder.addSymName (cognitive 31): SemanticSymbolBuilder.addSymName has cognitive complexity 31 (threshold 15). Drivers by points: if/else 19 (22 pts), boolean chains 6, match/switch 2, error handling 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/semanticdb/SemanticSymbolBuilder.scala"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff4cb36d10c032d949c9418e5d9f956ee958476302895eeda614431e1663b3c2"}},{"ruleId":"D2","level":"warning","message":{"text":"Typer.typedDefDef (cognitive 31): Typer.typedDefDef has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (20 pts), match/switch 2 (5 pts), loops 1 (4 pts), boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/Erasure.scala"},"region":{"startLine":983}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeae9e842715b5784f4015be21c2a9d9e1920671d46d8a26be01b13cc3f76853"}},{"ruleId":"D2","level":"warning","message":{"text":"ExtensionMethods.transform (cognitive 31): ExtensionMethods.transform has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 4 (8 pts), boolean chains 3, loops 1 (3 pts) (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":"compiler/src/dotty/tools/dotc/transform/ExtensionMethods.scala"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"983e9af8ff8655042d8609356a61d0a68082064956e7cb78996eac9d16685da9"}},{"ruleId":"D2","level":"warning","message":{"text":"DropForMap.transformInlined (cognitive 31): DropForMap.transformInlined has cognitive complexity 31 (threshold 15). Drivers by points: match/switch 5 (16 pts), if/else 10 (15 pts) (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":"compiler/src/dotty/tools/dotc/transform/localopt/DropForMap.scala"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bff40b72791c0f2c7297265368de6707e32fc4c97c2d5c4d82a7aea70aa76bb"}},{"ruleId":"D2","level":"warning","message":{"text":"SpaceEngine.computeSimplify (cognitive 31): SpaceEngine.computeSimplify has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (22 pts), match/switch 3 (8 pts), boolean chains 1 (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":"compiler/src/dotty/tools/dotc/transform/patmat/Space.scala"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae7b88620089ad6e06f871ebe96539361f44d7959a512c1cba0cc434825ad431"}},{"ruleId":"D2","level":"warning","message":{"text":"Signatures.toApplySignature (cognitive 31): Signatures.toApplySignature has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13, match/switch 10 (13 pts), boolean chains 5 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/util/Signatures.scala"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"1653f37e687603413bd38193c4c07ab7d7056c9333a9dea447d51a772576d60f"}},{"ruleId":"D2","level":"warning","message":{"text":"NumericRange.crossesTheEndAfterN (cognitive 31): NumericRange.crossesTheEndAfterN has cognitive complexity 31 (threshold 15). Drivers by points: if/else 17 (25 pts), boolean chains 6 (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":"library-js/src/scala/collection/immutable/NumericRange.scala"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f5501cd266f2bb4d10fdd16ac78b5e31a79aa751b2f3008be7a242f32b5feb3"}},{"ruleId":"D2","level":"warning","message":{"text":"NumericRange.crossesTheEndAfterN (cognitive 31): NumericRange.crossesTheEndAfterN has cognitive complexity 31 (threshold 15). Drivers by points: if/else 17 (25 pts), boolean chains 6 (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":"library/src/scala/collection/immutable/NumericRange.scala"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"069470964aa83d0296f7f34e3b5abc870d816f37bdbc6df3b06e0b288bc25551"}},{"ruleId":"D2","level":"warning","message":{"text":"PcCollector.traverseSought (cognitive 31): PcCollector.traverseSought has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 8, match/switch 4 (8 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":"presentation-compiler/src/main/dotty/tools/pc/PcCollector.scala"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"38b43a4127787fe4aded3ccc5b25c331a6f9e2009caa7f0cdbdd475c60784b72"}},{"ruleId":"D2","level":"warning","message":{"text":"ReplDriver.renderDefinitions (cognitive 31): ReplDriver.renderDefinitions has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (18 pts), match/switch 3 (6 pts), boolean chains 5, loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"repl/src/dotty/tools/repl/ReplDriver.scala"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0745acce0d96e76b37ec1981a366abdc90a80de8854327d0b258c66aaa27590"}},{"ruleId":"D2","level":"warning","message":{"text":"InkuireSupport.doInkuireStuff (cognitive 31): InkuireSupport.doInkuireStuff has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (15 pts), match/switch 8 (13 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":"scaladoc/src/dotty/tools/scaladoc/tasty/InkuireSupport.scala"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"3df2b2e8dc5b3678cab7e37fc722bcfb2d63c04af7f26eb87cd1aa0241d593d2"}},{"ruleId":"D2","level":"warning","message":{"text":"PlainBodyBuilder.genStringConcat (cognitive 30): PlainBodyBuilder.genStringConcat has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 4 (8 pts), loops 2 (6 pts), boolean chains 2 (nesting depth added 14). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/backend/jvm/BCodeBodyBuilder.scala"},"region":{"startLine":1371}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f7984c11856adb9308bb655ba4bd7f59b418a8e9c51b23454fe15bfae69dd37"}},{"ruleId":"D2","level":"warning","message":{"text":"PlainBodyBuilder.genCZJUMP (cognitive 30): PlainBodyBuilder.genCZJUMP has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (22 pts), match/switch 2 (6 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/backend/jvm/BCodeBodyBuilder.scala"},"region":{"startLine":1545}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ab158dabe9effbe34ef03a7e399694aef1133e23edb48c57e26f5e1fa7a3019"}},{"ruleId":"D2","level":"warning","message":{"text":"PlainSkelBuilder.genPlainClass (cognitive 30): PlainSkelBuilder.genPlainClass has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (20 pts), match/switch 3 (7 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":"compiler/src/dotty/tools/backend/jvm/BCodeSkelBuilder.scala"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"4359ecf837426a6a42eb929bcf545e422ef8ccfc2fa7fff1881c391c83c4dc9a"}},{"ruleId":"D2","level":"warning","message":{"text":"NamedType.computeDenot (cognitive 30): NamedType.computeDenot has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 6, match/switch 3 (5 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":"compiler/src/dotty/tools/dotc/core/Types.scala"},"region":{"startLine":2479}}}],"partialFingerprints":{"codehealthFindingId/v1":"228869b44a283c45e4c8926cabf8259616753464ae621d2b07bf4c0a61b1dac5"}},{"ruleId":"D2","level":"warning","message":{"text":"NamedType.derivedSelect (cognitive 30): NamedType.derivedSelect has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (21 pts), match/switch 2 (7 pts), boolean chains 2 (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":"compiler/src/dotty/tools/dotc/core/Types.scala"},"region":{"startLine":2830}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0bc85c1d24313bc49d5bb012d2705e98958ec621dead2e3be5b518973dcf8af"}},{"ruleId":"D2","level":"warning","message":{"text":"JavaParser.termDecl (cognitive 30): JavaParser.termDecl has cognitive complexity 30 (threshold 15). Drivers by points: if/else 16 (24 pts), boolean chains 5, 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":"compiler/src/dotty/tools/dotc/parsing/JavaParsers.scala"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fa6f8093845d1e9e318ef8622066bbbbb2479e48e91aadf1285b3c67338c375"}},{"ruleId":"D2","level":"warning","message":{"text":"SpaceEngine.checkReachability (cognitive 30): SpaceEngine.checkReachability has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 7, loops 1 (3 pts), match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/patmat/Space.scala"},"region":{"startLine":1124}}}],"partialFingerprints":{"codehealthFindingId/v1":"6612b42e1a3e778fc90c60442d9e78e0c4b64b7e84665d829c455791ec16c666"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeAssigner.assignType (cognitive 30): TypeAssigner.assignType has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (23 pts), match/switch 2 (4 pts), loops 1 (3 pts) (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":"compiler/src/dotty/tools/dotc/typer/TypeAssigner.scala"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"025a16cb9f1fa0c439cf4e4c47aaf6b8e2651f088294659ed73ad7871eae56ef"}},{"ruleId":"D2","level":"warning","message":{"text":"Typer.typedClosure (cognitive 30): Typer.typedClosure has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (24 pts), match/switch 2 (5 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/Typer.scala"},"region":{"startLine":2177}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a45a7d9861f1094673c81f351abc6d64c65c5a47a694fa2ba2e9f7057bbcd56"}},{"ruleId":"D2","level":"warning","message":{"text":"Typer.typedPackageDef (cognitive 30): Typer.typedPackageDef has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 4, loops 1 (4 pts), match/switch 2 (4 pts) (nesting depth added 14). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/Typer.scala"},"region":{"startLine":3742}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8111536d10c0b5bf98afc94be241fd9b9b728dbdfee2aef7d9a5e379b96b764"}},{"ruleId":"D2","level":"warning","message":{"text":"AutoImports.autoImportPosition (cognitive 30): AutoImports.autoImportPosition has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (17 pts), match/switch 7 (9 pts), boolean chains 4 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"presentation-compiler/src/main/dotty/tools/pc/AutoImports.scala"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9881f6aaa72a119d6a169628906a52a17d654c1e5f56cf71c8bebbc3a80a45d"}},{"ruleId":"D2","level":"warning","message":{"text":"Parameters.unapply (cognitive 30): Parameters.unapply has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (13 pts), match/switch 6 (10 pts), boolean chains 7 (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":"presentation-compiler/src/main/dotty/tools/pc/PcInlayHintsProvider.scala"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6c8fd4458f80ed7f5a2296ee5d7612422a81d39d78f7fd9aa08af9208532f00"}},{"ruleId":"D2","level":"warning","message":{"text":"Completions.completionsWithAffix (cognitive 30): Completions.completionsWithAffix has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (19 pts), boolean chains 8, match/switch 1 (2 pts), error handling 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"presentation-compiler/src/main/dotty/tools/pc/completions/Completions.scala"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cec72ed20ef2cb255d8b51006de26744cd478632732218e5059adb25f94458b"}},{"ruleId":"D2","level":"warning","message":{"text":"CaptureChecker.recheckValDef (cognitive 29): CaptureChecker.recheckValDef has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (19 pts), match/switch 2 (8 pts), boolean chains 2 (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":"compiler/src/dotty/tools/dotc/cc/CheckCaptures.scala"},"region":{"startLine":1299}}}],"partialFingerprints":{"codehealthFindingId/v1":"52438d449c5e8c015c207f3953aa28d4186f6b5e5ddff97367f2ff5cf7e7be8c"}},{"ruleId":"D2","level":"warning","message":{"text":"SepCheck.checkUse (cognitive 29): SepCheck.checkUse has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (17 pts), match/switch 3 (9 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/cc/SepCheck.scala"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"7444dfc1b4303f5c664ec795e74d8ec25c33a9731eeed770d14658d733c31044"}},{"ruleId":"D2","level":"warning","message":{"text":"Constant.convertTo (cognitive 29): Constant.convertTo has cognitive complexity 29 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 8, match/switch 3 (4 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":"compiler/src/dotty/tools/dotc/core/Constants.scala"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"80957eb80b1dc0e35c9dc2671fa7fcd3b5ae0974629e83c867d6f3442261ee67"}},{"ruleId":"D2","level":"warning","message":{"text":"SingleDenotation.current (cognitive 29): SingleDenotation.current has cognitive complexity 29 (threshold 15). Drivers by points: if/else 18 (25 pts), loops 3, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/Denotations.scala"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cd9014578d5ad0b95350df0dbc38fa22c9e67a31876e7aa0d7541bf1ea74f04"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeErasure.sigName (cognitive 29): TypeErasure.sigName has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15 (27 pts), boolean chains 1, match/switch 1 (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":"compiler/src/dotty/tools/dotc/core/TypeErasure.scala"},"region":{"startLine":1116}}}],"partialFingerprints":{"codehealthFindingId/v1":"11580cf23d0c104bbd369807ea6c54b8f3e161a087f800d0039be26d8fdcdff8"}},{"ruleId":"D2","level":"warning","message":{"text":"Type.classSymbol (cognitive 29): Type.classSymbol has cognitive complexity 29 (threshold 15). Drivers by points: if/else 14 (24 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/Types.scala"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1cb58923ffb53e33d35dae7a28e056d32e522d964713b46e5486c77e2a761c7"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeReader.scanTree (cognitive 29): TreeReader.scanTree has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 3 (10 pts), match/switch 1 (nesting depth added 14). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/tasty/TreeUnpickler.scala"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"93019b70bbe3b1f6a40f9e8c752c17813320c1e455d299078a58b117bf0ab715"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeReader.createMemberSymbol (cognitive 29): TreeReader.createMemberSymbol has cognitive complexity 29 (threshold 15). Drivers by points: if/else 18 (20 pts), boolean chains 7, 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":"compiler/src/dotty/tools/dotc/core/tasty/TreeUnpickler.scala"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d265dbf285f5f291044bb648189fb485294f34e2e9095ebf101dafa05d09f0c"}},{"ruleId":"D2","level":"warning","message":{"text":"JavaParser.compilationUnit (cognitive 29): JavaParser.compilationUnit has cognitive complexity 29 (threshold 15). Drivers by points: if/else 16 (20 pts), loops 3 (5 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/parsing/JavaParsers.scala"},"region":{"startLine":1119}}}],"partialFingerprints":{"codehealthFindingId/v1":"75b2cb5d462ecb68356ef1c120ee741dfe59621201fcb0cbb396ed150b120308"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.simpleExprRest (cognitive 29): Parser.simpleExprRest has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 5 (12 pts), boolean chains 3 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/parsing/Parsers.scala"},"region":{"startLine":3060}}}],"partialFingerprints":{"codehealthFindingId/v1":"d66c493e0f5ab5e0d6a548442ec184c3260fd271343be159e51d52e1ae9912d3"}},{"ruleId":"D2","level":"warning","message":{"text":"Interpreter.paramsSig (cognitive 29): Interpreter.paramsSig has cognitive complexity 29 (threshold 15). Drivers by points: if/else 24 (25 pts), match/switch 4 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/quoted/Interpreter.scala"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"87f9a2622196732f23fb8b4155c005c9a2e5d5386e98880aae0c78cac15ef088"}},{"ruleId":"D2","level":"warning","message":{"text":"CannotBeIncluded.msg (cognitive 29): CannotBeIncluded.msg has cognitive complexity 29 (threshold 15). Drivers by points: if/else 17 (21 pts), boolean chains 5, match/switch 2 (3 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"compiler/src/dotty/tools/dotc/reporting/messages.scala"},"region":{"startLine":3846}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1a4982638034ed8a56c13185caf5a8db73b182127c578ac214fbe32b58d6070"}},{"ruleId":"D2","level":"warning","message":{"text":"CheckNoSuperThis.transformDefDef (cognitive 29): CheckNoSuperThis.transformDefDef has cognitive complexity 29 (threshold 15). Drivers by points: match/switch 4 (16 pts), if/else 5, boolean chains 4, loops 1 (4 pts) (nesting depth added 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/CheckNoSuperThis.scala"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8dfeb51cd2a6e1116f213ff75373b985a60665052a1863fcbe738afcc906a27"}},{"ruleId":"D2","level":"warning","message":{"text":"SpaceEngine.signature (cognitive 29): SpaceEngine.signature has cognitive complexity 29 (threshold 15). Drivers by points: if/else 14 (24 pts), match/switch 3 (4 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/patmat/Space.scala"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dfd1b4cdc8da3700283a95d1bd40486a4a8966c0dd29957e3f2a9a69c040a23"}},{"ruleId":"D2","level":"warning","message":{"text":"Inferencing.instDecision (cognitive 29): Inferencing.instDecision has cognitive complexity 29 (threshold 15). Drivers by points: if/else 16 (23 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/Inferencing.scala"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba23b093702ac7e0e808e83b41a10bbf0e8c3598a1dc575d26017240ba10fe64"}},{"ruleId":"D2","level":"warning","message":{"text":"PcSemanticTokensProvider.makeNode (cognitive 29): PcSemanticTokensProvider.makeNode has cognitive complexity 29 (threshold 15). Drivers by points: if/else 20 (21 pts), boolean chains 8 (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":"presentation-compiler/src/main/dotty/tools/pc/PcSemanticTokensProvider.scala"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"308050cb9cc98552fbece4986af7a638a94dc4e424bcbdb3aac2c60997e8057a"}},{"ruleId":"D2","level":"warning","message":{"text":"Completions.findSuffix (cognitive 29): Completions.findSuffix has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 5, match/switch 3 (5 pts), error handling 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":"presentation-compiler/src/main/dotty/tools/pc/completions/Completions.scala"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4f1d15b76165dd361d81d772cc35f61a911e3e3d5d7b31639b6f16877edd906"}},{"ruleId":"D2","level":"warning","message":{"text":"Completions.computeRelevancePenalty (cognitive 29): Completions.computeRelevancePenalty has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15 (16 pts), boolean chains 9, match/switch 3, error handling 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"presentation-compiler/src/main/dotty/tools/pc/completions/Completions.scala"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"781bfb73b179cdf194092993d4117d05ace1976aebae2d3df42eb7ddabbb51c5"}},{"ruleId":"D2","level":"warning","message":{"text":"ParseResult.mixesCommandsAndDirectives (cognitive 29): ParseResult.mixesCommandsAndDirectives has cognitive complexity 29 (threshold 15). Drivers by points: if/else 14 (23 pts), boolean chains 3, match/switch 1 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"repl/src/dotty/tools/repl/ParseResult.scala"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f319ae8490a331c1e3c9e3ef84360892c74189ad9a7cfdf22480732ee8e9f51"}},{"ruleId":"D2","level":"warning","message":{"text":"PrimitiveBType.maxValueType (cognitive 28): PrimitiveBType.maxValueType has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15 (18 pts), match/switch 6 (10 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":"compiler/src/dotty/tools/backend/jvm/BTypes.scala"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bdcf146a37bdaa8627b5aa3cc82a048c82f990fbe45133a79f4812112d17a39"}},{"ruleId":"D2","level":"warning","message":{"text":"AliasingFrame.merge (cognitive 28): AliasingFrame.merge has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (20 pts), loops 2 (7 pts), boolean chains 1 (nesting depth added 19). 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":"compiler/src/dotty/tools/backend/jvm/analysis/AliasingAnalyzer.scala"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"eafd358da37dfac0dfc12f6029a1c5143a09cbedd6e546e6684beaaf2802e707"}},{"ruleId":"D2","level":"warning","message":{"text":"JSCodeGen.genClosure (cognitive 28): JSCodeGen.genClosure has cognitive complexity 28 (threshold 15). Drivers by points: if/else 22 (23 pts), boolean chains 4, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/backend/sjs/JSCodeGen.scala"},"region":{"startLine":3673}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7e2d79cb0f2244a68f218347280b823a80152ed79a2400d100afc90262a6c29"}},{"ruleId":"D2","level":"warning","message":{"text":"CaptureChecker.testAdapted (cognitive 28): CaptureChecker.testAdapted has cognitive complexity 28 (threshold 15). Drivers by points: if/else 16 (19 pts), match/switch 3 (5 pts), boolean chains 2, loops 1 (2 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":"compiler/src/dotty/tools/dotc/cc/CheckCaptures.scala"},"region":{"startLine":1798}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef4608d6c9da74ef7fe6e706594f8bdbc470eea2e6d96f332e4390da0119fd0f"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassSymbol.sourceOfClass (cognitive 28): ClassSymbol.sourceOfClass has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 3 (13 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":"compiler/src/dotty/tools/dotc/core/Symbols.scala"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"a956e3602697d817d19a4995577e20fc60674c71129df271dc1a8f8ee9a8d68b"}},{"ruleId":"D2","level":"warning","message":{"text":"LocalUnpickler.complete (cognitive 28): LocalUnpickler.complete has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15 (22 pts), match/switch 2 (3 pts), boolean chains 2, error handling 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":"compiler/src/dotty/tools/dotc/core/unpickleScala2/Scala2Unpickler.scala"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"46fbdf40c856a0a574c01c27655f94b0c5ff323a3c53b873ab602399d327660e"}},{"ruleId":"D2","level":"warning","message":{"text":"PlainPrinter.toTextRHS (cognitive 28): PlainPrinter.toTextRHS has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (19 pts), match/switch 3 (5 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":"compiler/src/dotty/tools/dotc/printing/PlainPrinter.scala"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"2477be4f875ebcc47d419ceefa43f0a75b7bf521e349a09026f273088d3afd52"}},{"ruleId":"D2","level":"warning","message":{"text":"RefinedPrinter.toTextTemplate (cognitive 28): RefinedPrinter.toTextTemplate has cognitive complexity 28 (threshold 15). Drivers by points: if/else 17 (21 pts), boolean chains 5, match/switch 1 (2 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"compiler/src/dotty/tools/dotc/printing/RefinedPrinter.scala"},"region":{"startLine":1088}}}],"partialFingerprints":{"codehealthFindingId/v1":"616a8b6579f10866df6fc6ce27d454a0cbcf627a79b09d7fc21b5439c2199282"}},{"ruleId":"D2","level":"warning","message":{"text":"QuotePatterns.decode (cognitive 28): QuotePatterns.decode has cognitive complexity 28 (threshold 15). Drivers by points: match/switch 8 (13 pts), if/else 7 (12 pts), loops 1 (3 pts) (nesting depth added 12). 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":"compiler/src/dotty/tools/dotc/quoted/QuotePatterns.scala"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"75905bb02880fb3c0f3f7485f668cb153972691cbb958fde48adf110ece6b8c8"}},{"ruleId":"D2","level":"warning","message":{"text":"ActiveProfile.printSummary (cognitive 28): ActiveProfile.printSummary has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15 (18 pts), loops 5 (9 pts), match/switch 1 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/reporting/Profile.scala"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"53311194d6311dbf5bf64835006f9c44195ffd648ba927b8e7a4e1c1f1794d81"}},{"ruleId":"D2","level":"warning","message":{"text":"DoubleDefinition.msg (cognitive 28): DoubleDefinition.msg has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15 (19 pts), boolean chains 5, match/switch 2 (4 pts) (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"compiler/src/dotty/tools/dotc/reporting/messages.scala"},"region":{"startLine":2458}}}],"partialFingerprints":{"codehealthFindingId/v1":"c39d05f41c5c830a21d83d143225fba0b5ba27a2d14d1385e3ffea71c96a0ffa"}},{"ruleId":"D2","level":"warning","message":{"text":"Dependencies.markFree (cognitive 28): Dependencies.markFree has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15 (24 pts), boolean chains 3, error handling 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/Dependencies.scala"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2d8ba640810237274206c9dc7d376d3c062431474f31da25b071a5fec84d7f3"}},{"ruleId":"D2","level":"warning","message":{"text":"Dependencies.process (cognitive 28): Dependencies.process has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 8, match/switch 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/Dependencies.scala"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d1d4ee098dbef1d2d042ef2d4c4f1d13d26951d59c2ef32f6933079acb9c321"}},{"ruleId":"D2","level":"warning","message":{"text":"ExplicitOuter.referencesOuter (cognitive 28): ExplicitOuter.referencesOuter has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 10, match/switch 6 (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":"compiler/src/dotty/tools/dotc/transform/ExplicitOuter.scala"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"f892071670698bf9eb748f67f9ca6ae9684a23a35128979ee067e849da8dc705"}},{"ruleId":"D2","level":"warning","message":{"text":"ImplicitRunInfo.implicitScope (cognitive 28): ImplicitRunInfo.implicitScope has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (20 pts), match/switch 3 (6 pts), boolean chains 2 (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/Implicits.scala"},"region":{"startLine":823}}}],"partialFingerprints":{"codehealthFindingId/v1":"09a610693721c6e788da2a1be941dbcb4ab11945f311da815ccf0839b020b5b2"}},{"ruleId":"D2","level":"warning","message":{"text":"Nullables.assignmentSpans (cognitive 28): Nullables.assignmentSpans has cognitive complexity 28 (threshold 15). Drivers by points: loops 4 (12 pts), match/switch 4 (9 pts), if/else 5 (7 pts) (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":"compiler/src/dotty/tools/dotc/typer/Nullables.scala"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d5fd8cb626196733702ab0b2cc5f88228b1a19514aee0bbbef7c34249f06496"}},{"ruleId":"D2","level":"warning","message":{"text":"Synthesizer.manifestFactoryOf (cognitive 28): Synthesizer.manifestFactoryOf has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (16 pts), match/switch 6 (8 pts), boolean chains 4 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"compiler/src/dotty/tools/dotc/typer/Synthesizer.scala"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ba81947c665c3aeb78a31f94957cc43dbdc5be7576259829fecbe66492f1f51"}},{"ruleId":"D2","level":"warning","message":{"text":"Typer.typedCBSelect (cognitive 28): Typer.typedCBSelect has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (19 pts), match/switch 4 (8 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/Typer.scala"},"region":{"startLine":1039}}}],"partialFingerprints":{"codehealthFindingId/v1":"aef90fbbad357e5e26722d347b4b3bedad53f97c124f6764bd832267ddd1d982"}},{"ruleId":"D2","level":"warning","message":{"text":"Typer.decomposeProtoFunction (cognitive 28): Typer.decomposeProtoFunction has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (16 pts), match/switch 6 (10 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":"compiler/src/dotty/tools/dotc/typer/Typer.scala"},"region":{"startLine":1748}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b48d6ed2f2f167c5a067a60cf736bc68e0cef425f7d529ed49d7c9484196a8b"}},{"ruleId":"D2","level":"warning","message":{"text":"CompletionItemResolver.fullDocstring (cognitive 28): CompletionItemResolver.fullDocstring has cognitive complexity 28 (threshold 15). Drivers by points: if/else 17 (21 pts), match/switch 1 (4 pts), boolean chains 3 (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":"presentation-compiler/src/main/dotty/tools/pc/CompletionItemResolver.scala"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"46bb5c8f34881ae210d73d49247334008467cc9bdac9dcc7c6d892b833091520"}},{"ruleId":"D2","level":"warning","message":{"text":"PcDefinitionProvider.locationsForSymbol (cognitive 28): PcDefinitionProvider.locationsForSymbol has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (22 pts), match/switch 2 (6 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"presentation-compiler/src/main/dotty/tools/pc/PcDefinitionProvider.scala"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"57214ec77fe515e67ae6fb3e5952d4d5bbca0348d581a81d389e8cad33240f1e"}},{"ruleId":"D2","level":"warning","message":{"text":"PcInlayHintsProvider.collectDecorationsImpl (cognitive 28): PcInlayHintsProvider.collectDecorationsImpl has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (19 pts), match/switch 4 (5 pts), boolean chains 4 (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":"presentation-compiler/src/main/dotty/tools/pc/PcInlayHintsProvider.scala"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a8989960feeac530da7e625ba106615323f58cac753650000220f7cb8fb8699"}},{"ruleId":"D2","level":"warning","message":{"text":"PlainBodyBuilder.genCJUMP (cognitive 27): PlainBodyBuilder.genCJUMP has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (22 pts), match/switch 1 (3 pts), boolean chains 2 (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":"compiler/src/dotty/tools/backend/jvm/BCodeBodyBuilder.scala"},"region":{"startLine":1524}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc8f70ea416e92bcc9c3924fd69e8b5626f0177dbbbda1fb72f2dc78b6bf70e3"}},{"ruleId":"D2","level":"warning","message":{"text":"AliasingFrame.init (cognitive 27): AliasingFrame.init has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (26 pts), loops 1 (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":"compiler/src/dotty/tools/backend/jvm/analysis/AliasingAnalyzer.scala"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"263cb3cf89e2d634ca6c97cb310586449e7bb7ed02ebdaaf0a9fbe24a480eaff"}},{"ruleId":"D2","level":"warning","message":{"text":"GlobalOptimizer.collectAndOrderInlineRequests (cognitive 27): GlobalOptimizer.collectAndOrderInlineRequests has cognitive complexity 27 (threshold 15). Drivers by points: if/else 15 (24 pts), loops 2, 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":"compiler/src/dotty/tools/backend/jvm/opt/Inliner.scala"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aa4b88f61308d32e9da3eecc4b21c0ddfcd06b361a809303777678ab2643355"}},{"ruleId":"D2","level":"warning","message":{"text":"tpd.DefDef (cognitive 27): tpd.DefDef has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (19 pts), match/switch 3 (6 pts), boolean chains 2 (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":"compiler/src/dotty/tools/dotc/ast/tpd.scala"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb881770c0e03d88a30d02e6b51f96dd5edf5da8a2f32c82037b9c33aac7f089"}},{"ruleId":"D2","level":"warning","message":{"text":"Inliner.inlined (cognitive 27): Inliner.inlined has cognitive complexity 27 (threshold 15). Drivers by points: if/else 16 (17 pts), match/switch 5 (6 pts), loops 2 (4 pts) (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/inlines/Inliner.scala"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ff3aff19562e3d76c2040829c89db9900fbe23976362d2a5671f2693bf838a7"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.indentedToBraces (cognitive 27): Parser.indentedToBraces has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 7, match/switch 3 (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":"compiler/src/dotty/tools/dotc/parsing/Parsers.scala"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecbacde35d51a0cd6a316b7ed957d2e26e933da276e3a7297b8adc49d8984ecc"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.simpleType (cognitive 27): Parser.simpleType has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (22 pts), boolean chains 5 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/parsing/Parsers.scala"},"region":{"startLine":2229}}}],"partialFingerprints":{"codehealthFindingId/v1":"34eed2ac9f7b2b63dccabe0771224cc1e1ea223aad243585641be7fc52c8ac1f"}},{"ruleId":"D2","level":"warning","message":{"text":"Scanner.postProcessToken (cognitive 27): Scanner.postProcessToken has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 4, match/switch 2 (3 pts) (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/parsing/Scanners.scala"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea5fa6dad8e71cc13eda961510f6ada5a55d48bb7578540a0e4e944f7cb28a72"}},{"ruleId":"D2","level":"warning","message":{"text":"Utility.parseAttributeValue (cognitive 27): Utility.parseAttributeValue has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 2 (5 pts), match/switch 1 (4 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":"compiler/src/dotty/tools/dotc/parsing/xml/Utility.scala"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"06ec00a3063270a7bffd1c03112293297fbafffa9a6d3fa303a5e80e51ac15bd"}},{"ruleId":"D2","level":"warning","message":{"text":"MissingClassValidInCurrentRun.unapply (cognitive 27): MissingClassValidInCurrentRun.unapply has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (23 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/quoted/Interpreter.scala"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"e70d94c25bf2ce4b37792118259e9d38056cbc896d5bb572df50eeead271be89"}},{"ruleId":"D2","level":"warning","message":{"text":"SemanticSymbolBuilder.inverseSymbol (cognitive 27): SemanticSymbolBuilder.inverseSymbol has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (17 pts), match/switch 2 (5 pts), error handling 2 (3 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":"compiler/src/dotty/tools/dotc/semanticdb/SemanticSymbolBuilder.scala"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"af8eb4fcb13516a53aff467cbc772c96560227a0119f79d339718c538aeae467"}},{"ruleId":"D2","level":"warning","message":{"text":"CheckInlineTraits.transformBlock (cognitive 27): CheckInlineTraits.transformBlock has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (17 pts), match/switch 4 (9 pts), boolean chains 1 (nesting depth added 14). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/CheckInlineTraits.scala"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c38181dbce68ceb4290145b66518c9fddfda2fbad1b31310654a8ce87efaa3d"}},{"ruleId":"D2","level":"warning","message":{"text":"InlineVals.checkInlineConformant (cognitive 27): InlineVals.checkInlineConformant has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 3, 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":"compiler/src/dotty/tools/dotc/transform/InlineVals.scala"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"a906b224aa62280f80eaf50e4fae523486b1713da96da6ce1b66c04cc896931a"}},{"ruleId":"D2","level":"warning","message":{"text":"QuotesAndSplices.typedQuotePattern (cognitive 27): QuotesAndSplices.typedQuotePattern has cognitive complexity 27 (threshold 15). Drivers by points: if/else 17 (18 pts), loops 3 (4 pts), match/switch 3, boolean chains 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":"compiler/src/dotty/tools/dotc/typer/QuotesAndSplices.scala"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"62eab9eb8631758bc6a0b9f09fc91b661e7d827f4d204a54c883781d1d1ae97b"}},{"ruleId":"D2","level":"warning","message":{"text":"Typer.typedFunctionType (cognitive 27): Typer.typedFunctionType has cognitive complexity 27 (threshold 15). Drivers by points: if/else 16 (19 pts), match/switch 5 (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":"compiler/src/dotty/tools/dotc/typer/Typer.scala"},"region":{"startLine":1844}}}],"partialFingerprints":{"codehealthFindingId/v1":"432c37669fbd5865e2790193757996927f2c3e09869a1e070a85f8b1cf11d279"}},{"ruleId":"D2","level":"warning","message":{"text":"AnyAccumulator.drain (cognitive 27): AnyAccumulator.drain has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/jdk/AnyAccumulator.scala"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"32e13d42a0509d69ec4590fc60e7103a27da7932e124e2c66cc5aa4abb971b11"}},{"ruleId":"D2","level":"warning","message":{"text":"DoubleAccumulator.drain (cognitive 27): DoubleAccumulator.drain has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/jdk/DoubleAccumulator.scala"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"c279d8f78bfd0d7b5e2153aa7b1ddb925763fdb97b478ff418b14f3a21bb975c"}},{"ruleId":"D2","level":"warning","message":{"text":"IntAccumulator.drain (cognitive 27): IntAccumulator.drain has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/jdk/IntAccumulator.scala"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"040ce0a3f44c15300e370bf39c6b691cd05d303fd69f6db4ba97eca6d6feee0c"}},{"ruleId":"D2","level":"warning","message":{"text":"LongAccumulator.drain (cognitive 27): LongAccumulator.drain has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/jdk/LongAccumulator.scala"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7bef8b7ad2ee999c344251381d59fac68a2d1e97466a8b6021785f492ed801d"}},{"ruleId":"D2","level":"warning","message":{"text":"HoverProvider.fallbackToDynamics (cognitive 27): HoverProvider.fallbackToDynamics has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (17 pts), match/switch 4 (8 pts), boolean chains 2 (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":"presentation-compiler/src/main/dotty/tools/pc/HoverProvider.scala"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ed30e3e31eaffb4641b329728de102d89f7137eb7dee5db6df2153b85fe50d1"}},{"ruleId":"D2","level":"warning","message":{"text":"NamedArgCompletions.contribute (cognitive 27): NamedArgCompletions.contribute has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11, match/switch 7 (10 pts), boolean chains 6 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"presentation-compiler/src/main/dotty/tools/pc/completions/NamedArgCompletions.scala"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc35749a2b13636f707368fedc3d53b3c9f7714ca4c720e5470fa6008776ca5d"}},{"ruleId":"D2","level":"warning","message":{"text":"PlainBodyBuilder.genArithmeticOp (cognitive 26): PlainBodyBuilder.genArithmeticOp has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 4 (9 pts), boolean chains 3 (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/backend/jvm/BCodeBodyBuilder.scala"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"b937d78d7e4e52b4b68fc5a290c964771a484d83d57281c411297f6ded0c06b0"}},{"ruleId":"D2","level":"warning","message":{"text":"BoxUnbox.checkCopyOpReplacements (cognitive 26): BoxUnbox.checkCopyOpReplacements has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (20 pts), match/switch 2 (3 pts), boolean chains 2, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/backend/jvm/opt/BoxUnbox.scala"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b4aa46ed0e60b230faab9daebe4f1abdbf58bbce45ccba6fb5d6d6f491a67cb"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeInfo.isThisTypeResult (cognitive 26): TreeInfo.isThisTypeResult has cognitive complexity 26 (threshold 15). Drivers by points: match/switch 6 (15 pts), if/else 6, boolean chains 5 (nesting depth added 9). 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":"compiler/src/dotty/tools/dotc/ast/TreeInfo.scala"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9ed6982ee105ba44e0547b5d408fec95a37f0367628c43033dd87ae3940eaa7"}},{"ruleId":"D2","level":"warning","message":{"text":"ConstraintHandling.addConstraint (cognitive 26): ConstraintHandling.addConstraint has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 5, match/switch 3 (4 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/ConstraintHandling.scala"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d7213b896fd2adcf6d2d06595fcd0e8d6287e0f4b97b70dc93407ebb5f6342a"}},{"ruleId":"D2","level":"warning","message":{"text":"SymbolLoaders.enterToplevelsFromSource (cognitive 26): SymbolLoaders.enterToplevelsFromSource has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 3 (6 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/SymbolLoaders.scala"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f14c5c526b0a4690a0bd9d28d68cee301d03855427e3d95d64b5749fad12d31"}},{"ruleId":"D2","level":"warning","message":{"text":"AsSeenFromMap.apply (cognitive 26): AsSeenFromMap.apply has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 6, 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":"compiler/src/dotty/tools/dotc/core/TypeOps.scala"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"577dbc0ee400c296271f16b7bcb7907c6992f8055f26d21e54cebdd9be0826d2"}},{"ruleId":"D2","level":"warning","message":{"text":"MatchType.reduced (cognitive 26): MatchType.reduced has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (18 pts), match/switch 2 (3 pts), boolean chains 2, error handling 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/Types.scala"},"region":{"startLine":5196}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aea787015e949df85266b6247220caa6dcb9a216d56b4266ba49d9f6530b921"}},{"ruleId":"D2","level":"warning","message":{"text":"PositionUnpickler.ensureDefined (cognitive 26): PositionUnpickler.ensureDefined has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 2 (4 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/tasty/PositionUnpickler.scala"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"268e5694654e8dd92eee3ac98bd4529e34cae8cd83ed33d78f590c403b7d1f0e"}},{"ruleId":"D2","level":"warning","message":{"text":"InlineReducer.reduceProjection (cognitive 26): InlineReducer.reduceProjection has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/inlines/InlineReducer.scala"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"95b5f6ce6b810f9d234d88b7248c3e2fbf89748aa796fcfe1b05fd19754a1417"}},{"ruleId":"D2","level":"warning","message":{"text":"Inliner.expandMacro (cognitive 26): Inliner.expandMacro has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 3, loops 1 (2 pts), match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/inlines/Inliner.scala"},"region":{"startLine":1402}}}],"partialFingerprints":{"codehealthFindingId/v1":"18a243604466109c2d7fe0e3f2c2ebf3fb113969706144d574651eac7846becb"}},{"ruleId":"D2","level":"warning","message":{"text":"JavaScanner.intVal (cognitive 26): JavaScanner.intVal has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/parsing/JavaScanners.scala"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"dad42cbbf0e83216a50615f44e6d8a86cf57650a3d6cf578fbb1629f0a673e2a"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.typeDefOrDcl (cognitive 26): Parser.typeDefOrDcl has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (13 pts), match/switch 4 (10 pts), boolean chains 3 (nesting depth added 9). 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":"compiler/src/dotty/tools/dotc/parsing/Parsers.scala"},"region":{"startLine":4485}}}],"partialFingerprints":{"codehealthFindingId/v1":"e72ce125054b5aec731ffddf15c89e39f7a4fc2c7a67d944c47963f5e16f60b6"}},{"ruleId":"D2","level":"warning","message":{"text":"Splicer.checkValidMacroBody (cognitive 26): Splicer.checkValidMacroBody has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 5 (10 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":"compiler/src/dotty/tools/dotc/transform/Splicer.scala"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a40703d2a96650c610fce4fdb2d944d506aa0bfa7a7eb1b09dfe7035d629d60"}},{"ruleId":"D2","level":"warning","message":{"text":"Semantic.init (cognitive 26): Semantic.init has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 5, 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":"compiler/src/dotty/tools/dotc/transform/init/Semantic.scala"},"region":{"startLine":1542}}}],"partialFingerprints":{"codehealthFindingId/v1":"bef6a14f17221ab6be95924aea649cad147a312dec3c67f43fc57ef4191a47be"}},{"ruleId":"D2","level":"warning","message":{"text":"ExplicitJSClasses.transformTemplate (cognitive 26): ExplicitJSClasses.transformTemplate has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (19 pts), match/switch 1 (3 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/sjs/ExplicitJSClasses.scala"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5946a9eaa2bc4189bce6ca2af9c9e68e24539fbba50e6c8d1a8870feb472da5"}},{"ruleId":"D2","level":"warning","message":{"text":"Checking.checkEnumCaseRefsLegal (cognitive 26): Checking.checkEnumCaseRefsLegal has cognitive complexity 26 (threshold 15). Drivers by points: match/switch 5 (10 pts), if/else 7, loops 3 (7 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/Checking.scala"},"region":{"startLine":1646}}}],"partialFingerprints":{"codehealthFindingId/v1":"599d623726c12aa79d594bcb8ddff6bf7f10a90428dbc2794f7b26277ebbf981"}},{"ruleId":"D2","level":"warning","message":{"text":"Implicits.missingArgMsg (cognitive 26): Implicits.missingArgMsg has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (12 pts), match/switch 5 (10 pts), boolean chains 4 (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":"compiler/src/dotty/tools/dotc/typer/Implicits.scala"},"region":{"startLine":973}}}],"partialFingerprints":{"codehealthFindingId/v1":"81288ef0203c6110b4608af690494e063022dd4fe87431a0e25c2e68e44a8e0a"}},{"ruleId":"D2","level":"warning","message":{"text":"Symbol.newClass (cognitive 26): Symbol.newClass has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (15 pts), match/switch 4 (5 pts), boolean chains 4, loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/scala/quoted/runtime/impl/QuotesImpl.scala"},"region":{"startLine":2802}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5292bed4373668851b85489615ed9943f4c90a72e5a2ea6dd531ffea30fff07"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.parse (cognitive 26): Parser.parse has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (17 pts), match/switch 6 (9 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":"directives-parser/src/main/scala/dotty/tools/directives/Parser.scala"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e58c044db7711ca1e96fe392f022ad38bae272f9f5d957f85dde69c6c60157d"}},{"ruleId":"D2","level":"warning","message":{"text":"WithCompilationUnit.symbolAlternatives (cognitive 26): WithCompilationUnit.symbolAlternatives has cognitive complexity 26 (threshold 15). Drivers by points: if/else 16 (19 pts), boolean chains 4, 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":"presentation-compiler/src/main/dotty/tools/pc/WithCompilationUnit.scala"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"de57ba37bc01ca61e42256c83263f2080a967e3f7318a4405e16fe728c85cff6"}},{"ruleId":"D2","level":"warning","message":{"text":"Resources.searchData (cognitive 26): Resources.searchData has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (17 pts), match/switch 6 (7 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":"scaladoc/src/dotty/tools/scaladoc/renderers/Resources.scala"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"2408841a3548134a3d4ac232afbff17c64cedbd9db2249abd9f8691cd6b380e3"}},{"ruleId":"D2","level":"warning","message":{"text":"PlainBodyBuilder.genCond (cognitive 25): PlainBodyBuilder.genCond has cognitive complexity 25 (threshold 15). Drivers by points: if/else 16 (20 pts), match/switch 3 (4 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":"compiler/src/dotty/tools/backend/jvm/BCodeBodyBuilder.scala"},"region":{"startLine":1589}}}],"partialFingerprints":{"codehealthFindingId/v1":"2235170b0b1ea8d701fe73d34d805183681573e56c8089bec4f406bc557b7791"}},{"ruleId":"D2","level":"warning","message":{"text":"PlainBodyBuilder.genInvokeDynamicLambda (cognitive 25): PlainBodyBuilder.genInvokeDynamicLambda has cognitive complexity 25 (threshold 15). Drivers by points: if/else 19 (20 pts), boolean chains 4, match/switch 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/backend/jvm/BCodeBodyBuilder.scala"},"region":{"startLine":1760}}}],"partialFingerprints":{"codehealthFindingId/v1":"d19cd75629f8ceb5feb05c4aa119bdb29c09bef7be8e0f2a09affdbe4b7403d7"}},{"ruleId":"D2","level":"warning","message":{"text":"GlobalOptimizer.run (cognitive 25): GlobalOptimizer.run has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 4 (5 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":"compiler/src/dotty/tools/backend/jvm/opt/Inliner.scala"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"64b1bf14ccb8f4dc42ceef8d5e7d5310f19b78992efa127fa9db910d75108531"}},{"ruleId":"D2","level":"warning","message":{"text":"JSCodeGen.genNonNativeJSClass (cognitive 25): JSCodeGen.genNonNativeJSClass has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 2, match/switch 1 (2 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":"compiler/src/dotty/tools/backend/sjs/JSCodeGen.scala"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"b928fd26de6ef74798db2787a1a83971b37345306e13d3a387a3b9a2f06b587c"}},{"ruleId":"D2","level":"warning","message":{"text":"suppressions.runFinished (cognitive 25): suppressions.runFinished has cognitive complexity 25 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 3 (9 pts), boolean chains 3 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/Run.scala"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"26a4fa5efad9a0d054b24a6eda367aebb1b707a86866fb4321a824e3b0a40673"}},{"ruleId":"D2","level":"warning","message":{"text":"Denotations.staticRef (cognitive 25): Denotations.staticRef has cognitive complexity 25 (threshold 15). Drivers by points: if/else 16 (23 pts), boolean chains 1, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/Denotations.scala"},"region":{"startLine":1342}}}],"partialFingerprints":{"codehealthFindingId/v1":"c08732da83f33d7f67ad3aa64ea87cd26300d586a7aa4d18de1f9869c006c661"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassDenotation.computeMemberNames (cognitive 25): ClassDenotation.computeMemberNames has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 5 (10 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/SymDenotations.scala"},"region":{"startLine":2538}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0a3defee2e79a27e1aeb1a3a5f95b06603ffdfd473fdc55993af99927c13486"}},{"ruleId":"D2","level":"warning","message":{"text":"Type.dealias (cognitive 25): Type.dealias has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (15 pts), match/switch 3 (7 pts), boolean chains 3 (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":"compiler/src/dotty/tools/dotc/core/Types.scala"},"region":{"startLine":1547}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bccd9abc0144aa0a1048fb594b8e8f4bb8ec4ef71d9d4839a4f47d71e5f7079"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassfileParser.parseAnnotArg (cognitive 25): ClassfileParser.parseAnnotArg has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (19 pts), match/switch 2 (4 pts), loops 1 (2 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":"compiler/src/dotty/tools/dotc/core/classfile/ClassfileParser.scala"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9a3173ffaebb7998c60d568995937dd83567e4fe8f0f209345689b611db93bc"}},{"ruleId":"D2","level":"warning","message":{"text":"JavaParser.annotation (cognitive 25): JavaParser.annotation has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (13 pts), match/switch 3 (5 pts), loops 2 (4 pts), boolean chains 3 (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":"compiler/src/dotty/tools/dotc/parsing/JavaParsers.scala"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"f33ad5b6d77e1d97e8b0297e7547065ef0eb6629e1c122fa8cdf3f850e62a2b0"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.infixOps (cognitive 25): Parser.infixOps has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 7, 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":"compiler/src/dotty/tools/dotc/parsing/Parsers.scala"},"region":{"startLine":1229}}}],"partialFingerprints":{"codehealthFindingId/v1":"04959479c8013c35f12428b7761dc34589387a766d5b3aed9b35ad89a2612bfa"}},{"ruleId":"D2","level":"warning","message":{"text":"Scanner.getFraction (cognitive 25): Scanner.getFraction has cognitive complexity 25 (threshold 15). Drivers by points: boolean chains 11, if/else 6 (10 pts), loops 2 (4 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/parsing/Scanners.scala"},"region":{"startLine":1488}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d2c744a1b08ef10f451eecf1dbc1df0fd0f63e0cd198756b6852877fef7010a"}},{"ruleId":"D2","level":"warning","message":{"text":"MessageRendering.messageAndPos (cognitive 25): MessageRendering.messageAndPos has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (19 pts), boolean chains 3, loops 1 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/reporting/MessageRendering.scala"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"159efce1a40793be5ac33c02849d35fa8239e29629a8e83fd09a72263aeb2be1"}},{"ruleId":"D2","level":"warning","message":{"text":"CheckUnused.transformOther (cognitive 25): CheckUnused.transformOther has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 4 (10 pts), loops 1 (2 pts), boolean chains 1 (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":"compiler/src/dotty/tools/dotc/transform/CheckUnused.scala"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"60c2d9cab390f2e4fdc048740322187d4c2a38ff719dfe658f9c1edbe14686ea"}},{"ruleId":"D2","level":"warning","message":{"text":"Mixin.transformSym (cognitive 25): Mixin.transformSym has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 5, loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/Mixin.scala"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"eea3366d71dc4d6485d4c89fbcfa0b0c87255bdc84a34090ee0d4e17a7dfeb3d"}},{"ruleId":"D2","level":"warning","message":{"text":"PostTyperTransformer.processValOrDefDef (cognitive 25): PostTyperTransformer.processValOrDefDef has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (21 pts), boolean chains 3, match/switch 1 (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/PostTyper.scala"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dcf10c1851593065cd45a55734e239f28ed800439e786a0e00b1f75d31c1d75"}},{"ruleId":"D2","level":"warning","message":{"text":"Checking.checkNoPrivateLeaks (cognitive 25): Checking.checkNoPrivateLeaks has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 7, match/switch 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/Checking.scala"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8144bfe55eec096158a080ae91d6f96fa6499f04e676e2a30efba7ff5664d1f"}},{"ruleId":"D2","level":"warning","message":{"text":"Checking.checkAndAdaptExperimentalImports (cognitive 25): Checking.checkAndAdaptExperimentalImports has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9, match/switch 5 (9 pts), loops 2 (4 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":"compiler/src/dotty/tools/dotc/typer/Checking.scala"},"region":{"startLine":932}}}],"partialFingerprints":{"codehealthFindingId/v1":"868b0944800655bb3d806a8f423c9f930569557e654d4770ddd8bfaed9ddbbd6"}},{"ruleId":"D2","level":"warning","message":{"text":"Deriver.processDerivedInstance (cognitive 25): Deriver.processDerivedInstance has cognitive complexity 25 (threshold 15). Drivers by points: if/else 16 (18 pts), boolean chains 4, loops 2, 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":"compiler/src/dotty/tools/dotc/typer/Deriving.scala"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1050f9ac533931d9a9823561406a448446fa8f2c998ecf6edd52d30d147e21c"}},{"ruleId":"D2","level":"warning","message":{"text":"Inferencing.couldInstantiateTypeVar (cognitive 25): Inferencing.couldInstantiateTypeVar has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 5 (15 pts), if/else 6 (7 pts), 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":"compiler/src/dotty/tools/dotc/typer/Inferencing.scala"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eef878ca6dc96b3e6aa4310bbbee8ebe346e09591117693934d2a96f4cfc2b9"}},{"ruleId":"D2","level":"warning","message":{"text":"ProtoTypes.normalize (cognitive 25): ProtoTypes.normalize has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (19 pts), match/switch 2 (4 pts), boolean chains 2 (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":"compiler/src/dotty/tools/dotc/typer/ProtoTypes.scala"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"124d56814a4b3f7504e3fae26813976b89af8c8cab9ed5b129fa80634266aeb0"}},{"ruleId":"D2","level":"warning","message":{"text":"Signatures.applyCallInfo (cognitive 25): Signatures.applyCallInfo has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (16 pts), match/switch 5 (8 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/util/Signatures.scala"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c432b48516cb88cf84bd53e88d3ca2d6e6cefca620b45777282103914f0d9b8"}},{"ruleId":"D2","level":"warning","message":{"text":"StringParsers.parseLong (cognitive 25): StringParsers.parseLong has cognitive complexity 25 (threshold 15). Drivers by points: if/else 17 (22 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"library/src/scala/collection/StringParsers.scala"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"e45d85787ea32b3847afba238c2e444b9d427d5ce071b8924ac6b914e16c8d24"}},{"ruleId":"D2","level":"warning","message":{"text":"DefaultPromise.zipWith (cognitive 25): DefaultPromise.zipWith has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (13 pts), error handling 2 (8 pts), match/switch 2 (4 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/concurrent/impl/Promise.scala"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c20ca3cf92f2a00274d203b4e165d588b72c1db8f76542324d528cf1d9aa4ed"}},{"ruleId":"D2","level":"warning","message":{"text":"OverrideCompletions.implementAllFor (cognitive 25): OverrideCompletions.implementAllFor has cognitive complexity 25 (threshold 15). Drivers by points: if/else 16 (18 pts), boolean chains 5, 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":"presentation-compiler/src/main/dotty/tools/pc/completions/OverrideCompletions.scala"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff0f5b3c5e7dd1c542c0d344428775db04cb1be24e14fc55823bf4c711c59f40"}},{"ruleId":"D2","level":"warning","message":{"text":"ShortenedTypePrinter.defaultMethodSignature (cognitive 25): ShortenedTypePrinter.defaultMethodSignature has cognitive complexity 25 (threshold 15). Drivers by points: if/else 20 (23 pts), match/switch 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":"presentation-compiler/src/main/dotty/tools/pc/printer/ShortenedTypePrinter.scala"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"07f9a2bcba8bcf198e40f5274d30ab5c305ed8526255ede9035791aa8307e17f"}},{"ruleId":"D2","level":"warning","message":{"text":"BCSignatureGen.getGenericSignature (cognitive 24): BCSignatureGen.getGenericSignature has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (17 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":"compiler/src/dotty/tools/backend/jvm/BCodeHelpers.scala"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dcb5ad407cf8672307519d7ebd138b7c34616fb35ff30e522d1c370bb1eae29"}},{"ruleId":"D2","level":"warning","message":{"text":"PlainSkelBuilder.initJClass (cognitive 24): PlainSkelBuilder.initJClass has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 4, 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":"compiler/src/dotty/tools/backend/jvm/BCodeSkelBuilder.scala"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f3824077ab91b3e96150412a89b4caab60e5ae2aee87e4bb3f2ec73c17b810a"}},{"ruleId":"D2","level":"warning","message":{"text":"PrimitiveBox.checkPrimitiveBox (cognitive 24): PrimitiveBox.checkPrimitiveBox has cognitive complexity 24 (threshold 15). Drivers by points: loops 4 (12 pts), if/else 6 (8 pts), boolean chains 2, match/switch 2 (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":"compiler/src/dotty/tools/backend/jvm/opt/BoxUnbox.scala"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"49c12162fab169373f3d5f094f56f28a2f1fc09ed89fea649f5ac22deeb089e4"}},{"ruleId":"D2","level":"warning","message":{"text":"CopyProp.copyPropagation (cognitive 24): CopyProp.copyPropagation has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 3, loops 2 (3 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":"compiler/src/dotty/tools/backend/jvm/opt/CopyProp.scala"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e30916886ddd261256371f1d1715edbbb2a548ed24b2f30969c5001e3d78fa4"}},{"ruleId":"D2","level":"warning","message":{"text":"NamerOps.addConstructorProxies (cognitive 24): NamerOps.addConstructorProxies has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 2 (7 pts), boolean chains 3, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/NamerOps.scala"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1ce76e7a2bd5df12cbe6c82f2d5d42785d3f421c60468d77ef071aabe7b8d82"}},{"ruleId":"D2","level":"warning","message":{"text":"PatternTypeConstrainer.constrainSimplePatternType (cognitive 24): PatternTypeConstrainer.constrainSimplePatternType has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 4, match/switch 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":"compiler/src/dotty/tools/dotc/core/PatternTypeConstrainer.scala"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"084674da800cb8fb4c35b7f379404c06a388bd5f5436747c1c2947a9bc52e81e"}},{"ruleId":"D2","level":"warning","message":{"text":"Symbol.sourceSymbol (cognitive 24): Symbol.sourceSymbol has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (16 pts), match/switch 3 (6 pts), boolean chains 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":"compiler/src/dotty/tools/dotc/core/Symbols.scala"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2c06d36be995ba1a57d23d4bcf63ad924a04548ce751f247179d005a81c4462"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeApplications.translateParameterized (cognitive 24): TypeApplications.translateParameterized has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (20 pts), match/switch 2 (4 pts) (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/TypeApplications.scala"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffffc851419d81817645682d7bcc8f62499adbeebf5d6054dfc354e7eba9ec07"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeComparer.distributeAnd (cognitive 24): TypeComparer.distributeAnd has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (16 pts), match/switch 4 (7 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":"compiler/src/dotty/tools/dotc/core/TypeComparer.scala"},"region":{"startLine":2861}}}],"partialFingerprints":{"codehealthFindingId/v1":"209605507d4829f30cab3d7147b26b193909f2f2a38cf5be90bf9d1a10950abd"}},{"ruleId":"D2","level":"warning","message":{"text":"SAMType.deconstruct (cognitive 24): SAMType.deconstruct has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 7, match/switch 2 (4 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"compiler/src/dotty/tools/dotc/core/Types.scala"},"region":{"startLine":6033}}}],"partialFingerprints":{"codehealthFindingId/v1":"17d04e552cf8073c3721dc96d0246e6810b925934b96aa95527b6881b3788669"}},{"ruleId":"D2","level":"warning","message":{"text":"ByteCodecs.encode8to7 (cognitive 24): ByteCodecs.encode8to7 has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (23 pts), loops 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":"compiler/src/dotty/tools/dotc/core/classfile/ByteCodecs.scala"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"49b8f8255e6d262c8a91326681f3cb3b0ff6bee1657b1e8389dd25daab001fa7"}},{"ruleId":"D2","level":"warning","message":{"text":"Inliner.paramBindingDef (cognitive 24): Inliner.paramBindingDef has cognitive complexity 24 (threshold 15). Drivers by points: if/else 16 (18 pts), match/switch 3 (5 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"compiler/src/dotty/tools/dotc/inlines/Inliner.scala"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"a44a0f8a3c8989c6f82860847031f54d28b0a8d6b41ff81e7e62f9f94eb2bc80"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.followingIsLambdaAfterColon (cognitive 24): Parser.followingIsLambdaAfterColon has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 6, 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":"compiler/src/dotty/tools/dotc/parsing/Parsers.scala"},"region":{"startLine":1105}}}],"partialFingerprints":{"codehealthFindingId/v1":"af64263a595deaa686a7b5ed71f916f49f1b5bade09c25176998934305a55a3f"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.mkImport (cognitive 24): Parser.mkImport has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 2 (6 pts), boolean chains 2, loops 1 (2 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":"compiler/src/dotty/tools/dotc/parsing/Parsers.scala"},"region":{"startLine":4160}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf15c95f5273d76b77d372bc729a2efd55a3e692c396c39ac6cceb0585c96753"}},{"ruleId":"D2","level":"warning","message":{"text":"PlainPrinter.kindString (cognitive 24): PlainPrinter.kindString has cognitive complexity 24 (threshold 15). Drivers by points: if/else 22 (23 pts), boolean chains 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/printing/PlainPrinter.scala"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffb5040a9dd8d910ba8c269c0f764893c0cc56ef2ad25c0ab674e06d7dfe5949"}},{"ruleId":"D2","level":"warning","message":{"text":"InfoPrinter.pprint (cognitive 24): InfoPrinter.pprint has cognitive complexity 24 (threshold 15). Drivers by points: if/else 22, match/switch 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":"compiler/src/dotty/tools/dotc/semanticdb/PPrint.scala"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"defa6e525cd792a0beee09c49d2af1761ee1a60e53508d776c2a54a279c85d67"}},{"ruleId":"D2","level":"warning","message":{"text":"Translator.emit (cognitive 24): Translator.emit has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (15 pts), match/switch 4 (8 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":"compiler/src/dotty/tools/dotc/transform/PatternMatcher.scala"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"7656db1081d9dfbee5e44c0169a81e4c5d565bb133f5e749f70bbf1d72a0b019"}},{"ruleId":"D2","level":"warning","message":{"text":"Checker.withDefinedSyms (cognitive 24): Checker.withDefinedSyms has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (14 pts), match/switch 3 (9 pts), loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/TreeChecker.scala"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"af535ab95ef60762accb49792cca4090bfb17f588fee2ec17806e44aa8f6ed92"}},{"ruleId":"D2","level":"warning","message":{"text":"Objects.init (cognitive 24): Objects.init has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (17 pts), match/switch 4 (5 pts), boolean chains 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":"compiler/src/dotty/tools/dotc/transform/init/Objects.scala"},"region":{"startLine":2112}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1be8f5bfa5efad04fc211fc4828e25b1fc8931768b3d8e20ce5a1e29100c7e3"}},{"ruleId":"D2","level":"warning","message":{"text":"SpaceEngine.minus (cognitive 24): SpaceEngine.minus has cognitive complexity 24 (threshold 15). Drivers by points: if/else 15 (20 pts), boolean chains 3, match/switch 1 (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":"compiler/src/dotty/tools/dotc/transform/patmat/Space.scala"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca5a1f81da9ed7a6577e291308be266b2e9b5b902a46a2acaf6b4c63978f887f"}},{"ruleId":"D2","level":"warning","message":{"text":"PrepJSExports.checkExportTarget (cognitive 24): PrepJSExports.checkExportTarget has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (15 pts), boolean chains 9 (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":"compiler/src/dotty/tools/dotc/transform/sjs/PrepJSExports.scala"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0573184b5a7fece9b8939b249010726f4b7c354efa5848a69c591757db4d1f5"}},{"ruleId":"D2","level":"warning","message":{"text":"ScalaJSPrepJSInteropTransformer.transformStatOrExpr (cognitive 24): ScalaJSPrepJSInteropTransformer.transformStatOrExpr has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 3 (5 pts), boolean chains 4 (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":"compiler/src/dotty/tools/dotc/transform/sjs/PrepJSInterop.scala"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d7fbaaae179d2d4f053ddf4ba0c6cfa5e2e964a8fcc5fa0060cc799b969111c"}},{"ruleId":"D2","level":"warning","message":{"text":"Synthesizer.productMirror (cognitive 24): Synthesizer.productMirror has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (18 pts), match/switch 3 (4 pts), loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/Synthesizer.scala"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"01de960c2805d8fbfd8f08111242f0b3f2d491402c7c01bdd4926eabf205bc8e"}},{"ruleId":"D2","level":"warning","message":{"text":"Typer.typedStats (cognitive 24): Typer.typedStats has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 5 (9 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/Typer.scala"},"region":{"startLine":4199}}}],"partialFingerprints":{"codehealthFindingId/v1":"32b1aef119cf36c7d8b34ee1660f53c49a86268bdd387675d7b1e0187317f128"}},{"ruleId":"D2","level":"warning","message":{"text":"StringParsers.parseInt (cognitive 24): StringParsers.parseInt has cognitive complexity 24 (threshold 15). Drivers by points: if/else 17 (22 pts), boolean chains 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":"library/src/scala/collection/StringParsers.scala"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"060266516e444ecd75b897b6310e82205ee86896daa5fc8e6fd4db6d8df38839"}},{"ruleId":"D2","level":"warning","message":{"text":"FromDigits.integerFromDigits (cognitive 24): FromDigits.integerFromDigits has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 8, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/util/FromDigits.scala"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e2c43998d75cdd4bf4e458801a0c43caf51c3247351975aeb642d31909fc4ec"}},{"ruleId":"D2","level":"warning","message":{"text":"PropertiesTrait.isJavaAtLeast (cognitive 24): PropertiesTrait.isJavaAtLeast has cognitive complexity 24 (threshold 15). Drivers by points: if/else 15 (19 pts), boolean chains 3, match/switch 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":"library/src/scala/util/Properties.scala"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"e808806f895e8e4116164170c339379397fe041f901b4896c83213c1cc96e330"}},{"ruleId":"D2","level":"warning","message":{"text":"AutoImportsProvider.autoImports (cognitive 24): AutoImportsProvider.autoImports has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (13 pts), loops 2 (5 pts), match/switch 3 (5 pts), boolean chains 1 (nesting depth added 7). 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":"presentation-compiler/src/main/dotty/tools/pc/AutoImportsProvider.scala"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5c5f080ee99e82274b28c4462cb4ec4a810da47f3a0afea454dfbaafe8dc61a"}},{"ruleId":"D2","level":"warning","message":{"text":"ShortenedTypePrinter.paramLabel (cognitive 24): ShortenedTypePrinter.paramLabel has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (15 pts), match/switch 3 (6 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"presentation-compiler/src/main/dotty/tools/pc/printer/ShortenedTypePrinter.scala"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"24ef9a57cb2fa53a056af86a6dfb88ca0a29e2dc9a2c129ef58478ef265e6a00"}},{"ruleId":"D2","level":"warning","message":{"text":"ProductToStringProbe.runtimeClassSymbol (cognitive 24): ProductToStringProbe.runtimeClassSymbol has cognitive complexity 24 (threshold 15). Drivers by points: if/else 17 (23 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"repl/src/dotty/tools/repl/Rendering.scala"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"12f7d205e279b079fb5e298794572b57c4903a97019249e7ab60efa81c1ac7e5"}},{"ruleId":"D2","level":"warning","message":{"text":"HtmlRenderer.mkFrame (cognitive 24): HtmlRenderer.mkFrame has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (18 pts), match/switch 4 (6 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":"scaladoc/src/dotty/tools/scaladoc/renderers/HtmlRenderer.scala"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d7ec763293a9c607ad769c4d7afe88b03affe2eb7b481630a4ecf007c78cef2"}},{"ruleId":"D2","level":"warning","message":{"text":"Scaladoc2AnchorCreator.signatureAnchor (cognitive 24): Scaladoc2AnchorCreator.signatureAnchor has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (14 pts), match/switch 6 (10 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":"scaladoc/src/dotty/tools/scaladoc/tasty/Scaladoc2AnchorCreator.scala"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a4a1ef3216029c11287b3860c73c35110ab73d637d11fc027aee28307309761"}},{"ruleId":"D2","level":"warning","message":{"text":"TypesSupport.emitFunctionArrow (cognitive 24): TypesSupport.emitFunctionArrow has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (18 pts), match/switch 2 (5 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scaladoc/src/dotty/tools/scaladoc/tasty/TypesSupport.scala"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d2d753fc5b266a9b783d833cb807f614296890aedd4fd6d0b67cec69dd19ace"}},{"ruleId":"D2","level":"warning","message":{"text":"AliasSet.-= (cognitive 23): AliasSet.-= has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (20 pts), match/switch 2 (3 pts) (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":"compiler/src/dotty/tools/backend/jvm/analysis/AliasingAnalyzer.scala"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"97ba727fa750c64923125c12e7f83e45ed5d18b013864c1db9e2c7a0586bf36e"}},{"ruleId":"D2","level":"warning","message":{"text":"LambdaMetaFactoryCall.unapply (cognitive 23): LambdaMetaFactoryCall.unapply has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 4, match/switch 2 (3 pts) (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/backend/jvm/analysis/AnalysisUtils.scala"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b96a0274914d91109c601bb09653000b6a63eb8269c0c309cdbed465d167e9f"}},{"ruleId":"D2","level":"warning","message":{"text":"JSCodeGen.genMatch (cognitive 23): JSCodeGen.genMatch has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (11 pts), match/switch 6 (10 pts), boolean chains 1, 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":"compiler/src/dotty/tools/backend/sjs/JSCodeGen.scala"},"region":{"startLine":3539}}}],"partialFingerprints":{"codehealthFindingId/v1":"beb32b89ed6377ce413945be47b472cd90d674a5917699c450a058bf69f98711"}},{"ruleId":"D2","level":"warning","message":{"text":"JSExportsGen.genCallDefaultGetter (cognitive 23): JSExportsGen.genCallDefaultGetter has cognitive complexity 23 (threshold 15). Drivers by points: if/else 15 (21 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/backend/sjs/JSExportsGen.scala"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"88b72430dd94ce95cc40ab7beae70cf6f51311322f2e49a7fc42986c46a5faa4"}},{"ruleId":"D2","level":"warning","message":{"text":"Positioned.envelope (cognitive 23): Positioned.envelope has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (19 pts), match/switch 2 (3 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":"compiler/src/dotty/tools/dotc/ast/Positioned.scala"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"780a21cb8d79b834ae4062483a6980d9d3c856ad93a4f40724f5b06903557d32"}},{"ruleId":"D2","level":"warning","message":{"text":"CaptureChecker.markFree (cognitive 23): CaptureChecker.markFree has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 5 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/cc/CheckCaptures.scala"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd5ea3921dedb10e0e025f7b0445f5d3175005a0aebfcf10b00ceef7eb0d8139"}},{"ruleId":"D2","level":"warning","message":{"text":"CaptureChecker.markFreeTypeArgs (cognitive 23): CaptureChecker.markFreeTypeArgs has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 2, loops 1 (2 pts), match/switch 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/cc/CheckCaptures.scala"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"e53ae738e632219663de1df50bb332ff8bce5220449e9576716a1d7c8b405088"}},{"ruleId":"D2","level":"warning","message":{"text":"CaptureChecker.refineConstructorInstance (cognitive 23): CaptureChecker.refineConstructorInstance has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 1, loops 1, match/switch 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/cc/CheckCaptures.scala"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"926f9ec159913ddc14828d553fc6d24e413cdd27dadc186792b8e48b8c34f886"}},{"ruleId":"D2","level":"warning","message":{"text":"CaptureChecker.checkStatefulInheritance (cognitive 23): CaptureChecker.checkStatefulInheritance has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (19 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 13). 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":"compiler/src/dotty/tools/dotc/cc/CheckCaptures.scala"},"region":{"startLine":2484}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff30f9f6e0e6718ae7470e864c0dc45d46b7e1767c2c85aab614b0c0501ba908"}},{"ruleId":"D2","level":"warning","message":{"text":"SymDenotations.traceInvalid (cognitive 23): SymDenotations.traceInvalid has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (15 pts), error handling 1 (4 pts), boolean chains 3, 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":"compiler/src/dotty/tools/dotc/core/SymDenotations.scala"},"region":{"startLine":2884}}}],"partialFingerprints":{"codehealthFindingId/v1":"30dd7a15553ff1efbf0df94d6168e53834704ff37e54927eda7d4d61c8fd9d30"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeErasure.transformInfo (cognitive 23): TypeErasure.transformInfo has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"compiler/src/dotty/tools/dotc/core/TypeErasure.scala"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"a659ceeaecc3aeb5824b0238652eec7d13a7a220b9160edfa661cb88a7695c47"}},{"ruleId":"D2","level":"warning","message":{"text":"NamedType.argForParam (cognitive 23): NamedType.argForParam has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 2 (5 pts), boolean chains 2, loops 1 (2 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":"compiler/src/dotty/tools/dotc/core/Types.scala"},"region":{"startLine":2781}}}],"partialFingerprints":{"codehealthFindingId/v1":"e538576509d3a9015b7f7834608744c74d09ae1ef3ec136946970c75b55ddd2e"}},{"ruleId":"D2","level":"warning","message":{"text":"NamedType.withPrefix (cognitive 23): NamedType.withPrefix has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/Types.scala"},"region":{"startLine":2903}}}],"partialFingerprints":{"codehealthFindingId/v1":"de510f623ca63b93a4d4c7229f5b615c79f4cfcf24d2f46fb863ae419d1f4d5a"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeAccumulator.foldOver (cognitive 23): TypeAccumulator.foldOver has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (18 pts), match/switch 2 (4 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":"compiler/src/dotty/tools/dotc/core/Types.scala"},"region":{"startLine":6836}}}],"partialFingerprints":{"codehealthFindingId/v1":"20350b60c5810a6390c875026ac8d444dc473e2de7106fbc9a85de85a76e9b61"}},{"ruleId":"D2","level":"warning","message":{"text":"JavaScanner.getlitch (cognitive 23): JavaScanner.getlitch has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/parsing/JavaScanners.scala"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a8912c8ec4a5ef7854c626bf139eaf62a65a2e22e434ea01b8c6da0938304ab"}},{"ruleId":"D2","level":"warning","message":{"text":"PlainPrinter.toTextCapability (cognitive 23): PlainPrinter.toTextCapability has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (15 pts), match/switch 4 (7 pts), boolean chains 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/printing/PlainPrinter.scala"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"29e40d77cbe83f28c4154f6440fa8ecbab93c7d2c37014a8b889943297167f02"}},{"ruleId":"D2","level":"warning","message":{"text":"MissingImplicitArgument.msg (cognitive 23): MissingImplicitArgument.msg has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 7 (12 pts), if/else 11 (nesting depth added 5). 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":"compiler/src/dotty/tools/dotc/reporting/messages.scala"},"region":{"startLine":3182}}}],"partialFingerprints":{"codehealthFindingId/v1":"85e401156cae8f856432fbd1a05971d9745fc86dc85b86409dddf896a75d018b"}},{"ruleId":"D2","level":"warning","message":{"text":"ExtractAPICollector.computeType (cognitive 23): ExtractAPICollector.computeType has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (15 pts), match/switch 4 (7 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":"compiler/src/dotty/tools/dotc/sbt/ExtractAPI.scala"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"586c73248b54596ee1aa07c19e5a631dfb2d20201a979bac113721b1bf38f999"}},{"ruleId":"D2","level":"warning","message":{"text":"Scala3.namePresentInSource (cognitive 23): Scala3.namePresentInSource has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/semanticdb/Scala3.scala"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6ebfa56ff802174e5d9e9875632808640da7c7f00c44a395f85ea4a1bd30ce4"}},{"ruleId":"D2","level":"warning","message":{"text":"SemanticdbInputStream.readRawBytesSlowPath (cognitive 23): SemanticdbInputStream.readRawBytesSlowPath has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 3 (7 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/semanticdb/internal/SemanticdbInputStream.scala"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a7defd9c54d46e5fc1399b2745d9b3b98f6ad650ce1e9bc71d675630b11200c"}},{"ruleId":"D2","level":"warning","message":{"text":"Boxing.adaptClosure (cognitive 23): Boxing.adaptClosure has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 4 (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":"compiler/src/dotty/tools/dotc/transform/Erasure.scala"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"95f17bb58f13a2a9505c7cab3924c3b78bfd3c8f5e4182a52e0bab5ac300adc9"}},{"ruleId":"D2","level":"warning","message":{"text":"ExpandSAMs.transformBlock (cognitive 23): ExpandSAMs.transformBlock has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 4 (9 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":"compiler/src/dotty/tools/dotc/transform/ExpandSAMs.scala"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad6057ca5d7ebf03cd0ebb1160786bbc0c930a3fa80225094ce5284a34d47df3"}},{"ruleId":"D2","level":"warning","message":{"text":"ExplicitOuter.transformTemplate (cognitive 23): ExplicitOuter.transformTemplate has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 2 (4 pts), boolean chains 3, match/switch 1 (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":"compiler/src/dotty/tools/dotc/transform/ExplicitOuter.scala"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf0f5043cb0b73a49a6a85b418dc100341bde530dfa631e81771acb87f807edd"}},{"ruleId":"D2","level":"warning","message":{"text":"InliningTreeMap.transform (cognitive 23): InliningTreeMap.transform has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (14 pts), match/switch 4 (9 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":"compiler/src/dotty/tools/dotc/transform/Inlining.scala"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"55b0ca540b989e0304e7d8e5b669f194a57c04980e93b728f5404a149630627d"}},{"ruleId":"D2","level":"warning","message":{"text":"MacroAnnotations.expandAnnotations (cognitive 23): MacroAnnotations.expandAnnotations has cognitive complexity 23 (threshold 15). Drivers by points: loops 3 (12 pts), if/else 6 (7 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/MacroAnnotations.scala"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8911399af58d32dd8a928ba891db1000f17cf8d01ddf316519dd8274707c72b"}},{"ruleId":"D2","level":"warning","message":{"text":"Conversion.verify (cognitive 23): Conversion.verify has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 13, match/switch 4 (6 pts), if/else 3, loops 1 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/localopt/FormatChecker.scala"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dbfd183d7610f2c3fb16b18de89eb92bf3d0bc76622d3fc62fe38d12fcce425"}},{"ruleId":"D2","level":"warning","message":{"text":"ImportSuggestions.importSuggestions (cognitive 23): ImportSuggestions.importSuggestions has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 4, match/switch 4, loops 1 (2 pts), error handling 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/ImportSuggestions.scala"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ce7701f36859322312736d643b2752fdb05c857b74cff8377f8708fe63dba88"}},{"ruleId":"D2","level":"warning","message":{"text":"Namer.checkDefName (cognitive 23): Namer.checkDefName has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 12, if/else 7 (11 pts) (nesting depth added 4). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/Namer.scala"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"308882db0f265c08b320c741c2816f44b889be0f34d68ac41bf3913176115f86"}},{"ruleId":"D2","level":"warning","message":{"text":"Namer.completeTrailingParamss (cognitive 23): Namer.completeTrailingParamss has cognitive complexity 23 (threshold 15). Drivers by points: loops 5 (12 pts), if/else 4 (7 pts), boolean chains 4 (nesting depth added 10). 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":"compiler/src/dotty/tools/dotc/typer/Namer.scala"},"region":{"startLine":2094}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6ea10a3a44fce54f1a11eb1105494446e92c2d5fd4e745b8c55eff2e8f5c797"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeDefCompleter.typeSig (cognitive 23): TypeDefCompleter.typeSig has cognitive complexity 23 (threshold 15). Drivers by points: if/else 15 (16 pts), match/switch 4 (5 pts), boolean chains 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":"compiler/src/dotty/tools/dotc/typer/Namer.scala"},"region":{"startLine":1140}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7c84ac2884927393cf1def3fd5d561a785f00836d85356f791419ecefa2a8be"}},{"ruleId":"D2","level":"warning","message":{"text":"Typer.tryInsertApplyOrImplicit (cognitive 23): Typer.tryInsertApplyOrImplicit has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (16 pts), match/switch 3 (5 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/Typer.scala"},"region":{"startLine":4357}}}],"partialFingerprints":{"codehealthFindingId/v1":"230638b884701c0b7a18c7c04f0895d16d4612fc98e8c25e984ba891d41b757f"}},{"ruleId":"D2","level":"warning","message":{"text":"PcSymbolSearch.collectAllExtensionParamSymbols (cognitive 23): PcSymbolSearch.collectAllExtensionParamSymbols has cognitive complexity 23 (threshold 15). Drivers by points: loops 3 (9 pts), match/switch 3 (8 pts), if/else 3 (4 pts), boolean chains 2 (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":"presentation-compiler/src/main/dotty/tools/pc/PcSymbolSearch.scala"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e23d207fbe4dfb90166e3024dabc6731f86d87e4f6788905f8d06495243d06e"}},{"ruleId":"D2","level":"warning","message":{"text":"Completions.enrichWithSymbolSearch (cognitive 23): Completions.enrichWithSymbolSearch has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 9, match/switch 1 (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":"presentation-compiler/src/main/dotty/tools/pc/completions/Completions.scala"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"40e52327645091c175014465d21839d46b58e90573bb416df31b09356f72bd09"}},{"ruleId":"D2","level":"warning","message":{"text":"SnippetExpectations.validateLevel (cognitive 23): SnippetExpectations.validateLevel has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (19 pts), loops 2 (4 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":"scaladoc/src/dotty/tools/scaladoc/snippets/SnippetExpectations.scala"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"127e7a7754dd136813f46934ee9772cef275d8c5a68aa5619df0e5e5a7442df6"}},{"ruleId":"D2","level":"warning","message":{"text":"PlainBodyBuilder.genEqEqPrimitive (cognitive 22): PlainBodyBuilder.genEqEqPrimitive has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 5, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/backend/jvm/BCodeBodyBuilder.scala"},"region":{"startLine":1685}}}],"partialFingerprints":{"codehealthFindingId/v1":"08bd84dafa215432e234c1129c29cd075eac4bceef8f5e49271518f51727a2a4"}},{"ruleId":"D2","level":"warning","message":{"text":"BTypeLoader.buildNestedInfo (cognitive 22): BTypeLoader.buildNestedInfo has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/backend/jvm/BTypeLoader.scala"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1ddc1982656e8b8e797eb9de8597d58c62476f1f57a300dba16b6f2d47f3153"}},{"ruleId":"D2","level":"warning","message":{"text":"LocalOptImpls.compactLocalVariables (cognitive 22): LocalOptImpls.compactLocalVariables has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (11 pts), match/switch 3 (7 pts), loops 3, boolean chains 1 (nesting depth added 6). 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":"compiler/src/dotty/tools/backend/jvm/opt/LocalOptimizer.scala"},"region":{"startLine":939}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f292e0fac7210d8ee2641dd5ec7546c8fc9d7e1d359df9ceab9c680b65a8fb1"}},{"ruleId":"D2","level":"warning","message":{"text":"desugar.getVariables (cognitive 22): desugar.getVariables has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 2 (5 pts), boolean chains 4, match/switch 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/ast/Desugar.scala"},"region":{"startLine":2632}}}],"partialFingerprints":{"codehealthFindingId/v1":"d66be4c6565dc7bac8cabf15c99aea76ebb1a5bfceafb13ca8f67ade7a5e6004"}},{"ruleId":"D2","level":"warning","message":{"text":"CaptureChecker.interpolate (cognitive 22): CaptureChecker.interpolate has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 5 (9 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":"compiler/src/dotty/tools/dotc/cc/CheckCaptures.scala"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e1537d91d99a85c72c6e2c3f11b30381a7cc26f68633c2bac4cb5233a79ceca"}},{"ruleId":"D2","level":"warning","message":{"text":"SepCheck.sepApplyError (cognitive 22): SepCheck.sepApplyError has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (15 pts), match/switch 4, boolean chains 3 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/cc/SepCheck.scala"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"789cbfef77e4c5e9278f6a4ab0b0c77cb106dbe70b0e57f088664eab89e8886d"}},{"ruleId":"D2","level":"warning","message":{"text":"CheckRealizable.realizability (cognitive 22): CheckRealizable.realizability has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 2, match/switch 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":"compiler/src/dotty/tools/dotc/core/CheckRealizable.scala"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"13e9ca635e0814f03fdd0858c07464475efb1d414823c99fae99421e3dcffa48"}},{"ruleId":"D2","level":"warning","message":{"text":"ConstraintHandling.addOneBound (cognitive 22): ConstraintHandling.addOneBound has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 4, 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":"compiler/src/dotty/tools/dotc/core/ConstraintHandling.scala"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"6331704428e9afdd6ed20c47a699d0183435197569c90e4efe5b7321376cbdb2"}},{"ruleId":"D2","level":"warning","message":{"text":"PhasesBase.fusePhases (cognitive 22): PhasesBase.fusePhases has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 2 (5 pts), match/switch 1 (5 pts), boolean chains 2 (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":"compiler/src/dotty/tools/dotc/core/Phases.scala"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"6961e3e90ec10151e96de4baf1ad416ee4302c9f6e14ac86cbb9f5e12a3653f4"}},{"ruleId":"D2","level":"warning","message":{"text":"SymbolLoader.complete (cognitive 22): SymbolLoader.complete has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (14 pts), error handling 4, boolean chains 2, match/switch 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/SymbolLoaders.scala"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"1005caeafe24a9f99c44f850e0a767132361cd62422db5743488328358186f62"}},{"ruleId":"D2","level":"warning","message":{"text":"ApproximatingTypeMap.derivedRefinedType (cognitive 22): ApproximatingTypeMap.derivedRefinedType has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (14 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":"compiler/src/dotty/tools/dotc/core/Types.scala"},"region":{"startLine":6606}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4d590ee8d5ee2e1e5a05ea294ed77b355746a90d3b13ae63bf44103b6e34e38"}},{"ruleId":"D2","level":"warning","message":{"text":"Inliner.computeThisBindings (cognitive 22): Inliner.computeThisBindings has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 2 (6 pts), boolean chains 3, 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":"compiler/src/dotty/tools/dotc/inlines/Inliner.scala"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"3469643e9c31e12811288272247cf97c0c99e3a45dcf0bb5964aac1efd7394cb"}},{"ruleId":"D2","level":"warning","message":{"text":"JavaScanner.getFraction (cognitive 22): JavaScanner.getFraction has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 8, loops 2 (4 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/parsing/JavaScanners.scala"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"37025b5ad2d04dc702e1c6f4e0dfc2443ebde8953e004eb69efc7a2b2e4995e8"}},{"ruleId":"D2","level":"warning","message":{"text":"WConf.parseFilter (cognitive 22): WConf.parseFilter has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 5 (13 pts), if/else 5, error handling 1 (3 pts), boolean chains 1 (nesting depth added 10). 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":"compiler/src/dotty/tools/dotc/reporting/WConf.scala"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb96b5f6c32c8eea8bbe0659db252577dda6dadc3fca64ec147437eb30a43b60"}},{"ruleId":"D2","level":"warning","message":{"text":"CheckUnused.resolveScoped (cognitive 22): CheckUnused.resolveScoped has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (11 pts), match/switch 3 (9 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":"compiler/src/dotty/tools/dotc/transform/CheckUnused.scala"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"cee87c18736e1fa03162afec6dac9357f955ab13215453a966c10d16614e6781"}},{"ruleId":"D2","level":"warning","message":{"text":"Typer.typedApply (cognitive 22): Typer.typedApply has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (15 pts), match/switch 3 (4 pts), boolean chains 3 (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":"compiler/src/dotty/tools/dotc/transform/Erasure.scala"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f6a041b4d8d75ef9ae0376f4c9b95e72d58ef948eaa8de873b94d1dc96879b8"}},{"ruleId":"D2","level":"warning","message":{"text":"CoverageTransformer.transform (cognitive 22): CoverageTransformer.transform has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 5, match/switch 1 (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":"compiler/src/dotty/tools/dotc/transform/InstrumentCoverage.scala"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"13b98e05fe7eb857524dc59cdd8276b4ad5553ee8a899f10f3bac7a61096d947"}},{"ruleId":"D2","level":"warning","message":{"text":"Objects.instantiate (cognitive 22): Objects.instantiate has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 3 (7 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":"compiler/src/dotty/tools/dotc/transform/init/Objects.scala"},"region":{"startLine":1402}}}],"partialFingerprints":{"codehealthFindingId/v1":"d63fb9b502616e8882462ea51032998e9b4593fdb044edeb9d9ad52865ec5567"}},{"ruleId":"D2","level":"warning","message":{"text":"Objects.evalType (cognitive 22): Objects.evalType has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 1, match/switch 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/init/Objects.scala"},"region":{"startLine":2043}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae543ac53bfc9e9ffea9760c2f101d70d47aa630d187c318e3270b54750eff69"}},{"ruleId":"D2","level":"warning","message":{"text":"Checking.checkNoDoubleDeclaration (cognitive 22): Checking.checkNoDoubleDeclaration has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 6, loops 1, 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":"compiler/src/dotty/tools/dotc/typer/Checking.scala"},"region":{"startLine":1360}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c8b9b31b578e7e9740b402a1245ef61698802196e99cb31a32bc9a18be618e8"}},{"ruleId":"D2","level":"warning","message":{"text":"Namer.checkNoConflict (cognitive 22): Namer.checkNoConflict has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 7, loops 2 (5 pts) (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/Namer.scala"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd823bd564676c59ac754e8ec37048f9cb461ca049e70016a147be52057d0fad"}},{"ruleId":"D2","level":"warning","message":{"text":"RefChecks.checkOverloadedRestrictions (cognitive 22): RefChecks.checkOverloadedRestrictions has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 3 (5 pts), match/switch 1 (2 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":"compiler/src/dotty/tools/dotc/typer/RefChecks.scala"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"465330c2ab97f4e5b39ca83eebb956a51ea0696db77ad36b1e2569cb52e281a3"}},{"ruleId":"D2","level":"warning","message":{"text":"RefChecks.checkUnaryMethods (cognitive 22): RefChecks.checkUnaryMethods has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 3, match/switch 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/RefChecks.scala"},"region":{"startLine":1110}}}],"partialFingerprints":{"codehealthFindingId/v1":"e82f382188a167d67c30b5e30d62bffc89c6784112cae914c47a760550bb2a16"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeAssigner.accessibleType (cognitive 22): TypeAssigner.accessibleType has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (19 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/TypeAssigner.scala"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7da52f6af754a28cf411f901179e63c5700031b97b2cde38d50745c62a47053"}},{"ruleId":"D2","level":"warning","message":{"text":"Typer.typedTuple (cognitive 22): Typer.typedTuple has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (19 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":"compiler/src/dotty/tools/dotc/typer/Typer.scala"},"region":{"startLine":3886}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba704bf7ea55f33db392fd6aab055cca6c550d7eb04b4d0e7e592094bffb7cdd"}},{"ruleId":"D2","level":"warning","message":{"text":"Traverser.checkVariance (cognitive 22): Traverser.checkVariance has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 4, match/switch 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/VarianceChecker.scala"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f695795f7ab2ca0e292036531a7ae514102f662388c8a2ce0f85120ed2f99a5"}},{"ruleId":"D2","level":"warning","message":{"text":"NumericRange.sum (cognitive 22): NumericRange.sum has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (16 pts), loops 1 (4 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/collection/immutable/NumericRange.scala"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"2025bd2053cc8221d587d581de8c481c404dd79fd582c0d2b073f1e5633f3611"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.tokenize (cognitive 22): Parser.tokenize has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (15 pts), loops 3, boolean chains 2, match/switch 2 (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":"library/src/scala/sys/process/Parser.scala"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"df36bc627531aae8189d08a43b7fdff6d6e51ef69011bcf01b474b36f0411d33"}},{"ruleId":"D2","level":"warning","message":{"text":"OverrideCompletions.toCompletionValue (cognitive 22): OverrideCompletions.toCompletionValue has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 3, 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":"presentation-compiler/src/main/dotty/tools/pc/completions/OverrideCompletions.scala"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"276abce9ff295ab73ca7d205690b6d50b44b354f2fadc637a9b2eafce7c6be20"}},{"ruleId":"D2","level":"warning","message":{"text":"PageSearchEngine.matchPage (cognitive 22): PageSearchEngine.matchPage has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (17 pts), match/switch 2 (3 pts), boolean chains 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":"scaladoc-js/main/src/searchbar/engine/PageSearchEngine.scala"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a8c634b0817bf91f435f8227d867efb1723691da5d365c676b4223c2e378b26"}},{"ruleId":"D2","level":"warning","message":{"text":"MemberLookup.lookupOpt (cognitive 22): MemberLookup.lookupOpt has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (13 pts), match/switch 3 (6 pts), boolean chains 2, error handling 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":"scaladoc/src/dotty/tools/scaladoc/tasty/comments/MemberLookup.scala"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6f8c418b607524acd2b68724628950a4df71f5aa5fc0499c371bacdafe53ce1"}},{"ruleId":"D2","level":"warning","message":{"text":"ClosureOptimizer.rewriteClosureApplyInvocations (cognitive 21): ClosureOptimizer.rewriteClosureApplyInvocations has cognitive complexity 21 (threshold 15). Drivers by points: loops 4 (8 pts), match/switch 2 (7 pts), if/else 3 (6 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/backend/jvm/opt/ClosureOptimizer.scala"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"fca56c15fcc082bafc004259b7e8ffabe14cb1b74c33c5777f62523bcbdbbf00"}},{"ruleId":"D2","level":"warning","message":{"text":"InlineRequest.logText (cognitive 21): InlineRequest.logText has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (7 pts), loops 2 (7 pts), match/switch 2 (7 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":"compiler/src/dotty/tools/backend/jvm/opt/InlinerHeuristics.scala"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"85b951c1d36e24362e91fee5b4960414855c78af29f9c22d788c013b03128412"}},{"ruleId":"D2","level":"warning","message":{"text":"OptimizerCallGraph.cloneInstructions (cognitive 21): OptimizerCallGraph.cloneInstructions has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (19 pts), boolean chains 1, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/backend/jvm/opt/OptimizerCallGraph.scala"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"753dbda2c56bfe249c42efab360d19b0318afbdf990a1ffb17bdb722988119f2"}},{"ruleId":"D2","level":"warning","message":{"text":"desugar.extMethod (cognitive 21): desugar.extMethod has cognitive complexity 21 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 7 (8 pts), match/switch 2 (3 pts) (nesting depth added 8). 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":"compiler/src/dotty/tools/dotc/ast/Desugar.scala"},"region":{"startLine":1236}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad568378ca23c3fc3f514c225da26388cf135db2552e4f2a729323a13534400d"}},{"ruleId":"D2","level":"warning","message":{"text":"MainProxies.mainProxy (cognitive 21): MainProxies.mainProxy has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (17 pts), match/switch 2 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/ast/MainProxies.scala"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"8de8d218605e6926eae95cf32ffe94cf2f1c03240c1ada08a4c919401fc86f48"}},{"ruleId":"D2","level":"warning","message":{"text":"Positioned.checkPos (cognitive 21): Positioned.checkPos has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 5 (9 pts), if/else 6 (7 pts), boolean chains 3, loops 1 (2 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":"compiler/src/dotty/tools/dotc/ast/Positioned.scala"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1293852e5a2c58d00b4ef5a4b231c8ed963226dc8e49fa71ab45111544cddf0"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeTypeMap.transform (cognitive 21): TreeTypeMap.transform has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 3 (6 pts), error handling 1 (4 pts) (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":"compiler/src/dotty/tools/dotc/ast/TreeTypeMap.scala"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"401d50cdec048f4262b35e79cb4dc0c1d2c1210ecd340515ddf2e57e92c69fb7"}},{"ruleId":"D2","level":"warning","message":{"text":"CaptureSet.withCaptureSetsExplained (cognitive 21): CaptureSet.withCaptureSetsExplained has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 2 (8 pts), loops 2 (4 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":"compiler/src/dotty/tools/dotc/cc/CaptureSet.scala"},"region":{"startLine":1896}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbbd3023c14624fad49602309822ec651ad164c55342be8ada9d5eba85b94a20"}},{"ruleId":"D2","level":"warning","message":{"text":"Setup.decorate (cognitive 21): Setup.decorate has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (14 pts), match/switch 2 (5 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/cc/Setup.scala"},"region":{"startLine":955}}}],"partialFingerprints":{"codehealthFindingId/v1":"0062089cf4ea644c9f56072dc79094c020cf8928b886c6389d97b8de533ec024"}},{"ruleId":"D2","level":"warning","message":{"text":"CommandLineParser.tokenize (cognitive 21): CommandLineParser.tokenize has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (14 pts), loops 3, boolean chains 2, match/switch 2 (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":"compiler/src/dotty/tools/dotc/config/CommandLineParser.scala"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"739fb288d2f0b84d004f206c514ff64d5f0a090dbb28cd291934b39943142dae"}},{"ruleId":"D2","level":"warning","message":{"text":"ConstraintHandling.dropTransparentTraits (cognitive 21): ConstraintHandling.dropTransparentTraits has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/ConstraintHandling.scala"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"34478875bd36d90343e64dd21c30dc1329df3462dcb042d64c9f5cd4882b7e7b"}},{"ruleId":"D2","level":"warning","message":{"text":"SingleDenotation.computeAsSeenFrom (cognitive 21): SingleDenotation.computeAsSeenFrom has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 4, match/switch 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":"compiler/src/dotty/tools/dotc/core/Denotations.scala"},"region":{"startLine":1113}}}],"partialFingerprints":{"codehealthFindingId/v1":"efc042ec45b28313c440531629b32a2b678987626b60b9167ba3c4f12a234860"}},{"ruleId":"D2","level":"warning","message":{"text":"SymDenotation.completeFrom (cognitive 21): SymDenotation.completeFrom has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (18 pts), error handling 1 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/SymDenotations.scala"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"4166ae251cdd4784e0102436beaaf1ea0c0da246fbcb3bb25494d1409b5e71a9"}},{"ruleId":"D2","level":"warning","message":{"text":"SymDenotation.fullNameSeparated (cognitive 21): SymDenotation.fullNameSeparated has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 4, loops 1 (2 pts), match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/SymDenotations.scala"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"efc8578df076840d2dda69a9d44a0dcae741147a34571878eab0336b2b9eb139"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeComparer.hasMatchingMember (cognitive 21): TypeComparer.hasMatchingMember has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 9, match/switch 5 (7 pts), if/else 5 (nesting depth added 2). 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":"compiler/src/dotty/tools/dotc/core/TypeComparer.scala"},"region":{"startLine":2265}}}],"partialFingerprints":{"codehealthFindingId/v1":"202acd213f7236cba4bc731ec36c45bad0ecb5de42bc7b4c9c096c912854d7f0"}},{"ruleId":"D2","level":"warning","message":{"text":"Type.atoms (cognitive 21): Type.atoms has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 6 (11 pts), if/else 8 (10 pts) (nesting depth added 7). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/Types.scala"},"region":{"startLine":1508}}}],"partialFingerprints":{"codehealthFindingId/v1":"96d4216adb45808305d80869bd6ea6f205bc9a4a8dfa227aa47f161ae3cc6ff4"}},{"ruleId":"D2","level":"warning","message":{"text":"SAMType.samParent (cognitive 21): SAMType.samParent has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (11 pts), match/switch 4 (9 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":"compiler/src/dotty/tools/dotc/core/Types.scala"},"region":{"startLine":5992}}}],"partialFingerprints":{"codehealthFindingId/v1":"3539d575f3354ee24ff97ad93697e5cdd54bdd48f920da8b1d7f863b40bc314c"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeReader.normalizeFlags (cognitive 21): TreeReader.normalizeFlags has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 5 (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":"compiler/src/dotty/tools/dotc/core/tasty/TreeUnpickler.scala"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f4cc2d66ec6431e0dc192154b44162937656fd178cf3715fd986bfeae2ed821"}},{"ruleId":"D2","level":"warning","message":{"text":"InlinerTreeMap.apply (cognitive 21): InlinerTreeMap.apply has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 4 (8 pts), boolean chains 3 (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":"compiler/src/dotty/tools/dotc/inlines/Inliner.scala"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"58e0ee29eb7f70e1ea4816c30cb456cbccb5ca5b79c45b742ac325a8136a665e"}},{"ruleId":"D2","level":"warning","message":{"text":"InlineTyper.typedSelect (cognitive 21): InlineTyper.typedSelect has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (11 pts), match/switch 4 (8 pts), boolean chains 2 (nesting depth added 5). 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":"compiler/src/dotty/tools/dotc/inlines/Inliner.scala"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"028e1bd97a7dadc990f603dce5a0873fb48693654e3814b62660896e81f6541f"}},{"ruleId":"D2","level":"warning","message":{"text":"Scanner.skipComment (cognitive 21): Scanner.skipComment has cognitive complexity 21 (threshold 15). Drivers by points: if/else 15 (18 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"compiler/src/dotty/tools/dotc/parsing/Scanners.scala"},"region":{"startLine":1026}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbd09f064461888458c2c2cc647543a39674324741975eaba8b997550758f095"}},{"ruleId":"D2","level":"warning","message":{"text":"Scanner.getNumber (cognitive 21): Scanner.getNumber has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 4, match/switch 2 (4 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":"compiler/src/dotty/tools/dotc/parsing/Scanners.scala"},"region":{"startLine":1533}}}],"partialFingerprints":{"codehealthFindingId/v1":"7feaea6a41bcf87995fefa5d74e1e72feade331dbaf8a5ed81ae4b54f925fbe5"}},{"ruleId":"D2","level":"warning","message":{"text":"DidYouMean.didYouMean (cognitive 21): DidYouMean.didYouMean has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (15 pts), match/switch 3, boolean chains 2, error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/reporting/DidYouMean.scala"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"07899e1128c2038bb12d8f9ced1d9f901ca3c4dd27620f8b18d974ff2bf052fd"}},{"ruleId":"D2","level":"warning","message":{"text":"Extractor.symbolKinds (cognitive 21): Extractor.symbolKinds has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (18 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/semanticdb/ExtractSemanticDB.scala"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d0605c3cbf0fc5e377757162ec70b7901d774dacb40602f903796166e59a98e"}},{"ruleId":"D2","level":"warning","message":{"text":"SyntheticsExtractor.tryFindSynthetic (cognitive 21): SyntheticsExtractor.tryFindSynthetic has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 4 (9 pts), boolean chains 6, if/else 6 (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":"compiler/src/dotty/tools/dotc/semanticdb/SyntheticsExtractor.scala"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"057433d926c1af28dd5a208fa8273954d81d536371caaf5ad14a2618399e7b0c"}},{"ruleId":"D2","level":"warning","message":{"text":"CheckStatic.transformTemplate (cognitive 21): CheckStatic.transformTemplate has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 3, loops 1, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/CheckStatic.scala"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeb354ec91cf80a66f5c780e16170e327dc360b1056ce04318068c9d6041c3f4"}},{"ruleId":"D2","level":"warning","message":{"text":"Boxing.adaptToType (cognitive 21): Boxing.adaptToType has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 3, match/switch 2 (3 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":"compiler/src/dotty/tools/dotc/transform/Erasure.scala"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"17a5ed9e55e4d2ddb43e5a1645ed61a6f2bd41c1d2dbd2e41af359c3612b33c2"}},{"ruleId":"D2","level":"warning","message":{"text":"MoveStatics.transformStats (cognitive 21): MoveStatics.transformStats has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3, match/switch 1 (3 pts), loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/MoveStatics.scala"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd54c03e0866313ed93ff1b9a5c18d9665c96a70701c9a25a1318488f647bc29"}},{"ruleId":"D2","level":"warning","message":{"text":"DropForMap.transformApply (cognitive 21): DropForMap.transformApply has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (15 pts), match/switch 4 (6 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":"compiler/src/dotty/tools/dotc/transform/localopt/DropForMap.scala"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c1c9b11cae29f97af0b66bce663d78097ce46791d3f540bcaaedd45341deb5"}},{"ruleId":"D2","level":"warning","message":{"text":"TypedFormatChecker.checked (cognitive 21): TypedFormatChecker.checked has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 2, loops 1, match/switch 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/localopt/FormatChecker.scala"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"1afb030259dd586d50c1f98e648b6f5b6364282435326e807c075dba4bb61562"}},{"ruleId":"D2","level":"warning","message":{"text":"SpaceEngine.satisfiable (cognitive 21): SpaceEngine.satisfiable has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (13 pts), match/switch 5 (6 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":"compiler/src/dotty/tools/dotc/transform/patmat/Space.scala"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"99eae3b9f6cc8b29094a94c3931f1312de6d4e37777ec86baadbbc2edf6ecd21"}},{"ruleId":"D2","level":"warning","message":{"text":"ExplicitJSClasses.transformInfo (cognitive 21): ExplicitJSClasses.transformInfo has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (6 pts), boolean chains 3, 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":"compiler/src/dotty/tools/dotc/transform/sjs/ExplicitJSClasses.scala"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"5da73a5c465174fb42e93d6d1a8775cd9edf3ab44c3b94b205ecf0d5bd848e68"}},{"ruleId":"D2","level":"warning","message":{"text":"Dynamic.typedDynamicApply (cognitive 21): Dynamic.typedDynamicApply has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (13 pts), match/switch 4 (7 pts), boolean chains 1 (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":"compiler/src/dotty/tools/dotc/typer/Dynamic.scala"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"64e72bebe898e296b5008c39785ac251ca58e06223d9ad6bd3de06599461f071"}},{"ruleId":"D2","level":"warning","message":{"text":"Implicits.assumedCanEqual (cognitive 21): Implicits.assumedCanEqual has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 8, if/else 7 (8 pts), match/switch 3 (5 pts) (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/Implicits.scala"},"region":{"startLine":1051}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8e01c3a93fca739791db8767cd5c2cbe639b7f1448801c4149a33e174b10d31"}},{"ruleId":"D2","level":"warning","message":{"text":"Future.firstCompletedOf (cognitive 21): Future.firstCompletedOf has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 1 (4 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/concurrent/Future.scala"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"69aa8e8466a919b0d20e535f26b55e6463031d16aa3547a8197d0c9164059e91"}},{"ruleId":"D2","level":"warning","message":{"text":"DefaultPromise.linkRootOf (cognitive 21): DefaultPromise.linkRootOf has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/concurrent/impl/Promise.scala"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"483f09364cc64650334891289546df81a04fe64ad05e7c811a178992a388cef4"}},{"ruleId":"D2","level":"warning","message":{"text":"ReplCompiler.typeCheck (cognitive 21): ReplCompiler.typeCheck has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (8 pts), match/switch 5 (7 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"repl/src/dotty/tools/repl/ReplCompiler.scala"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"8adba1d29e14b5e484e611c4ead86c246bd4fabe143a636ff5e659dcba3a7898"}},{"ruleId":"D2","level":"warning","message":{"text":"PlainBodyBuilder.genTypeApply (cognitive 20): PlainBodyBuilder.genTypeApply has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 2, match/switch 1 (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":"compiler/src/dotty/tools/backend/jvm/BCodeBodyBuilder.scala"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9acedeb698e83beb30a9b1721ec77fe5332357633e76f17210c1049c18abd9c"}},{"ruleId":"D2","level":"warning","message":{"text":"BType.conformsTo (cognitive 20): BType.conformsTo has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (8 pts), match/switch 4 (7 pts), boolean chains 5 (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":"compiler/src/dotty/tools/backend/jvm/BTypes.scala"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5e934d643fc076b0549fe98751aa7409611a405ae6ccb8408df5eff259790ea"}},{"ruleId":"D2","level":"warning","message":{"text":"BoxKind.checkInstanceCreation (cognitive 20): BoxKind.checkInstanceCreation has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (15 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 12). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/backend/jvm/opt/BoxUnbox.scala"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"180201b765629029fa5b447afcf8bfb8ea6b6c5637128cbea8a6e1660fab3a05"}},{"ruleId":"D2","level":"warning","message":{"text":"Tuple.checkTupleCreation (cognitive 20): Tuple.checkTupleCreation has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 2 (5 pts), boolean chains 2, match/switch 2 (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":"compiler/src/dotty/tools/backend/jvm/opt/BoxUnbox.scala"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"64adc97c303ff898972d747e63cfb7c9658fae99f0523ce184ea9905cc3eae7b"}},{"ruleId":"D2","level":"warning","message":{"text":"Tuple.checkTupleExtraction (cognitive 20): Tuple.checkTupleExtraction has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 1, 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":"compiler/src/dotty/tools/backend/jvm/opt/BoxUnbox.scala"},"region":{"startLine":835}}}],"partialFingerprints":{"codehealthFindingId/v1":"658887d355caadc2c320107254f041281e4b5830fc880ba6175b92bd27e985d7"}},{"ruleId":"D2","level":"warning","message":{"text":"ClosureOptimizer.rewriteClosureApplyInvocation (cognitive 20): ClosureOptimizer.rewriteClosureApplyInvocation has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 2, 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":"compiler/src/dotty/tools/backend/jvm/opt/ClosureOptimizer.scala"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"03d9ef725369f1cb685ae17fe70ca7de556af2567a742e8efbfce4c491aa943d"}},{"ruleId":"D2","level":"warning","message":{"text":"JSCodeGen.genConversion (cognitive 20): JSCodeGen.genConversion has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (9 pts), match/switch 4 (9 pts), boolean chains 2 (nesting depth added 7). 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":"compiler/src/dotty/tools/backend/sjs/JSCodeGen.scala"},"region":{"startLine":2915}}}],"partialFingerprints":{"codehealthFindingId/v1":"f17d3b1939e2fce27bd4337e6db7bb8b55e36387deb7cffe60d5fdae2d44d015"}},{"ruleId":"D2","level":"warning","message":{"text":"desugar.tuple (cognitive 20): desugar.tuple has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (17 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"compiler/src/dotty/tools/dotc/ast/Desugar.scala"},"region":{"startLine":1856}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b14ab1ef03fffac42adab7df354ba6ed631e7568acfd4cb5a60e1d37d77fb24"}},{"ruleId":"D2","level":"warning","message":{"text":"desugar.adaptPatternArgs (cognitive 20): desugar.adaptPatternArgs has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 2 (4 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/ast/Desugar.scala"},"region":{"startLine":1910}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b0f61f74d67a7f85f40a59d4d5dde877e95ff85a65bde38e80bbfd7a6a5bc35"}},{"ruleId":"D2","level":"warning","message":{"text":"UntypedTreeInfo.defKind (cognitive 20): UntypedTreeInfo.defKind has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (16 pts), match/switch 2 (3 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":"compiler/src/dotty/tools/dotc/ast/TreeInfo.scala"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8140ed6ce6961615af24fa0dd3eb17fae2f4acedd96a65ebfae5c9818fcaf1c"}},{"ruleId":"D2","level":"warning","message":{"text":"CaptureChecker.instantiate (cognitive 20): CaptureChecker.instantiate has cognitive complexity 20 (threshold 15). Drivers by points: loops 3 (12 pts), if/else 6, match/switch 1 (2 pts) (nesting depth added 10). 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":"compiler/src/dotty/tools/dotc/cc/CheckCaptures.scala"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9389a8826c02f028ca3153c54e97c2338989911102d981c343d7a7583dcf769"}},{"ruleId":"D2","level":"warning","message":{"text":"CaptureChecker.checkFieldOfClassifiedClass (cognitive 20): CaptureChecker.checkFieldOfClassifiedClass has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (6 pts), match/switch 1 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/cc/CheckCaptures.scala"},"region":{"startLine":1494}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcf5657dc300e1dba270aeb6b3b22379617790817b6472b26ec8bb3098ff0417"}},{"ruleId":"D2","level":"warning","message":{"text":"CaptureChecker.postCheck (cognitive 20): CaptureChecker.postCheck has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (11 pts), match/switch 4 (6 pts), loops 1 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/cc/CheckCaptures.scala"},"region":{"startLine":2513}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fa08329add0a69389e14ac2b72b3a201b05b6330b4d184b6aadd0ce0063edee"}},{"ruleId":"D2","level":"warning","message":{"text":"checker.traverse (cognitive 20): checker.traverse has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (8 pts), match/switch 3 (6 pts), boolean chains 4, loops 1 (2 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":"compiler/src/dotty/tools/dotc/cc/SafeRefs.scala"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"02ce7fb63269a3878635b89bb3291195004002b6c7fc40d3a95fc7008d4a1512"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassDenotation.computeBaseData (cognitive 20): ClassDenotation.computeBaseData has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 3 (6 pts), boolean chains 5 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/SymDenotations.scala"},"region":{"startLine":2127}}}],"partialFingerprints":{"codehealthFindingId/v1":"20dd4542b3be02a75c259aaf8898a0e0a4701ec09ef10a8400a127d27c8873da"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeApplications.typeParams (cognitive 20): TypeApplications.typeParams has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 3 (5 pts), boolean chains 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/TypeApplications.scala"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"36c000598a8b28aacbdd4b55151b03eda0b8ed23020f798ab8bfd3e88837da8a"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeErasure.compareErasedGlb (cognitive 20): TypeErasure.compareErasedGlb has cognitive complexity 20 (threshold 15). Drivers by points: if/else 16, boolean chains 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":"compiler/src/dotty/tools/dotc/core/TypeErasure.scala"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"01b2d3600667d9d03793bd49bde257bee3110c3a7c9ff9f6e4111fdebc757cb6"}},{"ruleId":"D2","level":"warning","message":{"text":"Type.lookupRefined (cognitive 20): Type.lookupRefined has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 3 (5 pts), boolean chains 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/Types.scala"},"region":{"startLine":1749}}}],"partialFingerprints":{"codehealthFindingId/v1":"940d5ca4ac13e88e71c7bea1bca30538635d12de86b41c3273cea3f69c8e1e44"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassfileParser.parseAnnotation (cognitive 20): ClassfileParser.parseAnnotation has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 2 (3 pts), boolean chains 2, error handling 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/classfile/ClassfileParser.scala"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"942ff96534e4056b045ccf82ec57e336f3724a2732f699f21825ac5a24fcfd43"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeSectionUnpickler.unpickle0 (cognitive 20): TreeSectionUnpickler.unpickle0 has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (9 pts), match/switch 3 (6 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 6). 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":"compiler/src/dotty/tools/dotc/core/tasty/TastyPrinter.scala"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"47ffcabc2108791438c7f12c1ae80ea58a4181d705a2b9430f6e93dfd2fcc5ad"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeReader.readTemplate (cognitive 20): TreeReader.readTemplate has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15 (16 pts), boolean chains 3, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/tasty/TreeUnpickler.scala"},"region":{"startLine":1116}}}],"partialFingerprints":{"codehealthFindingId/v1":"9252433600fd1a6e518c3ee2fbbd13ffae8a08fae0f8f16e38fda93896c771fb"}},{"ruleId":"D2","level":"warning","message":{"text":"Scala2Unpickler.setClassInfo (cognitive 20): Scala2Unpickler.setClassInfo has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 2, loops 1, 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":"compiler/src/dotty/tools/dotc/core/unpickleScala2/Scala2Unpickler.scala"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbaceb4e5d0ae4ce13a657efbeb1a910bc0f3e991c47c97f310631d1ede9d6ae"}},{"ruleId":"D2","level":"warning","message":{"text":"Scala2Unpickler.run (cognitive 20): Scala2Unpickler.run has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 1 (4 pts), loops 2, boolean chains 1, error handling 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/unpickleScala2/Scala2Unpickler.scala"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"f21a8ac27baa7cb2c56c338ba050d305bf7e59bc3eddceb1d79a684cc46c6f5d"}},{"ruleId":"D2","level":"warning","message":{"text":"isElideableExpr.apply (cognitive 20): isElideableExpr.apply has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 7, match/switch 1 (nesting depth added 3). 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":"compiler/src/dotty/tools/dotc/inlines/Inliner.scala"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec95dfdd8c2b0814bec03e8c062cd87f395342a88933b0df6effaef3ca4ca0f1"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.interpolatedString (cognitive 20): Parser.interpolatedString has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (15 pts), loops 2 (4 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":"compiler/src/dotty/tools/dotc/parsing/Parsers.scala"},"region":{"startLine":1508}}}],"partialFingerprints":{"codehealthFindingId/v1":"867288422627e283b75b829f6a080e0680ec81c1ffeac69a744c553b1a152728"}},{"ruleId":"D2","level":"warning","message":{"text":"Scanner.isLeadingInfixOperator (cognitive 20): Scanner.isLeadingInfixOperator has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 11, if/else 5 (6 pts), match/switch 2 (3 pts) (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/parsing/Scanners.scala"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"69c0692f5610b1e8a9b1d8a5bd5597b1c24dfa2fead06ba9ba6f2f437d89d127"}},{"ruleId":"D2","level":"warning","message":{"text":"MarkupParser.xPattern (cognitive 20): MarkupParser.xPattern has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 2 (6 pts), match/switch 1 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/parsing/xml/MarkupParsers.scala"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"56bd5466c226b97b3510e77b774ad3b06df37fb7af795505354796d4f8178118"}},{"ruleId":"D2","level":"warning","message":{"text":"Interpreter.interpretTree (cognitive 20): Interpreter.interpretTree has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (15 pts), match/switch 2 (3 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":"compiler/src/dotty/tools/dotc/quoted/Interpreter.scala"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"94e8dfe75256e9ac37d61837ce4c7d9ca5f50b22a73cee31f34bc93028b768bc"}},{"ruleId":"D2","level":"warning","message":{"text":"Typer.checkNotErased (cognitive 20): Typer.checkNotErased has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 3 (9 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":"compiler/src/dotty/tools/dotc/transform/Erasure.scala"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6f5184d68372bf2f8281e849362a823aaf3852e3b7d134326502faeba5c35dc"}},{"ruleId":"D2","level":"warning","message":{"text":"CoverageTransformer.needsLift (cognitive 20): CoverageTransformer.needsLift has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 12, if/else 4 (5 pts), match/switch 3 (nesting depth added 1). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/InstrumentCoverage.scala"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"1037d7f1023d6bc025e5bd7eb57916682e1d5abcab7bf462ac934688ad6ade1f"}},{"ruleId":"D2","level":"warning","message":{"text":"LazyVals.transformLazyVal (cognitive 20): LazyVals.transformLazyVal has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 5 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/LazyVals.scala"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9db5eac442f6e564528e5d003ee66561f4148f99b0d4f1cf154c7e23c6594c2"}},{"ruleId":"D2","level":"warning","message":{"text":"PostTyperTransformer.forwardParamAccessors (cognitive 20): PostTyperTransformer.forwardParamAccessors has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (11 pts), boolean chains 3, loops 1 (3 pts), match/switch 2 (3 pts) (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":"compiler/src/dotty/tools/dotc/transform/PostTyper.scala"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"675c66ce8f1bceecf5fb03482fd13c62ee5688887b7b4b03f6fafe8c4c0549cb"}},{"ruleId":"D2","level":"warning","message":{"text":"Objects.readLocal (cognitive 20): Objects.readLocal has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 3 (4 pts), boolean chains 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/init/Objects.scala"},"region":{"startLine":1463}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a13e87d117069b7b92218a70d833a62d98830601ca957ce3e27d731cdac0d47"}},{"ruleId":"D2","level":"warning","message":{"text":"ExplicitJSClasses.transformApply (cognitive 20): ExplicitJSClasses.transformApply has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 1 (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":"compiler/src/dotty/tools/dotc/transform/sjs/ExplicitJSClasses.scala"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"e363a19538bc0d4fc3b9f89eb9c11bfdacf637a82d8d6e52834d67fb7989a340"}},{"ruleId":"D2","level":"warning","message":{"text":"ScalaJSPrepJSInteropTransformer.constantFoldJSAnnotations (cognitive 20): ScalaJSPrepJSInteropTransformer.constantFoldJSAnnotations has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (10 pts), match/switch 3 (9 pts), boolean chains 1 (nesting depth added 8). 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":"compiler/src/dotty/tools/dotc/transform/sjs/PrepJSInterop.scala"},"region":{"startLine":1099}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d4a60f25ecc954e1b15a1ba14559e970aa9b6dc77af0d7b05056687508453b3"}},{"ruleId":"D2","level":"warning","message":{"text":"Errors.selectErrorAddendum (cognitive 20): Errors.selectErrorAddendum has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (14 pts), loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"compiler/src/dotty/tools/dotc/typer/ErrorReporting.scala"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"9376ac24883ecf942d73b7d221a75baafb5448aec89c8c083b456d089a38d7fa"}},{"ruleId":"D2","level":"warning","message":{"text":"Typer.typedNew (cognitive 20): Typer.typedNew has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 2 (5 pts), boolean chains 4, match/switch 2 (3 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":"compiler/src/dotty/tools/dotc/typer/Typer.scala"},"region":{"startLine":1298}}}],"partialFingerprints":{"codehealthFindingId/v1":"96445cdd7c01a4afb674509c24bcd8d07a5fcfe50e037f532f7f040471566e1f"}},{"ruleId":"D2","level":"warning","message":{"text":"Typer.typedAnnotated (cognitive 20): Typer.typedAnnotated has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (14 pts), match/switch 2 (5 pts), boolean chains 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":"compiler/src/dotty/tools/dotc/typer/Typer.scala"},"region":{"startLine":3792}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae11378a14a136323f5d13e2547c7c1e9a2af3566108c797c0323870754b9fe1"}},{"ruleId":"D2","level":"warning","message":{"text":"DiffUtil.needlemanWunsch (cognitive 20): DiffUtil.needlemanWunsch has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (13 pts), loops 3 (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":"compiler/src/dotty/tools/dotc/util/DiffUtil.scala"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"f708d31f818ae067feac4aae008a27be0d9016218cc78f6b3202655db323143e"}},{"ruleId":"D2","level":"warning","message":{"text":"NumericRange.sum (cognitive 20): NumericRange.sum has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 1 (4 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":"library-js/src/scala/collection/immutable/NumericRange.scala"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"09b618ddb0e6c7ae1cfbb4ddcf6e7ca347d5aa131e3f5de459d6eeabe05021ef"}},{"ruleId":"D2","level":"warning","message":{"text":"Stream.hasDefiniteSize (cognitive 20): Stream.hasDefiniteSize has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/collection/immutable/Stream.scala"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"87e28da42c32c5c55473de6351cee9cc1ab217b4798ecc3a425f13fa72bc86e5"}},{"ruleId":"D2","level":"warning","message":{"text":"ExternalDocLink.parse (cognitive 20): ExternalDocLink.parse has cognitive complexity 20 (threshold 15). Drivers by points: loops 4 (14 pts), if/else 3, match/switch 3 (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":"scaladoc/src/dotty/tools/scaladoc/ExternalDocLink.scala"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"df68344348b9c60ff2b1154f5cdc14dd633d3e1282fb4df4ad1dd60c05ed3807"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.getInline (cognitive 20): Parser.getInline has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (14 pts), match/switch 2 (3 pts), boolean chains 2, loops 1 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scaladoc/src/dotty/tools/scaladoc/tasty/comments/wiki/Parser.scala"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fea2cc21f3283eba7466792b4c05877b51b46bb8b0fc385d6c124448f955b8f"}},{"ruleId":"D2","level":"warning","message":{"text":"PlainBodyBuilder.genLoadIfTo (cognitive 19): PlainBodyBuilder.genLoadIfTo has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 2, match/switch 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":"compiler/src/dotty/tools/backend/jvm/BCodeBodyBuilder.scala"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c23fe143ff004ec539e2235e739db960c04d8d991d6f5eebf3c0aef245eb1b6"}},{"ruleId":"D2","level":"warning","message":{"text":"BCAnnotGen.emitArgument (cognitive 19): BCAnnotGen.emitArgument has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 4 (7 pts), if/else 5 (6 pts), loops 2 (4 pts), boolean chains 2 (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":"compiler/src/dotty/tools/backend/jvm/BCodeHelpers.scala"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"b023a70161e4089ae2d24b5d1276996cc40372e2a53e5d8ded2b65361d7e8974"}},{"ruleId":"D2","level":"warning","message":{"text":"CheckCaptures.checkWellformedRetains (cognitive 19): CheckCaptures.checkWellformedRetains has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 5, error handling 1 (3 pts), 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":"compiler/src/dotty/tools/dotc/cc/CheckCaptures.scala"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"1474d753845c2937bd791c6eca3a0ae10cc299dd094300f3dabaad8258353f21"}},{"ruleId":"D2","level":"warning","message":{"text":"CaptureChecker.addOuterRefs (cognitive 19): CaptureChecker.addOuterRefs has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 3, match/switch 3, loops 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/cc/CheckCaptures.scala"},"region":{"startLine":1940}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa00022e8a0153edbfcb197a9c647e44faf429dd4f790de776dd94f738fb7362"}},{"ruleId":"D2","level":"warning","message":{"text":"ImplicitNullMap.apply (cognitive 19): ImplicitNullMap.apply has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (11 pts), match/switch 4 (8 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":"compiler/src/dotty/tools/dotc/core/ImplicitNullInterop.scala"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9889a12f1a592bf9642ee95a959cc8d27fea8fd09d9e0fb128c67c5cf75b7a6"}},{"ruleId":"D2","level":"warning","message":{"text":"OrderingConstraint.adjustDeps (cognitive 19): OrderingConstraint.adjustDeps 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: 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":"compiler/src/dotty/tools/dotc/core/OrderingConstraint.scala"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"a546bcacabb6eb7a317b70a3cb614623370c91863f6c9e8da8513269f8c3484e"}},{"ruleId":"D2","level":"warning","message":{"text":"OrderingConstraint.stripParams (cognitive 19): OrderingConstraint.stripParams has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (18 pts), match/switch 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/OrderingConstraint.scala"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f069894c1cb67d2e125ac30ed09d92e0ab40f5e7b8b41f34cd68e21552081e1"}},{"ruleId":"D2","level":"warning","message":{"text":"SymDenotation.isAccessibleFrom (cognitive 19): SymDenotation.isAccessibleFrom has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 13, if/else 6. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/SymDenotations.scala"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"82694af1b553b72aa761dc06959f8e3b3bd22780220f574cc5a58aa45a6ec014"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeComparer.liftToThis (cognitive 19): TypeComparer.liftToThis has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 3, 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":"compiler/src/dotty/tools/dotc/core/TypeComparer.scala"},"region":{"startLine":1740}}}],"partialFingerprints":{"codehealthFindingId/v1":"be7eeb46a3915bfaa63c00d5295eaaf0bcb14b1c9e71e94d51e5fe2ed40f0d0a"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeErasure.isGenericArrayElement (cognitive 19): TypeErasure.isGenericArrayElement has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 7, match/switch 2 (nesting depth added 2). 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":"compiler/src/dotty/tools/dotc/core/TypeErasure.scala"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a5a74571cf19e00ea21645f498e146a2891850f4c252780577b268c592cab42"}},{"ruleId":"D2","level":"warning","message":{"text":"NamedTypeUniques.enterIfNew (cognitive 19): NamedTypeUniques.enterIfNew has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (15 pts), match/switch 1 (2 pts), boolean chains 1, error handling 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/Uniques.scala"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"5458c8d97f57fa357a1427fac185281e33c8d99bfc3faaa16cbef7c021b92f1a"}},{"ruleId":"D2","level":"warning","message":{"text":"MemberCompleter.complete (cognitive 19): MemberCompleter.complete has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (16 pts), match/switch 2, boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/classfile/ClassfileParser.scala"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"14ab1aaeec9c5b991fd2066ebd8edfceee3dd94706d9cd2ceda4a2688404e0f2"}},{"ruleId":"D2","level":"warning","message":{"text":"innerClasses.classSymbol (cognitive 19): innerClasses.classSymbol has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 2, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/classfile/ClassfileParser.scala"},"region":{"startLine":1433}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0121d9aab2854b8027f82b6f12dcb9b901aab378ff8b75f361eff02f7d6ece9"}},{"ruleId":"D2","level":"warning","message":{"text":"Scala2Unpickler.elimExistentials (cognitive 19): Scala2Unpickler.elimExistentials has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (12 pts), match/switch 5 (6 pts), boolean chains 1 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/unpickleScala2/Scala2Unpickler.scala"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"5398152ff9828bc1f55a239219d3631bc7eb50d75e310a79f441cde341aa7924"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.statSepOrEnd (cognitive 19): Parser.statSepOrEnd has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (16 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":"compiler/src/dotty/tools/dotc/parsing/Parsers.scala"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"96f318835f9de7057ce8105a146a53cb69ed8362ec112e26181bac2bfd60d50c"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.expr (cognitive 19): Parser.expr has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 2, loops 1 (2 pts), match/switch 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":"compiler/src/dotty/tools/dotc/parsing/Parsers.scala"},"region":{"startLine":2615}}}],"partialFingerprints":{"codehealthFindingId/v1":"ade5826933cf13b0405ad142cfe88088e142434520cd59d7ff11ae48b8b32fd6"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.compilationUnit (cognitive 19): Parser.compilationUnit has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 1, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/parsing/Parsers.scala"},"region":{"startLine":5279}}}],"partialFingerprints":{"codehealthFindingId/v1":"f694d4f254a3642070cff9879b8ced7d3552c83386ebd52fd0b8dec8795a067b"}},{"ruleId":"D2","level":"warning","message":{"text":"RefinedPrinter.toText (cognitive 19): RefinedPrinter.toText has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/printing/RefinedPrinter.scala"},"region":{"startLine":1225}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb0bb69b55bcfedd03158c12eafb5d55bfd487127b888bcdd52e34e897f3c2f9"}},{"ruleId":"D2","level":"warning","message":{"text":"Seen.record (cognitive 19): Seen.record has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 3 (7 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":"compiler/src/dotty/tools/dotc/reporting/Message.scala"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd7598ec07b7fe3d83ccdc8b103a465714131ca195808e56f2879b4f25046587"}},{"ruleId":"D2","level":"warning","message":{"text":"Seen.explanation (cognitive 19): Seen.explanation has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (16 pts), match/switch 2, boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"compiler/src/dotty/tools/dotc/reporting/Message.scala"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcac5051a08d890ea598eadc0aa113a249d47db8a56be16b66c2aad057341f5d"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeMismatch.msg (cognitive 19): TypeMismatch.msg has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 3, match/switch 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":"compiler/src/dotty/tools/dotc/reporting/messages.scala"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"04d198d54b2cec3b8a9cdbb94473edf0c8f6c8bc7a52c54caa40c9036d44cc48"}},{"ruleId":"D2","level":"warning","message":{"text":"TraceSyntax.doTrace (cognitive 19): TraceSyntax.doTrace has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), error handling 2 (4 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/reporting/trace.scala"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"97c69f6c0f3068b09d84c7847020e6270b4ed0aa18d30d34a8a317d0d51c7af5"}},{"ruleId":"D2","level":"warning","message":{"text":"FirstTransform.foldCondition (cognitive 19): FirstTransform.foldCondition has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 3 (6 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":"compiler/src/dotty/tools/dotc/transform/FirstTransform.scala"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b3c0471b64acd3288ce816e734cd83ef0929e05d0cfe08e45e8538bf0f201fc"}},{"ruleId":"D2","level":"warning","message":{"text":"Translator.collectSwitchCases (cognitive 19): Translator.collectSwitchCases has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 5, match/switch 4 (5 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/PatternMatcher.scala"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"713ceb91f32ac7a59e5557aab30019a63a3523f9cb17b3cbcce9002ca21935ad"}},{"ruleId":"D2","level":"warning","message":{"text":"SpecializeFunctions.transformApply (cognitive 19): SpecializeFunctions.transformApply has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 4 (12 pts), if/else 5 (6 pts), boolean chains 1 (nesting depth added 9). 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":"compiler/src/dotty/tools/dotc/transform/SpecializeFunctions.scala"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"693bcfd2309bb441580939800eebb1ea7236987fc8c1f0e0f7de783bff6a4c64"}},{"ruleId":"D2","level":"warning","message":{"text":"Staging.checkPostCondition (cognitive 19): Staging.checkPostCondition has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (9 pts), match/switch 3 (6 pts), boolean chains 4 (nesting depth added 5). 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":"compiler/src/dotty/tools/dotc/transform/Staging.scala"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ab849ff78fee67fb9cc8d142bfeb19e8eabb47ac41fd1b7430261aa7377ff7b"}},{"ruleId":"D2","level":"warning","message":{"text":"ImplicitSearch.checkDivergence (cognitive 19): ImplicitSearch.checkDivergence has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 7, match/switch 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/Implicits.scala"},"region":{"startLine":1850}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cf8ce73ae3b07a4473c1185bb21c0cbda7d05ebfdb5f825758ff7bc01fa3761"}},{"ruleId":"D2","level":"warning","message":{"text":"ImportInfo.ensureInitialized (cognitive 19): ImportInfo.ensureInitialized has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/ImportInfo.scala"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eabc7aa4f47ec9a9ea0414da8c9ce9a05a72d02562246659e81e8c09f4de787"}},{"ruleId":"D2","level":"warning","message":{"text":"Linter.warnOnInterestingResultInStatement (cognitive 19): Linter.warnOnInterestingResultInStatement has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 4 (7 pts), boolean chains 6, if/else 6 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/Linter.scala"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bc698914561ee85c496406d076cec6fd31b32d68f0f329fc9d38c592934addb"}},{"ruleId":"D2","level":"warning","message":{"text":"AppToMain.rewrite (cognitive 19): AppToMain.rewrite has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 4 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/Migrations.scala"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"e56cafae20976f0162856ce6d4e420304874aac42627591708add23cb46c6f64"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassCompleter.processExports (cognitive 19): ClassCompleter.processExports has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (8 pts), match/switch 5 (7 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/Namer.scala"},"region":{"startLine":1588}}}],"partialFingerprints":{"codehealthFindingId/v1":"0107af7f9b86c84811735dde7af18f451da4d926ab064a416ca67b9f062e6a0d"}},{"ruleId":"D2","level":"warning","message":{"text":"QuotesAndSplices.typedSplicePattern (cognitive 19): QuotesAndSplices.typedSplicePattern has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 3 (6 pts), loops 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":"compiler/src/dotty/tools/dotc/typer/QuotesAndSplices.scala"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f670ce610d7e6a342be016c54bdfce08d40caf21039a1d2e32f96396bae09e4"}},{"ruleId":"D2","level":"warning","message":{"text":"Typer.typedTypeDef (cognitive 19): Typer.typedTypeDef has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 5, match/switch 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/Typer.scala"},"region":{"startLine":3308}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1e3951b63bca489f47b2af39f448e7f4a450263b4d6417c12cc0cba8cbdbca1"}},{"ruleId":"D2","level":"warning","message":{"text":"Typer.typedInfixOp (cognitive 19): Typer.typedInfixOp has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 1 (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":"compiler/src/dotty/tools/dotc/typer/Typer.scala"},"region":{"startLine":3853}}}],"partialFingerprints":{"codehealthFindingId/v1":"829b4a3abb632e3b245f06a904d674eec460fe6839a1f4e128434f12327a9b61"}},{"ruleId":"D2","level":"warning","message":{"text":"Util.detectMainClassAndMethod (cognitive 19): Util.detectMainClassAndMethod has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (8 pts), loops 4 (8 pts), error handling 1 (2 pts), 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":"compiler/src/dotty/tools/scripting/Util.scala"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"afc53b7f8d3a4f553a745fdcc7d54c65d323e6b51001a29dfab97bf5129ac8da"}},{"ruleId":"D2","level":"warning","message":{"text":"ScalaRunTime.stringOf (cognitive 19): ScalaRunTime.stringOf has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (10 pts), match/switch 4, boolean chains 3, error handling 2 (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":"library-js/src/scala/runtime/ScalaRunTime.scala"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"22461e0e18c2bcea93738de4b1c8a5609a61a7e99ae8a579e3436a55fb0e90bc"}},{"ruleId":"D2","level":"warning","message":{"text":"BitSetStepper.findNext (cognitive 19): BitSetStepper.findNext has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (18 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":"library/src/scala/collection/convert/impl/BitSetStepper.scala"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"041e75eceff0e2aa89d4c1b6b7964aafba2477daa74230d188bd327a33a330be"}},{"ruleId":"D2","level":"warning","message":{"text":"TableStepperBase.trySplit (cognitive 19): TableStepperBase.trySplit has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 2 (6 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/collection/convert/impl/TableStepper.scala"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc3d8fabdf9cc6464198761a1cd162369c02e9ef16906ed7aec6cb7bd672c5f3"}},{"ruleId":"D2","level":"warning","message":{"text":"BigInt.gcd (cognitive 19): BigInt.gcd 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":"library/src/scala/math/BigInt.scala"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"c171a3d0a198a07db2be59cf0880a7ead263146060a956c211f60d1cf9afba83"}},{"ruleId":"D2","level":"warning","message":{"text":"ReplBytecodeAnalysis.isScalaRunTimeProductToString (cognitive 19): ReplBytecodeAnalysis.isScalaRunTimeProductToString has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 8, if/else 6, match/switch 4, error handling 1. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"repl/src/dotty/tools/repl/ReplBytecodeAnalysis.scala"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"450248cd47c44cd223ccb3028a9039526231116f3cd78ddf239124a5bbb605c1"}},{"ruleId":"D2","level":"warning","message":{"text":"ReplDriver.resolveAndAddDeps (cognitive 19): ReplDriver.resolveAndAddDeps has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 1 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"repl/src/dotty/tools/repl/ReplDriver.scala"},"region":{"startLine":944}}}],"partialFingerprints":{"codehealthFindingId/v1":"f594786075f39b17f65e86d7abfc4915a822e5dc5e2fabc8219ebf55ce6a67f3"}},{"ruleId":"D2","level":"warning","message":{"text":"MarkupConversion.resolveLink (cognitive 19): MarkupConversion.resolveLink has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 3 (9 pts), if/else 3 (6 pts), loops 1 (4 pts) (nesting depth added 12). 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":"scaladoc/src/dotty/tools/scaladoc/tasty/comments/Comments.scala"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"a30ab060739d7502ae2a64fe913b7783476e937393462bb624c4ca5275675526"}},{"ruleId":"D2","level":"warning","message":{"text":"AliasSet.\u002B= (cognitive 18): AliasSet.\u002B= has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (12 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/backend/jvm/analysis/AliasingAnalyzer.scala"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"f086e0216811f066ec3c8cbcd873def2342ae800b3e3cd682a8b30dd6543bfb7"}},{"ruleId":"D2","level":"warning","message":{"text":"JSCodeGen.computeJSNativeLoadSpecOfInPhase (cognitive 18): JSCodeGen.computeJSNativeLoadSpecOfInPhase has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 2 (5 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":"compiler/src/dotty/tools/backend/sjs/JSCodeGen.scala"},"region":{"startLine":5123}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b0542c2a1baa3b9849b6c783200abfe967aed0245322c12cbad7ba69533a051"}},{"ruleId":"D2","level":"warning","message":{"text":"NameExtractor.apply (cognitive 18): NameExtractor.apply has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (15 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":"compiler/src/dotty/tools/dotc/ast/Desugar.scala"},"region":{"startLine":1410}}}],"partialFingerprints":{"codehealthFindingId/v1":"f337513d8ba6ee2e13569f0ba4d9416d0dd5ebf36c910a2d68669e530fb66d5e"}},{"ruleId":"D2","level":"warning","message":{"text":"Capability.subsumes (cognitive 18): Capability.subsumes has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 7, match/switch 5 (6 pts), if/else 5 (nesting depth added 1). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/cc/Capability.scala"},"region":{"startLine":847}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c4cbce9787589b01cbc5738220176dc733011b79e9650478f7a34cd4c87585d"}},{"ruleId":"D2","level":"warning","message":{"text":"CheckCaptures.disallowBadRootsIn (cognitive 18): CheckCaptures.disallowBadRootsIn has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 3 (8 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":"compiler/src/dotty/tools/dotc/cc/CheckCaptures.scala"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"f64fc5ad719725534ddd721d1c5bb07270f867c285dfce880c5e4500e66256af"}},{"ruleId":"D2","level":"warning","message":{"text":"CaptureChecker.recheckDefDef (cognitive 18): CaptureChecker.recheckDefDef has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 2 (5 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":"compiler/src/dotty/tools/dotc/cc/CheckCaptures.scala"},"region":{"startLine":1370}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8bfdf561739197090d5fbe2bb7b2748d3bf562a733e4b7ab424b1a5995c4330"}},{"ruleId":"D2","level":"warning","message":{"text":"CaptureChecker.checkInferredResult (cognitive 18): CaptureChecker.checkInferredResult has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3, match/switch 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/cc/CheckCaptures.scala"},"region":{"startLine":1425}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfa9ca00e861ed7ea79f4ca7a92111288527e2eb71588d5bfe815b3bc0baa5e9"}},{"ruleId":"D2","level":"warning","message":{"text":"CommentExpander.expandInheritdoc (cognitive 18): CommentExpander.expandInheritdoc has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (10 pts), match/switch 3 (6 pts), loops 1 (2 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":"compiler/src/dotty/tools/dotc/core/Comments.scala"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"a35f1f8492a36a06a6b816af928e5a189e83c4fdf079de33d2d21ea93f494aa4"}},{"ruleId":"D2","level":"warning","message":{"text":"ConstraintHandling.widenInferred (cognitive 18): ConstraintHandling.widenInferred has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 2, 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":"compiler/src/dotty/tools/dotc/core/ConstraintHandling.scala"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b370be91c900fdbc512c51ebc7b0b284e363b3e57a46767719b995c9ef7a44a"}},{"ruleId":"D2","level":"warning","message":{"text":"NamerOps.normalizeIfConstructor (cognitive 18): NamerOps.normalizeIfConstructor has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (9 pts), match/switch 3 (8 pts), boolean chains 1 (nesting depth added 7). 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":"compiler/src/dotty/tools/dotc/core/NamerOps.scala"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"0862f8287d9a94e4ca693c4b12305cf9828ae6f552011beb3742da7b39b764ed"}},{"ruleId":"D2","level":"warning","message":{"text":"Substituters.substSym (cognitive 18): Substituters.substSym has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (4 pts), match/switch 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":"compiler/src/dotty/tools/dotc/core/Substituters.scala"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e2667c0af294535613df19c9377ba0faa6f163dabc8fc09f935456794dab0fd"}},{"ruleId":"D2","level":"warning","message":{"text":"SymDenotation.paramSymss (cognitive 18): SymDenotation.paramSymss has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (14 pts), loops 1 (2 pts), match/switch 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":"compiler/src/dotty/tools/dotc/core/SymDenotations.scala"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"544c3d1b49e0c4bac5f6b38672ad842dc8643c2737fc7f3dff2e8eb4ff8581d4"}},{"ruleId":"D2","level":"warning","message":{"text":"SymDenotation.sealedStrictDescendants (cognitive 18): SymDenotation.sealedStrictDescendants has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (17 pts), 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":"compiler/src/dotty/tools/dotc/core/SymDenotations.scala"},"region":{"startLine":1862}}}],"partialFingerprints":{"codehealthFindingId/v1":"733e0b0d96ba6e012a144180b2bce700ac485733686de6e87922469d6ec6c0db"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeComparer.matchingMethodParams (cognitive 18): TypeComparer.matchingMethodParams has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 4, 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":"compiler/src/dotty/tools/dotc/core/TypeComparer.scala"},"region":{"startLine":2454}}}],"partialFingerprints":{"codehealthFindingId/v1":"bca13b70437fcd81327943dd8b356cfa906a74dccae84831369c98503f58f1d8"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeErasure.tupleArity (cognitive 18): TypeErasure.tupleArity has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (14 pts), match/switch 2 (4 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":"compiler/src/dotty/tools/dotc/core/TypeErasure.scala"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a7f77739e71ac03440aee6c108fcd1a454411a7a2414c3da6943cf8e4b815fa"}},{"ruleId":"D2","level":"warning","message":{"text":"TastyPrinter.main (cognitive 18): TastyPrinter.main has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (12 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/tasty/TastyPrinter.scala"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccdc14fbf63dc7b7ae60024528e930f7993d48f10182aedb79a839c8aef40b18"}},{"ruleId":"D2","level":"warning","message":{"text":"Inlines.inlineParentInlineTraits (cognitive 18): Inlines.inlineParentInlineTraits has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 2 (5 pts), boolean chains 3, match/switch 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":"compiler/src/dotty/tools/dotc/inlines/Inlines.scala"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"436abd0e20091ad59b032fa11e30e12feff08bdd6a109216fd363fcf9cfbe4d4"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceTree.namePos (cognitive 18): SourceTree.namePos has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/interactive/SourceTree.scala"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a1cbea3f89bfb32b864c673ee42fc836a36fff3b76fe260a993122c1b4141f6"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.bracesToIndented (cognitive 18): Parser.bracesToIndented has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 9, if/else 6 (7 pts), match/switch 2 (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/parsing/Parsers.scala"},"region":{"startLine":847}}}],"partialFingerprints":{"codehealthFindingId/v1":"69bd9173dfdccc7e905c6db730ad8fb13ea8a9f7b86e639f4950454a8122ea6e"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.checkEndMarker (cognitive 18): Parser.checkEndMarker has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 5, 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":"compiler/src/dotty/tools/dotc/parsing/Parsers.scala"},"region":{"startLine":1726}}}],"partialFingerprints":{"codehealthFindingId/v1":"15eede4cb1032abe531366aed66a9fc569874ecda0ea860793c554887d6bd9b2"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.selfType (cognitive 18): Parser.selfType has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 4 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/parsing/Parsers.scala"},"region":{"startLine":5126}}}],"partialFingerprints":{"codehealthFindingId/v1":"e93e1008def52a1f0f6a58af3fb6ecf60c1451054011a351448a9e1e734a2acd"}},{"ruleId":"D2","level":"warning","message":{"text":"Scanner.fetchString (cognitive 18): Scanner.fetchString has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/parsing/Scanners.scala"},"region":{"startLine":1373}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0f8dc58d569f4fa73bd03a1bc0cbae75307e37ac2b27d3a3bad2491ff532b2d"}},{"ruleId":"D2","level":"warning","message":{"text":"RefinedPrinter.toTextRef (cognitive 18): RefinedPrinter.toTextRef has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 2 (5 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":"compiler/src/dotty/tools/dotc/printing/RefinedPrinter.scala"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d7f939a366236e06d63860e0fd50ef28cc609c699906c072b9cdfc381293572"}},{"ruleId":"D2","level":"warning","message":{"text":"PickledQuotes.spliceTerms (cognitive 18): PickledQuotes.spliceTerms has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 4 (6 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":"compiler/src/dotty/tools/dotc/quoted/PickledQuotes.scala"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c7854303f75dab4b6e8fbd4ba38c766a5bfca08f3cae742d7abe4731ca32a1c"}},{"ruleId":"D2","level":"warning","message":{"text":"ExtractAPICollector.treeHash (cognitive 18): ExtractAPICollector.treeHash has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (10 pts), match/switch 4 (6 pts), boolean chains 1, loops 1 (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":"compiler/src/dotty/tools/dotc/sbt/ExtractAPI.scala"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"8da6bb1e3393aa40454be383d38b4521368484f9a7768b244df7d4c8c9858ad7"}},{"ruleId":"D2","level":"warning","message":{"text":"Lifter.liftLocals (cognitive 18): Lifter.liftLocals has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 2, loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/LambdaLift.scala"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"1534332569ec1ed2d2b358fa9437d357b32c812a1caf501c6c4e059f8c03bc79"}},{"ruleId":"D2","level":"warning","message":{"text":"SpecializeInlineTraits.transformTypeDef (cognitive 18): SpecializeInlineTraits.transformTypeDef has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 2 (6 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/SpecializeInlineTraits.scala"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"d64b76cc5ba0fb1d5e81f0fc274f6d8a0b4bf2421794480b911a7d63fc2a116a"}},{"ruleId":"D2","level":"warning","message":{"text":"Env.resolveEnvRecur (cognitive 18): Env.resolveEnvRecur has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 1 (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":"compiler/src/dotty/tools/dotc/transform/init/Objects.scala"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9002f2192893b375007196b1be2b27c233ec345621c522efbe9dc62e2d733d8"}},{"ruleId":"D2","level":"warning","message":{"text":"SpaceEngine.computeIsSubspace (cognitive 18): SpaceEngine.computeIsSubspace has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 12, if/else 3, match/switch 2 (3 pts) (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/patmat/Space.scala"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c7067e354436a536f07aa4c8ba7bd96f9a31eeef9a778031c52a37df032cc1b"}},{"ruleId":"D2","level":"warning","message":{"text":"SpaceEngine.project (cognitive 18): SpaceEngine.project has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 1, match/switch 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/patmat/Space.scala"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f6b937315bb06f39d08b471ee91c8db083d642f03278e31383c26e94251ba95"}},{"ruleId":"D2","level":"warning","message":{"text":"ScalaJSPrepJSInteropTransformer.transformMemberDef (cognitive 18): ScalaJSPrepJSInteropTransformer.transformMemberDef has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (16 pts), match/switch 2 (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":"compiler/src/dotty/tools/dotc/transform/sjs/PrepJSInterop.scala"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dd1947eaec4931b2e54e2dc05da27bb9c5fe47c649bad47b62414551853dd60"}},{"ruleId":"D2","level":"warning","message":{"text":"ScalaJSPrepJSInteropTransformer.checkJSNativeDefinition (cognitive 18): ScalaJSPrepJSInteropTransformer.checkJSNativeDefinition has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/sjs/PrepJSInterop.scala"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"df325ee190f3d5f04189ffcf53a5d92702bdfd699ec55bca0ec6475dd7560063"}},{"ruleId":"D2","level":"warning","message":{"text":"Checking.checkScala2Implicit (cognitive 18): Checking.checkScala2Implicit has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (13 pts), match/switch 4, boolean chains 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":"compiler/src/dotty/tools/dotc/typer/Checking.scala"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"165f5dcc6b05e087c526677b3f46f2f9babdc9836c07ea7d479d931c7998d411"}},{"ruleId":"D2","level":"warning","message":{"text":"Errors.typeMismatch (cognitive 18): Errors.typeMismatch has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (9 pts), match/switch 4 (7 pts), boolean chains 2 (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":"compiler/src/dotty/tools/dotc/typer/ErrorReporting.scala"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"b238a89252e78d58cd1be76577ee9ea5adce895b3433510092e73422b69e0964"}},{"ruleId":"D2","level":"warning","message":{"text":"EtaExpansion.etaExpand (cognitive 18): EtaExpansion.etaExpand has cognitive complexity 18 (threshold 15). Drivers by points: if/else 14, boolean chains 3, match/switch 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/EtaExpansion.scala"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"06215bd02e8ece6b2a7b935948cadfc862922aba34b96489fef00fd9745600f3"}},{"ruleId":"D2","level":"warning","message":{"text":"Linter.warnOnImplausiblePattern (cognitive 18): Linter.warnOnImplausiblePattern has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 5, match/switch 3 (4 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/Linter.scala"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f9df5a6f45057c0f4fa328a36661bdca5fc09c93e4991e8b9c96866ada93e08"}},{"ruleId":"D2","level":"warning","message":{"text":"Namer.defDefSig (cognitive 18): Namer.defDefSig has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 3 (4 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":"compiler/src/dotty/tools/dotc/typer/Namer.scala"},"region":{"startLine":2027}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5f71e449b34f8fc808742ba3fb4fda46abf4c60d991ef1d665a236431cc63ae"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeAssigner.selectionType (cognitive 18): TypeAssigner.selectionType has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (12 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":"compiler/src/dotty/tools/dotc/typer/TypeAssigner.scala"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fea4bc060364441161b4c59faa6df32bdd0a51a4cf0625dcdbeb1c427900dd2"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeAssigner.assignType (cognitive 18): TypeAssigner.assignType has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 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":"compiler/src/dotty/tools/dotc/typer/TypeAssigner.scala"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"caf3d20cd31163872fb195c75b533752eb8d5ea710a212b1aae48e5eecfbf1db"}},{"ruleId":"D2","level":"warning","message":{"text":"Typer.typedMatchTypeTree (cognitive 18): Typer.typedMatchTypeTree has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"compiler/src/dotty/tools/dotc/typer/Typer.scala"},"region":{"startLine":2916}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f45b1f6eb0eb2183c1e296103f24d7840d69f9ff5352627ed2c7e7a18142f8d"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceCodePrinter.printParamDef (cognitive 18): SourceCodePrinter.printParamDef has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/scala/quoted/runtime/impl/printers/SourceCode.scala"},"region":{"startLine":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"14064821831f56d702de9630979b57c83f28c40e9dcd476ba5a44207e6cf2dcd"}},{"ruleId":"D2","level":"warning","message":{"text":"AnyIteratorStepper.trySplit (cognitive 18): AnyIteratorStepper.trySplit has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 3 other methods here (DoubleIteratorStepper.trySplit, IntIteratorStepper.trySplit, LongIteratorStepper.trySplit) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/collection/convert/impl/IteratorStepper.scala"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"6454e9ab32371cb735be9812654a6b1d368284b6ff45ac9b845919743bbb7a0c"}},{"ruleId":"D2","level":"warning","message":{"text":"DoubleIteratorStepper.trySplit (cognitive 18): DoubleIteratorStepper.trySplit has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 3 other methods here (AnyIteratorStepper.trySplit, IntIteratorStepper.trySplit, LongIteratorStepper.trySplit) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/collection/convert/impl/IteratorStepper.scala"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c4e8ae83f3d14781b45be818abccb1aec5d49d3d97daf26a2625dc38a5f4ae9"}},{"ruleId":"D2","level":"warning","message":{"text":"IntIteratorStepper.trySplit (cognitive 18): IntIteratorStepper.trySplit has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 3 other methods here (AnyIteratorStepper.trySplit, DoubleIteratorStepper.trySplit, LongIteratorStepper.trySplit) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/collection/convert/impl/IteratorStepper.scala"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"dda37ea255b410e02b82ff5758f11a570b5da804c5619fb73b103d5ff595001a"}},{"ruleId":"D2","level":"warning","message":{"text":"LongIteratorStepper.trySplit (cognitive 18): LongIteratorStepper.trySplit has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 3 other methods here (AnyIteratorStepper.trySplit, DoubleIteratorStepper.trySplit, IntIteratorStepper.trySplit) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/collection/convert/impl/IteratorStepper.scala"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2b17efe083a1a1b6bad98e3afd3a302c761c580506ca9bae9dd5a74217748d4"}},{"ruleId":"D2","level":"warning","message":{"text":"DefaultPromise.tryAwait0 (cognitive 18): DefaultPromise.tryAwait0 has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (18 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":"library/src/scala/concurrent/impl/Promise.scala"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cf5246d58d0cba7a8ef083b38770b5ebd5b3ef7292a525f33db8208bd3b13de"}},{"ruleId":"D2","level":"warning","message":{"text":"XRayModeHint.unapply (cognitive 18): XRayModeHint.unapply has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 4 (9 pts), if/else 6, boolean chains 3 (nesting depth added 5). 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":"presentation-compiler/src/main/dotty/tools/pc/PcInlayHintsProvider.scala"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"69cc75966fe9e16e2c87ff66d58a3f05c143745a8832a3abededa38b4eff9dd4"}},{"ruleId":"D2","level":"warning","message":{"text":"PcSymbolSearch.soughtSymbols (cognitive 18): PcSymbolSearch.soughtSymbols has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 7, match/switch 2 (nesting depth added 3). 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":"presentation-compiler/src/main/dotty/tools/pc/PcSymbolSearch.scala"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"97ecacfd97417b3af03e39ddd31b2b328962e09e641ac6a04322f686efbc076f"}},{"ruleId":"D2","level":"warning","message":{"text":"InterpolatorCompletions.contributeScope (cognitive 18): InterpolatorCompletions.contributeScope has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 5, match/switch 2, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"presentation-compiler/src/main/dotty/tools/pc/completions/InterpolatorCompletions.scala"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfca93035ead1e07d7067af5b51593acfb81672ca161af9f7db17dbb5e1af0e8"}},{"ruleId":"D2","level":"warning","message":{"text":"CompletionValueGenerator.labelForCaseMember (cognitive 18): CompletionValueGenerator.labelForCaseMember has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 6 (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":"presentation-compiler/src/main/dotty/tools/pc/completions/MatchCaseCompletions.scala"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"315eafe425c3c17732becf134aff13f879e529fff30f72677d2c86375d1880ad"}},{"ruleId":"D2","level":"warning","message":{"text":"ShortenedTypePrinter.splitExtensionParamss (cognitive 18): ShortenedTypePrinter.splitExtensionParamss has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (13 pts), match/switch 2 (4 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":"presentation-compiler/src/main/dotty/tools/pc/printer/ShortenedTypePrinter.scala"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4ec3c49915258fb0521ae214db8ccd5905bdea1b874727eb575feacac7bd11c"}},{"ruleId":"D2","level":"warning","message":{"text":"ReplCompiler.docOf (cognitive 18): ReplCompiler.docOf has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 2 (7 pts), match/switch 2 (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":"repl/src/dotty/tools/repl/ReplCompiler.scala"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0acc4fa5284903e8d9d4299cd12808c7c446be4a29bc0b73983224040826f76"}},{"ruleId":"D2","level":"warning","message":{"text":"ReplPhase.definitions (cognitive 18): ReplPhase.definitions has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (7 pts), loops 3 (6 pts), match/switch 4 (5 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":"repl/src/dotty/tools/repl/ReplCompiler.scala"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"929e09becc495d5209588aa0c836823d34cade066271f68cf48d908da14f4c6d"}},{"ruleId":"D2","level":"warning","message":{"text":"SearchbarComponent.handleArrowDown (cognitive 18): SearchbarComponent.handleArrowDown has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scaladoc-js/main/src/searchbar/SearchbarComponent.scala"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"f44b52deaa468d47de36c9c46f43e09480077adb617eb01327c4a1c923947ab6"}},{"ruleId":"D2","level":"warning","message":{"text":"Locations.rawLocation (cognitive 18): Locations.rawLocation has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 3 (6 pts), boolean chains 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scaladoc/src/dotty/tools/scaladoc/renderers/Locations.scala"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"eac8200e71b7cbcd09df6edad01a8b8ed90ff00ce040f5973a138df70dd65615"}},{"ruleId":"D2","level":"warning","message":{"text":"ScaladocTastyInspector.inspect (cognitive 18): ScaladocTastyInspector.inspect has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (11 pts), match/switch 3, boolean chains 2, error handling 1, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"scaladoc/src/dotty/tools/scaladoc/tasty/TastyParser.scala"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"95c62540f7431c25f07839cc843b0c1dd2ae6a76994fbaa7dc315941c0fd63c6"}},{"ruleId":"D2","level":"warning","message":{"text":"BCodeUtils.substituteLabel (cognitive 17): BCodeUtils.substituteLabel has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 1, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/backend/jvm/BCodeUtils.scala"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"076f37c261738b56b32885f9a70e5cfaa6e92939d7c1e96c75c49e30038dda0f"}},{"ruleId":"D2","level":"warning","message":{"text":"JSCodeGen.genApply (cognitive 17): JSCodeGen.genApply has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 3, match/switch 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":"compiler/src/dotty/tools/backend/sjs/JSCodeGen.scala"},"region":{"startLine":2265}}}],"partialFingerprints":{"codehealthFindingId/v1":"41e11276533b1a6544aab1f84c3c104f945b0f0f88818f5405645ac4a2d03a48"}},{"ruleId":"D2","level":"warning","message":{"text":"JSCodeGen.genEqEqPrimitive (cognitive 17): JSCodeGen.genEqEqPrimitive has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 4 (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":"compiler/src/dotty/tools/backend/sjs/JSCodeGen.scala"},"region":{"startLine":3001}}}],"partialFingerprints":{"codehealthFindingId/v1":"91e79555fa82c051a32f5f7d8a8408e4b33071a351e4f5525d79cd4eac048b0a"}},{"ruleId":"D2","level":"warning","message":{"text":"JSCodeGen.genApplyJSMethodGeneric (cognitive 17): JSCodeGen.genApplyJSMethodGeneric has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (11 pts), match/switch 3 (5 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"compiler/src/dotty/tools/backend/sjs/JSCodeGen.scala"},"region":{"startLine":3286}}}],"partialFingerprints":{"codehealthFindingId/v1":"59bb4e0bf2b313e8fc21129089492eb55b4550435c0242c99bd5dfc439748c94"}},{"ruleId":"D2","level":"warning","message":{"text":"JSEncoding.toTypeRefInternal (cognitive 17): JSEncoding.toTypeRefInternal has cognitive complexity 17 (threshold 15). Drivers by points: if/else 14 (16 pts), 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":"compiler/src/dotty/tools/backend/sjs/JSEncoding.scala"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eeec18e2e3ae0d1d388fd5fa25c38d0b6111ec275afbdd75351d4ce0943ec51"}},{"ruleId":"D2","level":"warning","message":{"text":"JSExportsGen.genOverloadDispatchSameArgcRec (cognitive 17): JSExportsGen.genOverloadDispatchSameArgcRec has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 2 (6 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/backend/sjs/JSExportsGen.scala"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"447900d024e72ea4c265e2b2c293afafe44d6da993491657a1be1941b88e932d"}},{"ruleId":"D2","level":"warning","message":{"text":"desugar.desugarContextBounds (cognitive 17): desugar.desugarContextBounds has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 2 (4 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/ast/Desugar.scala"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"38d0c0fcd4bf6e59b540d5f227ef9fba9555f5bc0565d5d48a7cc5a825e23889"}},{"ruleId":"D2","level":"warning","message":{"text":"Capability.transClassifiers (cognitive 17): Capability.transClassifiers has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (15 pts), match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/cc/Capability.scala"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a462df6a4c69df50a5c2f0b514dac4460b403db23c25925187a4165d9fa9211"}},{"ruleId":"D2","level":"warning","message":{"text":"CaptureSet.ofType (cognitive 17): CaptureSet.ofType has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), match/switch 2 (4 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":"compiler/src/dotty/tools/dotc/cc/CaptureSet.scala"},"region":{"startLine":1819}}}],"partialFingerprints":{"codehealthFindingId/v1":"74df74e9b428303035eb7f95776d885f4899bcd83be9a46da0f5e506f91b7c1e"}},{"ruleId":"D2","level":"warning","message":{"text":"Var.addThisElem (cognitive 17): Var.addThisElem has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 3, match/switch 1 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/cc/CaptureSet.scala"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"d01df8dcc5163105ca64d59a5af3bc47c9bdf64f1d742571960c148f5d9ad2da"}},{"ruleId":"D2","level":"warning","message":{"text":"Setup.recordParamAliases (cognitive 17): Setup.recordParamAliases has cognitive complexity 17 (threshold 15). Drivers by points: loops 3 (10 pts), if/else 3 (6 pts), boolean chains 1 (nesting depth added 10). 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":"compiler/src/dotty/tools/dotc/cc/Setup.scala"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f73967a89b424e70b9236559cea569b3f14d4cf289b2cf1a4c8a5c495f3912c"}},{"ruleId":"D2","level":"warning","message":{"text":"Synthetics.transform (cognitive 17): Synthetics.transform has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 5 (6 pts), boolean chains 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":"compiler/src/dotty/tools/dotc/cc/Synthetics.scala"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"2470160abd408599355b2d557e51396918f2f31a6688d6969b968c5f9935cd81"}},{"ruleId":"D2","level":"warning","message":{"text":"Columnator.columnate (cognitive 17): Columnator.columnate has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13, match/switch 2 (3 pts), boolean chains 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/config/CliCommand.scala"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"53583c2a8f1a4e4eb09d149aadceadaca1a0ee9e180fb81fbe541a9b6e25c898"}},{"ruleId":"D2","level":"warning","message":{"text":"OrderingConstraint.order (cognitive 17): OrderingConstraint.order has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/OrderingConstraint.scala"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"b26639dd2caf8039805814113fc6092a5573d2632be93e745ef81761f69602c0"}},{"ruleId":"D2","level":"warning","message":{"text":"MutableScope.lookupEntry (cognitive 17): MutableScope.lookupEntry has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), loops 2 (4 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 5). 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":"compiler/src/dotty/tools/dotc/core/Scopes.scala"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"08e8bd4d9568df63700a21d6b502a2fba230bf761445b3bc2e85bf238e20423e"}},{"ruleId":"D2","level":"warning","message":{"text":"Symbol.source (cognitive 17): Symbol.source has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 3 (9 pts), if/else 7, boolean chains 1 (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":"compiler/src/dotty/tools/dotc/core/Symbols.scala"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"dda57c3d3351fe533e335d0f756468f0bccbb3d571de4f41954fa256a49680c3"}},{"ruleId":"D2","level":"warning","message":{"text":"TyperState.mergeConstraintWith (cognitive 17): TyperState.mergeConstraintWith has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 8, if/else 5 (7 pts), loops 1, match/switch 1 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/TyperState.scala"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebebdd3f220ffb1ce2813192841b70b3f853da8539ee96c262429dd5a3eb6af7"}},{"ruleId":"D2","level":"warning","message":{"text":"Type.testProvisional (cognitive 17): Type.testProvisional has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 9, if/else 4 (6 pts), match/switch 1 (2 pts) (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/Types.scala"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"93b76eb57c5f994a30d6da2b5da4fcc4efac29a88d6a005f6bcdb57cb443edb3"}},{"ruleId":"D2","level":"warning","message":{"text":"NamedType.argDenot (cognitive 17): NamedType.argDenot has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 3, match/switch 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":"compiler/src/dotty/tools/dotc/core/Types.scala"},"region":{"startLine":2576}}}],"partialFingerprints":{"codehealthFindingId/v1":"f21cceb9f958afd7c50b8e04cfcc9401987cf4e2f86f0fcec2371ca60c51a5ff"}},{"ruleId":"D2","level":"warning","message":{"text":"NamedType.infoDependsOnPrefix (cognitive 17): NamedType.infoDependsOnPrefix has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 8, match/switch 4 (6 pts), if/else 3 (nesting depth added 2). 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":"compiler/src/dotty/tools/dotc/core/Types.scala"},"region":{"startLine":2684}}}],"partialFingerprints":{"codehealthFindingId/v1":"622da701b7d8ba938d8b82a059873160ad50f95530288a582e3176e2e0539cef"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassfileParser.parseClass (cognitive 17): ClassfileParser.parseClass has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), loops 3 (6 pts), boolean chains 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":"compiler/src/dotty/tools/dotc/core/classfile/ClassfileParser.scala"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"e90ddd2bd3a3150e73bfe89e91191ec88774017ea33ae318e57df1abe77d634b"}},{"ruleId":"D2","level":"warning","message":{"text":"TreePickler.pickleDef (cognitive 17): TreePickler.pickleDef has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 4, loops 1 (2 pts), match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/tasty/TreePickler.scala"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fdc9d605952736d743f8b26f0daa57e7f710e0fed1704598446c231e9828f6f"}},{"ruleId":"D2","level":"warning","message":{"text":"JavaParser.modifiers (cognitive 17): JavaParser.modifiers has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 3 (8 pts), if/else 5 (7 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/parsing/JavaParsers.scala"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e55b5dec52213458ef91d95c040f144a109d6a69d852be1f30d9385beaa5fcd"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.followedByToken (cognitive 17): Parser.followedByToken has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 2, 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":"compiler/src/dotty/tools/dotc/parsing/Parsers.scala"},"region":{"startLine":955}}}],"partialFingerprints":{"codehealthFindingId/v1":"8274ef380dc3e37c0426bd56efa4bec5900a85b0238da71af8c6050fd38ad367"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.accessQualifierOpt (cognitive 17): Parser.accessQualifierOpt has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (16 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":"compiler/src/dotty/tools/dotc/parsing/Parsers.scala"},"region":{"startLine":3729}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b50c511e2dcd88556bc0de4fd46af85a17cebd4aeab313074c63226c287fff8"}},{"ruleId":"D2","level":"warning","message":{"text":"QuotePatterns.encode (cognitive 17): QuotePatterns.encode has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13, loops 2 (4 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/quoted/QuotePatterns.scala"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"964a927810d1f13cf9133bec7fdd9a7ba52561ef6ab787893d06c819d9a61a1d"}},{"ruleId":"D2","level":"warning","message":{"text":"NotAMember.msg (cognitive 17): NotAMember.msg has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 2, 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":"compiler/src/dotty/tools/dotc/reporting/messages.scala"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8ab1f078c4d7586403eed1b0f959928649df9b2cde324b5c750992c58329483"}},{"ruleId":"D2","level":"warning","message":{"text":"AbstractExtractDependenciesCollector.recordTree (cognitive 17): AbstractExtractDependenciesCollector.recordTree has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 2, loops 1 (2 pts), match/switch 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/sbt/ExtractDependencies.scala"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aa68154d4a397a15319245caab90ac0d8d89376119bf401f69781fb049dfeb9"}},{"ruleId":"D2","level":"warning","message":{"text":"SemanticdbInputStream.tryRefillBuffer (cognitive 17): SemanticdbInputStream.tryRefillBuffer has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/semanticdb/internal/SemanticdbInputStream.scala"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce3988ea3a7dbf93270be52f12439e96a330a2f74d8c9d7a66709b031a7be05e"}},{"ruleId":"D2","level":"warning","message":{"text":"ContextFunctionResults.integrateSelect (cognitive 17): ContextFunctionResults.integrateSelect has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (8 pts), match/switch 2 (6 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/ContextFunctionResults.scala"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"d239a4d2b271b4f415aabe396de346422f4c4feeb10c413a7ea9b5a7bedf9f87"}},{"ruleId":"D2","level":"warning","message":{"text":"LambdaLift.transformIdent (cognitive 17): LambdaLift.transformIdent has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 1, match/switch 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":"compiler/src/dotty/tools/dotc/transform/LambdaLift.scala"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"abf124f838da1855c6ebe1ddc0896d138a3f0bd777a78a14791cd1a1f8d4b454"}},{"ruleId":"D2","level":"warning","message":{"text":"MegaPhase.transformTree (cognitive 17): MegaPhase.transformTree has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (14 pts), match/switch 2, boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"compiler/src/dotty/tools/dotc/transform/MegaPhase.scala"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"88038b018a6d40b6de5029cbb0d8e4192d6d396cb94b3e473b41cd1362e3d1c4"}},{"ruleId":"D2","level":"warning","message":{"text":"PostTyperTransformer.makeFormalsDeclared (cognitive 17): PostTyperTransformer.makeFormalsDeclared has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (8 pts), match/switch 4 (8 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":"compiler/src/dotty/tools/dotc/transform/PostTyper.scala"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bc7f63c649a0115f06d46eaaff28ff8939df73c0bce012a8791c06c218f7e37"}},{"ruleId":"D2","level":"warning","message":{"text":"Splicer.splice (cognitive 17): Splicer.splice has cognitive complexity 17 (threshold 15). Drivers by points: error handling 4 (8 pts), if/else 4 (8 pts), match/switch 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":"compiler/src/dotty/tools/dotc/transform/Splicer.scala"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"969db0c5683b8bf29b198a3360f0cc9413422a7e13f06f8ee65e65d6cc027e49"}},{"ruleId":"D2","level":"warning","message":{"text":"SyntheticMembers.fromProductBody (cognitive 17): SyntheticMembers.fromProductBody has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (12 pts), loops 1 (2 pts), match/switch 2, boolean chains 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/SyntheticMembers.scala"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"96febeec5a6c278130c3fb12b14fe0a2d24d96d2abc6935c576c650ef527add5"}},{"ruleId":"D2","level":"warning","message":{"text":"SpaceEngine.intersect (cognitive 17): SpaceEngine.intersect has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (16 pts), 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":"compiler/src/dotty/tools/dotc/transform/patmat/Space.scala"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"843e93968345ed8984e49a26b9be5ab45c39d264889ebc3985ffa45310fda5ca"}},{"ruleId":"D2","level":"warning","message":{"text":"SpaceEngine.erase (cognitive 17): SpaceEngine.erase has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 2, 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":"compiler/src/dotty/tools/dotc/transform/patmat/Space.scala"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"861356fc24e3bdf1dfb914710acef3100777be565afe38e9a9ab1dd4679d07f1"}},{"ruleId":"D2","level":"warning","message":{"text":"JSCallingConvention.of (cognitive 17): JSCallingConvention.of has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 4, match/switch 1 (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":"compiler/src/dotty/tools/dotc/transform/sjs/JSSymUtils.scala"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e91c49ac011b7aa9318214360a7c9527bb94bd0ccd12e01ffc034c717fee415"}},{"ruleId":"D2","level":"warning","message":{"text":"Checking.checkValidInfix (cognitive 17): Checking.checkValidInfix has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 3 (5 pts), boolean chains 2 (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":"compiler/src/dotty/tools/dotc/typer/Checking.scala"},"region":{"startLine":1282}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5f8cbd075185de4fdf3ba88e13948b1d3b1d05450fedd744a8a817354f6bbed"}},{"ruleId":"D2","level":"warning","message":{"text":"ImplicitSearch.recursiveRef (cognitive 17): ImplicitSearch.recursiveRef has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 4, match/switch 2 (4 pts) (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/Implicits.scala"},"region":{"startLine":1920}}}],"partialFingerprints":{"codehealthFindingId/v1":"486ab863c3c6ee993deba50d0af15cc3c624990ea7e034997c4d2502a591fbd4"}},{"ruleId":"D2","level":"warning","message":{"text":"MatchResult.toExpr (cognitive 17): MatchResult.toExpr has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), match/switch 3 (6 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":"compiler/src/scala/quoted/runtime/impl/QuoteMatcher.scala"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"417d07684e813996dcee6071b51093220f29432452bd0e451d953d8c84c28027"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeRepr.typeConstructorOf (cognitive 17): TypeRepr.typeConstructorOf has cognitive complexity 17 (threshold 15). Drivers by points: if/else 15 (17 pts) (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/scala/quoted/runtime/impl/QuotesImpl.scala"},"region":{"startLine":1852}}}],"partialFingerprints":{"codehealthFindingId/v1":"67c64b804b3262001c9deeb0a81a1175f2af8202fb416b322cda32cd22b3c1f3"}},{"ruleId":"D2","level":"warning","message":{"text":"Map.updateWithAux (cognitive 17): Map.updateWithAux has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 3 (5 pts) (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/collection/concurrent/Map.scala"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"a96c4b697740ef876467716992a23804d098b01d85a172717e1076bdb8a5c561"}},{"ruleId":"D2","level":"warning","message":{"text":"ChampStepperBase.trySplit (cognitive 17): ChampStepperBase.trySplit has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 2 (6 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":"library/src/scala/collection/convert/impl/ChampStepper.scala"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"6489b2f346179ed09c66b53d7a206705427abf2e25c17985bb7b016a4afb36e2"}},{"ruleId":"D2","level":"warning","message":{"text":"DefaultPromise.removeCallback (cognitive 17): DefaultPromise.removeCallback has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (17 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":"library/src/scala/concurrent/impl/Promise.scala"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bbd08758e50b1aed7a64b51f8cb2a1700e9b6636b049320edda2843415b20b3"}},{"ruleId":"D2","level":"warning","message":{"text":"AnyAccumulatorStepper.trySplit (cognitive 17): AnyAccumulatorStepper.trySplit has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (17 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":"library/src/scala/jdk/AnyAccumulator.scala"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffbc7fabbfcb302b4713daa51178dc13991fb520972f7ccb27f8166c067d0c10"}},{"ruleId":"D2","level":"warning","message":{"text":"DoubleAccumulatorStepper.trySplit (cognitive 17): DoubleAccumulatorStepper.trySplit has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (17 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":"library/src/scala/jdk/DoubleAccumulator.scala"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"29a0e629790287f86aa39eff430b4eae9cfd8faa3d36e7cf6130884e5adccad8"}},{"ruleId":"D2","level":"warning","message":{"text":"IntAccumulatorStepper.trySplit (cognitive 17): IntAccumulatorStepper.trySplit has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (17 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":"library/src/scala/jdk/IntAccumulator.scala"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f7028c833e3cf2bed79edafa9be92165285297dd26ba12ba20a87e8122100a7"}},{"ruleId":"D2","level":"warning","message":{"text":"LongAccumulatorStepper.trySplit (cognitive 17): LongAccumulatorStepper.trySplit has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (17 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":"library/src/scala/jdk/LongAccumulator.scala"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa573bdda77306db8290d05f34aaff0ddeb64a69fd18a6400d9b6abb74494224"}},{"ruleId":"D2","level":"warning","message":{"text":"InferredType.unapply (cognitive 17): InferredType.unapply has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 4, 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":"presentation-compiler/src/main/dotty/tools/pc/PcInlayHintsProvider.scala"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"3518ae73c96e52d8fa7559f3a501c614f34a06d46ef369f1103e10ed562710d9"}},{"ruleId":"D2","level":"warning","message":{"text":"SignatureHelpProvider.withDocumentation (cognitive 17): SignatureHelpProvider.withDocumentation has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (8 pts), match/switch 5 (8 pts), boolean chains 1 (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":"presentation-compiler/src/main/dotty/tools/pc/SignatureHelpProvider.scala"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d7afc383ac4199401cdde363ccc19ed97ccdde3ad39951f365bdbc8aa856d21"}},{"ruleId":"D2","level":"warning","message":{"text":"AmmoniteFileCompletions.contribute (cognitive 17): AmmoniteFileCompletions.contribute has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 4, match/switch 3 (4 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":"presentation-compiler/src/main/dotty/tools/pc/completions/AmmoniteFileCompletions.scala"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfee4d1a904da7719b5b38bfda4f0b7246679114d8edee3cfec37c93148e0684"}},{"ruleId":"D2","level":"warning","message":{"text":"AbstractFileClassLoader.loadClass (cognitive 17): AbstractFileClassLoader.loadClass has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (8 pts), match/switch 2 (5 pts), error handling 1 (3 pts), boolean chains 1 (nesting depth added 6). 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":"repl/src/dotty/tools/repl/AbstractFileClassLoader.scala"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"76f54d874669ecc2e0c16ae949072862ebff00e26c2aaea0f08256a30f138a3d"}},{"ruleId":"D2","level":"warning","message":{"text":"ParseResult.leadingCommand (cognitive 17): ParseResult.leadingCommand has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), match/switch 2 (6 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":"repl/src/dotty/tools/repl/ParseResult.scala"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f0f5c1ae39388b627c26704e58bb175bc37b7f81aeba8898a75cc03f8a3e89e"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassLikeSupport.parseMethod (cognitive 17): ClassLikeSupport.parseMethod has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8, match/switch 4 (5 pts), boolean chains 4 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scaladoc/src/dotty/tools/scaladoc/tasty/ClassLikeSupport.scala"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c2eba853c32a0515c269ed2a027669a781c6307cd533687aaf99c36b62fee27"}},{"ruleId":"D2","level":"warning","message":{"text":"Main.main (cognitive 16): Main.main has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 1, match/switch 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":"community-build/src/scala/dotty/communitybuild/Main.scala"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f6d275007e257b65c706ea55694654919d8ab8dd39873da6fa4d9e973ebc1f8"}},{"ruleId":"D2","level":"warning","message":{"text":"JCodeMethodN.emitT2T (cognitive 16): JCodeMethodN.emitT2T has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 5 (8 pts), if/else 6, boolean chains 2 (nesting depth added 3). 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":"compiler/src/dotty/tools/backend/jvm/BCodeIdiomatic.scala"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f181c49e2c585e670c87ac2f1fbf5741a2885647d8cc6f59e6ed80d13196c8b"}},{"ruleId":"D2","level":"warning","message":{"text":"Ref.checkRefCreation (cognitive 16): Ref.checkRefCreation has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), loops 2 (5 pts), match/switch 2, boolean chains 1 (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":"compiler/src/dotty/tools/backend/jvm/opt/BoxUnbox.scala"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdfe2e2be5c5bcc387fe4fadaff00ec51451f48356db624f951a89837183ea51"}},{"ruleId":"D2","level":"warning","message":{"text":"JSCodeGen.genClassFields (cognitive 16): JSCodeGen.genClassFields has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 5 (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":"compiler/src/dotty/tools/backend/sjs/JSCodeGen.scala"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d1e0bb453486e801daabff8c2d1a1cdf9c1d2e7f7e8c320ed1edfa7126d3b3d"}},{"ruleId":"D2","level":"warning","message":{"text":"suppressions.nowarnAction (cognitive 16): suppressions.nowarnAction has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 1 (3 pts), match/switch 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":"compiler/src/dotty/tools/dotc/Run.scala"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"99feae6619d4589c4a8bb12d4320224f1dd97ed797ddfb936e41ffb3e08961dc"}},{"ruleId":"D2","level":"warning","message":{"text":"TypedTreeInfo.exprPurity (cognitive 16): TypedTreeInfo.exprPurity has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 2, match/switch 1 (nesting depth added 3). 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":"compiler/src/dotty/tools/dotc/ast/TreeInfo.scala"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"603ebb26e79fd9e97cdbb45b054e409f5b86a8460fed394cb1d87eba80a2716f"}},{"ruleId":"D2","level":"warning","message":{"text":"tpd.ref (cognitive 16): tpd.ref has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/ast/tpd.scala"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"43baa7bdf0abb7c14eca24aeb88ce39f9585d6743c33beb1b6ed79ca16841e2c"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeOps.changeOwnerAfter (cognitive 16): TreeOps.changeOwnerAfter has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/ast/tpd.scala"},"region":{"startLine":927}}}],"partialFingerprints":{"codehealthFindingId/v1":"d008008ce991ded31dfdddb895a8989434899bfec1acb502672a1f4a0500a2c9"}},{"ruleId":"D2","level":"warning","message":{"text":"Capability.maxSubsumes (cognitive 16): Capability.maxSubsumes has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 8, if/else 5, match/switch 3. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/cc/Capability.scala"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ecefb8613297b7b881877c28a9a50e5e4349cc402335c14506a21588242fd22"}},{"ruleId":"D2","level":"warning","message":{"text":"CaptureChecker.anchorCaps (cognitive 16): CaptureChecker.anchorCaps has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 3 (9 pts), if/else 4, loops 1 (3 pts) (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":"compiler/src/dotty/tools/dotc/cc/CheckCaptures.scala"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb2299d659713e76ed3e9bfc32a123a8642099e6d97976da4f753f3c7a4a4814"}},{"ruleId":"D2","level":"warning","message":{"text":"Setup.transformInferredType (cognitive 16): Setup.transformInferredType has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 4, match/switch 3 (4 pts) (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/cc/Setup.scala"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff8a56e8a685c555dd8cebd3eb6016681c9be31cab9e30a836efe5216db5d343"}},{"ruleId":"D2","level":"warning","message":{"text":"ConstraintHandling.addBoundTransitively (cognitive 16): ConstraintHandling.addBoundTransitively has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 3, 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":"compiler/src/dotty/tools/dotc/core/ConstraintHandling.scala"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"5531200c93214193c83c8a00eb105ac78188d0b3a9aa4e69aa377697fc89119e"}},{"ruleId":"D2","level":"warning","message":{"text":"Context.implicits (cognitive 16): Context.implicits has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), error handling 1 (3 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/Contexts.scala"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b8bd68c6ae85e7a9fe5a6e41ceae12b2e6b9cfafb8e89cab18b0a12f5edb086"}},{"ruleId":"D2","level":"warning","message":{"text":"SingleDenotation.matchesLoosely (cognitive 16): SingleDenotation.matchesLoosely has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 5, match/switch 1 (2 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":"compiler/src/dotty/tools/dotc/core/Denotations.scala"},"region":{"startLine":1058}}}],"partialFingerprints":{"codehealthFindingId/v1":"35ed162c4a2d92ed05af7db7bd6812021289ac406f19d6f4ed3b280d987e8484"}},{"ruleId":"D2","level":"warning","message":{"text":"GadtState.addBound (cognitive 16): GadtState.addBound has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (14 pts), 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":"compiler/src/dotty/tools/dotc/core/GadtConstraint.scala"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd3d9652c2fbd84eeeb7b58b0f0aa7e46c3cedeaac40b81bbd8330d8682ec5a5"}},{"ruleId":"D2","level":"warning","message":{"text":"NamerOps.addContextBoundCompanions (cognitive 16): NamerOps.addContextBoundCompanions has cognitive complexity 16 (threshold 15). Drivers by points: if/else 2 (6 pts), match/switch 1 (5 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/NamerOps.scala"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7a5939098fefece4b02a34cedab254c433ff8e55b792bf0306657c7d4a79022"}},{"ruleId":"D2","level":"warning","message":{"text":"PhasesBase.usePhases (cognitive 16): PhasesBase.usePhases has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6, loops 3 (5 pts), match/switch 3 (5 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":"compiler/src/dotty/tools/dotc/core/Phases.scala"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"04ee0a547a0ffb5549e12e81cc76df7b239131b02f907c7ecab611c9e25146ba"}},{"ruleId":"D2","level":"warning","message":{"text":"SubstApproxMap.apply (cognitive 16): SubstApproxMap.apply has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 2 (5 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/Substituters.scala"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf1a807d62a198bef6407d78ff8eb54537a7e9b22710cc90c2173462659f76a2"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeComparer.inNestedLevel (cognitive 16): TypeComparer.inNestedLevel has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (16 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":"compiler/src/dotty/tools/dotc/core/TypeComparer.scala"},"region":{"startLine":1711}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b49022834ad9552168aa96131137aabfd13784d34907548bea9ffcf47007d39"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeComparer.matchesType (cognitive 16): TypeComparer.matchesType has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 4 (7 pts), boolean chains 5, if/else 4 (nesting depth added 3). 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":"compiler/src/dotty/tools/dotc/core/TypeComparer.scala"},"region":{"startLine":2418}}}],"partialFingerprints":{"codehealthFindingId/v1":"aabcddcfb22c3adbd2c756cbe010833609a098b7c667b66127ac1c0b34fef929"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeMap.mapCapability (cognitive 16): TypeMap.mapCapability has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 6 (12 pts), if/else 3 (4 pts) (nesting depth added 7). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/Types.scala"},"region":{"startLine":6269}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae71a5f14a91d8bdde3be88d772cb18ff5d9e14f3db5ae02099d393be801bd93"}},{"ruleId":"D2","level":"warning","message":{"text":"AppliedUniques.enterIfNew (cognitive 16): AppliedUniques.enterIfNew has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/Uniques.scala"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eb81316fceae90d2a80195827167edcc6f7e0bafcbb353b21ca10c1cce54fb0"}},{"ruleId":"D2","level":"warning","message":{"text":"InlineTyper.typedIf (cognitive 16): InlineTyper.typedIf has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (15 pts), match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/inlines/Inliner.scala"},"region":{"startLine":1057}}}],"partialFingerprints":{"codehealthFindingId/v1":"638514dc83d22d465f7ab7a16fa04ecbcec626b55cc1688ae636ea21f91fed88"}},{"ruleId":"D2","level":"warning","message":{"text":"JavaParser.typeBodyDecls (cognitive 16): JavaParser.typeBodyDecls has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 4, 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":"compiler/src/dotty/tools/dotc/parsing/JavaParsers.scala"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e76c19685b5f964a91378c02f952ab7bc7f54926d09835ba8ba783779ec8d7a"}},{"ruleId":"D2","level":"warning","message":{"text":"JavaScanner.getNumber (cognitive 16): JavaScanner.getNumber has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 4, match/switch 1 (2 pts), loops 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/parsing/JavaScanners.scala"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c64859e9dfaab70f7e45cf8105852e6ef2bff24eff306a731466d52be1572cc"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.dropParensOrBraces (cognitive 16): Parser.dropParensOrBraces has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"compiler/src/dotty/tools/dotc/parsing/Parsers.scala"},"region":{"startLine":899}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca34cfdc079db302882a41c4e5bfb246cd6cefcce66854a7a9840dff007f2043"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.caseClause (cognitive 16): Parser.caseClause has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 2, 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":"compiler/src/dotty/tools/dotc/parsing/Parsers.scala"},"region":{"startLine":3424}}}],"partialFingerprints":{"codehealthFindingId/v1":"df1b8363e3510c6630107bf966a5d26004c3dbed412f9059c3bbc87f5299d6ec"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.checkedAscription (cognitive 16): Parser.checkedAscription has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 2 (6 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":"compiler/src/dotty/tools/dotc/parsing/Parsers.scala"},"region":{"startLine":3514}}}],"partialFingerprints":{"codehealthFindingId/v1":"6853fa4175c1cb7f995739128f4e9fbe3c71155b3632d16dcb6935016c723350"}},{"ruleId":"D2","level":"warning","message":{"text":"Scanner.indentWidth (cognitive 16): Scanner.indentWidth has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/parsing/Scanners.scala"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e862b28a5eb8d05b18af299c204abcee4bf0940244e7ba2f1a963a3a02ed047"}},{"ruleId":"D2","level":"warning","message":{"text":"SymbolicXMLBuilder.element (cognitive 16): SymbolicXMLBuilder.element has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7, match/switch 5 (7 pts), loops 2 (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":"compiler/src/dotty/tools/dotc/parsing/xml/SymbolicXMLBuilder.scala"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"e13934018e0c5fc7006d8e2c4471e5decbd0f98ed4d0943dd006a381e0cdb803"}},{"ruleId":"D2","level":"warning","message":{"text":"Reporter.issueUnconfigured (cognitive 16): Reporter.issueUnconfigured has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (11 pts), match/switch 2 (4 pts), boolean chains 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":"compiler/src/dotty/tools/dotc/reporting/Reporter.scala"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"7769e768e07b2e3641c6440979a425d6bd6ccdb8035ea407505d77c0f2b93958"}},{"ruleId":"D2","level":"warning","message":{"text":"DependencyRecorder.recordClassDependency (cognitive 16): DependencyRecorder.recordClassDependency 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":"compiler/src/dotty/tools/dotc/sbt/ExtractDependencies.scala"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"09579db424097dc4846fac0aa827f15d1c0c409cfcd8a57958a740c60c55e29d"}},{"ruleId":"D2","level":"warning","message":{"text":"InfoPrinter.pprint (cognitive 16): InfoPrinter.pprint has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), match/switch 4 (6 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":"compiler/src/dotty/tools/dotc/semanticdb/PPrint.scala"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3655d6a5653c5e99dd36eef6de04cd5d8182cbc36c7f8b8164a431124c0e5e8"}},{"ruleId":"D2","level":"warning","message":{"text":"SemanticdbInputStream.readRawVarint64 (cognitive 16): SemanticdbInputStream.readRawVarint64 has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13 (16 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":"compiler/src/dotty/tools/dotc/semanticdb/internal/SemanticdbInputStream.scala"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea41369f5612cb8ffbbdc2372a5618972dc97426c2b8cde85fc3b76a3d366fa2"}},{"ruleId":"D2","level":"warning","message":{"text":"CheckReentrant.addVars (cognitive 16): CheckReentrant.addVars has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/CheckReentrant.scala"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"866b8f424ca8f8a79913ad2f78487e85f0d7ba694bd15bee341ca9102a1617a5"}},{"ruleId":"D2","level":"warning","message":{"text":"CheckUnused.transformSelect (cognitive 16): CheckUnused.transformSelect 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":"compiler/src/dotty/tools/dotc/transform/CheckUnused.scala"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"664a08205c39e74260652bf10cfe6967e332a37c49f034c0dd800b9f818d2d63"}},{"ruleId":"D2","level":"warning","message":{"text":"Constructors.markUsedPrivateSymbols (cognitive 16): Constructors.markUsedPrivateSymbols has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 9, if/else 3 (5 pts), match/switch 1 (2 pts) (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/Constructors.scala"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"87dd7964b035e0facc6ab59c377e28d8676ea16c703a2e60e20241fc6e2d38fa"}},{"ruleId":"D2","level":"warning","message":{"text":"InliningTreeMap.transformMemberDef (cognitive 16): InliningTreeMap.transformMemberDef has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/Inlining.scala"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9c85b88e6b1e294dad8ca81d27149bc749a9bed6a11e2a02d962f8b5e3b84ac"}},{"ruleId":"D2","level":"warning","message":{"text":"Cursor.next (cognitive 16): Cursor.next has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), error handling 1 (3 pts), match/switch 2 (3 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":"compiler/src/dotty/tools/dotc/transform/OverridingPairs.scala"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"07fcc35d6e47f71779ef63fdb9fbe76203ee59a7bdf87ee7415343e5b9977be9"}},{"ruleId":"D2","level":"warning","message":{"text":"Translator.mergeTests (cognitive 16): Translator.mergeTests has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 7 (9 pts), if/else 7 (nesting depth added 2). 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":"compiler/src/dotty/tools/dotc/transform/PatternMatcher.scala"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d1815a99358b6397590feb9c98e86b39d19979d69d542715b456d72fe6dc78b"}},{"ruleId":"D2","level":"warning","message":{"text":"PostTyperTransformer.normalizeTypeArgs (cognitive 16): PostTyperTransformer.normalizeTypeArgs has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 5 (10 pts), if/else 5, boolean chains 1 (nesting depth added 5). 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":"compiler/src/dotty/tools/dotc/transform/PostTyper.scala"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"af42755266fc6947d8aa0a68c0269e0117040505f773869ad7993352e0fcc491"}},{"ruleId":"D2","level":"warning","message":{"text":"Rechecker.recheckApply (cognitive 16): Rechecker.recheckApply has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), match/switch 3 (4 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/Recheck.scala"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"d48c4f7023a6b3ed43b5a2217b73336536e5d2f5da53767885bc769b8e95e7e0"}},{"ruleId":"D2","level":"warning","message":{"text":"Rechecker.recheckStart (cognitive 16): Rechecker.recheckStart has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 4 (6 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":"compiler/src/dotty/tools/dotc/transform/Recheck.scala"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"3abd4f2a8224e97483015f0efbc2283ca9aa8cb90a5434ba18284df79058f5cb"}},{"ruleId":"D2","level":"warning","message":{"text":"YCheckPositions.checkPostCondition (cognitive 16): YCheckPositions.checkPostCondition has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 3, match/switch 2 (3 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":"compiler/src/dotty/tools/dotc/transform/YCheckPositions.scala"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e7c7580c73bf6da255e9c35f6973077f2235b73737267bd10dcdf07127d2319"}},{"ruleId":"D2","level":"warning","message":{"text":"Migrations.typedAsFunction (cognitive 16): Migrations.typedAsFunction has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (14 pts), match/switch 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":"compiler/src/dotty/tools/dotc/typer/Migrations.scala"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"f18be4801a829aec784075ded425b57e4d7e748d2cb8f3d232e374bbd24caf87"}},{"ruleId":"D2","level":"warning","message":{"text":"FunProto.cacheTypedArg (cognitive 16): FunProto.cacheTypedArg has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 2 (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":"compiler/src/dotty/tools/dotc/typer/ProtoTypes.scala"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c8a8f1120c6c7ca7a7c1d5c36ce2c3d8b744d1966cf6a934d9827556115d90e"}},{"ruleId":"D2","level":"warning","message":{"text":"FunProto.typedArgs (cognitive 16): FunProto.typedArgs has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 1 (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":"compiler/src/dotty/tools/dotc/typer/ProtoTypes.scala"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"dad27ba1127a61b98fc50da79993b59bad94d686e3f4b3485cd3f186c5631b6b"}},{"ruleId":"D2","level":"warning","message":{"text":"ShowPickled.printFile (cognitive 16): ShowPickled.printFile has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 2, loops 2, match/switch 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/util/ShowPickled.scala"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a61606477ec47eb52351638798f437dd3567e4841a6db6b895260ccb5689935"}},{"ruleId":"D2","level":"warning","message":{"text":"SimpleIdentityMap.remove (cognitive 16): SimpleIdentityMap.remove has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (11 pts), 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":"compiler/src/dotty/tools/dotc/util/SimpleIdentityMap.scala"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5b23ba12964b708ebe3876afb1616a4ae0121b6af9885da8385a596af74aa54"}},{"ruleId":"D2","level":"warning","message":{"text":"SimpleIdentitySet.-- (cognitive 16): SimpleIdentitySet.-- has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/util/SimpleIdentitySet.scala"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"67e4781349c1533eb3da46f76b6dd32630676cdf024a4bce6eae52c0db4a76ee"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceCodePrinter.printTargDef (cognitive 16): SourceCodePrinter.printTargDef has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), match/switch 4 (8 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":"compiler/src/scala/quoted/runtime/impl/printers/SourceCode.scala"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"892dee481ecc7e2b4713e47f723e2838c18ed118b32e7f35e66c2404bddfed95"}},{"ruleId":"D2","level":"warning","message":{"text":"LazyList.hasDefiniteSize (cognitive 16): LazyList.hasDefiniteSize has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/collection/immutable/LazyList.scala"},"region":{"startLine":1191}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a6e8dc2a8fce0fba19ed71d8012c46c1461b762afe453ac7f2bcc0ec3fbd41b"}},{"ruleId":"D2","level":"warning","message":{"text":"MurmurHash3.arrayHash (cognitive 16): MurmurHash3.arrayHash has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (7 pts), loops 2 (6 pts), boolean chains 2, match/switch 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/util/hashing/MurmurHash3.scala"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"230e5e48aaa779c5a6753771b2225fac96fd743d993691f183b02635732a54df"}},{"ruleId":"D2","level":"warning","message":{"text":"MemberRenderer.classLikeParts (cognitive 16): MemberRenderer.classLikeParts has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scaladoc/src/dotty/tools/scaladoc/renderers/MemberRenderer.scala"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"3daab7e233bcbbda7425a0b5bf42c81c295d31dba3a151d4f8aa7d3c8b97499f"}},{"ruleId":"D2","level":"warning","message":{"text":"Sidebar.toSidebar (cognitive 16): Sidebar.toSidebar has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (7 pts), boolean chains 6, match/switch 2 (3 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":"scaladoc/src/dotty/tools/scaladoc/site/SidebarParser.scala"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"09183dff897850872a2f14204e34c9b4371d226c66b22b0790bab43c0a5e397d"}},{"ruleId":"D2","level":"warning","message":{"text":"SnippetExpectations.parse (cognitive 16): SnippetExpectations.parse has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scaladoc/src/dotty/tools/scaladoc/snippets/SnippetExpectations.scala"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"08d349f7d605b29b5034ddaf2af32ebae3f2537f53b5dc3874c4f0352c9ee65f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Parser: TooManyMethods \u2014 285 methods. The bar is 30 methods; this is 255 over it, 9.50\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/parsing/Parsers.scala"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"54c76a8deb36d1660fbd76a166af127341407247fb9f268a16848a41848d59bd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/Types.scala: FileTooLong \u2014 4289 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 3789 over it, 8.58\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":"compiler/src/dotty/tools/dotc/core/Types.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a38624de298d5a91b896feb9ef125f0334b1511536b0606bd22c46df932fc510"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SymDenotation: TooManyMethods \u2014 237 methods. The bar is 30 methods; this is 207 over it, 7.90\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":"compiler/src/dotty/tools/dotc/core/SymDenotations.scala"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"45eb6ff6e7f01b4f24bba8e4709fec6dc61c796bd3aba7005063227e4de6e803"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: typer/Typer.scala: FileTooLong \u2014 3812 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 3312 over it, 7.62\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":"compiler/src/dotty/tools/dotc/typer/Typer.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"df32697ed51429993512d608f23b105b81266c26ad85b7764fef73cb2a4c915e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parsing/Parsers.scala: FileTooLong \u2014 3745 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 3245 over it, 7.49\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/parsing/Parsers.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d593a03c7855b69f856f919f4f69fda7679fe6a766ca3fdaf1ab13cf80f92064"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Typ.canDecompose: MethodTooLong \u2014 canDecompose runs 711 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 611 over it, 7.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/patmat/Space.scala"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"36dfb44a1437ec9f791cbd17529f66f519828bf2c2dde3dd9a1c7569e54fcc16"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Typ.decompose: MethodTooLong \u2014 decompose runs 710 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 610 over it, 7.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/patmat/Space.scala"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d5a3cc401bd436cc2130c09af5260e3b370ac3c267387e071a5c2d6791d43e4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Type: TooManyMethods \u2014 199 methods. The bar is 30 methods; this is 169 over it, 6.63\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/Types.scala"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"885822ad92b50ec84c7ec288a764b88e579aad10ae57c44be4a3d4b1b2675a39"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: reporting/messages.scala: FileTooLong \u2014 3315 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2815 over it, 6.63\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/reporting/messages.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4059957af80e40d7437fff97bb460e9852b6ee243a357ff83f70d34fad6ec6bc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sjs/JSCodeGen.scala: FileTooLong \u2014 3069 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: JSCodeGen (57-5251). The bar is 500 significant lines; this is 2569 over it, 6.14\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/backend/sjs/JSCodeGen.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee4b7eb2df24ccc410e364216d0f5026ea02ac53099f6bece84b7be7dee078ed"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: impl/QuotesImpl.scala: FileTooLong \u2014 2968 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2468 over it, 5.94\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/scala/quoted/runtime/impl/QuotesImpl.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6e45a3bbd77397ebadd1d92776fbae7ef34ed9336b904177c3a2890f43ff61c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/TypeComparer.scala: FileTooLong \u2014 2573 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2073 over it, 5.15\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/TypeComparer.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf44bde21fdf1350baf3cef7187b520a65e64f4480c19578534aeba6f4e2e565"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Definitions: TooManyMethods \u2014 147 methods. The bar is 30 methods; this is 117 over it, 4.90\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":"compiler/src/dotty/tools/dotc/core/Definitions.scala"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"b841121d2bbf2a05a7f24ad1e813956427442b9812f0addaa20122987772dd85"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TreeChecker.checkParents: MethodTooLong \u2014 checkParents runs 447 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 347 over it, 4.47\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/TreeChecker.scala"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5ac15e186daaaaa4e2598af55494142f4308f6fd912b1490131523e9a8afe72"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: JSCodeGen: TooManyMethods \u2014 132 methods. The bar is 30 methods; this is 102 over it, 4.40\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/backend/sjs/JSCodeGen.scala"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"423e0d01d896535449ecd1cea835da46056370c50b18fc3bebfd330ad049134f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TreeNodeChecker.traverse: MethodTooLong \u2014 traverse runs 435 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 335 over it, 4.35\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/TreeChecker.scala"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fc0573d0b93235c45768f288b7475f8c4976ce3216cb47aec651bc67ad9e13c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Typer: TooManyMethods \u2014 124 methods. The bar is 30 methods; this is 94 over it, 4.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/Typer.scala"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"defa5d4edf340dd4fef8f746a96291e0ea6ad21f1b886b403e6540e379b7c6b7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: quoted/Quotes.scala: FileTooLong \u2014 1928 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1428 over it, 3.86\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":"library/src/scala/quoted/Quotes.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b43e9f444e2a2f526786064b0e9a7b982f91e42aa8b9a55ce3e32970c57f539b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: tpd: TooManyMethods \u2014 115 methods. The bar is 30 methods; this is 85 over it, 3.83\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":"compiler/src/dotty/tools/dotc/ast/tpd.scala"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"de8a98cfe26cec2946a84e51c25c5e6139ed2cc010aba2b69f47035739a90968"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/SymDenotations.scala: FileTooLong \u2014 1876 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1376 over it, 3.75\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":"compiler/src/dotty/tools/dotc/core/SymDenotations.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0097d65979a61b3c51846605c495115a5dbf7bd27e3c75f757665f4d7eeb5df0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/Definitions.scala: FileTooLong \u2014 1866 significant lines (blank, comment-only and punctuation-only lines excluded), about 99% of them inside a single declaration: Definitions (53-2637). The bar is 500 significant lines; this is 1366 over it, 3.73\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":"compiler/src/dotty/tools/dotc/core/Definitions.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f754d73238298ba2ce9e7426a65157e35ba6e44058e902bf7ed6b37a1c1fe59"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Byte: TooManyMethods \u2014 109 methods. The bar is 30 methods; this is 79 over it, 3.63\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/Byte.scala"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"c97bdb0be7da33eda06f9c0f2a711a9712715e268654fb9d6a4cbb3431b7fc5e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Char: TooManyMethods \u2014 109 methods. The bar is 30 methods; this is 79 over it, 3.63\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/Char.scala"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"54558401a5f22159c85a06af1f7aeecb3e99f33f35eb9c15e1c758d76da58edc"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Int: TooManyMethods \u2014 109 methods. The bar is 30 methods; this is 79 over it, 3.63\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/Int.scala"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"af45eb8d5ed9ff60e2f62eb04cb1c7f15d92f1da9f3e4101fc38c3d6f5a07fda"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Long: TooManyMethods \u2014 109 methods. The bar is 30 methods; this is 79 over it, 3.63\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/Long.scala"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"e77a3db45afba0f830e9b7bb8522c2839b86f8e03a7ab2cced227f576434ed0a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Short: TooManyMethods \u2014 109 methods. The bar is 30 methods; this is 79 over it, 3.63\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/Short.scala"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"d161fd4368f9d10c79b7d23f8eed282861a6671d1f86c731a28f7fbf334edff4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: untpd: TooManyMethods \u2014 103 methods. The bar is 30 methods; this is 73 over it, 3.43\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":"compiler/src/dotty/tools/dotc/ast/untpd.scala"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"0788dea86e782f46a9e4128afdf2a50b11fdb4f056593e28c3ba4d882fe1160f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: JSDefinitions: TooManyMethods \u2014 102 methods. The bar is 30 methods; this is 72 over it, 3.40\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/backend/sjs/JSDefinitions.scala"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"adbbe10cbfc640c14bb0c065e57cc94650af3c2ed145401e7164d73227800387"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cc/CheckCaptures.scala: FileTooLong \u2014 1655 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1155 over it, 3.31\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/cc/CheckCaptures.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"599bd779db6bf1b4e81549d0c75d01d7dc54132d04ad324719b6bc7ce6001a9a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ast/Desugar.scala: FileTooLong \u2014 1633 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1133 over it, 3.27\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":"compiler/src/dotty/tools/dotc/ast/Desugar.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bb244e0cfab4aa5a4b043a436a57695c8e33d57aba17bd6f20c366bdb14151e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TypeComparer: TooManyMethods \u2014 97 methods. The bar is 30 methods; this is 67 over it, 3.23\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/TypeComparer.scala"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"1048873071cf83e73ed0ad889f65803be848766a83c1fa714a1004f430091813"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PlainPrinter: TooManyMethods \u2014 95 methods. The bar is 30 methods; this is 65 over it, 3.17\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/printing/PlainPrinter.scala"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ac66ffdf08934d75ef53ca61aa3e41b8ca53bd5bf11734c0282e7151eb3e332"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Context: TooManyMethods \u2014 94 methods. The bar is 30 methods; this is 64 over it, 3.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/Contexts.scala"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"20d84e6adfb15ffa1044386b4665613c801e8f4882393eef7044ee4a93065168"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: typer/Namer.scala: FileTooLong \u2014 1512 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1012 over it, 3.02\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/Namer.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"96218b7a1b96c84c3cd192145bef7ebfe2048438cb3d434e0e539432d09cf6dc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tasty/TreeUnpickler.scala: FileTooLong \u2014 1484 significant lines (blank, comment-only and punctuation-only lines excluded), about 96% of them inside a single declaration: TreeUnpickler (59-1971). The bar is 500 significant lines; this is 984 over it, 2.97\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":"compiler/src/dotty/tools/dotc/core/tasty/TreeUnpickler.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff9e2a73483882c15d97063121237dd98e88365f3b26c29fd5de4b649a6bcb42"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: init/Objects.scala: FileTooLong \u2014 1467 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 967 over it, 2.93\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/init/Objects.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"243aaa0320228b77c4c01ae3967d6ca443d7b2a30dbe24a4b72036fdca7ec121"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Double: TooManyMethods \u2014 87 methods. The bar is 30 methods; this is 57 over it, 2.90\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":"library/src/scala/Double.scala"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"13d3040333f4b64bff8c7953f690972fd9eb1d27b89775492716878ce53e3ee4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Float: TooManyMethods \u2014 87 methods. The bar is 30 methods; this is 57 over it, 2.90\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":"library/src/scala/Float.scala"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d413ba3c1bc9f57554f4d18d468b27499335774d1003fa588c455b4598becbc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: typer/Implicits.scala: FileTooLong \u2014 1427 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 927 over it, 2.85\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":"compiler/src/dotty/tools/dotc/typer/Implicits.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2316adec5b4a39fbf2f81534219fa2db9ba0b92a6f24b69e6af39b687f7442ed"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MegaPhase: TooManyMethods \u2014 82 methods. The bar is 30 methods; this is 52 over it, 2.73\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/MegaPhase.scala"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e432284f2ce9234e5e3c9fd72dba8e63221897d4263147584fc2583a9039cf9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Scanner: TooManyMethods \u2014 81 methods. The bar is 30 methods; this is 51 over it, 2.70\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":"compiler/src/dotty/tools/dotc/parsing/Scanners.scala"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d879539bca1ee592009941a20f13e304240c87a12f0efa69be5f11e57f10077"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: typer/Checking.scala: FileTooLong \u2014 1317 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 817 over it, 2.63\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/Checking.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b463148ca5ae02c7b93dbb5223cc5f85f0bfeb31c396130da39bf1e1994323ac"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parsing/Scanners.scala: FileTooLong \u2014 1309 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 809 over it, 2.62\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":"compiler/src/dotty/tools/dotc/parsing/Scanners.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"00d7af3fe3d8577ceccbd9915862656219823cd59ae4aef4844914992116e083"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MiniPhase: TooManyMethods \u2014 77 methods. The bar is 30 methods; this is 47 over it, 2.57\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/MegaPhase.scala"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a05e371c693431822a1052840aa3593c1f806aa9435846a0b9b2595a6951472"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: math: 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":"library/src/scala/math/package.scala"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce73df2d805d4a21d55c54cc286b05fa5bb49425f68532f16722aff06c2bba1f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: RefinedPrinter: ClassTooLong \u2014 1012 significant lines (blank, comment-only and punctuation-only lines excluded), 42 methods. The bar is 400 significant lines; this is 612 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":"compiler/src/dotty/tools/dotc/printing/RefinedPrinter.scala"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aefb8ffd18c069a91372b07d1bc983ed1f24bbe455cb7bda99e6ebdb6f2efd4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GenericSignatures.javaSig0: MethodTooLong \u2014 javaSig0 runs 250 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 150 over it, 2.50\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/backend/jvm/GenericSignatures.scala"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"72cbea8f09f205a72e2fdbc08fa8ab468761992196cf0f13084d6ec88a6a9d19"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: jvm/BCodeBodyBuilder.scala: FileTooLong \u2014 1210 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 710 over it, 2.42\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/backend/jvm/BCodeBodyBuilder.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0150dae9bc9deedcb886c9c012f1a41368aa400bc7277696362b2b777510a697"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ast/Trees.scala: FileTooLong \u2014 1207 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 707 over it, 2.41\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":"compiler/src/dotty/tools/dotc/ast/Trees.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad76abe3d4192e490711b3c9c963430975f7c5a472b583cff4aeaf5949697f96"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: printers/SourceCode.scala: FileTooLong \u2014 1163 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 663 over it, 2.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":"compiler/src/scala/quoted/runtime/impl/printers/SourceCode.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f408869f0ad58c3af58dd75cf0925c1ae77b7e619a9c6d98e8447d95cd40bf1d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: desugar: TooManyMethods \u2014 68 methods. The bar is 30 methods; this is 38 over it, 2.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":"compiler/src/dotty/tools/dotc/ast/Desugar.scala"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"78c51be8926b508c67ecc5187e22a32d939cdeac30a7543a3d8278f6fdbe1f7f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TreeReader: TooManyMethods \u2014 68 methods. The bar is 30 methods; this is 38 over it, 2.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":"compiler/src/dotty/tools/dotc/core/tasty/TreeUnpickler.scala"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9c5e45837b2481a56c7559c75b3d9f3beba895bd184c7da917f1c3cd4141922"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cc/CaptureSet.scala: FileTooLong \u2014 1117 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 617 over it, 2.23\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":"compiler/src/dotty/tools/dotc/cc/CaptureSet.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"302079afbc830a9f86a4ce854cf7b0f50fe29028f75af73a9f634078c8e05dc6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PostTyperTransformer.flattenSpreads: MethodTooLong \u2014 flattenSpreads runs 221 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 121 over it, 2.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/PostTyper.scala"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce906fc663c05823ed666a0c3e1cee15cce38d65e0a7a160d8a244c4f8be5bb5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ErrorReporting.wrongNumberOfTypeArgs: MethodTooLong \u2014 wrongNumberOfTypeArgs runs 220 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 120 over it, 2.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/ErrorReporting.scala"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e9a304307e6528fd582bf1ab576282f7f40bdc0b0b4c8f670d48818743f4284"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ErrorReporting.missingArgs: MethodTooLong \u2014 missingArgs runs 218 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 118 over it, 2.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/ErrorReporting.scala"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"aed16577383304cc9ff08b4ca85e38a6ab77caa371fd1c90b52356304b11f3e1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TypeAssigner: TooManyMethods \u2014 64 methods. The bar is 30 methods; this is 34 over it, 2.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/TypeAssigner.scala"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"addd6acff9a9e1936de8ec0a9219f64e8e22ffd7209a21a1dc33a80c6acab62b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: classfile/ClassfileParser.scala: FileTooLong \u2014 1059 significant lines (blank, comment-only and punctuation-only lines excluded), about 82% of them inside a single declaration: ClassfileParser (268-1558). The bar is 500 significant lines; this is 559 over it, 2.12\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/classfile/ClassfileParser.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b48e24242000d876e19029190c9d452cc8f22bbc6857a8d832974814768171c4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TreeCopier: TooManyMethods \u2014 63 methods. The bar is 30 methods; this is 33 over it, 2.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/ast/Trees.scala"},"region":{"startLine":1272}}}],"partialFingerprints":{"codehealthFindingId/v1":"11a01a0c5b43974073428bb3904db885cef59157538013d843504f80154037b2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: JavaParser: TooManyMethods \u2014 63 methods. The bar is 30 methods; this is 33 over it, 2.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/parsing/JavaParsers.scala"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"e806bf363d98b4bc7c30be3b6c57815c69cb5eb4136be75481b342f90cf73c5f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: printing/RefinedPrinter.scala: FileTooLong \u2014 1046 significant lines (blank, comment-only and punctuation-only lines excluded), about 97% of them inside a single declaration: RefinedPrinter (38-1296). The bar is 500 significant lines; this is 546 over it, 2.09\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":"compiler/src/dotty/tools/dotc/printing/RefinedPrinter.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7bc9e6fd8ffb09ecb46b7c8f3b00bec35d1ed123740bd8de1fa4f1379d38ace"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ast/tpd.scala: FileTooLong \u2014 1026 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 526 over it, 2.05\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/ast/tpd.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b685896a85942d5b9c39c8f0494a6f59f08821a7138904c3c215d928dd5de6cc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: transform/CheckUnused.scala: FileTooLong \u2014 1008 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 508 over it, 2.02\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/CheckUnused.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9895276f9a730371ed8cf95712007df601a94a4a5189ff3656a1b511e456754"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Symbol: TooManyMethods \u2014 60 methods. The bar is 30 methods; this is 30 over it, 2.00\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":"compiler/src/dotty/tools/dotc/core/Symbols.scala"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"d64ffe60c9f4ba22506f3654978b16aeb46e3dae083efed6e8cbc69b2825d608"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ErrorReporting.matchReductionAddendum: MethodTooLong \u2014 matchReductionAddendum runs 200 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 100 over it, 2.00\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/ErrorReporting.scala"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffd92630e5a4925b287b47ed548a125420b5b5b55c7b3ee06a6ab716404190ae"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: init/Semantic.scala: FileTooLong \u2014 996 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 496 over it, 1.99\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":"compiler/src/dotty/tools/dotc/transform/init/Semantic.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"40c13590801cfb2da6cf1d2d0c79a9b580a9ba64013f1aa4eb362899058e4d73"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Scala2Unpickler: TooManyMethods \u2014 59 methods. The bar is 30 methods; this is 29 over it, 1.97\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/unpickleScala2/Scala2Unpickler.scala"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ec5f790df4e413f8a47f386ab8fae5abea7ffa8d942d3746472794eed5c75f8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Rechecker: TooManyMethods \u2014 59 methods. The bar is 30 methods; this is 29 over it, 1.97\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/Recheck.scala"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"3245bcfcdd1d729cd63aaaaf5be50c396b009387ca613be1e9137b57eae52623"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: BoxesRunTime: TooManyMethods \u2014 59 methods. The bar is 30 methods; this is 29 over it, 1.97\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/runtime/BoxesRunTime.java"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca7a1609f4cab749d98b28bd128a90fd9b28cc8b2acbe9b4b30597a2b33900a8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: inlines/Inliner.scala: FileTooLong \u2014 980 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 480 over it, 1.96\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/inlines/Inliner.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8281f7845e4aea57521cc4ca14d023cdaffa690dee80c3f61635e4889ade7c74"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TreePickler: ClassTooLong \u2014 777 significant lines (blank, comment-only and punctuation-only lines excluded), 36 methods. The bar is 400 significant lines; this is 377 over it, 1.94\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":"compiler/src/dotty/tools/dotc/core/tasty/TreePickler.scala"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fb2ef9ec0fa1e5aa1e3cf98ddaeb50d916eae49da51fd947a541bd9e392f622"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: typer/RefChecks.scala: FileTooLong \u2014 957 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 457 over it, 1.91\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/RefChecks.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d92ecdd8dbb81abf1aaf641444e11422ab5d008772e526767bda9b9db3bc2db"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: unpickleScala2/Scala2Unpickler.scala: FileTooLong \u2014 953 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 453 over it, 1.91\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/unpickleScala2/Scala2Unpickler.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1f6264513efa58867cc7fcf8fa67f498f3297ed6a6d5e9096839783685eac27"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Predef: TooManyMethods \u2014 57 methods. The bar is 30 methods; this is 27 over it, 1.90\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":"library/src/scala/Predef.scala"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"55f82d820dfed3be6106839f9c3c288e1e3d728b395916aeff1022628f4f57f2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SourceCodePrinter: TooManyMethods \u2014 56 methods. The bar is 30 methods; this is 26 over it, 1.87\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":"compiler/src/scala/quoted/runtime/impl/printers/SourceCode.scala"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d6c2f3feb0a6069d3bcda0b69a6b06e2b6a180a038442f30e69fa36b2a577c7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CaptureSet: TooManyMethods \u2014 55 methods. The bar is 30 methods; this is 25 over it, 1.83\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":"compiler/src/dotty/tools/dotc/cc/CaptureSet.scala"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"992666805e61da25ce3f91a02975667efb19441b7827fb044a6789d9da4cd9e1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cc/Capability.scala: FileTooLong \u2014 907 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 407 over it, 1.81\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/cc/Capability.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c709ee8d356e09be23d6e514bc2bbcb207d95ee7440fddd9db304f7f9e33365"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/StdNames.scala: FileTooLong \u2014 907 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 407 over it, 1.81\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/StdNames.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c63064ffeaa2809bc4e1c8ed389f5ddf7e9525b016217f8672f9fcdf1dd1a5d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: completions/Completions.scala: FileTooLong \u2014 903 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 403 over it, 1.81\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"presentation-compiler/src/main/dotty/tools/pc/completions/Completions.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bc8d7c836416efc0e20af5aa00429b01a9fe4b7596f5ac2e47be9f5370fd5ea"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TreeOps: TooManyMethods \u2014 54 methods. The bar is 30 methods; this is 24 over it, 1.80\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":"compiler/src/dotty/tools/dotc/ast/tpd.scala"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"a173fa4a888278ed979dbb83646db2acd6164909d8628decef7ce07f1516e745"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: FreshContext: TooManyMethods \u2014 54 methods. The bar is 30 methods; this is 24 over it, 1.80\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":"compiler/src/dotty/tools/dotc/core/Contexts.scala"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9dab71db455ddbc13764d55bcb224a0e3f6b45b62706759c34c54fb071d7a6f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Capability: TooManyMethods \u2014 53 methods. The bar is 30 methods; this is 23 over it, 1.77\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/cc/Capability.scala"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ead69c7fe09979ee2e22b40ff1bc0481b2d6b2324eba2128d1346d90e670403"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: BigDecimal: TooManyMethods \u2014 52 methods. The bar is 30 methods; this is 22 over it, 1.73\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/math/BigDecimal.scala"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc0f1815b941745f14456af463c40dd925afe1a7ba1759b50a61692557047e47"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: BigInt: TooManyMethods \u2014 52 methods. The bar is 30 methods; this is 22 over it, 1.73\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/math/BigInt.scala"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e23f554ed63fa139a801a293aa35c8d05ee59a908dba092660d8e2c910b3c6f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: BCodeUtils: TooManyMethods \u2014 51 methods. The bar is 30 methods; this is 21 over it, 1.70\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":"compiler/src/dotty/tools/backend/jvm/BCodeUtils.scala"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f344cb0697f75c97bbb958d5c7156a8aeaa9787f12bb818ef88136bb1f58496"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SemanticdbOutputStream: TooManyMethods \u2014 51 methods. The bar is 30 methods; this is 21 over it, 1.70\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":"compiler/src/dotty/tools/dotc/semanticdb/internal/SemanticdbOutputStream.scala"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0fb5173968b6757baf2ee2fbbb498b7b169be22e075e2f31bfdd756b39df4e3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parsing/JavaParsers.scala: FileTooLong \u2014 842 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 342 over it, 1.68\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":"compiler/src/dotty/tools/dotc/parsing/JavaParsers.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6396856b4bcb4b5bce57ecea58c95a829310e229e3868f2bc0a0144e2156040b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PlainPrinter: ClassTooLong \u2014 672 significant lines (blank, comment-only and punctuation-only lines excluded), 95 methods. The bar is 400 significant lines; this is 272 over it, 1.68\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":"compiler/src/dotty/tools/dotc/printing/PlainPrinter.scala"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcff3ce2a63a263510fbd9f16537ace705250a93b467bcc23c6d8b6c22af35bd"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: OrderingConstraint: TooManyMethods \u2014 50 methods. The bar is 30 methods; this is 20 over it, 1.67\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/OrderingConstraint.scala"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce485db79d4d77972e7b62fff6fdd12cc5a4f8f86cbe70c8e609a71d24782844"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: transform/Erasure.scala: FileTooLong \u2014 829 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 329 over it, 1.66\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":"compiler/src/dotty/tools/dotc/transform/Erasure.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b101d9d61d1007b3f92d790d9e9f92616e3d3d8143936cee06f10a4c100e19c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ast/TreeInfo.scala: FileTooLong \u2014 823 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 323 over it, 1.65\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/ast/TreeInfo.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa85ec536760e05e4371769d1fb08dacc1926f0baba3e30d5d86072494c10b37"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PlainPrinter.toTextRetainedElem: MethodTooLong \u2014 toTextRetainedElem runs 164 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 64 over it, 1.64\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/printing/PlainPrinter.scala"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6a2d70fad7df226a3bff7000a9d3f53e42d6326168c15434e9b49a92dbbf001"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: JCodeMethodN: TooManyMethods \u2014 49 methods. The bar is 30 methods; this is 19 over it, 1.63\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/backend/jvm/BCodeIdiomatic.scala"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"08571835a91de621ed39a16807210422106612589cb826757275d01b2404933f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: transform/MegaPhase.scala: FileTooLong \u2014 810 significant lines (blank, comment-only and punctuation-only lines excluded), about 88% of them inside a single declaration: MegaPhase (145-1126). The bar is 500 significant lines; this is 310 over it, 1.62\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":"compiler/src/dotty/tools/dotc/transform/MegaPhase.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d31d9e6171c1392256064bf1a074d62453473971a19b8e5d05420cc7fc7054d5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SyntheticMembers.existingDef: MethodTooLong \u2014 existingDef runs 162 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 62 over it, 1.62\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/SyntheticMembers.scala"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba7537f2226520f36b4f1b3bc33f64a1e6cf1c81c3824b88f555de7a78a731b2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sjs/PrepJSInterop.scala: FileTooLong \u2014 804 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 304 over it, 1.61\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":"compiler/src/dotty/tools/dotc/transform/sjs/PrepJSInterop.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c32fba719187d5d47a0228c627660569fda92dde5ea00e6463cc6b1be6f906b9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CaptureChecker: TooManyMethods \u2014 48 methods. The bar is 30 methods; this is 18 over it, 1.60\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/cc/CheckCaptures.scala"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5cc4be3edc158f7f618827eac198cebff5d8c912cab55fad16852a5e40820c0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: StreamConverters: TooManyMethods \u2014 48 methods. The bar is 30 methods; this is 18 over it, 1.60\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/jdk/javaapi/StreamConverters.scala"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c29cea8285377b3290a7e882147fb118d40fb1623284f7a2069398089db37da"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/Denotations.scala: FileTooLong \u2014 800 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 300 over it, 1.60\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":"compiler/src/dotty/tools/dotc/core/Denotations.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a0bd57d65c1709ef2b65945e18e7faa237f12b8f15f695f4ce5832318d3fc26"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: inlines/Inlines.scala: FileTooLong \u2014 799 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 299 over it, 1.60\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":"compiler/src/dotty/tools/dotc/inlines/Inlines.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"82356039aa717750523d87c649b4019f446390edb2d295e9a1b5cb00df2288b3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tasty/TreePickler.scala: FileTooLong \u2014 796 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: TreePickler (23-967). The bar is 500 significant lines; this is 296 over it, 1.59\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":"compiler/src/dotty/tools/dotc/core/tasty/TreePickler.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d73e1a452d66a6b3d59145aabc9f9edf72faf9d7a531cec75f4e57c17cb8b34d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PlainPrinter.toTextRetainedElems: MethodTooLong \u2014 toTextRetainedElems runs 158 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 58 over it, 1.58\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/printing/PlainPrinter.scala"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bb2555e50dd8cffd9c423e5ea8272e145c5d1cc404bf5e54ec12809ab1a5e09"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PropertiesTrait: TooManyMethods \u2014 47 methods. The bar is 30 methods; this is 17 over it, 1.57\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/util/Properties.scala"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d68977018db253c91523a65681b296faaef34d9996a863ecaf80169a2da96cf"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MurmurHash3: TooManyMethods \u2014 47 methods. The bar is 30 methods; this is 17 over it, 1.57\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/util/hashing/MurmurHash3.scala"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea5c42b5ef50bb7c0f4c3b5de4207b00c3959b7a544fa691de5dc96349585a0d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PlainPrinter.isElidableUniversal: MethodTooLong \u2014 isElidableUniversal runs 155 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 55 over it, 1.55\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/printing/PlainPrinter.scala"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e5d2235e95ce739c01d7647da24373e22e43140e6a6463cb5aee020599a3576"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PlainBodyBuilder: TooManyMethods \u2014 46 methods. The bar is 30 methods; this is 16 over it, 1.53\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/backend/jvm/BCodeBodyBuilder.scala"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"1674f0164de64f3785cbb4483e939e3ba384c76399e3388c405b4eae271c97ea"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TreeInfo: TooManyMethods \u2014 46 methods. The bar is 30 methods; this is 16 over it, 1.53\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/ast/TreeInfo.scala"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c01b2c105f4b2d8d83a66352175729a850a6391269fd14f38c1878f0270b0e1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Phase: TooManyMethods \u2014 46 methods. The bar is 30 methods; this is 16 over it, 1.53\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/Phases.scala"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"88f1d84fea8bf1a4a773bffa2926400612e3391d52f486d6f1e2a9314784e956"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Symbols: TooManyMethods \u2014 46 methods. The bar is 30 methods; this is 16 over it, 1.53\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/Symbols.scala"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd4efa7820ddb13258d67a578f2f6b91c8a3b5680fa3938a6661e905b57a7fde"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SemanticdbInputStream: TooManyMethods \u2014 46 methods. The bar is 30 methods; this is 16 over it, 1.53\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/semanticdb/internal/SemanticdbInputStream.scala"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"25552db18dacf9ac57f6d53e2b01acad2728489e601bcd9144234af6b8164cb5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SyntheticMembers.synthesizeDef: MethodTooLong \u2014 synthesizeDef runs 153 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 53 over it, 1.53\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/SyntheticMembers.scala"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8011e4f6364c6f32d69a9fa09fc1ec234df832fc374f4865759de0060b44cbc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: patmat/Space.scala: FileTooLong \u2014 757 significant lines (blank, comment-only and punctuation-only lines excluded), about 93% of them inside a single declaration: decompose (105-1189). The bar is 500 significant lines; this is 257 over it, 1.51\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/patmat/Space.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"15c208cc517d52803d10624ec403bcc6539cf4a3089e9b6a6dcad6d40171ba06"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cc/Setup.scala: FileTooLong \u2014 755 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 255 over it, 1.51\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":"compiler/src/dotty/tools/dotc/cc/Setup.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9e131311751f1100251a8ec5cfdd8a9855698982c7a6358f9c864aea6845e64"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: transform/PatternMatcher.scala: FileTooLong \u2014 752 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 252 over it, 1.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":"compiler/src/dotty/tools/dotc/transform/PatternMatcher.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b85f147f306d5b0a9fc8248d99e57a9db320581937c3a989671de298076d292b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SingleDenotation: TooManyMethods \u2014 45 methods. The bar is 30 methods; this is 15 over it, 1.50\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/Denotations.scala"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"d65ccdfa563888e424c702e31b00c9b8210ce2321875958a0d4161ed5662dee4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TypeComparer: TooManyMethods \u2014 45 methods. The bar is 30 methods; this is 15 over it, 1.50\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/TypeComparer.scala"},"region":{"startLine":3453}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9774e752dfe75b2a16792dedbaadb61f2e935b35c5dc0b605878893dc43bad7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SemanticdbOutputStream: TooManyMethods \u2014 45 methods. The bar is 30 methods; this is 15 over it, 1.50\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/semanticdb/internal/SemanticdbOutputStream.scala"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"226942ebcc1d9dd0c010c0a7c48c9a4517a8f9196c95cce8dcc27ee4deb52b51"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: JSExportsGen: ClassTooLong \u2014 599 significant lines (blank, comment-only and punctuation-only lines excluded), 31 methods. The bar is 400 significant lines; this is 199 over it, 1.50\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/backend/sjs/JSExportsGen.scala"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8ba150c6fd281f38484c382d42430079eae86487f71762703cb81047aa4b58d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Feature: TooManyMethods \u2014 44 methods. The bar is 30 methods; this is 14 over it, 1.47\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/config/Feature.scala"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a9341b56ef82ce9ff455605e7058cc2bd68de55fa8372dbb2755ff8e992dac4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PlainPrinter.toTextGeneralCaptureSet: MethodTooLong \u2014 toTextGeneralCaptureSet runs 145 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 45 over it, 1.45\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/printing/PlainPrinter.scala"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6ec7b7212b9a1356822f1b2a533d48b98c330d62d69d51879336af74555e2ed"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cc/SepCheck.scala: FileTooLong \u2014 724 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 224 over it, 1.45\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/cc/SepCheck.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf9261e0106df351cbd4399e2f4783c9d35eff1f7169371c338d5b353886108a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PhasesBase: TooManyMethods \u2014 43 methods. The bar is 30 methods; this is 13 over it, 1.43\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":"compiler/src/dotty/tools/dotc/core/Phases.scala"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"18f62ddbea855c3d484b74b7dcf4ef2b795cada9b5b04597434ff6a1c4c94859"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SymbolicXMLBuilder: TooManyMethods \u2014 43 methods. The bar is 30 methods; this is 13 over it, 1.43\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":"compiler/src/dotty/tools/dotc/parsing/xml/SymbolicXMLBuilder.scala"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"76bc5b5f9aa9d122696b256377f93e7dfaa1931aa932c9646c7904120fc11e8f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: JavaConverters: TooManyMethods \u2014 43 methods. The bar is 30 methods; this is 13 over it, 1.43\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":"library/src/scala/collection/JavaConverters.scala"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa2c82fe9121147605fa88028293d3a4b9c836611a7f5192147398d73b6e3256"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: repl/ReplDriver.scala: FileTooLong \u2014 707 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 207 over it, 1.41\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":"repl/src/dotty/tools/repl/ReplDriver.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dc8b9bf177e03d966b2a3a658fccc348017d33d81dfbc760b882208a1673251"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ClassDenotation: TooManyMethods \u2014 42 methods. The bar is 30 methods; this is 12 over it, 1.40\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/SymDenotations.scala"},"region":{"startLine":1927}}}],"partialFingerprints":{"codehealthFindingId/v1":"73d0af86580067a68fad8e663238f0fb9affc8936d8f24c39b9bda4da9b3d5bc"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Printer: TooManyMethods \u2014 42 methods. The bar is 30 methods; this is 12 over it, 1.40\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/printing/Printer.scala"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6bfe79b84bc7081d8bfc9d434afe1961e5b44997f7634fa56108a8a596fbb34"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RefinedPrinter: TooManyMethods \u2014 42 methods. The bar is 30 methods; this is 12 over it, 1.40\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/printing/RefinedPrinter.scala"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"214e36ce298f2a58380a77ab5d6b8b0647483dccc3afe904655f717a6d7fcc85"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AbstractBuilder: TooManyMethods \u2014 42 methods. The bar is 30 methods; this is 12 over it, 1.40\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/sys/process/ProcessBuilderImpl.scala"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb7ada4cd203f8b13834034dc85014d8a9fc180bc4971253e4f974fdf8caab63"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/Contexts.scala: FileTooLong \u2014 698 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 198 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":"compiler/src/dotty/tools/dotc/core/Contexts.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0d2031c02af87149158d65c5cfee588fec998b70ebb367efa330e79173daed5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: opt/Inliner.scala: FileTooLong \u2014 694 significant lines (blank, comment-only and punctuation-only lines excluded), about 73% of them inside a single declaration: GlobalOptimizer (34-955). The bar is 500 significant lines; this is 194 over it, 1.39\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":"compiler/src/dotty/tools/backend/jvm/opt/Inliner.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fce5ff1603fc0f5f0625d439ad36605da39b24cd5787fc14a49ccf447d29e608"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: printing/PlainPrinter.scala: FileTooLong \u2014 691 significant lines (blank, comment-only and punctuation-only lines excluded), about 97% of them inside a single declaration: PlainPrinter (22-887). The bar is 500 significant lines; this is 191 over it, 1.38\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":"compiler/src/dotty/tools/dotc/printing/PlainPrinter.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fd6e2ac1a69b2d5b1e41b3897baa6f98c4775cab46f69544ab1f0f0ddd50d0d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TypedTreeInfo: TooManyMethods \u2014 41 methods. The bar is 30 methods; this is 11 over it, 1.37\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":"compiler/src/dotty/tools/dotc/ast/TreeInfo.scala"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d1aa9facb163474309fb297aee2a82f1c74608fd04baa7960f4b96f076e7521"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SpaceEngine: TooManyMethods \u2014 41 methods. The bar is 30 methods; this is 11 over it, 1.37\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":"compiler/src/dotty/tools/dotc/transform/patmat/Space.scala"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"0990eb413cc685d13224147976fe631560b779c48edcc3594bf9d6be441bf72c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Checking: TooManyMethods \u2014 41 methods. The bar is 30 methods; this is 11 over it, 1.37\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":"compiler/src/dotty/tools/dotc/typer/Checking.scala"},"region":{"startLine":1020}}}],"partialFingerprints":{"codehealthFindingId/v1":"0796bd0bc533ff6fb0b9ae2718f83f88de2277c34cad7d0fd12e6ecfbecf6124"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/TypeErasure.scala: FileTooLong \u2014 673 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 173 over it, 1.35\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/TypeErasure.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9aea341866876b0118e7e321651d89bdad71af4f2431c89b05f7c4f6500382d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PropertiesTrait: TooManyMethods \u2014 40 methods. The bar is 30 methods; this is 10 over it, 1.33\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/config/Properties.scala"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c28f7c0e304dd4b3ea8a9e319e05ca2626b193f92887dd8f8c0c4bca08485f0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Constraint: TooManyMethods \u2014 40 methods. The bar is 30 methods; this is 10 over it, 1.33\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/Constraint.scala"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd04f8704d84ed8ae0a5bcfd465abbf7ae422af02f809a270afc18c757781664"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DurationConversions: TooManyMethods \u2014 40 methods. The bar is 30 methods; this is 10 over it, 1.33\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/concurrent/duration/DurationConversions.scala"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"adcd05e4de50a644266813c98f27a3ea07cef1493c2b3c2e1c90e36e1d61a3b9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TextMacros.generate: MethodTooLong \u2014 generate runs 133 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 33 over it, 1.33\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"repl/src/sourcecode/Macros.scala"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aa425794ce51842bb6e1d1df1e1d921aa4676e003fd077a765b08ae02c9f930"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: typer/ProtoTypes.scala: FileTooLong \u2014 662 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 162 over it, 1.32\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/ProtoTypes.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0a6997af8cfb2d452d478e944c9df87f531359c0b26364419a807b85b3c9437"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/Symbols.scala: FileTooLong \u2014 657 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 157 over it, 1.31\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/Symbols.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c62a8dce60054a6e0efb0d0146e44aa94fcb14f585382ea13b7839ee47aab224"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: typer/Synthesizer.scala: FileTooLong \u2014 656 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 156 over it, 1.31\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/Synthesizer.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e9131b0259202f0362590016b15f25afafed950bc98a2015015ecf8c34a9681"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: transform/TreeChecker.scala: FileTooLong \u2014 653 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 153 over it, 1.31\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/TreeChecker.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f245cc67c729434af51847b958ab8abc58a81f485d8c112f8464c3156e6f4bf7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cc/CaptureOps.scala: FileTooLong \u2014 652 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 152 over it, 1.30\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/cc/CaptureOps.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b36064eb47a87d356d99a9ea515eb2c7a60f302bbc72a694cce490656eae5d0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Denotation: TooManyMethods \u2014 39 methods. The bar is 30 methods; this is 9 over it, 1.30\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/Denotations.scala"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5c944c7d6ca2098d6bbac514e5f1851258f1bbca27459a4d25043690c7738c0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Namer: TooManyMethods \u2014 39 methods. The bar is 30 methods; this is 9 over it, 1.30\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/Namer.scala"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"70d6ff35c1b709c13585851c74d43cfb9f05db1adc9f089dfa092ad637a637a2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: transform/DesugarSpecializedTraits.scala: FileTooLong \u2014 650 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 150 over it, 1.30\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/DesugarSpecializedTraits.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"395f71b39e9be6aeceb803a25b4ba8b3294eb449188d4764d9baab4eab72a9c7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/OrderingConstraint.scala: FileTooLong \u2014 648 significant lines (blank, comment-only and punctuation-only lines excluded), about 88% of them inside a single declaration: OrderingConstraint (151-1017). The bar is 500 significant lines; this is 148 over it, 1.30\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/OrderingConstraint.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd13cb8c96c04fbeeee88b33368bf1789e63dbd534f3af12f3246b1bcbdb0768"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/TypeOps.scala: FileTooLong \u2014 640 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 140 over it, 1.28\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":"compiler/src/dotty/tools/dotc/core/TypeOps.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"129c436a312ea14629bb8f8accf0c89e3ee779b5c4481d4e9d2a7eaddf86859c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: GlobalOptimizer: ClassTooLong \u2014 510 significant lines (blank, comment-only and punctuation-only lines excluded), 7 methods. The bar is 400 significant lines; this is 110 over it, 1.28\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/backend/jvm/opt/Inliner.scala"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2ec2c1901a27a45d0ff64e449a0a35b7aef907ef9ee7a55764ecf7b2b020d0b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: NamedType: 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":"compiler/src/dotty/tools/dotc/core/Types.scala"},"region":{"startLine":2330}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7e51273b6b47eabf8d9ae8be331fbc7477b37e18d59c3a06a26c5e27c82b203"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Reporter: 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":"compiler/src/dotty/tools/dotc/reporting/Reporter.scala"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a5540ab13fb72dadc6bded06d80d3ee9fb54f5d0f37d8fa2819f16ae852359d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: BigDecimal: 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":"library/src/scala/math/BigDecimal.scala"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ac26fb750040da0af8c8dce168a5952f5946ac788c6a868e5e8fce62107a672"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sjs/JSExportsGen.scala: FileTooLong \u2014 624 significant lines (blank, comment-only and punctuation-only lines excluded), about 96% of them inside a single declaration: JSExportsGen (34-1030). The bar is 500 significant lines; this is 124 over it, 1.25\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":"compiler/src/dotty/tools/backend/sjs/JSExportsGen.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c82487eaccbcb3570e8057dfea447c575a6154aa1ecb8b1580ea4eeccbafcb02"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: BoxesRunTime: ClassTooLong \u2014 496 significant lines (blank, comment-only and punctuation-only lines excluded), 59 methods. The bar is 400 significant lines; this is 96 over it, 1.24\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/runtime/BoxesRunTime.java"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"a25959b1a809dc247a0e959d2afa1a03d2b6370613bfd178194f5b5fb7c06696"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MemberRenderer: TooManyMethods \u2014 37 methods. The bar is 30 methods; this is 7 over it, 1.23\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scaladoc/src/dotty/tools/scaladoc/renderers/MemberRenderer.scala"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"b999be76d5a7c6dc27848ab1003e2402e78208247a87eaa46dcb0f53a85de463"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: transform/PostTyper.scala: FileTooLong \u2014 609 significant lines (blank, comment-only and punctuation-only lines excluded), about 95% of them inside a single declaration: PostTyper (72-869). The bar is 500 significant lines; this is 109 over it, 1.22\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":"compiler/src/dotty/tools/dotc/transform/PostTyper.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"508f0ef0938c47bdea35fa1ef84501a278ec073e1156e926bc353e43c0690556"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ConstraintHandling: TooManyMethods \u2014 36 methods. The bar is 30 methods; this is 6 over it, 1.20\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":"compiler/src/dotty/tools/dotc/core/ConstraintHandling.scala"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f6476133d58f74a48db6932ebc4ecd3f212e5fb9b57c80ec68c1a2023a1437c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TypeMap: TooManyMethods \u2014 36 methods. The bar is 30 methods; this is 6 over it, 1.20\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":"compiler/src/dotty/tools/dotc/core/Types.scala"},"region":{"startLine":6176}}}],"partialFingerprints":{"codehealthFindingId/v1":"407b3c4eee90566edd133cf4513984e183eb69d5f2a0a57eb690dba646f5ac22"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TreePickler: TooManyMethods \u2014 36 methods. The bar is 30 methods; this is 6 over it, 1.20\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":"compiler/src/dotty/tools/dotc/core/tasty/TreePickler.scala"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"d114e715381ac5bcda2c40af7bb283c9e7d926d56a0e348ab019c90a944f06a4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MarkupParser: TooManyMethods \u2014 36 methods. The bar is 30 methods; this is 6 over it, 1.20\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":"compiler/src/dotty/tools/dotc/parsing/xml/MarkupParsers.scala"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"31740f8c0827486b889fb8e9df7372f06324287b757f2fabc852f1eb35ba9348"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ExtendedThreadMxBean: TooManyMethods \u2014 36 methods. The bar is 30 methods; this is 6 over it, 1.20\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":"compiler/src/dotty/tools/dotc/profile/ExtendedThreadMxBean.java"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"773456f07d113c7f1606bc3924f70a35dc6b19d636453338f27623f1bf237069"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ast/untpd.scala: FileTooLong \u2014 600 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 100 over it, 1.20\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":"compiler/src/dotty/tools/dotc/ast/untpd.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"18f7e26187e921f40747b475af7cfa4dc82407aaa6bdf82ff4691b6555cb23af"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GlobalOptimizer.runInliner: MethodTooLong \u2014 runInliner runs 119 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/backend/jvm/opt/Inliner.scala"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"96ea3f111edb6ee0d6e66b4af7d3ffe97ef1be2df623ea974f9f2d2a24aef985"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: opt/LocalOptimizer.scala: FileTooLong \u2014 587 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 87 over it, 1.17\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/backend/jvm/opt/LocalOptimizer.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac07b8ab3b82a8b461d45f68080570945531e2f47050ef8c1b2cb5eb21175c47"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: transform/InstrumentCoverage.scala: FileTooLong \u2014 584 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 84 over it, 1.17\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/InstrumentCoverage.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"baf8a3734beb93d5047944769973061fe8c781e8c0abe97407d9a107f88fae35"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: BoxUnbox: ClassTooLong \u2014 463 significant lines (blank, comment-only and punctuation-only lines excluded), 3 methods. The bar is 400 significant lines; this is 63 over it, 1.16\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/backend/jvm/opt/BoxUnbox.scala"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6921228edf892bd6624beffc2570406f3cb84df96c8686ef7f280b1702bcef1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: immutable/LazyList.scala: FileTooLong \u2014 573 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 73 over it, 1.15\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/collection/immutable/LazyList.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db75c9c98a49d2362649d3fb0332b5f12a5a1fbb2e8cc78a8dc515d2ed6e632b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pc/ScalaPresentationCompiler.scala: FileTooLong \u2014 568 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 68 over it, 1.14\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"presentation-compiler/src/main/dotty/tools/pc/ScalaPresentationCompiler.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e08d77df3619f3699e08a654680f5b66f929b519f2e355d50f0cb6e91eb09f6e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Expr: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/quoted/Expr.scala"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"4defc3200f9c71e1f813df606598c61a484f88cffdb071a592ec5994a2584cbb"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ReplDriver: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"repl/src/dotty/tools/repl/ReplDriver.scala"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"de4275bd00c40b1cc405e2d6eb64c68f72d8c0f17e84279f3d6cd418572d9b9a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: jvm/BCodeSkelBuilder.scala: FileTooLong \u2014 563 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 63 over it, 1.13\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/backend/jvm/BCodeSkelBuilder.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"93f7de2244d38219795e697b89712014363c52c109c2d504b0bca5c34b8ca853"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tasty/TypesSupport.scala: FileTooLong \u2014 554 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 54 over it, 1.11\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scaladoc/src/dotty/tools/scaladoc/tasty/TypesSupport.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cfa00153dfa873a4603b28ec994d426700efd810162c4a7c7b46441fc9ed422"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Name: TooManyMethods \u2014 33 methods. The bar is 30 methods; this is 3 over it, 1.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/Names.scala"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"f979b013c4007d222e7759ebd3ae97098ef6069d748d2e466cd3cb8cec5c7cd1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: FiniteDuration: TooManyMethods \u2014 33 methods. The bar is 30 methods; this is 3 over it, 1.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/concurrent/duration/Duration.scala"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"665c7aa0c4eb920b718cb33e3036a4a133aa219b3025b134500a6fc49677209f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TypesSupport: TooManyMethods \u2014 33 methods. The bar is 30 methods; this is 3 over it, 1.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scaladoc/src/dotty/tools/scaladoc/tasty/TypesSupport.scala"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e2bee34a4b4a3f18c19f51212ad9737c7605265da67a9f4d774689baad987e4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parsing/JavaScanners.scala: FileTooLong \u2014 544 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 44 over it, 1.09\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":"compiler/src/dotty/tools/dotc/parsing/JavaScanners.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2924d6e203daeb6bfaddeb7c204fc693baef03c1f9371253c8f9d76df41ec594"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PrepareInlineable.initContext: MethodTooLong \u2014 initContext runs 108 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/inlines/PrepareInlineable.scala"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"c23ca12a79418cb60350e9f12e33b570c877fc38726dfd3b8bfa67c00a26ffb0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: communitybuild/projects.scala: FileTooLong \u2014 536 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 36 over it, 1.07\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"community-build/src/scala/dotty/communitybuild/projects.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"19c41f0a50b8dd08ef0fcac8044353faed0f620871370128f3bc1353f5dd6a3c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sbt/ExtractAPI.scala: FileTooLong \u2014 535 significant lines (blank, comment-only and punctuation-only lines excluded), about 76% of them inside a single declaration: ExtractAPICollector (201-886). The bar is 500 significant lines; this is 35 over it, 1.07\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":"compiler/src/dotty/tools/dotc/sbt/ExtractAPI.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9836ff3c59eef6ef959fc4e33344a44cb9e8a358f5d0445a34f21ce5b7c2baa7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Run: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/Run.scala"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"69b8391fb62fe73ca2bb6b4acfd6638bebb05c628175dfdc8b13a737ec5e6c40"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TypeApplications: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/TypeApplications.scala"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b46ebe09cc2add1e50d22f388f6b08779845bd580c7d45ea545acafd33c9358"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: report: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/report.scala"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"54376bbb593b12f53401a96216a36adf67a421b1e9f2100a398405c5f37b20dd"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ScalaRunTime: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library-js/src/scala/runtime/ScalaRunTime.scala"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea86a50595e554df77d66ab51d7a9a02e1a54e2d40e288599f0e4febfe5c9d2f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PrepareInlineable.makeInlineable: MethodTooLong \u2014 makeInlineable runs 106 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/inlines/PrepareInlineable.scala"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ec4c4e2b7b91681bcb19c9d2490fcf37c23699df36bfd414f6198b78853fb24"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: semanticdb/ExtractSemanticDB.scala: FileTooLong \u2014 529 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 29 over it, 1.06\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/semanticdb/ExtractSemanticDB.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cafee087583e6248ea8def0fb3584c7872988f03e3984b4168003d9bf71ce64"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dotc/Run.scala: FileTooLong \u2014 524 significant lines (blank, comment-only and punctuation-only lines excluded), about 75% of them inside a single declaration: Run (48-643). The bar is 500 significant lines; this is 24 over it, 1.05\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":"compiler/src/dotty/tools/dotc/Run.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9269779c0d5a84e01d7f3c8b1d44405730e1a86eeff3e28ab6bcc4b11fce1e61"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PrepareInlineable.addAccessorDefs: MethodTooLong \u2014 addAccessorDefs runs 104 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/inlines/PrepareInlineable.scala"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"bad0d9e976d3ee76e1e47609336abb9c6e073e3d319fab691811d9e3ef7aff89"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CopyProp: ClassTooLong \u2014 415 significant lines (blank, comment-only and punctuation-only lines excluded), 5 methods. The bar is 400 significant lines; this is 15 over it, 1.04\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":"compiler/src/dotty/tools/backend/jvm/opt/CopyProp.scala"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4568635a359d37717de609d65ce24a4c09ccd6f507f6704550afec02e02b09b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PlainSkelBuilder: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/backend/jvm/BCodeSkelBuilder.scala"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5aea4fdfb03d047a9223128dea8e2b3de750cd1859733785ade977c435528fb"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: JSExportsGen: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/backend/sjs/JSExportsGen.scala"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"27e310700c57e953621ee68e7053283e6ab1328f25f857dbd1d8225595b1546c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CoverageTransformer: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/InstrumentCoverage.scala"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"77132761f84884a735e88af5733f812bfd10e13cbb9225e267a8676cc913ff16"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Path: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/io/Path.scala"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"d69e6a7481665c02e6070522e616f4c655c75c7368bed3bc382a3d46648d1cee"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: interactive/Completion.scala: FileTooLong \u2014 512 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 12 over it, 1.02\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/interactive/Completion.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"522c427e74c615469f842e2cf6f7a92e3c079a05b888d1469e33db32dfaf17ad"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ExtractAPICollector: ClassTooLong \u2014 409 significant lines (blank, comment-only and punctuation-only lines excluded), 26 methods. The bar is 400 significant lines; this is 9 over it, 1.02\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/sbt/ExtractAPI.scala"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"57e1a499046363d50fae0b7521dfb8fe9c667cbf53813a17a68bac75efae4a02"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pc/PcInlayHintsProvider.scala: FileTooLong \u2014 506 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 6 over it, 1.01\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"presentation-compiler/src/main/dotty/tools/pc/PcInlayHintsProvider.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"952ae1efd4acea1d4d4ee5b562531ae93dbe82804f36d88de4c8685ca480b985"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (36 shared lines): compiler/src/dotty/tools/dotc/util/NameTransformer.scala:95-156 | library/src/scala/reflect/NameTransformer.scala:121-184 \u2014 These two members are variants of one another: 36 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/util/NameTransformer.scala"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"116d75dc3896a8cbaf81b0fb7129f7a07df71454d5cc25facd9ce377b6059ce1"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (11 members, 50\u002B identical tokens): library/src/scala/Product12.scala:53-67 | library/src/scala/Product13.scala:54-69 | library/src/scala/Product14.scala:55-71 | library/src/scala/Product15.scala:56-73 | library/src/scala/Product16.scala:57-75 | library/src/scala/Product17.scala:58-77 | library/src/scala/Product18.scala:59-79 | library/src/scala/Product19.scala:60-81 | library/src/scala/Product20.scala:61-83 | library/src/scala/Product21.scala:62-85 | library/src/scala/Product22.scala:63-87 \u2014 These 11 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 11 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 11 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/Product12.scala"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3138e3946cf10482748517d98b39177addb0a10d8f11f33a01f541edef8dc47"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): compiler/src/dotty/tools/dotc/parsing/JavaScanners.scala:62-356 | compiler/src/dotty/tools/dotc/parsing/JavaScanners.scala:378-413 | compiler/src/dotty/tools/dotc/parsing/Scanners.scala:878-1024 | compiler/src/dotty/tools/dotc/parsing/Scanners.scala:1137-1170 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/parsing/JavaScanners.scala"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"6923af66b15a30bdebbce85f505003240ae4fe512b37eddfeeb6180c3da67389"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): library/src/scala/collection/convert/impl/IteratorStepper.scala:29-44 | library/src/scala/collection/convert/impl/IteratorStepper.scala:54-69 | library/src/scala/collection/convert/impl/IteratorStepper.scala:79-94 | library/src/scala/collection/convert/impl/IteratorStepper.scala:104-119 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/collection/convert/impl/IteratorStepper.scala"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"f59223a9c6f9bb957d0750d40f050786e07f7d76e8bbef11d955138920aebcd3"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): library/src/scala/jdk/AnyAccumulator.scala:87-132 | library/src/scala/jdk/DoubleAccumulator.scala:85-139 | library/src/scala/jdk/IntAccumulator.scala:88-145 | library/src/scala/jdk/LongAccumulator.scala:86-140 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/jdk/AnyAccumulator.scala"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5838c72039a9a69e75bac44ebe884cc511ab20701addffff8c420e5bb571730"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): library/src/scala/jdk/AnyAccumulator.scala:216-234 | library/src/scala/jdk/DoubleAccumulator.scala:278-296 | library/src/scala/jdk/IntAccumulator.scala:284-302 | library/src/scala/jdk/LongAccumulator.scala:279-297 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/jdk/AnyAccumulator.scala"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"10b3cbfeb0d19d88a93901d5acdd1e8faf1f044c2098167b779b4c9d2d7929ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): library/src/scala/jdk/AnyAccumulator.scala:370-392 | library/src/scala/jdk/DoubleAccumulator.scala:428-450 | library/src/scala/jdk/IntAccumulator.scala:434-456 | library/src/scala/jdk/LongAccumulator.scala:429-451 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/jdk/AnyAccumulator.scala"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c6d67be2e50698dfa5eb6ef1ef1ec6c557da7ad044f5533b5dba3dafe72aeef"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): library/src/scala/runtime/BoxesRunTime.java:553-578 | library/src/scala/runtime/BoxesRunTime.java:580-605 | library/src/scala/runtime/BoxesRunTime.java:607-632 | library/src/scala/runtime/BoxesRunTime.java:634-659 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/runtime/BoxesRunTime.java"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"41f899274bf542f66c8abb2e2a02da04d4eb8f3aea4448b894cc8b6862f02abe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (128 corresponding lines): compiler/src/dotty/tools/dotc/transform/init/Objects.scala:2112-2239 | compiler/src/dotty/tools/dotc/transform/init/Semantic.scala:1542-1670 \u2014 These two members are one piece of code written twice and then edited apart: 128 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":"compiler/src/dotty/tools/dotc/transform/init/Objects.scala"},"region":{"startLine":2112}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a18bb7761460345a869a0fe4e10761fcd4d926b158a89f25e640e92e932450c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (65 corresponding lines): compiler/src/dotty/tools/dotc/core/classfile/ByteCodecs.scala:62-126 | compiler/src/dotty/tools/dotc/core/classfile/ByteCodecs.scala:128-192 \u2014 These two members are one piece of code written twice and then edited apart: 65 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":"compiler/src/dotty/tools/dotc/core/classfile/ByteCodecs.scala"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1055b3e1cfe6c4fca0a7064210a573177e6e0b7246ec37398b99552a4af8eae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (78 corresponding lines): compiler/src/dotty/tools/dotc/config/CommandLineParser.scala:30-107 | library/src/scala/sys/process/Parser.scala:30-113 \u2014 These two members are one piece of code written twice and then edited apart: 78 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":"compiler/src/dotty/tools/dotc/config/CommandLineParser.scala"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfc72574d4e53b6424a32f7da95f13fcd827b62bdc6fbd93b7f60b1963dbdd9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 55\u002B corresponding lines): library/src/scala/jdk/DoubleAccumulator.scala:452-506 | library/src/scala/jdk/IntAccumulator.scala:458-512 | library/src/scala/jdk/LongAccumulator.scala:453-507 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 55 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/jdk/DoubleAccumulator.scala"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b7610ba425e00bcb013cf316b643ce2c7cd50bbcafdf777614c6fe3df99e82b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (46 corresponding lines): library-js/src/scala/collection/immutable/NumericRange.scala:270-315 | library/src/scala/collection/immutable/NumericRange.scala:319-372 \u2014 These two members are one piece of code written twice and then edited apart: 46 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":"library-js/src/scala/collection/immutable/NumericRange.scala"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfa2cedd2691f8f328d787491eafa23bab7398d0eac1e47e9d0dd63cf2d32491"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): library/src/scala/collection/StringParsers.scala:106-138 | library/src/scala/collection/StringParsers.scala:140-173 \u2014 These two members are one piece of code written twice and then edited apart: 33 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":"library/src/scala/collection/StringParsers.scala"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"abed53b9a02c5eb9919ba1085f6f536817caad4ffe21aee88abcc97fe683ab1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (8 members, 6\u002B corresponding lines): library/src/scala/runtime/TupledFunctions.scala:104-109 | library/src/scala/runtime/TupledFunctions.scala:111-116 | library/src/scala/runtime/TupledFunctions.scala:118-123 | library/src/scala/runtime/TupledFunctions.scala:125-130 | library/src/scala/runtime/TupledFunctions.scala:132-137 | library/src/scala/runtime/TupledFunctions.scala:139-144 | library/src/scala/runtime/TupledFunctions.scala:146-151 | library/src/scala/runtime/TupledFunctions.scala:153-158 \u2014 These 8 members are one piece of code written 8 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 8 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/runtime/TupledFunctions.scala"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"190f3eb15db7d42cad28dd716b405b17f493932cc54100eb5649e0734f0ef8b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): compiler/src/dotty/tools/dotc/parsing/JavaScanners.scala:590-626 | compiler/src/dotty/tools/dotc/parsing/Scanners.scala:1488-1526 \u2014 These two members are one piece of code written twice and then edited apart: 37 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":"compiler/src/dotty/tools/dotc/parsing/JavaScanners.scala"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"18367b4cb65ce86778ee156d78cafe8e7502198220f115eef8b0fb70345b9a6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): library/src/scala/util/hashing/MurmurHash3.scala:220-254 | library/src/scala/util/hashing/MurmurHash3.scala:315-347 \u2014 These two members are one piece of code written twice and then edited apart: 33 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":"library/src/scala/util/hashing/MurmurHash3.scala"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"0615f6633cd876f9eeef33996b3fb2fdf1ffd1aebb91d460fb465804a3768a88"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): compiler/src/dotty/tools/backend/jvm/BCodeBodyBuilder.scala:1524-1542 | compiler/src/dotty/tools/backend/jvm/BCodeBodyBuilder.scala:1545-1572 \u2014 These two members are one piece of code written twice and then edited apart: 19 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":"compiler/src/dotty/tools/backend/jvm/BCodeBodyBuilder.scala"},"region":{"startLine":1524}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd944d95050ee9c51db5d960908b352e2423156db13fd40d97711e2dc68b3209"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): compiler/src/dotty/tools/backend/jvm/opt/BoxUnbox.scala:684-705 | compiler/src/dotty/tools/backend/jvm/opt/BoxUnbox.scala:743-761 \u2014 These two members are one piece of code written twice and then edited apart: 19 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":"compiler/src/dotty/tools/backend/jvm/opt/BoxUnbox.scala"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3d596d3ef1fee427f0f5b72baece38d8719100725eb0be853fd33b5cb18684c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): compiler/src/dotty/tools/dotc/core/Types.scala:3556-3574 | compiler/src/dotty/tools/dotc/core/Types.scala:3705-3723 \u2014 These two members are one piece of code written twice and then edited apart: 19 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":"compiler/src/dotty/tools/dotc/core/Types.scala"},"region":{"startLine":3556}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfab84f3e99cf8622e8a0d1002d8d5590b500d580586a32f76174c07c35c641e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): compiler/src/dotty/tools/scripting/ScriptingDriver.scala:14-40 | compiler/src/dotty/tools/scripting/StringDriver.scala:16-46 \u2014 These two members are one piece of code written twice and then edited apart: 27 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":"compiler/src/dotty/tools/scripting/ScriptingDriver.scala"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"c553e1c6a6d83ee3251a38c8d98becac15b1920983aa2edccdc39f36e3831d3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): presentation-compiler/src/main/dotty/tools/pc/RawScalaPresentationCompiler.scala:92-114 | presentation-compiler/src/main/dotty/tools/pc/ScalaPresentationCompiler.scala:89-114 \u2014 These two members are one piece of code written twice and then edited apart: 23 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":"presentation-compiler/src/main/dotty/tools/pc/RawScalaPresentationCompiler.scala"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9be907f0a20c260ac174bee5f13b0420800f66e3fb07c6ba3b9bf4a5c3afb8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): compiler/src/dotty/tools/dotc/util/NameTransformer.scala:57-90 | library/src/scala/reflect/NameTransformer.scala:71-99 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/util/NameTransformer.scala"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fd24ecfefb674b641499715e062dde7659a4d1394d16575643fdde098812308"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 27\u002B corresponding lines): library/src/scala/runtime/BoxesRunTime.java:323-349 | library/src/scala/runtime/BoxesRunTime.java:352-378 | library/src/scala/runtime/BoxesRunTime.java:381-407 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 27 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/runtime/BoxesRunTime.java"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"250a35d2e500a4da9ca8d69c0c636a944bc2ffb15258585f31d35347b678abf9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 18\u002B corresponding lines): library/src/scala/runtime/BoxesRunTime.java:450-467 | library/src/scala/runtime/BoxesRunTime.java:470-487 | library/src/scala/runtime/BoxesRunTime.java:490-507 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/runtime/BoxesRunTime.java"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3df9403840238fcfb6d929793f98751c1bae9e67029120e353743f17f2cf536"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (7 members, 3\u002B corresponding lines): library/src/scala/quoted/Expr.scala:249-251 | library/src/scala/quoted/Expr.scala:254-256 | library/src/scala/quoted/Expr.scala:259-261 | library/src/scala/quoted/Expr.scala:264-266 | library/src/scala/quoted/Expr.scala:269-271 | library/src/scala/quoted/Expr.scala:274-276 | library/src/scala/quoted/Expr.scala:279-281 \u2014 These 7 members are one piece of code written 7 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 7 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/quoted/Expr.scala"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"679631e370b60d90334504922e33a2ad72c130ed04cd03a30b695fde4b97563e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): compiler/src/dotty/tools/dotc/typer/QuotesAndSplices.scala:161-174 | compiler/src/dotty/tools/dotc/typer/QuotesAndSplices.scala:181-197 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/QuotesAndSplices.scala"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"723addbc7788034f52e1bd1861cb98db780efe87ef5af56ea32ab421cbf38553"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): compiler/src/dotty/tools/dotc/core/Uniques.scala:42-68 | compiler/src/dotty/tools/dotc/core/Uniques.scala:83-105 \u2014 These two members are one piece of code written twice and then edited apart: 23 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":"compiler/src/dotty/tools/dotc/core/Uniques.scala"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc4e272973a4a7a65a1103159bbb7adfa1da6bee2d3fb5b7d11e9a89dfe23674"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): library/src/scala/collection/StringParsers.scala:68-85 | library/src/scala/collection/StringParsers.scala:87-104 \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":"library/src/scala/collection/StringParsers.scala"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"af4d6016243902869e070945e036bc46b6a6fce4c068b8527ae7ac83f22d63c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 18\u002B corresponding lines): library/src/scala/runtime/BoxesRunTime.java:227-244 | library/src/scala/runtime/BoxesRunTime.java:247-264 | library/src/scala/runtime/BoxesRunTime.java:267-284 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/runtime/BoxesRunTime.java"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"36fe841f02bd37055d3f70f0962ae98c7ab9853f3cccdbd96829b1a3ba7b5af8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): compiler/src/dotty/tools/backend/jvm/opt/OptimizerKnownBTypes.scala:73-84 | compiler/src/dotty/tools/backend/jvm/opt/OptimizerKnownBTypes.scala:88-98 | compiler/src/dotty/tools/backend/jvm/opt/OptimizerKnownBTypes.scala:133-144 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/backend/jvm/opt/OptimizerKnownBTypes.scala"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"d93ff4eb7225ac587c6f840d9a1197416487a861acf54e96f70ff2f4320ffebe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): library/src/scala/runtime/BoxesRunTime.java:287-302 | library/src/scala/runtime/BoxesRunTime.java:305-320 \u2014 These two members are one piece of code written twice and then edited apart: 16 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":"library/src/scala/runtime/BoxesRunTime.java"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ca8c2bc30a5ee2df8c5a66c6da5a3b92c1d05ea3f46d31a33cf25b554f0d60d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): compiler/src/dotty/tools/backend/sjs/JSCodeGen.scala:5018-5053 | compiler/src/dotty/tools/backend/sjs/JSCodeGen.scala:5067-5102 \u2014 These two members are one piece of code written twice and then edited apart: 36 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":"compiler/src/dotty/tools/backend/sjs/JSCodeGen.scala"},"region":{"startLine":5018}}}],"partialFingerprints":{"codehealthFindingId/v1":"f16ca66909f252254ca135ef909b4f7f24c8658bcbcc04f9b69cfbef22ae2e09"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): library/src/scala/runtime/VarArgsBuilder.scala:15-32 | library/src/scala/runtime/VarArgsBuilder.scala:34-51 \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":"library/src/scala/runtime/VarArgsBuilder.scala"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"78fe4b638eeb134f1500d04c531063fbb0865cc5b2baeb3f158bf6865a2b150e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): compiler/src/dotty/tools/dotc/core/TypeComparer.scala:2670-2685 | compiler/src/dotty/tools/dotc/core/TypeComparer.scala:2702-2720 \u2014 These two members are one piece of code written twice and then edited apart: 16 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":"compiler/src/dotty/tools/dotc/core/TypeComparer.scala"},"region":{"startLine":2670}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7558787e7e8f7c050ee077658e530ac135cbe90a3cd18843d2b8349eef02c2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 19\u002B corresponding lines): library/src/scala/jdk/DoubleAccumulator.scala:257-275 | library/src/scala/jdk/IntAccumulator.scala:263-281 | library/src/scala/jdk/LongAccumulator.scala:258-276 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/jdk/DoubleAccumulator.scala"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"63bba7c523f5640719d41b02556d8023794c1845ff6ea299ec19269633eaf697"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): compiler/src/dotty/tools/dotc/util/GenericHashMap.scala:109-135 | compiler/src/dotty/tools/dotc/util/GenericHashSet.scala:113-137 \u2014 These two members are one piece of code written twice and then edited apart: 25 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":"compiler/src/dotty/tools/dotc/util/GenericHashMap.scala"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"f61b76c07eb6e158d48727e15176093ce384b8f199bf17dfc17813ee1ede5003"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): compiler/src/dotty/tools/dotc/core/Symbols.scala:648-660 | compiler/src/dotty/tools/dotc/core/Symbols.scala:751-765 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/Symbols.scala"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"e073d5e27acc6f095c2bdcc84108e4444043043eab20d4375d7f3a44d9da2e9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): compiler/src/dotty/tools/dotc/parsing/JavaParsers.scala:859-878 | compiler/src/dotty/tools/dotc/parsing/JavaParsers.scala:939-959 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/parsing/JavaParsers.scala"},"region":{"startLine":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"10e2a6bdc4c2863c5f1516e730d37370af2bc7afda01a7cf38ab66996da341e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): library-js/src/scala/collection/immutable/NumericRange.scala:59-68 | library/src/scala/collection/immutable/NumericRange.scala:62-71 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library-js/src/scala/collection/immutable/NumericRange.scala"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeedd8a7d41e02c22c56b56c465f0f47d2be016853159f5428a4765195c23aa6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (8 members, 3\u002B corresponding lines): library/src/scala/Function15.scala:61-63 | library/src/scala/Function16.scala:63-65 | library/src/scala/Function17.scala:65-67 | library/src/scala/Function18.scala:67-69 | library/src/scala/Function19.scala:69-71 | library/src/scala/Function20.scala:71-73 | library/src/scala/Function21.scala:73-75 | library/src/scala/Function22.scala:75-77 \u2014 These 8 members are one piece of code written 8 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 8 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/Function15.scala"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"d150c681b0ba6e7bda0e1a0c51d60d187ff20cfd09f6f5b562cf424c60aa8812"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): compiler/src/dotty/tools/dotc/util/WeakHashSet.scala:137-153 | compiler/src/dotty/tools/dotc/util/WeakHashSet.scala:164-181 \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":"compiler/src/dotty/tools/dotc/util/WeakHashSet.scala"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cc9b663044a6ddf641b902a9beda8677f32dfd2472ed859b087b452ae2260f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): library/src/scala/collection/convert/impl/ChampStepper.scala:83-103 | library/src/scala/collection/immutable/ChampCommon.scala:164-185 \u2014 These two members are one piece of code written twice and then edited apart: 21 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":"library/src/scala/collection/convert/impl/ChampStepper.scala"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6a0622ce35ad0a82a49a876dcd281f53c9c878517431b363c218273db61d9d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): library/src/scala/sys/process/BasicIO.scala:48-58 | library/src/scala/sys/process/BasicIO.scala:70-78 \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":"library/src/scala/sys/process/BasicIO.scala"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"68cb68938edb649c4d41721ceb4aebc01efb5940d31dcac21b8580168a55c5d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): library/src/scala/collection/convert/StreamExtensions.scala:360-366 | library/src/scala/collection/convert/StreamExtensions.scala:391-397 | library/src/scala/collection/convert/StreamExtensions.scala:422-428 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/collection/convert/StreamExtensions.scala"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1b18998f7e836991ae9891a1602e10fb243430cde9e3424bbf8e1b05b162bc8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): compiler/src/dotty/tools/dotc/core/Types.scala:3513-3529 | compiler/src/dotty/tools/dotc/core/Types.scala:3603-3619 \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":"compiler/src/dotty/tools/dotc/core/Types.scala"},"region":{"startLine":3513}}}],"partialFingerprints":{"codehealthFindingId/v1":"6db064f7ff8311b8c73220f571bf56e865bac9ea3f2503eee96c514b2eae24b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): compiler/src/dotty/tools/dotc/core/Substituters.scala:249-268 | compiler/src/dotty/tools/dotc/core/Types.scala:3884-3897 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/Substituters.scala"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"e30086186e820d8adc94f3e8073644f47902a2b87d922a970592ae8679b1ad58"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): library/src/scala/Function21.scala:82-84 | library/src/scala/Function22.scala:84-86 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/Function21.scala"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"91c79d706dfe52f45e3c3f31a5f5bc5d61a896daa7209a3528d04e4a603d61b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): compiler/src/dotty/tools/dotc/sbt/ExtractDependencies.scala:467-478 | compiler/src/dotty/tools/dotc/sbt/ExtractDependencies.scala:480-491 \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":"compiler/src/dotty/tools/dotc/sbt/ExtractDependencies.scala"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"f85f59501b0e6275e04b43eb896c0c4599ba803fd32b9fc2a2afa98c0e7c4af4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): library/src/scala/jdk/DoubleAccumulator.scala:49-58 | library/src/scala/jdk/LongAccumulator.scala:50-59 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/jdk/DoubleAccumulator.scala"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e42d88e9a217709d7238d3fcf21e1967fbda62d31be5682b6da3a72ce73face"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): library/src/scala/util/control/TailCalls.scala:84-92 | library/src/scala/util/control/TailCalls.scala:95-103 \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":"library/src/scala/util/control/TailCalls.scala"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba9ebbb6524bfd8eb0beafafda652949cce1164e348cdee6eb40057416078c93"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): compiler/src/dotty/tools/dotc/transform/DropBreaks.scala:210-220 | compiler/src/dotty/tools/dotc/transform/DropBreaks.scala:240-252 \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":"compiler/src/dotty/tools/dotc/transform/DropBreaks.scala"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"631a992870bbdd7b9a753e15b4e2e96006742e84b28291f999aa461929a7749a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): scaladoc/src/scala/tasty/inspector/TastyInspector.scala:47-54 | tasty-inspector/src/scala/tasty/inspector/TastyInspector.scala:50-59 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scaladoc/src/scala/tasty/inspector/TastyInspector.scala"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a716427f22203a077c614d113a73c067686304301ee94dccc42b10e1f38c07e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): compiler/src/dotty/tools/dotc/core/Substituters.scala:29-40 | compiler/src/dotty/tools/dotc/core/Substituters.scala:43-55 \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":"compiler/src/dotty/tools/dotc/core/Substituters.scala"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"c675accd3729f2b9172ffabdabdd1ba81a4f78f7d8720630fac1bec91773cd94"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): compiler/src/dotty/tools/dotc/core/Substituters.scala:123-134 | compiler/src/dotty/tools/dotc/core/Substituters.scala:137-148 | compiler/src/dotty/tools/dotc/core/Substituters.scala:151-164 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/Substituters.scala"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"a93b83121b5b0fc1b3126f029ab0746c965d652a706dcc2ab39398072d144a20"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): compiler/src/dotty/tools/dotc/core/classfile/ClassfileParser.scala:215-228 | compiler/src/dotty/tools/dotc/core/classfile/ClassfileParser.scala:1510-1521 \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":"compiler/src/dotty/tools/dotc/core/classfile/ClassfileParser.scala"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"37743a06b8c83ad9f86080e477127fcf5900d348cf6bace78647d1244a341205"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): compiler/src/dotty/tools/dotc/interactive/Interactive.scala:202-211 | presentation-compiler/src/main/dotty/tools/pc/MetalsInteractive.scala:31-44 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/interactive/Interactive.scala"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"2df13996f3c01a125d99064df1f698ab9300142fcd41628013a38e666cd9a4cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): compiler/src/dotty/tools/dotc/cc/Capability.scala:413-418 | compiler/src/dotty/tools/dotc/cc/Capability.scala:424-428 \u2014 These two members are one piece of code written twice and then edited apart: 5 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":"compiler/src/dotty/tools/dotc/cc/Capability.scala"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed2970669f556e58b4095a663545e858d6305c55e5215e7291b0bad987c140ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): compiler/src/dotty/tools/dotc/ast/tpd.scala:42-49 | compiler/src/dotty/tools/dotc/ast/tpd.scala:51-58 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/ast/tpd.scala"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb8c028f69c27cc8ac527b38ab0e093b32a7cc5514aef7a61ceb5d01c8986ab0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): compiler/src/dotty/tools/dotc/core/Symbols.scala:625-634 | compiler/src/dotty/tools/dotc/core/Symbols.scala:725-737 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/Symbols.scala"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa07590dc5c00f604b4cbcf70cdc6b9c472bd1bab8532572808ab49d6f248539"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): library/src/scala/runtime/TupledFunctions.scala:11-14 | library/src/scala/runtime/TupledFunctions.scala:16-19 \u2014 These two members are one piece of code written twice and then edited apart: 4 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":"library/src/scala/runtime/TupledFunctions.scala"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cce38946272a95d335866ce394f8389f4d7589253bc1c752c6661893a2dc3a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): compiler/src/dotty/tools/debug/ResolveReflectEval.scala:242-253 | compiler/src/dotty/tools/debug/ResolveReflectEval.scala:256-268 \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":"compiler/src/dotty/tools/debug/ResolveReflectEval.scala"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"38116f0f8087baf5fccfdae1bc5b159ecc947e599115a29394b5643aabe450cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): library/src/scala/collection/immutable/LazyList.scala:1192-1211 | library/src/scala/collection/immutable/Stream.scala:340-358 \u2014 These two members are one piece of code written twice and then edited apart: 19 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":"library/src/scala/collection/immutable/LazyList.scala"},"region":{"startLine":1192}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9a566a436eaa181a8d0ff5ef39f86df0534c8ac18d2b73824e2db9db6a9f2e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): tasty/src/dotty/tools/tasty/TastyBuffer.scala:89-101 | tasty/src/dotty/tools/tasty/TastyBuffer.scala:105-114 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tasty/src/dotty/tools/tasty/TastyBuffer.scala"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"87d2e099c25f672ace02ec15ececf377c2cbeda97e19ffcd3d9cf0ec4203cc1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 8\u002B corresponding lines): library/src/scala/collection/immutable/ChampCommon.scala:65-72 | library/src/scala/collection/immutable/ChampCommon.scala:74-81 | library/src/scala/collection/immutable/ChampCommon.scala:83-91 | library/src/scala/collection/immutable/ChampCommon.scala:92-100 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/collection/immutable/ChampCommon.scala"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"31fa8493e0fd0508ef1152e5e74990b86c5336846cf7a4150f0d2ca95cce7c38"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): library/src/scala/collection/immutable/LazyList.scala:410-425 | library/src/scala/collection/immutable/Stream.scala:433-446 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/collection/immutable/LazyList.scala"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"d681efa2ce470754af96edb26362460e49a77aabc063c818483ff1d7f83896e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): compiler/src/dotty/tools/dotc/ast/TreeInfo.scala:621-633 | compiler/src/dotty/tools/dotc/inlines/Inliner.scala:41-51 \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":"compiler/src/dotty/tools/dotc/ast/TreeInfo.scala"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bfed3b4e1c6345f63a007119a5d435f169f35fdef83ffe1bb05430d26a70ad2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): compiler/src/dotty/tools/dotc/transform/LazyVals.scala:249-259 | compiler/src/dotty/tools/dotc/transform/LazyVals.scala:272-281 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/LazyVals.scala"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"3defd6968c52a7c42ad872b89a9e5e12753c71eef15004454a492e44fcd777c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): compiler/src/dotty/tools/dotc/profile/FileUtils.scala:96-111 | compiler/src/dotty/tools/dotc/profile/FileUtils.scala:113-128 \u2014 These two members are one piece of code written twice and then edited apart: 16 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":"compiler/src/dotty/tools/dotc/profile/FileUtils.scala"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"28c51b56f9e6ada0fd2b7ae0fc225c3ada4a8c10136f6bccdbd17fb0e8f6393c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): compiler/src/dotty/tools/dotc/core/Periods.scala:176-183 | compiler/src/dotty/tools/dotc/core/Periods.scala:185-191 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/Periods.scala"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"04ccbb53cf68485fa2bbb9cea1e383aa29c25b0d6ff7983baa46063154c33ded"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): library/src/scala/collection/immutable/LazyList.scala:1635-1648 | library/src/scala/collection/immutable/Stream.scala:567-577 \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":"library/src/scala/collection/immutable/LazyList.scala"},"region":{"startLine":1635}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f18be63a8bd2d5d9d9191a77a9111a05839c599135e3c619a49342357045e75"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 4\u002B corresponding lines): library/src/scala/runtime/TupledFunctions.scala:21-24 | library/src/scala/runtime/TupledFunctions.scala:26-29 | library/src/scala/runtime/TupledFunctions.scala:31-34 | library/src/scala/runtime/TupledFunctions.scala:36-39 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/runtime/TupledFunctions.scala"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1d3a85314691bd918a8a8425274d47e1aa4db282d6040de105bbcc69572c4a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): compiler/src/dotty/tools/dotc/ast/tpd.scala:687-695 | compiler/src/dotty/tools/dotc/ast/tpd.scala:697-705 \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":"compiler/src/dotty/tools/dotc/ast/tpd.scala"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"25ab194c3de1f96f88a5ac7be7717ba32e9aef456b4f72516931357c77c5b818"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): compiler/src/dotty/tools/dotc/transform/init/Objects.scala:708-719 | compiler/src/dotty/tools/dotc/transform/init/Objects.scala:722-733 | compiler/src/dotty/tools/dotc/transform/init/Objects.scala:736-747 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/init/Objects.scala"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"57dddc9b961d5fc69c914728bd63f5be755b6ccd4ac03a07933b0ee12e99fd42"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): compiler/src/dotty/tools/dotc/transform/init/Objects.scala:814-825 | compiler/src/dotty/tools/dotc/transform/init/Objects.scala:828-839 | compiler/src/dotty/tools/dotc/transform/init/Objects.scala:842-853 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/init/Objects.scala"},"region":{"startLine":814}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3901e56a96e96503c59555c43edc1aa4b5efd464ff1852cce35d3fbfaf06d58"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): library/src/scala/runtime/BoxesRunTime.java:125-134 | library/src/scala/runtime/BoxesRunTime.java:136-145 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/runtime/BoxesRunTime.java"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"3527da72586b5b389e052f637a9fba60347dc397508ca6532e7ca5f209a818fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): compiler/src/dotty/tools/dotc/transform/init/Objects.scala:2094-2104 | compiler/src/dotty/tools/dotc/transform/init/Semantic.scala:1236-1246 \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":"compiler/src/dotty/tools/dotc/transform/init/Objects.scala"},"region":{"startLine":2094}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bc93f0dc214b19994a9be54e0393c2de3734b1ded0e50d7899b94de4dd5faae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): compiler/src/dotty/tools/dotc/transform/InstrumentCoverage.scala:674-682 | compiler/src/dotty/tools/dotc/transform/InstrumentCoverage.scala:686-701 \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":"compiler/src/dotty/tools/dotc/transform/InstrumentCoverage.scala"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"f344b3e357287340fdba8a0cd3807aca39d4086e3a69292769dd1a5188bbc8ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (7 members, 2\u002B corresponding lines): library/src/scala/Tuple16.scala:56-57 | library/src/scala/Tuple17.scala:58-59 | library/src/scala/Tuple18.scala:60-61 | library/src/scala/Tuple19.scala:62-63 | library/src/scala/Tuple20.scala:64-65 | library/src/scala/Tuple21.scala:66-67 | library/src/scala/Tuple22.scala:68-69 \u2014 These 7 members are one piece of code written 7 times and then edited apart: every two of them correspond over at least 2 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 7 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/Tuple16.scala"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"55a7a8cb3d7440a885374c2f0f06bc656b7bb4b7d97e990a9f0bd603746dd4ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): compiler/src/dotty/tools/dotc/util/EqHashMap.scala:88-95 | compiler/src/dotty/tools/dotc/util/GenericHashMap.scala:164-171 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/util/EqHashMap.scala"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"caf4a118ae39e78aa4da5dac37ab8288831333f7e0d19e4a6987a53a99585ed7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): compiler/src/dotty/tools/dotc/transform/CheckShadowing.scala:108-120 | compiler/src/dotty/tools/dotc/transform/CheckShadowing.scala:124-133 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/CheckShadowing.scala"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1e90a8b972fc19499958630f1fbded5d6b6f0bbea937b9314863865dcfcfd0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): library/src/scala/runtime/Tuple2Zipped.scala:128-136 | library/src/scala/runtime/Tuple3Zipped.scala:138-147 \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":"library/src/scala/runtime/Tuple2Zipped.scala"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6cfbb4e168ea9f2ac1376f36f229eb0cfac1fba0eab8f229246664af4678a0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): library/src/scala/util/FromDigits.scala:167-176 | library/src/scala/util/FromDigits.scala:187-196 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/util/FromDigits.scala"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a9bae410df1ea71ddb47c1f73d316ee56724781c082d81fd3a0844b22e93beb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): compiler/src/dotty/tools/dotc/ast/Trees.scala:1458-1461 | compiler/src/dotty/tools/dotc/ast/Trees.scala:1462-1465 \u2014 These two members are one piece of code written twice and then edited apart: 4 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":"compiler/src/dotty/tools/dotc/ast/Trees.scala"},"region":{"startLine":1458}}}],"partialFingerprints":{"codehealthFindingId/v1":"c46424d515860d8bf0592f85fbfd21aec0543dd5b87382ee4463747b090a2a31"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): library-js/src/scala/collection/immutable/NumericRange.scala:320-328 | library/src/scala/collection/immutable/NumericRange.scala:377-385 \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":"library-js/src/scala/collection/immutable/NumericRange.scala"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eb801f21d8f86b54be924204a221f37d4114de25eb7dd8fd558d2d9bb9259da"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): compiler/src/dotty/tools/backend/jvm/analysis/AliasingAnalyzer.scala:515-526 | compiler/src/dotty/tools/backend/jvm/analysis/AliasingAnalyzer.scala:528-539 \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":"compiler/src/dotty/tools/backend/jvm/analysis/AliasingAnalyzer.scala"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"da3abf18eb8b90618d8ef33e3df0bac55bf8a2b4a3dd79761537ad369ff3f37f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): compiler/src/scala/quoted/runtime/impl/printers/SourceCode.scala:821-832 | compiler/src/scala/quoted/runtime/impl/printers/SourceCode.scala:834-844 \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":"compiler/src/scala/quoted/runtime/impl/printers/SourceCode.scala"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"e67fdd63388619dc0900af25cbf0b2f2e7c98652b95620f7d348b545945ce957"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): compiler/src/dotty/tools/backend/jvm/BCodeBodyBuilder.scala:44-55 | compiler/src/dotty/tools/backend/sjs/JSCodeGen.scala:5239-5250 \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":"compiler/src/dotty/tools/backend/jvm/BCodeBodyBuilder.scala"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eab1c842a5a77cee91684c287dd439f2f97cca53453d2a487e0ac462f8494d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (8 members, 7\u002B corresponding lines): library/src/scala/jdk/AnyAccumulator.scala:146-152 | library/src/scala/jdk/AnyAccumulator.scala:161-167 | library/src/scala/jdk/DoubleAccumulator.scala:152-158 | library/src/scala/jdk/DoubleAccumulator.scala:167-173 | library/src/scala/jdk/IntAccumulator.scala:158-164 | library/src/scala/jdk/IntAccumulator.scala:173-179 | library/src/scala/jdk/LongAccumulator.scala:153-159 | library/src/scala/jdk/LongAccumulator.scala:168-174 \u2014 These 8 members are one piece of code written 8 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 8 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/jdk/AnyAccumulator.scala"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"e69e428585e9a48f480b5a8e4677b7af9a33f2f8982a1738325406bcfe766311"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): presentation-compiler/src/main/dotty/tools/pc/ScalaPresentationCompiler.scala:426-434 | presentation-compiler/src/main/dotty/tools/pc/ScalaPresentationCompiler.scala:439-447 | presentation-compiler/src/main/dotty/tools/pc/ScalaPresentationCompiler.scala:467-479 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"presentation-compiler/src/main/dotty/tools/pc/ScalaPresentationCompiler.scala"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8a9ad0d26cfe5071a1c9990aecb8e20138cbb6a6d42421fbd46ff477b89ea29"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): library/src/scala/collection/generic/IsMap.scala:75-80 | library/src/scala/collection/generic/IsMap.scala:85-90 \u2014 These two members are one piece of code written twice and then edited apart: 6 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":"library/src/scala/collection/generic/IsMap.scala"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"43d7e1d70b0c0c364c69ebe4438268fd9a7b86614382fecf2f969cc85f1ec7a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): library/src/scala/concurrent/Future.scala:760-762 | library/src/scala/concurrent/Future.scala:943-945 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/concurrent/Future.scala"},"region":{"startLine":760}}}],"partialFingerprints":{"codehealthFindingId/v1":"76ea0d383e64af3e0b3bd2f4d848848a61ed24ef2bb929a8648e94513184bf69"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): library/src/scala/runtime/BoxesRunTime.java:510-515 | library/src/scala/runtime/BoxesRunTime.java:518-523 \u2014 These two members are one piece of code written twice and then edited apart: 6 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":"library/src/scala/runtime/BoxesRunTime.java"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1e9173d6a2cb52b3dfb5e9a2d928385881206832380a32d338262e9147b5978"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): library/src/scala/runtime/Tuple2Zipped.scala:61-71 | library/src/scala/runtime/Tuple3Zipped.scala:49-59 | library/src/scala/runtime/Tuple3Zipped.scala:61-71 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/runtime/Tuple2Zipped.scala"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcac9c5e8a853e0ea82c45412be03ca911d2b31b526b1344fdf17059d617cc5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 8\u002B corresponding lines): compiler/src/dotty/tools/dotc/ast/tpd.scala:722-735 | compiler/src/dotty/tools/dotc/ast/tpd.scala:751-758 | compiler/src/dotty/tools/dotc/ast/tpd.scala:793-800 | compiler/src/dotty/tools/dotc/ast/tpd.scala:802-811 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/ast/tpd.scala"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"eddf1a7f6a5af32b732b109acbbf10834afadd84c9cb03aaeeb798c11a5bf915"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): compiler/src/dotty/tools/dotc/ast/tpd.scala:1372-1379 | compiler/src/dotty/tools/dotc/transform/Recheck.scala:523-530 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/ast/tpd.scala"},"region":{"startLine":1372}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ffec9a616fc16e659c3eeeae8df4c5adf5b1cef94a88c05f59b087c9a65ac98"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 5\u002B corresponding lines): library/src/scala/collection/convert/AsJavaConverters.scala:208-212 | library/src/scala/collection/convert/AsJavaConverters.scala:228-232 | library/src/scala/collection/convert/AsJavaConverters.scala:267-271 | library/src/scala/collection/convert/AsScalaConverters.scala:160-164 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 5 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/collection/convert/AsJavaConverters.scala"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b99affd7f865847c59cae501149a68a22bc78115064d3a8e81f00ad7c925359"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): compiler/src/dotty/tools/dotc/ast/Trees.scala:1376-1379 | compiler/src/dotty/tools/dotc/ast/untpd.scala:671-674 \u2014 These two members are one piece of code written twice and then edited apart: 4 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":"compiler/src/dotty/tools/dotc/ast/Trees.scala"},"region":{"startLine":1376}}}],"partialFingerprints":{"codehealthFindingId/v1":"41c9570dcfb50e28332ecb3da0d03531099536803653a4a0cbaa5253f20cfdf5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): compiler/src/dotty/tools/dotc/core/Substituters.scala:187-193 | compiler/src/dotty/tools/dotc/core/Substituters.scala:195-201 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/Substituters.scala"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3b933f0b9d425d88b954362d0161b9dd6e5deaaca447900460f32c0b4a5c578"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): compiler/src/dotty/tools/dotc/transform/init/Objects.scala:1590-1592 | compiler/src/dotty/tools/dotc/transform/init/Semantic.scala:1226-1228 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/init/Objects.scala"},"region":{"startLine":1590}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c654adfb81c18e46dda4085a26092ce02e5612a02a04143b92f16691220a9b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): library/src/scala/math/BigInt.scala:362-370 | library/src/scala/math/BigInt.scala:376-384 | library/src/scala/math/BigInt.scala:390-400 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/math/BigInt.scala"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e64dfc4126ff488c5420975eb490af2f19f1aeb38b5c28b2fb2b70b45874029"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): library/src/scala/collection/immutable/Stream.scala:139-150 | library/src/scala/collection/immutable/LazyList.scala:552-563 \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":"library/src/scala/collection/immutable/Stream.scala"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d48199b3dbf3a1f2defbdd91f11102b9a43b65780fb4e2237cd64c3116b5a3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): repl/src/sourcecode/Macros.scala:172-178 | repl/src/sourcecode/Macros.scala:180-188 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"repl/src/sourcecode/Macros.scala"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5b628969bbe5191faf5c37432a416f8caed94f2af520d1d1250095631d89f46"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): library/src/scala/jdk/DoubleAccumulator.scala:38-47 | library/src/scala/jdk/IntAccumulator.scala:39-48 | library/src/scala/jdk/LongAccumulator.scala:39-48 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/jdk/DoubleAccumulator.scala"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f3c70bd05de935d7d0320f37113f52be6ff1c2f31d64d31b1dcccc9ff7b03f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 5\u002B corresponding lines): compiler/src/dotty/tools/dotc/ast/TreeInfo.scala:133-138 | compiler/src/dotty/tools/dotc/ast/TreeInfo.scala:142-147 | compiler/src/dotty/tools/dotc/ast/TreeInfo.scala:916-920 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 5 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/ast/TreeInfo.scala"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffc9d34828ad1e7c32a8b599d3c9a371098d51cf5280abdda35cf7a2eb7b8af9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): library-js/src/scala/reflect/Manifest.scala:65-68 | library/src/scala/reflect/Manifest.scala:66-69 \u2014 These two members are one piece of code written twice and then edited apart: 4 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":"library-js/src/scala/reflect/Manifest.scala"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e37094f544f89da84f2bca20a1f7b9b5057a6f51aa064d02bba8f1516de1a73"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): library/src/scala/collection/convert/impl/BinaryTreeStepper.scala:66-75 | library/src/scala/collection/convert/impl/BinaryTreeStepper.scala:86-95 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/collection/convert/impl/BinaryTreeStepper.scala"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"a043562fbcf97cf9b38179ed30235893cd133bb9c1af5bb37660a48e1cd84324"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): scaladoc/src/dotty/tools/scaladoc/tasty/InkuireSupport.scala:287-291 | scaladoc/src/dotty/tools/scaladoc/tasty/TypesSupport.scala:92-97 \u2014 These two members are one piece of code written twice and then edited apart: 5 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":"scaladoc/src/dotty/tools/scaladoc/tasty/InkuireSupport.scala"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"4490bc88319b4408501176eedfd1cdb0cbdc46e73ded973281a05833b4cdc397"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): compiler/src/dotty/tools/dotc/quoted/QuotePatterns.scala:335-338 | compiler/src/scala/quoted/runtime/impl/QuoteMatcher.scala:717-720 \u2014 These two members are one piece of code written twice and then edited apart: 4 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":"compiler/src/dotty/tools/dotc/quoted/QuotePatterns.scala"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"d62abcdc5704e4ff9d6b32bb7f3b44eb923ff64e74aabe6e4df03c6ae29a98f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): scaladoc/src/dotty/tools/scaladoc/tasty/InkuireSupport.scala:294-298 | scaladoc/src/dotty/tools/scaladoc/tasty/TypesSupport.scala:100-105 \u2014 These two members are one piece of code written twice and then edited apart: 5 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":"scaladoc/src/dotty/tools/scaladoc/tasty/InkuireSupport.scala"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"886dae0a4f978510c4d23c7b585fea8e6b3289d9d37706bab6911078caf105d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): library-js/src/scala/collection/immutable/NumericRange.scala:250-253 | library/src/scala/collection/immutable/NumericRange.scala:299-302 \u2014 These two members are one piece of code written twice and then edited apart: 4 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":"library-js/src/scala/collection/immutable/NumericRange.scala"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"e754bbbeb1597ed29d9205fa206b587ab53788ce34c6bb1992c310e8f7932dfb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): library-js/src/scala/collection/immutable/NumericRange.scala:257-260 | library/src/scala/collection/immutable/NumericRange.scala:306-309 \u2014 These two members are one piece of code written twice and then edited apart: 4 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":"library-js/src/scala/collection/immutable/NumericRange.scala"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"3afa9f35ea1c46825a894ec11699b5de18e1afbb0a65cce179f2cf8404d6ca2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): library/src/scala/collection/immutable/LazyList.scala:1624-1633 | library/src/scala/collection/immutable/Stream.scala:556-565 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/collection/immutable/LazyList.scala"},"region":{"startLine":1624}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb6f91c05987f5a853eba4e9a024520bb0631a490e9b197601a9d0e1c6a0eaa1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 10\u002B corresponding lines): library/src/scala/jdk/AnyAccumulator.scala:312-321 | library/src/scala/jdk/DoubleAccumulator.scala:370-379 | library/src/scala/jdk/IntAccumulator.scala:376-385 | library/src/scala/jdk/LongAccumulator.scala:371-380 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/jdk/AnyAccumulator.scala"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8b4169956afdb4a2bed0c71d200f762f9993b771203627866c15a90dfe2fc54"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): library-js/src/scala/collection/immutable/NumericRange.scala:137-140 | library/src/scala/collection/immutable/NumericRange.scala:186-189 \u2014 These two members are one piece of code written twice and then edited apart: 4 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":"library-js/src/scala/collection/immutable/NumericRange.scala"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b2ee7bf75e93345413afbbddf2f5202326342b5a8b292ec7151506e79130e81"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): library/src/scala/jdk/AnyAccumulator.scala:360-367 | library/src/scala/jdk/IntAccumulator.scala:424-431 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/jdk/AnyAccumulator.scala"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"76b1fcfc4d47e8d0850b6a7f32684e2cafa6dbc86bcdadcc76201a8664f45455"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): library/src/scala/jdk/DoubleAccumulator.scala:60-63 | library/src/scala/jdk/IntAccumulator.scala:63-66 | library/src/scala/jdk/LongAccumulator.scala:61-64 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/jdk/DoubleAccumulator.scala"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"e44137595f3af53d484ec3bd220dab2abd400bd22fc82908a874a15b045e5bce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 8\u002B corresponding lines): library/src/scala/jdk/AnyAccumulator.scala:303-310 | library/src/scala/jdk/DoubleAccumulator.scala:361-368 | library/src/scala/jdk/IntAccumulator.scala:367-374 | library/src/scala/jdk/LongAccumulator.scala:362-369 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/jdk/AnyAccumulator.scala"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"c633242db22719e2f85569de04cb7760d40fbd738fc5404545c031afe66734f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): library-js/src/scala/collection/immutable/NumericRange.scala:92-94 | library/src/scala/collection/immutable/NumericRange.scala:95-97 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library-js/src/scala/collection/immutable/NumericRange.scala"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9fec17dc8fe05f202812117fdd181a0c0d4755725120e9afb80219f57b57b1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (1 corresponding lines): library-js/src/scala/runtime/ScalaRunTime.scala:317-317 | library/src/scala/Predef.scala:823-825 \u2014 These two members are one piece of code written twice and then edited apart: 1 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":"library-js/src/scala/runtime/ScalaRunTime.scala"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ef9d5d44a5bdf1b1ee9ea4b38be32b8c2f1fe0d85195f492c21566ddea350fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): compiler/src/dotty/tools/dotc/Driver.scala:217-223 | scaladoc/src/dotty/tools/scaladoc/snippets/SnippetCompiler.scala:78-84 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/Driver.scala"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"228ac8066e028b2f125881d485f3a3d89f66561c3246d3bb8193554bc9fdcf73"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): scaladoc/src/dotty/tools/scaladoc/Inkuire.scala:140-145 | scaladoc/src/dotty/tools/scaladoc/tasty/InkuireSupport.scala:251-259 \u2014 These two members are one piece of code written twice and then edited apart: 6 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":"scaladoc/src/dotty/tools/scaladoc/Inkuire.scala"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebd4a6f0c5f63b01067a27816cb626fb8c189483e5b96c1c3adebc4c297db4c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): sbt-bridge/src/dotty/tools/xsbt/DelegatingReporter.java:89-95 | sbt-bridge/src/dotty/tools/xsbt/Problem.java:131-137 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sbt-bridge/src/dotty/tools/xsbt/DelegatingReporter.java"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"66cd9190539cbda30f02c4e9afdd277e8e37b1166131c52d1b943a632027d9e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): presentation-compiler/src/main/dotty/tools/pc/completions/MultilineCommentCompletion.scala:14-16 | presentation-compiler/src/main/dotty/tools/pc/completions/ScaladocCompletions.scala:76-79 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"presentation-compiler/src/main/dotty/tools/pc/completions/MultilineCommentCompletion.scala"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3d8cc2afee07651d5b146ad68a9b688a20631048dbee20f237124a6ef848b90"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): library-js/src/scala/reflect/Manifest.scala:351-352 | library/src/scala/reflect/Manifest.scala:346-347 \u2014 These two members are one piece of code written twice and then edited apart: 2 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":"library-js/src/scala/reflect/Manifest.scala"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"096ce13e9b892aa65987e37b5c0dde17272386b44b27f6db9dfb5fecdee05242"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 9\u002B corresponding lines): library/src/scala/jdk/AnyAccumulator.scala:336-344 | library/src/scala/jdk/DoubleAccumulator.scala:394-402 | library/src/scala/jdk/IntAccumulator.scala:400-408 | library/src/scala/jdk/LongAccumulator.scala:395-403 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/jdk/AnyAccumulator.scala"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1619cad543e04e4dfe4001f17f4172f79cdb533b1bf17600e8c3dc987764dd5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 3\u002B corresponding lines): library-js/src/scala/reflect/Manifest.scala:472-474 | library/src/scala/reflect/ClassManifestDeprecatedApis.scala:275-277 | library/src/scala/reflect/Manifest.scala:469-471 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library-js/src/scala/reflect/Manifest.scala"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"e773fe1209c1ed7cb257c2c3ae5c901c547892bc19d684cf36776aafd61c32bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): library/src/scala/jdk/DoubleAccumulator.scala:340-345 | library/src/scala/jdk/IntAccumulator.scala:346-351 | library/src/scala/jdk/LongAccumulator.scala:341-346 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/jdk/DoubleAccumulator.scala"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"40d6dca777b3b6a2a440ff60ebc9ba3c355e012f907727ebd747f0b660afd5d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): library/src/scala/Function3.scala:37-39 | library/src/scala/Function4.scala:39-41 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/Function3.scala"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"977a904915f99c5998358eed4fe52c66245a174b4b717bc4ee07b66c988ea826"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 1\u002B corresponding lines): library/src/scala/runtime/java8/JFunction2$mcDDD$sp.scala:19-19 | library/src/scala/runtime/java8/JFunction2$mcFDD$sp.scala:19-19 | library/src/scala/runtime/java8/JFunction2$mcIDD$sp.scala:19-19 | library/src/scala/runtime/java8/JFunction2$mcJDD$sp.scala:19-19 | library/src/scala/runtime/java8/JFunction2$mcZDD$sp.scala:19-19 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 1 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/runtime/java8/JFunction2$mcDDD$sp.scala"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4c965a86aa92f09e00d62f9f8c734f4b294e344079c54ca556eab5947fd58ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 1\u002B corresponding lines): library/src/scala/runtime/java8/JFunction2$mcDDI$sp.scala:19-19 | library/src/scala/runtime/java8/JFunction2$mcFDI$sp.scala:19-19 | library/src/scala/runtime/java8/JFunction2$mcIDI$sp.scala:19-19 | library/src/scala/runtime/java8/JFunction2$mcJDI$sp.scala:19-19 | library/src/scala/runtime/java8/JFunction2$mcZDI$sp.scala:19-19 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 1 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/runtime/java8/JFunction2$mcDDI$sp.scala"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"f066174a992efb9fc029a609769bff9acb6f152aad89e3ca219ed58fe74f342c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 1\u002B corresponding lines): library/src/scala/runtime/java8/JFunction2$mcDDJ$sp.scala:19-19 | library/src/scala/runtime/java8/JFunction2$mcFDJ$sp.scala:19-19 | library/src/scala/runtime/java8/JFunction2$mcIDJ$sp.scala:19-19 | library/src/scala/runtime/java8/JFunction2$mcJDJ$sp.scala:19-19 | library/src/scala/runtime/java8/JFunction2$mcZDJ$sp.scala:19-19 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 1 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/runtime/java8/JFunction2$mcDDJ$sp.scala"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea286183c43d6982795d47f368b9281c8f182b6c20422b22929339b5abf95e4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 1\u002B corresponding lines): library/src/scala/runtime/java8/JFunction2$mcDID$sp.scala:19-19 | library/src/scala/runtime/java8/JFunction2$mcFID$sp.scala:19-19 | library/src/scala/runtime/java8/JFunction2$mcIID$sp.scala:19-19 | library/src/scala/runtime/java8/JFunction2$mcJID$sp.scala:19-19 | library/src/scala/runtime/java8/JFunction2$mcZID$sp.scala:19-19 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 1 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/runtime/java8/JFunction2$mcDID$sp.scala"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"9de17eeaa144ce7d5557f8cb6ee629df7feb5981ce4c9fcf94fab5f11960dccc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 1\u002B corresponding lines): library/src/scala/runtime/java8/JFunction2$mcDII$sp.scala:19-19 | library/src/scala/runtime/java8/JFunction2$mcFII$sp.scala:19-19 | library/src/scala/runtime/java8/JFunction2$mcIII$sp.scala:19-19 | library/src/scala/runtime/java8/JFunction2$mcJII$sp.scala:19-19 | library/src/scala/runtime/java8/JFunction2$mcZII$sp.scala:19-19 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 1 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/runtime/java8/JFunction2$mcDII$sp.scala"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"0919df0b562beb9c82988afdb7138ec09ef911a2b346e3620bba19a77526d11c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 1\u002B corresponding lines): library/src/scala/runtime/java8/JFunction2$mcDIJ$sp.scala:19-19 | library/src/scala/runtime/java8/JFunction2$mcFIJ$sp.scala:19-19 | library/src/scala/runtime/java8/JFunction2$mcIIJ$sp.scala:19-19 | library/src/scala/runtime/java8/JFunction2$mcJIJ$sp.scala:19-19 | library/src/scala/runtime/java8/JFunction2$mcZIJ$sp.scala:19-19 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 1 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/runtime/java8/JFunction2$mcDIJ$sp.scala"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"a12cb2ac8fd4c8695c6ad5966faf7da43a64075940298846666c10b32b05b05d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 1\u002B corresponding lines): library/src/scala/runtime/java8/JFunction2$mcDJD$sp.scala:19-19 | library/src/scala/runtime/java8/JFunction2$mcFJD$sp.scala:19-19 | library/src/scala/runtime/java8/JFunction2$mcIJD$sp.scala:19-19 | library/src/scala/runtime/java8/JFunction2$mcJJD$sp.scala:19-19 | library/src/scala/runtime/java8/JFunction2$mcZJD$sp.scala:19-19 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 1 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/runtime/java8/JFunction2$mcDJD$sp.scala"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3d3aaccf6fc7e0a865638c055c9a55dafc7859c764155820cfd01e36589fcd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 1\u002B corresponding lines): library/src/scala/runtime/java8/JFunction2$mcDJI$sp.scala:19-19 | library/src/scala/runtime/java8/JFunction2$mcFJI$sp.scala:19-19 | library/src/scala/runtime/java8/JFunction2$mcIJI$sp.scala:19-19 | library/src/scala/runtime/java8/JFunction2$mcJJI$sp.scala:19-19 | library/src/scala/runtime/java8/JFunction2$mcZJI$sp.scala:19-19 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 1 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/runtime/java8/JFunction2$mcDJI$sp.scala"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"4362bee307b838d323a479b1c1784ff39f07ec9af6d5b227610e5b451a1a5829"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 1\u002B corresponding lines): library/src/scala/runtime/java8/JFunction2$mcDJJ$sp.scala:19-19 | library/src/scala/runtime/java8/JFunction2$mcFJJ$sp.scala:19-19 | library/src/scala/runtime/java8/JFunction2$mcIJJ$sp.scala:19-19 | library/src/scala/runtime/java8/JFunction2$mcJJJ$sp.scala:19-19 | library/src/scala/runtime/java8/JFunction2$mcZJJ$sp.scala:19-19 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 1 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/runtime/java8/JFunction2$mcDJJ$sp.scala"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"acf25db8cac6104386facb7e861354165cc613ef223fe64a127e377d176faea0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): library/src/scala/runtime/java8/JFunction2$mcVDD$sp.scala:19-22 | library/src/scala/runtime/java8/JFunction2$mcVID$sp.scala:19-22 | library/src/scala/runtime/java8/JFunction2$mcVJD$sp.scala:19-22 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/runtime/java8/JFunction2$mcVDD$sp.scala"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb9840850eff58522019ae421ca8cae8413fdc77887ed043c375d29705632b1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): library/src/scala/runtime/java8/JFunction2$mcVDI$sp.scala:19-22 | library/src/scala/runtime/java8/JFunction2$mcVII$sp.scala:19-22 | library/src/scala/runtime/java8/JFunction2$mcVJI$sp.scala:19-22 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/runtime/java8/JFunction2$mcVDI$sp.scala"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"570605438719e3a3c8dc803e82c2298a5e960db933e7261079dabf22e713508f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): library/src/scala/runtime/java8/JFunction2$mcVDJ$sp.scala:19-22 | library/src/scala/runtime/java8/JFunction2$mcVIJ$sp.scala:19-22 | library/src/scala/runtime/java8/JFunction2$mcVJJ$sp.scala:19-22 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/runtime/java8/JFunction2$mcVDJ$sp.scala"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a11bc7a8e5f8f1b663de5f0aedb8f22fb8d56de107883c65ff7627a55b50439"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): library-js/src/scala/reflect/ClassTag.scala:90-95 | library/src/scala/reflect/ClassTag.scala:84-89 \u2014 These two members are one piece of code written twice and then edited apart: 6 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":"library-js/src/scala/reflect/ClassTag.scala"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ad66ed87ae7d022d24c2409276c39fa1fba39565d15d8ed2f6989abf9474cf5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (94 lines \u00D7 2): library-js/src/scala/collection/immutable/NumericRange.scala:372-465 | library/src/scala/collection/immutable/NumericRange.scala:429-522 \u2014 before extracting anything, compare \u0060library-js/src/scala/collection/immutable/NumericRange.scala\u0060 and \u0060library/src/scala/collection/immutable/NumericRange.scala\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 243 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library-js/src/scala/collection/immutable/NumericRange.scala"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd317fabcd55e22d931884f1730effc13ec9ebebf5d03888a4e26eddeda46275"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (46 lines \u00D7 2): compiler/src/dotty/tools/dotc/transform/init/Objects.scala:2159-2204 | compiler/src/dotty/tools/dotc/transform/init/Semantic.scala:1578-1623 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/src/dotty/tools/dotc/transform/init/Objects.scala:2159\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060klass\u0060 to \u0060ClassSymbol): Contextual[Ref] = log(\u0022init \u0022 \u002B klass.show\u0060 in one and \u0060ClassSymbol): Contextual[Value] = log(\u0022init \u0022 \u002B klass.show\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/init/Objects.scala"},"region":{"startLine":2159}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f69088109ab9fdf489ddd338ef03e72a3fdf390c93060a89abdf454ae553102"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (45 lines \u00D7 2): scaladoc/src/scala/tasty/inspector/TastyInspector.scala:89-133 | tasty-inspector/src/scala/tasty/inspector/TastyInspector.scala:62-106 \u2014 before extracting anything, compare \u0060scaladoc/src/scala/tasty/inspector/TastyInspector.scala\u0060 and \u0060tasty-inspector/src/scala/tasty/inspector/TastyInspector.scala\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 58 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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":"scaladoc/src/scala/tasty/inspector/TastyInspector.scala"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc792cae78212e9bc5196f004009cc29e34397685320e7b895c7aa6907e42252"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (40 lines \u00D7 2): compiler/src/dotty/tools/tasty/besteffort/BestEffortTastyHeaderUnpickler.scala:83-122 | tasty/src/dotty/tools/tasty/TastyHeaderUnpickler.scala:137-176 \u2014 before extracting anything, compare \u0060compiler/src/dotty/tools/tasty/besteffort/BestEffortTastyHeaderUnpickler.scala\u0060 and \u0060tasty/src/dotty/tools/tasty/TastyHeaderUnpickler.scala\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 62 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/tasty/besteffort/BestEffortTastyHeaderUnpickler.scala"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"afd020cdd9870882a22c1ac4ba11cd5b3915bcfba1c9224c5d0e4d76f3e85b52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): library-js/src/scala/collection/immutable/NumericRange.scala:271-298 | library/src/scala/collection/immutable/NumericRange.scala:320-347 \u2014 before extracting anything, compare \u0060library-js/src/scala/collection/immutable/NumericRange.scala\u0060 and \u0060library/src/scala/collection/immutable/NumericRange.scala\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 243 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library-js/src/scala/collection/immutable/NumericRange.scala:271\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":"library-js/src/scala/collection/immutable/NumericRange.scala"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"955e442579b19c19c07f61557dc71af1d494c8fadf55c54e6afb693d312017b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (65 lines \u00D7 2): library-js/src/scala/collection/immutable/NumericRange.scala:148-212 | library/src/scala/collection/immutable/NumericRange.scala:197-261 \u2014 before extracting anything, compare \u0060library-js/src/scala/collection/immutable/NumericRange.scala\u0060 and \u0060library/src/scala/collection/immutable/NumericRange.scala\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 243 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library-js/src/scala/collection/immutable/NumericRange.scala"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"dae96709ffb5a91cedf02ad87bf2fb4a28eed03ef08e764867f330bd11b92494"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 4): library/src/scala/jdk/AnyAccumulator.scala:370-392 | library/src/scala/jdk/DoubleAccumulator.scala:428-450 | library/src/scala/jdk/IntAccumulator.scala:434-456 | library/src/scala/jdk/LongAccumulator.scala:429-451 \u2014 before extracting anything, compare \u0060library/src/scala/jdk/AnyAccumulator.scala\u0060 and \u0060library/src/scala/jdk/DoubleAccumulator.scala\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/jdk/AnyAccumulator.scala"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"44d0ec8431e98f5986d984620520fb1383e326775141942586edc73cc666e31b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30\u201335 lines \u00D7 3): library/src/scala/jdk/DoubleAccumulator.scala:86-119 | library/src/scala/jdk/IntAccumulator.scala:89-118 | library/src/scala/jdk/LongAccumulator.scala:87-121 \u2014 before extracting anything, compare \u0060library/src/scala/jdk/DoubleAccumulator.scala\u0060 and \u0060library/src/scala/jdk/IntAccumulator.scala\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 175 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/src/scala/jdk/DoubleAccumulator.scala:86\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/jdk/DoubleAccumulator.scala"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"9adca884168b410eba6b0f0917ccba515eae5124719b171702eac04381a12306"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): compiler/src/dotty/tools/dotc/util/NameTransformer.scala:133-153 | library/src/scala/reflect/NameTransformer.scala:161-181 \u2014 before extracting anything, compare \u0060compiler/src/dotty/tools/dotc/util/NameTransformer.scala\u0060 and \u0060library/src/scala/reflect/NameTransformer.scala\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 41 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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 \u0060compiler/src/dotty/tools/dotc/util/NameTransformer.scala:133\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/util/NameTransformer.scala"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a3de7afc7791a30becf989e2f987107eac0fa437bfa9239d87ab2698bce7afa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): presentation-compiler/src/main/dotty/tools/pc/RawScalaPresentationCompiler.scala:92-110 | presentation-compiler/src/main/dotty/tools/pc/ScalaPresentationCompiler.scala:89-108 \u2014 before extracting anything, compare \u0060presentation-compiler/src/main/dotty/tools/pc/RawScalaPresentationCompiler.scala\u0060 and \u0060presentation-compiler/src/main/dotty/tools/pc/ScalaPresentationCompiler.scala\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"presentation-compiler/src/main/dotty/tools/pc/RawScalaPresentationCompiler.scala"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"62606fb22ce157096ecda32fb74f8b6cdcb21716744e872656d2b54ffa3338e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): library/src/scala/collection/convert/impl/ChampStepper.scala:84-101 | library/src/scala/collection/immutable/ChampCommon.scala:165-182 \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":"library/src/scala/collection/convert/impl/ChampStepper.scala"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d13a7a4b82c496290371b19356f0d5e8d1bcdc1376747a99d0f77a5b3dd214d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): library/src/scala/jdk/DoubleAccumulator.scala:280-296 | library/src/scala/jdk/IntAccumulator.scala:286-302 | library/src/scala/jdk/LongAccumulator.scala:281-297 \u2014 before extracting anything, compare \u0060library/src/scala/jdk/DoubleAccumulator.scala\u0060 and \u0060library/src/scala/jdk/IntAccumulator.scala\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 175 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/src/scala/jdk/DoubleAccumulator.scala:280\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/jdk/DoubleAccumulator.scala"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"57e3a30cdb0ddce59dad1904f78ee91984e8d99bf524166ede637f85d4d4d47d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): compiler/src/dotty/tools/backend/jvm/opt/LocalOptimizer.scala:698-711 | compiler/src/dotty/tools/backend/jvm/opt/MethodMax.scala:49-64 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/backend/jvm/opt/LocalOptimizer.scala"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"5778af9d1c2a8e11eb3320c774b27b02e9760f2b3cdd4cf4907669fdb0b0a442"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 4): library/src/scala/collection/convert/impl/IteratorStepper.scala:31-44 | library/src/scala/collection/convert/impl/IteratorStepper.scala:56-69 | library/src/scala/collection/convert/impl/IteratorStepper.scala:81-94 | library/src/scala/collection/convert/impl/IteratorStepper.scala:106-119 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/src/scala/collection/convert/impl/IteratorStepper.scala:31\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/collection/convert/impl/IteratorStepper.scala"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"75670bbd45ccdc8b861edec69f70afc084f6315f1afc41149775f979f720224e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): library/src/scala/util/hashing/MurmurHash3.scala:221-234 | library/src/scala/util/hashing/MurmurHash3.scala:316-329 \u2014 both copies are in the same file, so extract the block 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 \u0060library/src/scala/util/hashing/MurmurHash3.scala:221\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":"library/src/scala/util/hashing/MurmurHash3.scala"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ca13063088c9c42352e84edb4f579b4f314f5fb41dc8a80883381b03204f752"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 11): library/src/scala/Product12.scala:53-65 | library/src/scala/Product13.scala:54-66 | library/src/scala/Product14.scala:55-67 | library/src/scala/Product15.scala:56-68 | library/src/scala/Product16.scala:57-69 | library/src/scala/Product17.scala:58-70 | library/src/scala/Product18.scala:59-71 | library/src/scala/Product19.scala:60-72 | library/src/scala/Product20.scala:61-73 | library/src/scala/Product21.scala:62-74 | library/src/scala/Product22.scala:63-75 \u2014 before extracting anything, compare \u0060library/src/scala/Product12.scala\u0060 and \u0060library/src/scala/Product13.scala\u0060 as WHOLE FILES: 86% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/src/scala/Product12.scala:53\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":"library/src/scala/Product12.scala"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ba5cd9942b3be3e0be92823b3722b8108505b1a3ad9b07cdf7475f22cdb3caa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): library/src/scala/jdk/DoubleAccumulator.scala:494-506 | library/src/scala/jdk/IntAccumulator.scala:500-512 | library/src/scala/jdk/LongAccumulator.scala:495-507 \u2014 before extracting anything, compare \u0060library/src/scala/jdk/DoubleAccumulator.scala\u0060 and \u0060library/src/scala/jdk/IntAccumulator.scala\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 175 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/src/scala/jdk/DoubleAccumulator.scala:494\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060c\u0060 to \u0060DoubleConsumer): Unit = while (N \u003E 0\u0060 in one and \u0060IntConsumer): Unit = while (N \u003E 0\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/jdk/DoubleAccumulator.scala"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ddb70f35b41283be4f96f134f95ebc6aac2908ac1fcc5bc72ad0c49695bc1e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): compiler/src/dotty/tools/dotc/util/EqHashMap.scala:47-59 | compiler/src/dotty/tools/dotc/util/GenericHashMap.scala:94-106 \u2014 before extracting anything, compare \u0060compiler/src/dotty/tools/dotc/util/EqHashMap.scala\u0060 and \u0060compiler/src/dotty/tools/dotc/util/GenericHashMap.scala\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 42 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/util/EqHashMap.scala"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cf546e4f62fe1af5debb5482b6dd660421a6b3d1249627098f82da6e303b04e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): compiler/src/dotty/tools/dotc/util/EqHashMap.scala:63-75 | compiler/src/dotty/tools/dotc/util/GenericHashMap.scala:139-151 \u2014 before extracting anything, compare \u0060compiler/src/dotty/tools/dotc/util/EqHashMap.scala\u0060 and \u0060compiler/src/dotty/tools/dotc/util/GenericHashMap.scala\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 42 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/util/EqHashMap.scala"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb73edc1852453c27de6f7212b03a0ac914834242bc3f54f226b9ddab6047284"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): compiler/src/dotty/tools/dotc/parsing/JavaScanners.scala:77-88 | compiler/src/dotty/tools/dotc/parsing/Scanners.scala:1147-1157 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/parsing/JavaScanners.scala"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"67d49da7eddd23b0c794a646bbe5cfe18753839b2a66a278be699474e53cf5c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): compiler/src/dotty/tools/tasty/besteffort/BestEffortTastyHeaderUnpickler.scala:56-67 | tasty/src/dotty/tools/tasty/TastyHeaderUnpickler.scala:111-122 \u2014 before extracting anything, compare \u0060compiler/src/dotty/tools/tasty/besteffort/BestEffortTastyHeaderUnpickler.scala\u0060 and \u0060tasty/src/dotty/tools/tasty/TastyHeaderUnpickler.scala\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 62 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/tasty/besteffort/BestEffortTastyHeaderUnpickler.scala"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f5cc115fb8befdc08f0634d9ecb818314518b61be9defb3282614ef56dfd018"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): library-js/src/scala/collection/immutable/NumericRange.scala:346-357 | library/src/scala/collection/immutable/NumericRange.scala:403-414 \u2014 before extracting anything, compare \u0060library-js/src/scala/collection/immutable/NumericRange.scala\u0060 and \u0060library/src/scala/collection/immutable/NumericRange.scala\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 243 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library-js/src/scala/collection/immutable/NumericRange.scala"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec8978d191b5cdc71979680cc82ed5485b40c7b8b4914c9a5eb770be9d4b2c44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): library/src/scala/collection/StringParsers.scala:128-138 | library/src/scala/collection/StringParsers.scala:163-173 \u2014 both copies are in the same file, so extract the block 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 \u0060library/src/scala/collection/StringParsers.scala:128\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/collection/StringParsers.scala"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d9bfaf545a4b72ce7a69a823ecf1ef2f747d8af9b5cdc6805c25f5c31b77bd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 6): library/src/scala/jdk/DoubleAccumulator.scala:480-489 | library/src/scala/jdk/DoubleAccumulator.scala:495-504 | library/src/scala/jdk/IntAccumulator.scala:486-495 | library/src/scala/jdk/IntAccumulator.scala:501-510 | library/src/scala/jdk/LongAccumulator.scala:481-490 | library/src/scala/jdk/LongAccumulator.scala:496-505 \u2014 before extracting anything, compare \u0060library/src/scala/jdk/DoubleAccumulator.scala\u0060 and \u0060library/src/scala/jdk/IntAccumulator.scala\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 175 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060c\u0060 to \u0060DoubleConsumer): Unit = while (N \u003E 0\u0060 in one and \u0060IntConsumer): Unit = while (N \u003E 0\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/jdk/DoubleAccumulator.scala"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"09f85dbe6e680570c3a6de7cf2eba610b43bdca9ae34ba85dce943e2f4163835"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): compiler/src/dotty/tools/debug/ResolveReflectEval.scala:242-251 | compiler/src/dotty/tools/debug/ResolveReflectEval.scala:256-264 \u2014 both copies are in the same file, so extract the block 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 \u0060compiler/src/dotty/tools/debug/ResolveReflectEval.scala:242\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/debug/ResolveReflectEval.scala"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"b39a0509b66e954a039def4efd0e747bb26bfbada1b000af1eb3c1cc55c93254"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): compiler/src/dotty/tools/dotc/core/Substituters.scala:59-68 | compiler/src/dotty/tools/dotc/core/Types.scala:3885-3894 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/src/dotty/tools/dotc/core/Substituters.scala:59\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":"compiler/src/dotty/tools/dotc/core/Substituters.scala"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f11a51655b1762db000cd715fa82e16a642f29cee907107842fd2d5294a5903"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): compiler/src/dotty/tools/dotc/reporting/messages.scala:2175-2184 | compiler/src/dotty/tools/dotc/reporting/messages.scala:2521-2530 \u2014 both copies are in the same file, so extract the block 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":"compiler/src/dotty/tools/dotc/reporting/messages.scala"},"region":{"startLine":2175}}}],"partialFingerprints":{"codehealthFindingId/v1":"f18a39c2ec4ec2dda949f32a893ef46e0e44f67994c99f541759f37e38f7d3fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): compiler/src/dotty/tools/dotc/transform/DropBreaks.scala:211-220 | compiler/src/dotty/tools/dotc/transform/DropBreaks.scala:243-251 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/DropBreaks.scala"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"676d464d2fcb5d5b0ce7f2af66ed3d63845a0e6e2229e147daa19c893d87dd73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): compiler/src/dotty/tools/dotc/transform/init/Objects.scala:1641-1650 | compiler/src/dotty/tools/dotc/transform/init/Semantic.scala:1277-1286 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/src/dotty/tools/dotc/transform/init/Objects.scala:1641\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":"compiler/src/dotty/tools/dotc/transform/init/Objects.scala"},"region":{"startLine":1641}}}],"partialFingerprints":{"codehealthFindingId/v1":"d64fa3ccaa4eb94bc3bf26e7215c4fcf26234feb80137e66a6631e9495ad53df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): compiler/src/dotty/tools/dotc/transform/init/Objects.scala:2124-2133 | compiler/src/dotty/tools/dotc/transform/init/Semantic.scala:1553-1562 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/src/dotty/tools/dotc/transform/init/Objects.scala:2124\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060klass\u0060 to \u0060ClassSymbol): Contextual[Ref] = log(\u0022init \u0022 \u002B klass.show\u0060 in one and \u0060ClassSymbol): Contextual[Value] = log(\u0022init \u0022 \u002B klass.show\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/init/Objects.scala"},"region":{"startLine":2124}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab875293af66cf579452b7a33fc7382ec1c74935cb22bb57dd2e714241fe2848"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): compiler/src/dotty/tools/tasty/besteffort/BestEffortTastyHeaderUnpickler.scala:157-166 | tasty/src/dotty/tools/tasty/TastyHeaderUnpickler.scala:211-220 \u2014 before extracting anything, compare \u0060compiler/src/dotty/tools/tasty/besteffort/BestEffortTastyHeaderUnpickler.scala\u0060 and \u0060tasty/src/dotty/tools/tasty/TastyHeaderUnpickler.scala\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 62 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/tasty/besteffort/BestEffortTastyHeaderUnpickler.scala"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"50ad19e608c1e61105054eb270c7cf1b1e9c1caec34d8b78668f822c01043743"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 4): compiler/src/dotty/tools/dotc/parsing/JavaScanners.scala:75-83 | compiler/src/dotty/tools/dotc/parsing/JavaScanners.scala:388-395 | compiler/src/dotty/tools/dotc/parsing/Scanners.scala:891-899 | compiler/src/dotty/tools/dotc/parsing/Scanners.scala:1146-1153 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060compiler/src/dotty/tools/dotc/parsing/JavaScanners.scala:84\u0060 calls \u0060getIdentRest\u0060 and \u0060compiler/src/dotty/tools/dotc/parsing/JavaScanners.scala:396\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/parsing/JavaScanners.scala"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddbb166b4cc4a85d2873272f41f21269c0ce12769c64edfa9ff0f28e6bcfd014"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 3): compiler/src/dotty/tools/dotc/quoted/PickledQuotes.scala:142-149 | compiler/src/dotty/tools/dotc/transform/PickleQuotes.scala:130-137 | compiler/src/dotty/tools/dotc/transform/Splicing.scala:141-149 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/quoted/PickledQuotes.scala"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2f9ebada6d1df330d58516fd56f990cd4ed9390eebeef0e8753ee740d65c46c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler/src/dotty/tools/dotc/util/EqHashSet.scala:62-70 | compiler/src/dotty/tools/dotc/util/GenericHashSet.scala:90-98 \u2014 before extracting anything, compare \u0060compiler/src/dotty/tools/dotc/util/EqHashSet.scala\u0060 and \u0060compiler/src/dotty/tools/dotc/util/GenericHashSet.scala\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 40 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/util/EqHashSet.scala"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"173dfc0b52a96ee4647f2145245b5ac8334e12cb5f5b9367d9aea79c948156e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler/src/dotty/tools/dotc/util/NameTransformer.scala:116-124 | library/src/scala/reflect/NameTransformer.scala:144-152 \u2014 before extracting anything, compare \u0060compiler/src/dotty/tools/dotc/util/NameTransformer.scala\u0060 and \u0060library/src/scala/reflect/NameTransformer.scala\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 41 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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 \u0060compiler/src/dotty/tools/dotc/util/NameTransformer.scala:116\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":"compiler/src/dotty/tools/dotc/util/NameTransformer.scala"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"30f7173ed3c5db2de801dbc16acdf580b57524ad041470ac7d7336980bb72df4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): library/src/scala/util/hashing/MurmurHash3.scala:237-245 | library/src/scala/util/hashing/MurmurHash3.scala:331-339 \u2014 both copies are in the same file, so extract the block 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 \u0060library/src/scala/util/hashing/MurmurHash3.scala:237\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":"library/src/scala/util/hashing/MurmurHash3.scala"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"900b541bd275f4775da8b55404fddb151a37418a97a70090ff528b314e7e39f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): presentation-compiler/src/main/dotty/tools/pc/InferredMethodProvider.scala:56-64 | presentation-compiler/src/main/dotty/tools/pc/InferredTypeProvider.scala:60-68 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"presentation-compiler/src/main/dotty/tools/pc/InferredMethodProvider.scala"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dc33a0d13aa63b9e4362355a2aba6fb8b3ce15f37f1cbb07290bf050a593ae8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/src/dotty/tools/debug/ResolveReflectEval.scala:100-107 | compiler/src/dotty/tools/debug/ResolveReflectEval.scala:123-130 \u2014 both copies are in the same file, so extract the block 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 \u0060compiler/src/dotty/tools/debug/ResolveReflectEval.scala:100\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/debug/ResolveReflectEval.scala"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"92364295d7f9ead93be1104c438f05cc17d3f7bbf4eadfb739a649592802647d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): compiler/src/dotty/tools/dotc/transform/init/Objects.scala:1682-1688 | compiler/src/dotty/tools/dotc/transform/init/Semantic.scala:1322-1329 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/src/dotty/tools/dotc/transform/init/Objects.scala:1682\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/init/Objects.scala"},"region":{"startLine":1682}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff91c59210e16ff6b55998ba5ee845ce068d4ae5600354079ba69e99b07194b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/src/dotty/tools/dotc/util/EqHashSet.scala:73-80 | compiler/src/dotty/tools/dotc/util/GenericHashSet.scala:101-108 \u2014 before extracting anything, compare \u0060compiler/src/dotty/tools/dotc/util/EqHashSet.scala\u0060 and \u0060compiler/src/dotty/tools/dotc/util/GenericHashSet.scala\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 40 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/util/EqHashSet.scala"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d63f42c6133544436e0b3fa47e6b236c399c04912144111e671331756ebbcde"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/src/dotty/tools/dotc/util/EqHashSet.scala:94-101 | compiler/src/dotty/tools/dotc/util/GenericHashSet.scala:152-159 \u2014 before extracting anything, compare \u0060compiler/src/dotty/tools/dotc/util/EqHashSet.scala\u0060 and \u0060compiler/src/dotty/tools/dotc/util/GenericHashSet.scala\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 40 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/util/EqHashSet.scala"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"71801a359e75788af2174f647f51bc44c30129c0d6fc3fc95df7fbed116c5380"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): scaladoc/src/scala/tasty/inspector/TastyInspector.scala:47-54 | tasty-inspector/src/scala/tasty/inspector/TastyInspector.scala:50-57 \u2014 before extracting anything, compare \u0060scaladoc/src/scala/tasty/inspector/TastyInspector.scala\u0060 and \u0060tasty-inspector/src/scala/tasty/inspector/TastyInspector.scala\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 58 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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":"scaladoc/src/scala/tasty/inspector/TastyInspector.scala"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"d74a5d0ef6545f1ffeed8fdcef2f47dbd8f6dd1b8877c8b529e7e6754e28078b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): library/src/scala/jdk/AnyAccumulator.scala:221-227 | library/src/scala/jdk/DoubleAccumulator.scala:283-289 | library/src/scala/jdk/IntAccumulator.scala:289-295 | library/src/scala/jdk/LongAccumulator.scala:284-290 \u2014 before extracting anything, compare \u0060library/src/scala/jdk/AnyAccumulator.scala\u0060 and \u0060library/src/scala/jdk/DoubleAccumulator.scala\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/src/scala/jdk/AnyAccumulator.scala:221\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/jdk/AnyAccumulator.scala"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"97bbf5ad8fc427ff287161280b2daf68e03d350309a4c12de829d49bf0f8c28c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): compiler/src/dotty/tools/dotc/parsing/JavaScanners.scala:69-75 | compiler/src/dotty/tools/dotc/parsing/JavaScanners.scala:379-385 | compiler/src/dotty/tools/dotc/parsing/Scanners.scala:1137-1143 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/src/dotty/tools/dotc/parsing/JavaScanners.scala:69\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/parsing/JavaScanners.scala"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"312c030e71b282480589e5ef2951cc01114b8786704e4502d2db0b547da6eb1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler/src/dotty/tools/dotc/core/Types.scala:3562-3568 | compiler/src/dotty/tools/dotc/core/Types.scala:3711-3717 \u2014 both copies are in the same file, so extract the block 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 \u0060compiler/src/dotty/tools/dotc/core/Types.scala:3562\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":"compiler/src/dotty/tools/dotc/core/Types.scala"},"region":{"startLine":3562}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9a66feccdcb61a4e7448370db325fe1926cdb6d4140575814922f66e9d2ca4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler/src/dotty/tools/dotc/transform/init/Objects.scala:1619-1625 | compiler/src/dotty/tools/dotc/transform/init/Semantic.scala:1267-1273 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/src/dotty/tools/dotc/transform/init/Objects.scala:1619\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060klass\u0060 to \u0060ClassSymbol): Contextual[Value] = log(\u0022evaluating \u0022 \u002B expr.show \u002B \u0022\u0060 in one and \u0060ClassSymbol\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/init/Objects.scala"},"region":{"startLine":1619}}}],"partialFingerprints":{"codehealthFindingId/v1":"73d51a0c7a4485b096e0be6cfb4d53818450d32474779fcdff8548d342b18365"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler/src/dotty/tools/dotc/transform/localopt/FormatChecker.scala:231-237 | compiler/src/dotty/tools/dotc/transform/localopt/StringInterpolatorOpt.scala:117-123 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/src/dotty/tools/dotc/transform/localopt/FormatChecker.scala:231\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":"compiler/src/dotty/tools/dotc/transform/localopt/FormatChecker.scala"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab128266e89f3027aea4fb139851b363814ddfa2c45fb9df52885c6e01389ac6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): scaladoc/src/dotty/tools/scaladoc/tasty/comments/Preparser.scala:46-52 | scaladoc/src/dotty/tools/scaladoc/tasty/comments/Preparser.scala:65-71 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060scaladoc/src/dotty/tools/scaladoc/tasty/comments/Preparser.scala:46\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":"scaladoc/src/dotty/tools/scaladoc/tasty/comments/Preparser.scala"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d4cae51a1e9ecdbc278f7a3968190c782123c1b2b5c71a4ee1119f1e7ac5be1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): compiler/src/dotty/tools/dotc/parsing/JavaScanners.scala:70-75 | compiler/src/dotty/tools/dotc/parsing/JavaScanners.scala:380-385 | compiler/src/dotty/tools/dotc/parsing/Scanners.scala:886-891 | compiler/src/dotty/tools/dotc/parsing/Scanners.scala:1138-1143 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/src/dotty/tools/dotc/parsing/JavaScanners.scala:70\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/parsing/JavaScanners.scala"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"897de58e37a0ad98271e9d22a3a46330e16dccbcc416191460808eaea15b3004"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): library/src/scala/jdk/AnyAccumulator.scala:102-107 | library/src/scala/jdk/DoubleAccumulator.scala:101-106 | library/src/scala/jdk/IntAccumulator.scala:104-109 | library/src/scala/jdk/LongAccumulator.scala:102-107 \u2014 before extracting anything, compare \u0060library/src/scala/jdk/AnyAccumulator.scala\u0060 and \u0060library/src/scala/jdk/DoubleAccumulator.scala\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/src/scala/jdk/AnyAccumulator.scala:102\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":"library/src/scala/jdk/AnyAccumulator.scala"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d1c3f136212a138f4058432a29bfd6fdec1fbcf7b1c9f52974a11982fa270c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): library/src/scala/jdk/DoubleAccumulator.scala:153-158 | library/src/scala/jdk/IntAccumulator.scala:159-164 | library/src/scala/jdk/LongAccumulator.scala:154-159 \u2014 before extracting anything, compare \u0060library/src/scala/jdk/DoubleAccumulator.scala\u0060 and \u0060library/src/scala/jdk/IntAccumulator.scala\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 175 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/jdk/DoubleAccumulator.scala"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"17de7e1f64c3fe5f532cbf31cb977ae67de032c611edac7839d5cbf06dbebad4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/src/dotty/tools/backend/jvm/analysis/ProdConsAnalyzer.scala:370-375 | compiler/src/dotty/tools/backend/jvm/analysis/ProdConsAnalyzer.scala:389-394 \u2014 both copies are in the same file, so extract the block 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 \u0060compiler/src/dotty/tools/backend/jvm/analysis/ProdConsAnalyzer.scala:370\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":"compiler/src/dotty/tools/backend/jvm/analysis/ProdConsAnalyzer.scala"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"23d70f06c7b73da1b49a315078a15c1fe4e9771505b65e8967bd6de3ae676904"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler/src/dotty/tools/dotc/core/Periods.scala:177-183 | compiler/src/dotty/tools/dotc/core/Periods.scala:185-191 \u2014 both copies are in the same file, so extract the block 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":"compiler/src/dotty/tools/dotc/core/Periods.scala"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bea72a0e45cb7bb1bbd3954b22e3f5ada48213f013933e23ef859986c7aafdd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/src/dotty/tools/dotc/core/Types.scala:3514-3519 | compiler/src/dotty/tools/dotc/core/Types.scala:3604-3609 \u2014 both copies are in the same file, so extract the block 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 \u0060compiler/src/dotty/tools/dotc/core/Types.scala:3514\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":"compiler/src/dotty/tools/dotc/core/Types.scala"},"region":{"startLine":3514}}}],"partialFingerprints":{"codehealthFindingId/v1":"134ce53584bb7e35378ba2ed32f03b6fbe4e6783b40827b32c8648512f02bf46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/src/dotty/tools/dotc/interactive/Interactive.scala:203-208 | presentation-compiler/src/main/dotty/tools/pc/MetalsInteractive.scala:32-42 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/src/dotty/tools/dotc/interactive/Interactive.scala:203\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/interactive/Interactive.scala"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c895eaa6b21165f4ac1606a8241f57893df12fa49a6a0c4c8a3a2cd8546e820"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/src/dotty/tools/dotc/parsing/Parsers.scala:3834-3839 | compiler/src/dotty/tools/dotc/parsing/Parsers.scala:4105-4110 \u2014 both copies are in the same file, so extract the block 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 \u0060compiler/src/dotty/tools/dotc/parsing/Parsers.scala:3834\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":"compiler/src/dotty/tools/dotc/parsing/Parsers.scala"},"region":{"startLine":3834}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1fe958bcf5ccb3b076c049cbb6e05959a9e80f8ecf973b7c1073e04453648b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/src/dotty/tools/dotc/transform/init/Objects.scala:1667-1672 | compiler/src/dotty/tools/dotc/transform/init/Semantic.scala:1307-1312 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/src/dotty/tools/dotc/transform/init/Objects.scala:1667\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":"compiler/src/dotty/tools/dotc/transform/init/Objects.scala"},"region":{"startLine":1667}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2f49f433799895043a52784273f01c980d62873a980d3fd6b936ae8e203bc4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): presentation-compiler/src/main/dotty/tools/pc/AutoImportsProvider.scala:34-39 | presentation-compiler/src/main/dotty/tools/pc/ConvertToNamedArgumentsProvider.scala:26-31 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"presentation-compiler/src/main/dotty/tools/pc/AutoImportsProvider.scala"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b0e59a46867252ad73f69f332d21101383d4d512c4b5f7f84494f7595b35f0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): library/src/scala/jdk/DoubleAccumulator.scala:168-173 | library/src/scala/jdk/IntAccumulator.scala:174-179 | library/src/scala/jdk/LongAccumulator.scala:169-174 \u2014 before extracting anything, compare \u0060library/src/scala/jdk/DoubleAccumulator.scala\u0060 and \u0060library/src/scala/jdk/IntAccumulator.scala\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 175 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/jdk/DoubleAccumulator.scala"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b7b47a45b519f62f9bd714f69a4975a3a77d78b51ba97f9f4bb8fa025c5b387"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/src/dotty/tools/dotc/parsing/JavaScanners.scala:596-600 | compiler/src/dotty/tools/dotc/parsing/Scanners.scala:1495-1499 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/src/dotty/tools/dotc/parsing/JavaScanners.scala:596\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060compiler/src/dotty/tools/dotc/parsing/Scanners.scala:1494\u0060 calls \u0060checkNoTrailingSeparator\u0060 and \u0060compiler/src/dotty/tools/dotc/parsing/JavaScanners.scala:595\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/parsing/JavaScanners.scala"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"41072bdafb43224f6653067b15dc4fd82cad9361e83c3105698bd42b374fc46e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20135 lines \u00D7 3): compiler/src/dotty/tools/dotc/semanticdb/internal/SemanticdbInputStream.scala:609-613 | compiler/src/dotty/tools/dotc/semanticdb/internal/SemanticdbInputStream.scala:616-619 | compiler/src/dotty/tools/dotc/semanticdb/internal/SemanticdbInputStream.scala:623-627 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/src/dotty/tools/dotc/semanticdb/internal/SemanticdbInputStream.scala:609\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/semanticdb/internal/SemanticdbInputStream.scala"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"9def22147a07cf840bf09a411864a051e6d69366c7a17ad4f7180364ca14f966"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/src/dotty/tools/dotc/semanticdb/internal/SemanticdbOutputStream.scala:194-198 | compiler/src/dotty/tools/dotc/semanticdb/internal/SemanticdbOutputStream.scala:207-211 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/src/dotty/tools/dotc/semanticdb/internal/SemanticdbOutputStream.scala:194\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/semanticdb/internal/SemanticdbOutputStream.scala"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"46f6faf5fde3123c14eb333766739ec5c82b777cecb7b3c2fd29fa1b7bbe6439"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): library/src/scala/runtime/VarArgsBuilder.scala:15-19 | library/src/scala/runtime/VarArgsBuilder.scala:34-39 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/runtime/VarArgsBuilder.scala"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"d97f05b8e63dbcef48c1d55aa9c8789dfcfe7ec616253ae906013967b0a8ed82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (155 lines \u00D7 2): library-js/src/scala/Console.scala:136-294 | library/src/scala/Console.scala:134-288 \u2014 before extracting anything, compare \u0060library-js/src/scala/Console.scala\u0060 and \u0060library/src/scala/Console.scala\u0060 as WHOLE FILES: 83% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. 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":"library-js/src/scala/Console.scala"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac207bda2f028644ecb36b9e4903e1234819fe484a6036f65b3de0a26ea62f03"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (113 lines \u00D7 2): library-js/src/scala/concurrent/ExecutionContext.scala:104-216 | library/src/scala/concurrent/ExecutionContext.scala:103-283 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library-js/src/scala/concurrent/ExecutionContext.scala:104\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library-js/src/scala/concurrent/ExecutionContext.scala"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"674f87669cb0fe7ab1b4524ae15fd1e80639e48724d945d1824b1754ab59a30f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): bench-run/src/main/scala/tuples/Drop.scala:14-22 | bench-run/src/main/scala/tuples/Split.scala:14-22 | bench-run/src/main/scala/tuples/Take.scala:14-22 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench-run/src/main/scala/tuples/Drop.scala"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e7f5ae9e4ce9cba9b758a8eb80be112c32ed68976b603ed1571dd5cde858bc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/src/dotty/tools/dotc/util/EqHashMap.scala:37-44 | compiler/src/dotty/tools/dotc/util/GenericHashMap.scala:84-91 \u2014 before extracting anything, compare \u0060compiler/src/dotty/tools/dotc/util/EqHashMap.scala\u0060 and \u0060compiler/src/dotty/tools/dotc/util/GenericHashMap.scala\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 42 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/util/EqHashMap.scala"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa8d21031967e907804cd509c2b24bcfc44fafbffa58c9d865a29c131a43e07e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/src/dotty/tools/dotc/util/EqHashMap.scala:78-85 | compiler/src/dotty/tools/dotc/util/GenericHashMap.scala:154-161 \u2014 before extracting anything, compare \u0060compiler/src/dotty/tools/dotc/util/EqHashMap.scala\u0060 and \u0060compiler/src/dotty/tools/dotc/util/GenericHashMap.scala\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 42 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/util/EqHashMap.scala"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"20eb2a052987e92205c7357ef42ff9cddc2c4ae90e3c53af4f7a303a1fb50676"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/src/dotty/tools/dotc/util/EqHashSet.scala:43-50 | compiler/src/dotty/tools/dotc/util/GenericHashSet.scala:71-78 \u2014 before extracting anything, compare \u0060compiler/src/dotty/tools/dotc/util/EqHashSet.scala\u0060 and \u0060compiler/src/dotty/tools/dotc/util/GenericHashSet.scala\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 40 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/util/EqHashSet.scala"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f687d5a905f0bb5987c18941988dd66c4fe803760deea9bdf185fe1198482d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler/src/dotty/tools/dotc/util/EqHashSet.scala:85-91 | compiler/src/dotty/tools/dotc/util/GenericHashSet.scala:143-149 \u2014 before extracting anything, compare \u0060compiler/src/dotty/tools/dotc/util/EqHashSet.scala\u0060 and \u0060compiler/src/dotty/tools/dotc/util/GenericHashSet.scala\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 40 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/util/EqHashSet.scala"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"96e3ebbe8bb67eb88122e96030a9ea1cd1ce6362f8930302f12618109ae926ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/src/dotty/tools/dotc/util/NameTransformer.scala:22-26 | library/src/scala/reflect/NameTransformer.scala:40-44 \u2014 before extracting anything, compare \u0060compiler/src/dotty/tools/dotc/util/NameTransformer.scala\u0060 and \u0060library/src/scala/reflect/NameTransformer.scala\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 41 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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":"compiler/src/dotty/tools/dotc/util/NameTransformer.scala"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4e390a42c005387ab2f68ac5c1cb3267aadc47456d8f9da9ac245b64ce9b7cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): library-js/src/scala/collection/immutable/NumericRange.scala:121-129 | library/src/scala/collection/immutable/NumericRange.scala:125-133 \u2014 before extracting anything, compare \u0060library-js/src/scala/collection/immutable/NumericRange.scala\u0060 and \u0060library/src/scala/collection/immutable/NumericRange.scala\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 243 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library-js/src/scala/collection/immutable/NumericRange.scala"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"0874f07419844e06e2e0aa3089c6f9593b27f9bf4ee55b56218fefa8c283a96e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): library-js/src/scala/collection/immutable/NumericRange.scala:220-224 | library/src/scala/collection/immutable/NumericRange.scala:269-273 \u2014 before extracting anything, compare \u0060library-js/src/scala/collection/immutable/NumericRange.scala\u0060 and \u0060library/src/scala/collection/immutable/NumericRange.scala\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 243 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library-js/src/scala/collection/immutable/NumericRange.scala"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0fb935c8bb86a00f56b1e196d14f2cb9c9ad5a7c6a15feb41cfc20eb5bd7e6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): library-js/src/scala/collection/immutable/NumericRange.scala:226-230 | library/src/scala/collection/immutable/NumericRange.scala:275-279 \u2014 before extracting anything, compare \u0060library-js/src/scala/collection/immutable/NumericRange.scala\u0060 and \u0060library/src/scala/collection/immutable/NumericRange.scala\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 243 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library-js/src/scala/collection/immutable/NumericRange.scala"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e627366fd675bb53732e01a0a6e542f22c60d6ca2ae71096b31f0a023719797"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): library-js/src/scala/collection/immutable/NumericRange.scala:235-241 | library/src/scala/collection/immutable/NumericRange.scala:284-290 \u2014 before extracting anything, compare \u0060library-js/src/scala/collection/immutable/NumericRange.scala\u0060 and \u0060library/src/scala/collection/immutable/NumericRange.scala\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 243 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library-js/src/scala/collection/immutable/NumericRange.scala"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"09197c77ee738ede4d77f1ec384703349087831f43ca278e740e43addd06704e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): library-js/src/scala/collection/immutable/NumericRange.scala:330-335 | library/src/scala/collection/immutable/NumericRange.scala:387-392 \u2014 before extracting anything, compare \u0060library-js/src/scala/collection/immutable/NumericRange.scala\u0060 and \u0060library/src/scala/collection/immutable/NumericRange.scala\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 243 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library-js/src/scala/collection/immutable/NumericRange.scala"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e5cb5015c6048e2b36247485bda87185481bcc9a7c3242937c76052b0befef2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): library-js/src/scala/collection/immutable/NumericRange.scala:507-513 | library/src/scala/collection/immutable/NumericRange.scala:566-572 \u2014 before extracting anything, compare \u0060library-js/src/scala/collection/immutable/NumericRange.scala\u0060 and \u0060library/src/scala/collection/immutable/NumericRange.scala\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 243 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library-js/src/scala/collection/immutable/NumericRange.scala"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3b6d366e6ba0568ef9a905b41e2b67b7fff87807e109cdbf2b220c9c747be68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): library/src/scala/collection/convert/impl/ChampStepper.scala:47-52 | library/src/scala/collection/immutable/ChampCommon.scala:126-131 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/collection/convert/impl/ChampStepper.scala"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"86a419cf541d00ecfdabeb3814f015c7e04293c9e2c116de9a4191a9469cd914"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): library/src/scala/collection/convert/impl/ChampStepper.scala:64-74 | library/src/scala/collection/immutable/ChampCommon.scala:145-155 \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":"library/src/scala/collection/convert/impl/ChampStepper.scala"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"a04bb8c3632130d61d9d35791e9cbf7049fd976deeefe9768afbbfc40e603b82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): library/src/scala/collection/convert/impl/InOrderStepperBase.scala:49-57 | library/src/scala/collection/convert/impl/IndexedStepperBase.scala:38-46 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/collection/convert/impl/InOrderStepperBase.scala"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"94908be836eb1578798fb846600b12527bb96f87ddba48b91bc2f31402bd6ec9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): library/src/scala/collection/mutable/IndexedSeq.scala:41-46 | library/src/scala/collection/mutable/Seq.scala:64-69 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/collection/mutable/IndexedSeq.scala"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa2ae09c5a163b4b7acb004205ddb0b14fb7315a4f3fd8d536005152114eb65a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 7): library/src/scala/jdk/AnyAccumulator.scala:174-180 | library/src/scala/jdk/DoubleAccumulator.scala:239-245 | library/src/scala/jdk/DoubleAccumulator.scala:247-253 | library/src/scala/jdk/IntAccumulator.scala:245-251 | library/src/scala/jdk/IntAccumulator.scala:253-259 | library/src/scala/jdk/LongAccumulator.scala:240-246 | library/src/scala/jdk/LongAccumulator.scala:248-254 \u2014 before extracting anything, compare \u0060library/src/scala/jdk/AnyAccumulator.scala\u0060 and \u0060library/src/scala/jdk/DoubleAccumulator.scala\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/jdk/AnyAccumulator.scala"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"08aa0ef55a9a8dac2cb8cd302469cad3a8a231de1562fa7e671d92ef5def677c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): library/src/scala/jdk/AnyAccumulator.scala:346-351 | library/src/scala/jdk/DoubleAccumulator.scala:404-409 | library/src/scala/jdk/IntAccumulator.scala:410-415 | library/src/scala/jdk/LongAccumulator.scala:405-410 \u2014 before extracting anything, compare \u0060library/src/scala/jdk/AnyAccumulator.scala\u0060 and \u0060library/src/scala/jdk/DoubleAccumulator.scala\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/jdk/AnyAccumulator.scala"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e55c64332e47f7fd966a876f3bdf1a6d85fb418574dd2103a8df444dcfdffdf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): library/src/scala/jdk/DoubleAccumulator.scala:70-76 | library/src/scala/jdk/IntAccumulator.scala:73-79 | library/src/scala/jdk/LongAccumulator.scala:71-77 \u2014 before extracting anything, compare \u0060library/src/scala/jdk/DoubleAccumulator.scala\u0060 and \u0060library/src/scala/jdk/IntAccumulator.scala\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 175 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/jdk/DoubleAccumulator.scala"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ee90b2d3ca02d83563f2c0c3637173cfd019adbb7fadd0c05aed2e6fe2f166e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): library/src/scala/jdk/DoubleAccumulator.scala:185-191 | library/src/scala/jdk/IntAccumulator.scala:191-197 | library/src/scala/jdk/LongAccumulator.scala:186-192 \u2014 before extracting anything, compare \u0060library/src/scala/jdk/DoubleAccumulator.scala\u0060 and \u0060library/src/scala/jdk/IntAccumulator.scala\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 175 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/jdk/DoubleAccumulator.scala"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f99602c257b69d85e47acac6c83f4f05df5b16129fbfd5c6d9b5c0e838c0532"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): library/src/scala/jdk/DoubleAccumulator.scala:193-199 | library/src/scala/jdk/IntAccumulator.scala:199-205 | library/src/scala/jdk/LongAccumulator.scala:194-200 \u2014 before extracting anything, compare \u0060library/src/scala/jdk/DoubleAccumulator.scala\u0060 and \u0060library/src/scala/jdk/IntAccumulator.scala\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 175 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/jdk/DoubleAccumulator.scala"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"850d4d02a00ec96994f741dfa77923f8889184a5d1e995df642bbd2a7ff50c53"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): library/src/scala/jdk/DoubleAccumulator.scala:201-209 | library/src/scala/jdk/IntAccumulator.scala:207-215 | library/src/scala/jdk/LongAccumulator.scala:202-210 \u2014 before extracting anything, compare \u0060library/src/scala/jdk/DoubleAccumulator.scala\u0060 and \u0060library/src/scala/jdk/IntAccumulator.scala\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 175 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/jdk/DoubleAccumulator.scala"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"b55b45f96c35b306e513e8b8923dae8bc06eb784f120f8fd0fc2c28e1518f3a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): library/src/scala/jdk/DoubleAccumulator.scala:211-219 | library/src/scala/jdk/IntAccumulator.scala:217-225 | library/src/scala/jdk/LongAccumulator.scala:212-220 \u2014 before extracting anything, compare \u0060library/src/scala/jdk/DoubleAccumulator.scala\u0060 and \u0060library/src/scala/jdk/IntAccumulator.scala\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 175 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/jdk/DoubleAccumulator.scala"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"9263d876a626d96ab3c2b46586817d81f67f0575a1df228c72de5227826aeba4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): library/src/scala/jdk/DoubleAccumulator.scala:418-425 | library/src/scala/jdk/LongAccumulator.scala:419-426 \u2014 before extracting anything, compare \u0060library/src/scala/jdk/DoubleAccumulator.scala\u0060 and \u0060library/src/scala/jdk/LongAccumulator.scala\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 189 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/jdk/DoubleAccumulator.scala"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"da4edb8794f2bfd9c90942a315699e1f3b5c7cb75a2f53bf9fe5e0661106b602"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): presentation-compiler/src/main/dotty/tools/pc/RawScalaPresentationCompiler.scala:55-63 | presentation-compiler/src/main/dotty/tools/pc/ScalaPresentationCompiler.scala:67-75 \u2014 before extracting anything, compare \u0060presentation-compiler/src/main/dotty/tools/pc/RawScalaPresentationCompiler.scala\u0060 and \u0060presentation-compiler/src/main/dotty/tools/pc/ScalaPresentationCompiler.scala\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060presentation-compiler/src/main/dotty/tools/pc/RawScalaPresentationCompiler.scala:51\u0060 calls \u0060this\u0060 and \u0060presentation-compiler/src/main/dotty/tools/pc/ScalaPresentationCompiler.scala:63\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"presentation-compiler/src/main/dotty/tools/pc/RawScalaPresentationCompiler.scala"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"3245be817391ae03a83b3e31c64444c9dd247c62aee1d8062f151b3737e8a380"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): presentation-compiler/src/main/dotty/tools/pc/RawScalaPresentationCompiler.scala:128-132 | presentation-compiler/src/main/dotty/tools/pc/ScalaPresentationCompiler.scala:165-169 \u2014 before extracting anything, compare \u0060presentation-compiler/src/main/dotty/tools/pc/RawScalaPresentationCompiler.scala\u0060 and \u0060presentation-compiler/src/main/dotty/tools/pc/ScalaPresentationCompiler.scala\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"presentation-compiler/src/main/dotty/tools/pc/RawScalaPresentationCompiler.scala"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8907d5d2c91b60d801e07ebaf6e8b10dbc59e028b7ea91f1b07820263509d88"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): scaladoc/src/scala/tasty/inspector/TastyInspector.scala:144-148 | tasty-inspector/src/scala/tasty/inspector/TastyInspector.scala:115-119 \u2014 before extracting anything, compare \u0060scaladoc/src/scala/tasty/inspector/TastyInspector.scala\u0060 and \u0060tasty-inspector/src/scala/tasty/inspector/TastyInspector.scala\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 58 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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":"scaladoc/src/scala/tasty/inspector/TastyInspector.scala"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"83b4993b2691c1ce62534d70fbb90369da1fec566eae58b8657fd7209995bcb4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/src/dotty/tools/backend/jvm/opt/OptimizerKnownBTypes.scala:74-79 | compiler/src/dotty/tools/backend/jvm/opt/OptimizerKnownBTypes.scala:134-139 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/src/dotty/tools/backend/jvm/opt/OptimizerKnownBTypes.scala:74\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":"compiler/src/dotty/tools/backend/jvm/opt/OptimizerKnownBTypes.scala"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"2da5fc2b3da0a16832297089397d04d3a39fa114a51f3620cb09540c58690d15"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/src/dotty/tools/dotc/core/Symbols.scala:650-654 | compiler/src/dotty/tools/dotc/core/Symbols.scala:753-757 \u2014 both copies are in the same file, so extract the block 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 \u0060compiler/src/dotty/tools/dotc/core/Symbols.scala:650\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":"compiler/src/dotty/tools/dotc/core/Symbols.scala"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"4768fa78442a5776cfcb60d2f1161f031a31678a6ed7603c6a8e9fe108988bb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler/src/dotty/tools/dotc/util/NameTransformer.scala:108-113 | library/src/scala/reflect/NameTransformer.scala:136-141 \u2014 before extracting anything, compare \u0060compiler/src/dotty/tools/dotc/util/NameTransformer.scala\u0060 and \u0060library/src/scala/reflect/NameTransformer.scala\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 41 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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 \u0060compiler/src/dotty/tools/dotc/util/NameTransformer.scala:108\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":"compiler/src/dotty/tools/dotc/util/NameTransformer.scala"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c0672762417fdf570d6db550f64bee79fd942cec7afed5df4b3e9ded3c4cfea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): library-js/src/scala/collection/immutable/NumericRange.scala:60-64 | library/src/scala/collection/immutable/NumericRange.scala:63-67 \u2014 before extracting anything, compare \u0060library-js/src/scala/collection/immutable/NumericRange.scala\u0060 and \u0060library/src/scala/collection/immutable/NumericRange.scala\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 243 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library-js/src/scala/collection/immutable/NumericRange.scala:60\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library-js/src/scala/collection/immutable/NumericRange.scala"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b920705cb0f8e71b2a6ecba63d3b1718127bff306e751baf0d790bbde3afc80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): library/src/scala/jdk/DoubleAccumulator.scala:50-55 | library/src/scala/jdk/LongAccumulator.scala:51-56 \u2014 before extracting anything, compare \u0060library/src/scala/jdk/DoubleAccumulator.scala\u0060 and \u0060library/src/scala/jdk/LongAccumulator.scala\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 189 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/jdk/DoubleAccumulator.scala"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"58d408cda2a11c0aa850a419a1c0cf53219841213cd1505018497d5c135669c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): library/src/scala/runtime/BoxesRunTime.java:454-461 | library/src/scala/runtime/BoxesRunTime.java:474-481 | library/src/scala/runtime/BoxesRunTime.java:494-501 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/src/scala/runtime/BoxesRunTime.java:454\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":"library/src/scala/runtime/BoxesRunTime.java"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aaf5b3ab2a7c18af72e72c69e1e5f5f3b7857ea0afc4f7f5d16cae081f4fd6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): library/src/scala/runtime/BoxesRunTime.java:554-559 | library/src/scala/runtime/BoxesRunTime.java:581-586 | library/src/scala/runtime/BoxesRunTime.java:608-613 | library/src/scala/runtime/BoxesRunTime.java:635-640 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060library/src/scala/runtime/BoxesRunTime.java:554\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":"library/src/scala/runtime/BoxesRunTime.java"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"2695b7229d1c4185cb6d4cffb4aae6a7f9e581eb3d62236a0dbfb41be4e2f199"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Checker (LCOM4 13): Checker\u0027s methods fall into 13 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 13 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":"compiler/src/dotty/tools/dotc/transform/TreeChecker.scala"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"5599a3a7e4397425f498e2272796043d9c77a8357431fd10bab22d94c3b059d2"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: SingleDenotation (LCOM4 10): SingleDenotation\u0027s methods fall into 10 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 10 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":"compiler/src/dotty/tools/dotc/core/Denotations.scala"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"f08af39d6ec534ff3924b73e0697818b75ca26b8d184f5401643c30ac616bf0f"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ClassDenotation (LCOM4 10): ClassDenotation\u0027s methods fall into 10 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 10 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":"compiler/src/dotty/tools/dotc/core/SymDenotations.scala"},"region":{"startLine":1927}}}],"partialFingerprints":{"codehealthFindingId/v1":"b72f330b83cca1e9aced066a6741d5af1eacc272d7cb917268e9ca92bbbef983"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: DoubleAccumulator (LCOM4 10): DoubleAccumulator\u0027s methods fall into 10 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 10 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":"library/src/scala/jdk/DoubleAccumulator.scala"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc47eee56ba746e804a4ababada96c178df90ea38b0773fdceee46c0af79ef6b"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: IntAccumulator (LCOM4 10): IntAccumulator\u0027s methods fall into 10 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 10 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":"library/src/scala/jdk/IntAccumulator.scala"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"7541b4a27053a1443ec4d46d9cc864a23f6ac120ccea3d874c7598a300f893d0"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: LongAccumulator (LCOM4 10): LongAccumulator\u0027s methods fall into 10 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 10 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":"library/src/scala/jdk/LongAccumulator.scala"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"bea26c7af734355903f9cf751245d43e9165e76d2108814bb8785be21a0fd821"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: OptimizerKnownBTypes (LCOM4 7): OptimizerKnownBTypes\u0027s methods fall into 7 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 7 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":"compiler/src/dotty/tools/backend/jvm/opt/OptimizerKnownBTypes.scala"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5c12119d1e6cf66ee85c5a457ec61c386f5286805b3cdbf1295fcbc6ae7fdda"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Var (LCOM4 6): Var\u0027s methods fall into 6 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 6 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":"compiler/src/dotty/tools/dotc/cc/CaptureSet.scala"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8914afc74fd71fe6b3bbae044391945a3ce50b25f635488445ebf84ee2e818b"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: PackageClassDenotation (LCOM4 5): PackageClassDenotation\u0027s methods fall into 5 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 5 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":"compiler/src/dotty/tools/dotc/core/SymDenotations.scala"},"region":{"startLine":2632}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a9034eb5ac4972f58aff6f57ea1ba6cf5e068e8b17cdebd7e6c98494cb3dd2c"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Scanner (LCOM4 5): Scanner\u0027s methods fall into 5 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 5 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":"compiler/src/dotty/tools/dotc/parsing/Scanners.scala"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a5943ff74f0dfbe089087af70bc881bd05645c971d79601d96700f46fb369e3"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Region (LCOM4 5): Region\u0027s methods fall into 5 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 5 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":"compiler/src/dotty/tools/dotc/parsing/Scanners.scala"},"region":{"startLine":1643}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cdb5f7abd90952f1201aad6c30643dbc900a3ef49493eb76a06033d465c4403"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ExtractorsPrinter (LCOM4 5): ExtractorsPrinter\u0027s methods fall into 5 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 5 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":"compiler/src/scala/quoted/runtime/impl/printers/Extractors.scala"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"d809186728791d38f6d211ace373771c3993089d47e000210967960d70f55660"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: AnyAccumulator (LCOM4 5): AnyAccumulator\u0027s methods fall into 5 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 5 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":"library/src/scala/jdk/AnyAccumulator.scala"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"91f6079ac27d9f1f8f31b5c03c8a39b21215e793f96163115a37ffda2898e295"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Tuple2Zipped (LCOM4 5): Tuple2Zipped\u0027s methods fall into 5 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 5 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":"library/src/scala/runtime/Tuple2Zipped.scala"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"af734cbf6de4a26aa9deb182678475eb8bd117685985538206f91f68963d8812"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Tuple3Zipped (LCOM4 5): Tuple3Zipped\u0027s methods fall into 5 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 5 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":"library/src/scala/runtime/Tuple3Zipped.scala"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d315cac8b764d192fb622dee6bcef1c71a175252f4b4779bfe0d4c437cad63c"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: CopyProp (LCOM4 4): CopyProp\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":"compiler/src/dotty/tools/backend/jvm/opt/CopyProp.scala"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1953adff9a5abe2c6bf89b5aeb9d2f899ea55ed0a64b2279b606c90cc8fdfa5"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: InsertExpression (LCOM4 4): InsertExpression\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":"compiler/src/dotty/tools/debug/InsertExpression.scala"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"303baaf93b0a62cba01724645425a359a46833a81611e911ac7dbee7c4c288b7"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: CompilationUnit (LCOM4 4): CompilationUnit\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":"compiler/src/dotty/tools/dotc/CompilationUnit.scala"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7fdbb5fad467a4ab8e23a054c992cbe0ac864c61100f3396b23149738671e08"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: CaptureChecker (LCOM4 4): CaptureChecker\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":"compiler/src/dotty/tools/dotc/cc/CheckCaptures.scala"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b0dfd912bac59e10021e833b1af0820658a0bbe4318d1490b3889d737971a3a"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: NamedType (LCOM4 4): NamedType\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":"compiler/src/dotty/tools/dotc/core/Types.scala"},"region":{"startLine":2330}}}],"partialFingerprints":{"codehealthFindingId/v1":"87ced813a3a20aaa6f2f8205713ad5f095a8cadeb063f0060cc7725c418be836"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: TreeBuffer (LCOM4 4): TreeBuffer\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":"compiler/src/dotty/tools/dotc/core/tasty/TreeBuffer.scala"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c495691be81b188b8b66884173203d79dca85157bdb03816f7b8fbeff7664d"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Reporter (LCOM4 4): Reporter\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":"compiler/src/dotty/tools/dotc/reporting/Reporter.scala"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eb4d49cb70bb2276a719bf5d7533067656af6fd1a2d7ec4962b194011f08fac"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ForwardDepChecks (LCOM4 4): ForwardDepChecks\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":"compiler/src/dotty/tools/dotc/transform/ForwardDepChecks.scala"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bd18a69120ff3e3b2d61d83a58ff6f412b05748fd278fdbbe870a20c9a043d4"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: PostTyper (LCOM4 4): PostTyper\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":"compiler/src/dotty/tools/dotc/transform/PostTyper.scala"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3756a38479dec028c3d5fed2b26c08a832c14bd536b43ffb68ae91ce947eb69"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Synthesizer (LCOM4 4): Synthesizer\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":"compiler/src/dotty/tools/dotc/typer/Synthesizer.scala"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"118b6651bb765c5b7f066ba3de902bf741bfba3e8cec0352fbb43db7b1f40368"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: SimpleIdentitySet (LCOM4 4): SimpleIdentitySet\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":"compiler/src/dotty/tools/dotc/util/SimpleIdentitySet.scala"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ee05239f28ae2132d24f83e249950c8bc354d6afb015746fb2e60e94339cf20"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: QuotesImpl (LCOM4 4): QuotesImpl\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":"compiler/src/scala/quoted/runtime/impl/QuotesImpl.scala"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab9c500d017f88effb06f38e78daacc0c36e1a59e6440b535ccd8c128af0ff96"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Regex (LCOM4 4): Regex\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":"library/src/scala/util/matching/Regex.scala"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3cd48dabef8c5f4a53a67f2ca4ac02963bd4b827b462da478a3a11b71382204"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Renderer (LCOM4 4): Renderer\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":"scaladoc/src/dotty/tools/scaladoc/renderers/Renderer.scala"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"d77ee231faa6bacd0ad99f58a0160b50e4ceac68cae7665da7cdc666cf8913ae"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/src/dotty/tools/dotc/core/TypeComparer.scala: compiler/src/dotty/tools/dotc/core/TypeComparer.scala changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 421 in TypeComparer.recur at line 290. 4 of those changes were fix/bug commits, and the other 13 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:38:06 \u002B00:00\u0027 --until=\u00272026-11-13 15:38:06 \u002B00:00\u0027 --full-history --no-merges -- compiler/src/dotty/tools/dotc/core/TypeComparer.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":"compiler/src/dotty/tools/dotc/core/TypeComparer.scala"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f3a7ca3b19bf1678e89f3ab350d0cd49c037bab764faa9eae11e72806d61bd5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/src/dotty/tools/dotc/typer/Typer.scala: compiler/src/dotty/tools/dotc/typer/Typer.scala changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 188 in Typer.adapt1 at line 4580. 2 of those changes were fix/bug commits, and the other 12 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:38:06 \u002B00:00\u0027 --until=\u00272026-11-13 15:38:06 \u002B00:00\u0027 --full-history --no-merges -- compiler/src/dotty/tools/dotc/typer/Typer.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":"compiler/src/dotty/tools/dotc/typer/Typer.scala"},"region":{"startLine":4580}}}],"partialFingerprints":{"codehealthFindingId/v1":"384f1154cd32b4d2275852a6b837bfc52d9eb82b006ce3bec1bd4fb11b7cc318"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/src/dotty/tools/dotc/typer/RefChecks.scala: compiler/src/dotty/tools/dotc/typer/RefChecks.scala changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 187 in RefChecks.checkAllOverrides at line 353. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:38:06 \u002B00:00\u0027 --until=\u00272026-11-13 15:38:06 \u002B00:00\u0027 --full-history --no-merges -- compiler/src/dotty/tools/dotc/typer/RefChecks.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":"compiler/src/dotty/tools/dotc/typer/RefChecks.scala"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"77ebc4c998dd358a6a31b8d5519c3954519dc47c56af231d3345c0a7cde6dff1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/src/dotty/tools/dotc/transform/CheckUnused.scala: compiler/src/dotty/tools/dotc/transform/CheckUnused.scala changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 124 in CheckUnused.warnings at line 649. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:38:06 \u002B00:00\u0027 --until=\u00272026-11-13 15:38:06 \u002B00:00\u0027 --full-history --no-merges -- compiler/src/dotty/tools/dotc/transform/CheckUnused.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":"compiler/src/dotty/tools/dotc/transform/CheckUnused.scala"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc04c787c018f0b6ec4d41b6d548ecbf4ed5dd9fd21d855a2c046519167f1570"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/src/dotty/tools/dotc/core/tasty/TreeUnpickler.scala: compiler/src/dotty/tools/dotc/core/tasty/TreeUnpickler.scala changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 102 in TreeReader.readTree at line 1326. 1 of those changes was a fix/bug commit, and the other 8 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:38:06 \u002B00:00\u0027 --until=\u00272026-11-13 15:38:06 \u002B00:00\u0027 --full-history --no-merges -- compiler/src/dotty/tools/dotc/core/tasty/TreeUnpickler.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":"compiler/src/dotty/tools/dotc/core/tasty/TreeUnpickler.scala"},"region":{"startLine":1326}}}],"partialFingerprints":{"codehealthFindingId/v1":"9418f827ca90c1546ad1392e222db168fae0a88e2f404aa8fa3d23699588ac1b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: repl/src/dotty/tools/repl/ReplDriver.scala: repl/src/dotty/tools/repl/ReplDriver.scala changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 51 in ReplDriver.interpretCommand at line 678. 4 of those changes were fix/bug commits, and the other 12 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:38:06 \u002B00:00\u0027 --until=\u00272026-11-13 15:38:06 \u002B00:00\u0027 --full-history --no-merges -- repl/src/dotty/tools/repl/ReplDriver.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":"repl/src/dotty/tools/repl/ReplDriver.scala"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe23a8b4349a382eb0206ed7c3beffe1d4e0bdce05b9578ec5aaae516d5d0b6e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/src/dotty/tools/dotc/typer/Namer.scala: compiler/src/dotty/tools/dotc/typer/Namer.scala changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 84 in ClassCompleter.exportForwarders at line 1252. 2 of those changes were fix/bug commits, and the other 6 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:38:06 \u002B00:00\u0027 --until=\u00272026-11-13 15:38:06 \u002B00:00\u0027 --full-history --no-merges -- compiler/src/dotty/tools/dotc/typer/Namer.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":"compiler/src/dotty/tools/dotc/typer/Namer.scala"},"region":{"startLine":1252}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d76c4a94a9eb612067bd72e6c9f8a3cdadb0fe2f5b1048b5f9cfe35e1b52a72"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/src/dotty/tools/dotc/core/TypeOps.scala: compiler/src/dotty/tools/dotc/core/TypeOps.scala changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in TypeOps.instantiateToSubType at line 794. 4 of those changes were fix/bug commits, and the other 10 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:38:06 \u002B00:00\u0027 --until=\u00272026-11-13 15:38:06 \u002B00:00\u0027 --full-history --no-merges -- compiler/src/dotty/tools/dotc/core/TypeOps.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":"compiler/src/dotty/tools/dotc/core/TypeOps.scala"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"05b2fcc7264d68447fe570ca70ef0752d8c723a14f56fede0beaee17e3b363b1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/src/dotty/tools/dotc/transform/PostTyper.scala: compiler/src/dotty/tools/dotc/transform/PostTyper.scala changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 67 in PostTyperTransformer.transform at line 559. 1 of those changes was a fix/bug commit, and the other 7 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:38:06 \u002B00:00\u0027 --until=\u00272026-11-13 15:38:06 \u002B00:00\u0027 --full-history --no-merges -- compiler/src/dotty/tools/dotc/transform/PostTyper.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":"compiler/src/dotty/tools/dotc/transform/PostTyper.scala"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffed66a2c5a9bc9f0319856ea83eb6b9106c8d17ddf90bc510c0c37670355ff3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/src/dotty/tools/dotc/core/tasty/TreePickler.scala: compiler/src/dotty/tools/dotc/core/tasty/TreePickler.scala changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 105 in TreePickler.pickleTree at line 419. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:38:06 \u002B00:00\u0027 --until=\u00272026-11-13 15:38:06 \u002B00:00\u0027 --full-history --no-merges -- compiler/src/dotty/tools/dotc/core/tasty/TreePickler.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":"compiler/src/dotty/tools/dotc/core/tasty/TreePickler.scala"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"67847c7eb29c71c9d185e4df22affee10bc6bdc446d002ed08fdd311c00f4623"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scaladoc/src/dotty/tools/scaladoc/tasty/TypesSupport.scala: scaladoc/src/dotty/tools/scaladoc/tasty/TypesSupport.scala changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 104 in TypesSupport.inner at line 117. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:38:06 \u002B00:00\u0027 --until=\u00272026-11-13 15:38:06 \u002B00:00\u0027 --full-history --no-merges -- scaladoc/src/dotty/tools/scaladoc/tasty/TypesSupport.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":"scaladoc/src/dotty/tools/scaladoc/tasty/TypesSupport.scala"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6f1a7982e35c8364bf7dad402801c057906ac4945cebcb1087324720c831e83"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/src/dotty/tools/dotc/core/TypeErasure.scala: compiler/src/dotty/tools/dotc/core/TypeErasure.scala changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 68 in TypeErasure.apply at line 784. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:38:06 \u002B00:00\u0027 --until=\u00272026-11-13 15:38:06 \u002B00:00\u0027 --full-history --no-merges -- compiler/src/dotty/tools/dotc/core/TypeErasure.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":"compiler/src/dotty/tools/dotc/core/TypeErasure.scala"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1022cf2e952695af5c24318592e4e45c7811eae03b3e764ee743a6c1f2c030c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/src/dotty/tools/dotc/inlines/Inliner.scala: compiler/src/dotty/tools/dotc/inlines/Inliner.scala changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in Inliner.dropUnusedDefs at line 1306. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:38:06 \u002B00:00\u0027 --until=\u00272026-11-13 15:38:06 \u002B00:00\u0027 --full-history --no-merges -- compiler/src/dotty/tools/dotc/inlines/Inliner.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":"compiler/src/dotty/tools/dotc/inlines/Inliner.scala"},"region":{"startLine":1306}}}],"partialFingerprints":{"codehealthFindingId/v1":"14d17b63d175b59b3a65671db07809d62ea159e004b0625de112ff7b179d27ff"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/src/dotty/tools/dotc/core/classfile/ClassfileParser.scala: compiler/src/dotty/tools/dotc/core/classfile/ClassfileParser.scala changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in ClassfileParser.parseAttributes at line 1038. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:38:06 \u002B00:00\u0027 --until=\u00272026-11-13 15:38:06 \u002B00:00\u0027 --full-history --no-merges -- compiler/src/dotty/tools/dotc/core/classfile/ClassfileParser.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":"compiler/src/dotty/tools/dotc/core/classfile/ClassfileParser.scala"},"region":{"startLine":1038}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d94ef5f4db7f4d7293831d839847a776447d45f7de95c48c4e7fcce13ee32e5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/src/dotty/tools/backend/jvm/opt/LocalOptimizer.scala: compiler/src/dotty/tools/backend/jvm/opt/LocalOptimizer.scala changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 57 in LocalOptimizer.nullnessOptimizations at line 390. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:38:06 \u002B00:00\u0027 --until=\u00272026-11-13 15:38:06 \u002B00:00\u0027 --full-history --no-merges -- compiler/src/dotty/tools/backend/jvm/opt/LocalOptimizer.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":"compiler/src/dotty/tools/backend/jvm/opt/LocalOptimizer.scala"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f1c15264c200cf580af7847985149c7868d2236314adbf2d7e8b7874ba2d97f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/src/dotty/tools/dotc/cc/CheckCaptures.scala: compiler/src/dotty/tools/dotc/cc/CheckCaptures.scala changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in CaptureChecker.adaptBoxed at line 2007. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:38:06 \u002B00:00\u0027 --until=\u00272026-11-13 15:38:06 \u002B00:00\u0027 --full-history --no-merges -- compiler/src/dotty/tools/dotc/cc/CheckCaptures.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":"compiler/src/dotty/tools/dotc/cc/CheckCaptures.scala"},"region":{"startLine":2007}}}],"partialFingerprints":{"codehealthFindingId/v1":"86987ec2eb0421399e6435a57362f5199f63d04cb28d65fae5047809a7243af9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/src/dotty/tools/backend/jvm/opt/CopyProp.scala: compiler/src/dotty/tools/backend/jvm/opt/CopyProp.scala changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 55 in CopyProp.eliminatePushPop at line 300. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:38:06 \u002B00:00\u0027 --until=\u00272026-11-13 15:38:06 \u002B00:00\u0027 --full-history --no-merges -- compiler/src/dotty/tools/backend/jvm/opt/CopyProp.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":"compiler/src/dotty/tools/backend/jvm/opt/CopyProp.scala"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce652eca9be5b1f2c61c163fea83b11786b0deaa7d5d22bb523d743aa63345f9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/src/dotty/tools/dotc/transform/Erasure.scala: compiler/src/dotty/tools/dotc/transform/Erasure.scala changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in Typer.typedSelect at line 654. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:38:06 \u002B00:00\u0027 --until=\u00272026-11-13 15:38:06 \u002B00:00\u0027 --full-history --no-merges -- compiler/src/dotty/tools/dotc/transform/Erasure.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":"compiler/src/dotty/tools/dotc/transform/Erasure.scala"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2e33518e7e6eaedab0139e5f700555e7facfdfd4f912ae8d77b6a40d7a82068"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/src/dotty/tools/dotc/core/Types.scala: compiler/src/dotty/tools/dotc/core/Types.scala changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in MatchType.reduced at line 5196. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:38:06 \u002B00:00\u0027 --until=\u00272026-11-13 15:38:06 \u002B00:00\u0027 --full-history --no-merges -- compiler/src/dotty/tools/dotc/core/Types.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":"compiler/src/dotty/tools/dotc/core/Types.scala"},"region":{"startLine":5196}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ebb1c72483f7615a57b7bef1000daa86f354c9a33e9a0c2cbafd38884bdcdc8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/src/dotty/tools/backend/jvm/BCodeBodyBuilder.scala: compiler/src/dotty/tools/backend/jvm/BCodeBodyBuilder.scala changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in PlainBodyBuilder.genApply at line 765. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:38:06 \u002B00:00\u0027 --until=\u00272026-11-13 15:38:06 \u002B00:00\u0027 --full-history --no-merges -- compiler/src/dotty/tools/backend/jvm/BCodeBodyBuilder.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":"compiler/src/dotty/tools/backend/jvm/BCodeBodyBuilder.scala"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b377dd44a40dae96b217c53da91733befdde2403135e67f2738b3cf6ea8ce74"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/src/dotty/tools/backend/jvm/opt/Inliner.scala: compiler/src/dotty/tools/backend/jvm/opt/Inliner.scala changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 57 in GlobalOptimizer.inlineCallsite at line 384. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:38:06 \u002B00:00\u0027 --until=\u00272026-11-13 15:38:06 \u002B00:00\u0027 --full-history --no-merges -- compiler/src/dotty/tools/backend/jvm/opt/Inliner.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":"compiler/src/dotty/tools/backend/jvm/opt/Inliner.scala"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"af62b458ea607a90884100c139da1520ef5a0bbe0e742173d66ad60cd2899c7a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/src/dotty/tools/backend/jvm/GenericSignatures.scala: compiler/src/dotty/tools/backend/jvm/GenericSignatures.scala changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 83 in GenericSignatures.javaSig0 at line 56. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:38:06 \u002B00:00\u0027 --until=\u00272026-11-13 15:38:06 \u002B00:00\u0027 --full-history --no-merges -- compiler/src/dotty/tools/backend/jvm/GenericSignatures.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":"compiler/src/dotty/tools/backend/jvm/GenericSignatures.scala"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"73b350ac64c52f2b12c61c74512c114272317982ec19582700d1d47c681bd35f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/src/dotty/tools/dotc/config/Settings.scala: compiler/src/dotty/tools/dotc/config/Settings.scala changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 56 in Setting.tryToSet at line 185. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:38:06 \u002B00:00\u0027 --until=\u00272026-11-13 15:38:06 \u002B00:00\u0027 --full-history --no-merges -- compiler/src/dotty/tools/dotc/config/Settings.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":"compiler/src/dotty/tools/dotc/config/Settings.scala"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed06e05baeddd37b9a6f238989c0462b5686a2a643477697d9c22fc07cd88f19"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/src/dotty/tools/backend/jvm/opt/BoxUnbox.scala: compiler/src/dotty/tools/backend/jvm/opt/BoxUnbox.scala changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 54 in BoxUnbox.boxUnboxElimination at line 181. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:38:06 \u002B00:00\u0027 --until=\u00272026-11-13 15:38:06 \u002B00:00\u0027 --full-history --no-merges -- compiler/src/dotty/tools/backend/jvm/opt/BoxUnbox.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":"compiler/src/dotty/tools/backend/jvm/opt/BoxUnbox.scala"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab6a7ac48e104d6203a1b37da6a8cf5c2e26da81e87f8d5680713d25f37e6686"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/src/dotty/tools/dotc/typer/Implicits.scala: compiler/src/dotty/tools/dotc/typer/Implicits.scala changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in ImplicitRunInfo.computeIScope at line 653. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:38:06 \u002B00:00\u0027 --until=\u00272026-11-13 15:38:06 \u002B00:00\u0027 --full-history --no-merges -- compiler/src/dotty/tools/dotc/typer/Implicits.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":"compiler/src/dotty/tools/dotc/typer/Implicits.scala"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"280e6419efd36ec67807c3902ecdc5f292835d68d98958c88816a3537a65447e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/src/dotty/tools/dotc/transform/patmat/Space.scala: compiler/src/dotty/tools/dotc/transform/patmat/Space.scala changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in SpaceEngine.checkReachability at line 1124. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:38:06 \u002B00:00\u0027 --until=\u00272026-11-13 15:38:06 \u002B00:00\u0027 --full-history --no-merges -- compiler/src/dotty/tools/dotc/transform/patmat/Space.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":"compiler/src/dotty/tools/dotc/transform/patmat/Space.scala"},"region":{"startLine":1124}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e5cf4c8d9bc5bd94e0d4427bdd6030adcbd77d011320392f1144374e0807cdf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/src/dotty/tools/dotc/parsing/Parsers.scala: compiler/src/dotty/tools/dotc/parsing/Parsers.scala changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in Parser.simpleExprRest at line 3060. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:38:06 \u002B00:00\u0027 --until=\u00272026-11-13 15:38:06 \u002B00:00\u0027 --full-history --no-merges -- compiler/src/dotty/tools/dotc/parsing/Parsers.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":"compiler/src/dotty/tools/dotc/parsing/Parsers.scala"},"region":{"startLine":3060}}}],"partialFingerprints":{"codehealthFindingId/v1":"e26913addec2677d5e47e382677ed08883cb95c8fdeaffabf07d7ccf2a069237"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/src/dotty/tools/dotc/core/ImplicitNullInterop.scala: compiler/src/dotty/tools/dotc/core/ImplicitNullInterop.scala changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in ImplicitNullMap.apply at line 250. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:38:06 \u002B00:00\u0027 --until=\u00272026-11-13 15:38:06 \u002B00:00\u0027 --full-history --no-merges -- compiler/src/dotty/tools/dotc/core/ImplicitNullInterop.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":"compiler/src/dotty/tools/dotc/core/ImplicitNullInterop.scala"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"b61488b47797ba9a533303ce82c752defb0fbfffb8ad43080e55508f53439356"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/src/dotty/tools/dotc/transform/PatternMatcher.scala: compiler/src/dotty/tools/dotc/transform/PatternMatcher.scala changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 51 in Translator.patternPlan at line 249. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:38:06 \u002B00:00\u0027 --until=\u00272026-11-13 15:38:06 \u002B00:00\u0027 --full-history --no-merges -- compiler/src/dotty/tools/dotc/transform/PatternMatcher.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":"compiler/src/dotty/tools/dotc/transform/PatternMatcher.scala"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"799782a8b073339ac1752f6ee0682a5b73f8b3318323e006acd5a252994139cc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/src/dotty/tools/dotc/parsing/JavaParsers.scala: compiler/src/dotty/tools/dotc/parsing/JavaParsers.scala changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in JavaParser.modifiers at line 466. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:38:06 \u002B00:00\u0027 --until=\u00272026-11-13 15:38:06 \u002B00:00\u0027 --full-history --no-merges -- compiler/src/dotty/tools/dotc/parsing/JavaParsers.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":"compiler/src/dotty/tools/dotc/parsing/JavaParsers.scala"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"b506f7cca2053532fd3231f00c297cb49e1b6c926d99cd7f01fd532c4118f4f4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/src/dotty/tools/dotc/transform/Constructors.scala: compiler/src/dotty/tools/dotc/transform/Constructors.scala changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 58 in Constructors.transformTemplate at line 142. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:38:06 \u002B00:00\u0027 --until=\u00272026-11-13 15:38:06 \u002B00:00\u0027 --full-history --no-merges -- compiler/src/dotty/tools/dotc/transform/Constructors.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":"compiler/src/dotty/tools/dotc/transform/Constructors.scala"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddc0387ba0b5c7f47f2c0cf5bff08bc67dd477e85bf2fafcf9f57e7884d3eddb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/src/dotty/tools/dotc/core/SymbolLoaders.scala: compiler/src/dotty/tools/dotc/core/SymbolLoaders.scala changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in SymbolLoader.complete at line 418. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:38:06 \u002B00:00\u0027 --until=\u00272026-11-13 15:38:06 \u002B00:00\u0027 --full-history --no-merges -- compiler/src/dotty/tools/dotc/core/SymbolLoaders.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":"compiler/src/dotty/tools/dotc/core/SymbolLoaders.scala"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"aea1fe8cc4cb4a013cacfe41a47598a7e03f07738ebd31443c6a3cdb02a139ee"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/src/dotty/tools/dotc/core/tasty/TastyPrinter.scala: compiler/src/dotty/tools/dotc/core/tasty/TastyPrinter.scala changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in TreeSectionUnpickler.unpickle0 at line 136. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:38:06 \u002B00:00\u0027 --until=\u00272026-11-13 15:38:06 \u002B00:00\u0027 --full-history --no-merges -- compiler/src/dotty/tools/dotc/core/tasty/TastyPrinter.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":"compiler/src/dotty/tools/dotc/core/tasty/TastyPrinter.scala"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa05ca38ab1a2aed3fe1d41eae5acab3549f09217dde994efc391b91a84474dd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/src/dotty/tools/backend/jvm/opt/OptimizerCallGraph.scala: compiler/src/dotty/tools/backend/jvm/opt/OptimizerCallGraph.scala changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in OptimizerCallGraph.addMethod at line 138. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:38:06 \u002B00:00\u0027 --until=\u00272026-11-13 15:38:06 \u002B00:00\u0027 --full-history --no-merges -- compiler/src/dotty/tools/backend/jvm/opt/OptimizerCallGraph.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":"compiler/src/dotty/tools/backend/jvm/opt/OptimizerCallGraph.scala"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d69ff3a10a806564e31194b8e057cbae6a2d29050b5d894a1c755b030b7bedb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/src/dotty/tools/dotc/transform/TypeTestsCasts.scala: compiler/src/dotty/tools/dotc/transform/TypeTestsCasts.scala changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in TypeTestsCasts.whyUncheckable at line 57. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:38:06 \u002B00:00\u0027 --until=\u00272026-11-13 15:38:06 \u002B00:00\u0027 --full-history --no-merges -- compiler/src/dotty/tools/dotc/transform/TypeTestsCasts.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":"compiler/src/dotty/tools/dotc/transform/TypeTestsCasts.scala"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7c963b3e0a8ffeb35c700a4169f2b74fb3b8df91027d82e733a582c9d9980f7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/src/dotty/tools/dotc/core/Denotations.scala: compiler/src/dotty/tools/dotc/core/Denotations.scala changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in SingleDenotation.current at line 802. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:38:06 \u002B00:00\u0027 --until=\u00272026-11-13 15:38:06 \u002B00:00\u0027 --full-history --no-merges -- compiler/src/dotty/tools/dotc/core/Denotations.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":"compiler/src/dotty/tools/dotc/core/Denotations.scala"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"f89c17fe47bd51e1ee3d69cb4e79337e7a54ad872a2a50f4edc054244f5d18c8"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: repl/src/dotty/tools/repl/AbstractFileClassLoader.scala: repl/src/dotty/tools/repl/AbstractFileClassLoader.scala changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 15 (its worst body is AbstractFileClassLoader.loadClass at line 68), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201CClean up Settings, fix Scaladoc issues this unearths (#27005)\u201D; \u201Cfix(repl): resolve StopRepl in -Xrepl-interrupt-instrumentation:local (#27201)\u201D; \u201Cfix(repl): -Xrepl-interrupt-instrumentation:local instrumenting nothing (#26960)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:38:06 \u002B00:00\u0027 --until=\u00272026-11-13 15:38:06 \u002B00:00\u0027 --full-history --no-merges -- repl/src/dotty/tools/repl/AbstractFileClassLoader.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":"repl/src/dotty/tools/repl/AbstractFileClassLoader.scala"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c0afe9eef4286c3d269d8f3f31f6ae1f78e9311b6839abac5f315eff99dd369"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: compiler/src/dotty/tools/dotc/core/Symbols.scala: compiler/src/dotty/tools/dotc/core/Symbols.scala changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 15 (its worst body is Symbol.sourceSymbol at line 336), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201CClean up Settings, fix Scaladoc issues this unearths (#27005)\u201D; \u201CFix \u0060Symbol.copy\u0060 ignoring its compilation unit argument (#27162)\u201D; \u201CRevert commit 10610cb, simplifying Symbol.isTerm/isType (#26873)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:38:06 \u002B00:00\u0027 --until=\u00272026-11-13 15:38:06 \u002B00:00\u0027 --full-history --no-merges -- compiler/src/dotty/tools/dotc/core/Symbols.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":"compiler/src/dotty/tools/dotc/core/Symbols.scala"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"34248f8ae269e7d5b765b7793dea945532244e17395576425b39f9dd714cab44"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 38 significant file(s) lose their only recent owner: compiler/src/dotty/tools/backend/jvm/opt/Inliner.scala, compiler/src/dotty/tools/backend/jvm/BCodeSkelBuilder.scala, compiler/src/dotty/tools/backend/jvm/BTypes.scala, compiler/src/dotty/tools/backend/jvm/opt/CopyProp.scala, compiler/src/dotty/tools/backend/jvm/BCodeHelpers.scala, compiler/src/dotty/tools/dotc/transform/sjs/ExplicitJSClasses.scala, compiler/src/dotty/tools/backend/jvm/opt/ClosureOptimizer.scala, compiler/src/dotty/tools/backend/jvm/BCodeUtils.scala (\u002B30 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7898b414c092efd7dcfdafa38ee62a749ec50161fbeb7ce5d6ad67884403b5bc"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #2: If anonymized user #2 becomes unavailable, 6 significant file(s) lose their only recent owner: compiler/src/dotty/tools/dotc/cc/Mutability.scala, compiler/src/dotty/tools/dotc/cc/CCState.scala, compiler/src/dotty/tools/dotc/cc/Synthetics.scala, compiler/src/dotty/tools/dotc/cc/CapturingType.scala, compiler/src/dotty/tools/dotc/cc/RetainingAnnotation.scala, compiler/src/dotty/tools/dotc/cc/ccConfig.scala. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"974821147603a9a412796f867195167458895d5bf2698fb397401ed1aa79baae"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #3: If anonymized user #3 becomes unavailable, 3 significant file(s) lose their only recent owner: library/src/scala/util/CommandLineParser.scala, library/src/scala/quoted/runtime/QuoteUnpickler.scala, library/src/scala/jdk/OptionShape.scala. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"f202b80e35632f375baed1518446fb7f0a3c2e75515e00aea95b0cd5985498b5"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 14 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold \u2014 folded into the bus-factor score and metrics (65 single-owned of 868 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; 868 of the 1626 production source files in this repository met that bar). They are anonymized user #4 (2 file(s)), anonymized user #5 (2 file(s)), anonymized user #6 (2 file(s)), anonymized user #7 (2 file(s)), anonymized user #8 (1 file(s)), anonymized user #9 (1 file(s)) (\u002B8 more) \u2014 spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: compiler/src/dotty/tools/dotc/transform/localopt/StringInterpolatorOpt.scala, compiler/src/dotty/tools/dotc/util/Chars.scala, project/scripts/syncStdLib.scala, community-build/src/scala/dotty/communitybuild/Main.scala, scaladoc/src/dotty/tools/scaladoc/renderers/DocRenderer.scala, scaladoc/src/dotty/tools/scaladoc/util/html.scala, library/src/scala/collection/immutable/LazyListIterableBase.scala, library/src/scala/collection/immutable/LazyListBase.scala (\u002B10 more)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // warn TODO: could warn \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":"tests/warn/i16639a.scala"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fb342a006a1d5275a4fee78aa192db6a506d54f686bcebaa03c939019303eee"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: check \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":"tests/warn/t11681.scala"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6a682d7b26875421ab79d9255212d3635c9682e36a8611f18e4f1d6f5acff29"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO warn \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":"tests/warn/unused-privates.scala"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3fc9d879c88866adb59303e47fe1b95ec1a9868da1909e11d92efec77b5a653"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO warn \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":"tests/warn/unused-privates.scala"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"052f8bc98d44ac8a504820e4f1b82c1e5a2b9f6344236cf481d6224e5fbd62f4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO warn \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":"tests/warn/unused-privates.scala"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ce8f23bfa84fff35a90a363603a4be71bc4313d5b0d8f72a14edb84cdc40e06"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO warn as we cannot distinguish unqualified private at top level \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":"tests/warn/unused-privates.scala"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7052c00eebf983c7757c6da8276af3c41bda47b099e28aba27b123999c5f0cf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \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":"tests/untried/neg/found-req-variance.scala"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b45ae04db44bd4fc6ee3c98912cd049933d5fcb3e85456ef3127c30263cc2d0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \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":"tests/run-staging/unliftables.scala"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"a92a69375a4a25822d2de2079328943845b46fc6730d3dd3d629f081c5f9a503"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \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":"tests/run-staging/unliftables.scala"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"66b2370239fe7d703eab32f28e811ba4c7b6c34434c20a9b7ed8a4311c229b07"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \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":"tests/run-staging/unliftables.scala"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"f18ebb0bb711c29fb1bfe9f50a93d779cc98c44dc3cf4ab62aad9bb93e26958b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \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":"tests/run-macros/gestalt-type-toolbox-reflect/Test_2.scala"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"117a8fae3e1f1d2e86e41c4f13ffe887682a52bb4eb415cfe51c7a348b1efd1e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \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":"tests/run-macros/gestalt-type-toolbox-reflect/Test_2.scala"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c86ae860e9bf4f4ab9d9b829f2680822c4562577bc83d54edf4cfd423f2a8e5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \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":"tests/run-macros/gestalt-type-toolbox-reflect/Test_2.scala"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"be7261a05a81ed387d35cf8c8ff0b7c154c85f0a4b46b569c4c84f307c090630"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \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":"tests/pending/run/name-based-patmat.scala"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"288e0776367388ce5dbc08eaaa31883aa6e1e94bde11f899125da027d0847e1d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \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":"tests/old-tasty-interpreter-prototype/interpreter/TreeInterpreter.scala"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cbcc73bd3fb369c4e6c90eb179d97cdd644fc5976a592246860820bf14079c3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \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":"tests/disabled/partest/run/t5717.scala"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"7efdb26ebd7a198c210fb9cc7591301f4993290de9572407cb39eb96d7a6b182"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \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":"scaladoc/src/dotty/tools/scaladoc/tasty/comments/Comments.scala"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"99c1dbfa1b9c9535a7ae153b105c184b95d01c8a6b59074babd3ca7a0076cdbe"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \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":"repl/src/dotty/tools/repl/ReplDriver.scala"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"b25b35ab1a809ac1f2409fa729e33b5d06c3f806a1a23b077ce6627c09f7d08b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //      val tpsFresh = cloneSymbols(tparams1) // @M cloneSymbols(tparams2) should be equivalent -- TODO: check \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":"tests/untried/neg/tcpoly_ticket2101.scala"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"c983c9283e8fc734a844346847328db7f72667ce27fd2596e64fb9a2de158d5f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment repeated across 16 files: The identical TodoComment appears in 16 files (17 occurrences) \u2014 almost certainly one boilerplate line from a single migration or decision, not 17 independent debts. Fix the systemic cause once rather than file-by-file. Text: \u0022// TODO improve infrastructure to avoid needing this code on each test\u0022. Source code is not a task system: track the cleanup where tasks live. (Every occurrence still counts toward the score and metrics.)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/run-tasty-inspector/i10359.scala"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a4b1562528c51e36a2c54d599981cf950967d0c470e9ce12d21e0bc70c84e51"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO add elements \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":"tests/run-staging/i3847-b.scala"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"333df87dbceb90529caf784b69c5b4158dd38b44a52990d8a9ebda6793dd3484"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO add elements \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":"tests/run-staging/i3847.scala"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"b94937daf91708123b332e7775d998a4cee741cdaf9578dc407d01202787fefc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO improve printer \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":"tests/run-staging/i3876-b.scala"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"029be46618cf0b5b1f77aad186e8fed59440ae7df1ce6a61a932c9e204e9c144"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO improve printer \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":"tests/run-staging/i3876-c.scala"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"15fa163390bf3fcaf6615b6b388cf6d30e5b7ecf7c12c33314d8730f3af6249e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO? \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":"tests/run-staging/unliftables.scala"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d0f415e7b08878d93d8a99a293bab0d17ecb82abfa692294bb1b77d2a4b6879"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO remove ascriptions when #6126 is fixed"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/run-staging/staged-tuples/StagedTuple.scala"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d0dde99257564eb9e7bac6a83685b6b62d1f3222bfd0e30d8735e879a97bf02"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME used genlet v \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":"tests/run-staging/shonan-hmm/MVmult.scala"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d50e7caea3277de5ed9b272f548e2d6fe56c36744e5f0ce1fbcc10373b031e4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO support blocks in the compiler to avoid creating trees of blocks? \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":"tests/run-staging/shonan-hmm/UnrolledExpr.scala"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"86f9a3ffb2d279302155f3a72a5fdb28d18d1a2231f44b37312962e01a685c8f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: more complex types: \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":"tests/run-macros/type-show/Test_2.scala"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e46081edc90a55d2a7b0129b5c81d236f4a7a5e5cd76b33f37cf75ce5999bd9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO check that the parent is Asserts \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":"tests/run-macros/tasty-macro-assert/quoted_1.scala"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"b87d6a9cefa9e714233909907824d67d63c29fa059f33dcf9066ef943e578802"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO check that the parent is Asserts \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":"tests/neg-macros/tasty-macro-assert-2/quoted_1.scala"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"7693fdef0ecb444b2ae7965eb498dc574578e6b14d31cee36eea97fadb7b7988"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO check that the parent is Asserts \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":"tests/neg-macros/tasty-macro-assert-1/quoted_1.scala"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2f28f45c357e563b491661969d79a0bb76b2450cbdc41b99949b6ccacc19657"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO should all by name parameters be in an inline node \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":"tests/run-macros/tasty-load-tree-2/quoted_1.scala"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"7919d9a3bc2f53ce7b5175354b62ca21d920014b67a7e62f9d59748032a58c9c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO should all by name parameters be in an inline node \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":"tests/run-macros/tasty-load-tree-1/quoted_1.scala"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"5df54761e2717a9a4a46f81504d8ba5f3c66954db2469e6709ee5e63449dec97"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO put this class in the stdlib or separate project? \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":"tests/run-macros/tasty-interpolation-1/Macro.scala"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a37f9681434eb6c2b2ad8e1ed8bbbfe9dc6bba7d3e7187a302298b88b141932"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO use ex.expr to recover the position \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":"tests/run-macros/tasty-interpolation-1/Macro.scala"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"839bd56f508eed6ce3992b05d8cf7dff4d96089f01efebf3b89b95d9201ff929"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO use ex.idx to recover the position \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":"tests/run-macros/tasty-interpolation-1/Macro.scala"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"0799a846cf7fdacdf3169464c31496c424b0dfebc86a407851eaecebf7638a55"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO use ex.idx to recover the position \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":"tests/run-macros/tasty-interpolation-1/Macro.scala"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"7de7d1c2fd28dad29352c51d0088458ec7716988d4afcd3271065dc77bced8ea"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO should all by name parameters be in an inline node? \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":"tests/run-macros/tasty-definitions-3/Macro_1.scala"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"6adbe899cfd86ae17a970d16eef1df0d6c41aa924cf0e4aada3eecd066c7767f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO should all by name parameters be in an inline node? \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":"tests/run-macros/tasty-definitions-2/Macro_1.scala"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b9f69a86e3fd441277881dc041651108d0f10f2e516a81328ae179cb42dad89"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: compiler failed to synthesize Type[T] \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":"tests/run-macros/reflect-isFunctionType/test_2.scala"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"54d6c1ada1e27dbc6e0fd2256b83e481bb83a5079fce884d3ad5f03f2b45cc18"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: compiler failed to synthesize Type[T] \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":"tests/run-macros/reflect-isFunctionType/test_2.scala"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"7750628a6bf521fd69686c9517b31e053d2afebaf1f77968cf316f87a04d3388"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO should elems of \u0060new Record\u0060 and \u0060Record.fromUntypedTuple\u0060 be IArray[Object] \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":"tests/run-macros/refined-selectable-macro/Macro_2.scala"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"28bcae8c6b3ff3ebb36fbba1150ce42db4c8d75bc8d66ffab00f12ba65eb6450"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO remove \u0060Type[T]\u0060 \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":"tests/run-macros/quoted-liftable-derivation-macro/Derivation_1.scala"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"86a444f5016b7d92a9507ff91ad06f3c5ed71c0d6c907c4cf432d3c12ea15371"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO make Lft creation lazy \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":"tests/run-macros/quoted-liftable-derivation-macro/Derivation_1.scala"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"b217af6c600c172c654955504619eb74701a5a2abf4eff34af9e0230fdc8f858"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO hide from users \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":"tests/run-macros/quoted-ToExpr-derivation-macro/Derivation_1.scala"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"ede04d3b238ae3a0fb880adf465bd29b3df88cbf976f9be131b2f76161fa749e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO hide from users \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":"tests/run-macros/quoted-ToExpr-derivation-macro/Derivation_1.scala"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ded9c76cc20db860c71d847be3d34120399548e0d97096589de8331dfb625c2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: support applyDynamic/updateDynamic? \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":"tests/run-macros/places-proto/Macros_1.scala"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0ab215503cd37b22bd53130aa86ccf2f24752a627b93ea0e9dd34bf2e5a2e25"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO check signature \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":"tests/run-macros/places-proto/Macros_1.scala"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b279e0cec480db96de0575a77c99e1ef0baac9f68f6a33e0c0c6e66646a89f7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO use type class derivation \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":"tests/run-macros/inline-macro-staged-interpreter/Macro_1.scala"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"53af7004e4398f7349bf608f3b05e0e3dab78bf14ed2970cfb1acae77abd2264"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO derive a quoted.FromExpr \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":"tests/run-macros/i7964/Macro_1.scala"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"925b450c2f215cb0f14f4a5f5650e38a4400ab3f77dc9af1cc3eaf62028b1104"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: require whitebox macro \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":"tests/run-macros/i5941/macro_1.scala"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"82403a2facce38e88eb3c4be202c961102905506782c993e66d0882ebda5d954"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: require whitebox macro \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":"tests/run-macros/i5941/macro_1.scala"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3fcc16de2f33955322efbb8a55a63131ebd3c7b4b7f478b50a0d4295ab6cee9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: require whitebox macros \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":"tests/run-macros/i5941/usage_2.scala"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"c97bcb4e867c3ef6a107d5eb4ddb80984dac9629d34cdac6466628a31c31a237"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: ///TODO no overloads \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":"tests/run-macros/i11685/Macro_1.scala"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca3044498647e1adc8ff6cc6e78c4271c2f9ae1013af69a17501bc93840c5c3f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO: is that public? \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":"tests/run-macros/i11685/Macro_1.scala"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e41c235afb4e2104dd465d173e0f14fb6b93ccb67c126f390b2acc1e9cc4236"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO? if member.privateWithin \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":"tests/run-macros/i11685/Macro_1.scala"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"36800510b5d8c4d42aaa95c9964819cf17fec022d783bcceaa45a3482acfd877"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME fix issue #5097 and enable private"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/run-macros/gestalt-optional-staging/Macro_1.scala"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"28dc36b670b7d5fd0034cb63fcb0c5cfcc8e72c78438806c2ac6020a2028281f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME fix issue #5097 and enable private"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/run-macros/gestalt-optional-staging/Macro_1.scala"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2ef7bb698a6411a79c7ec935f08dd6508aac9f7e8c6d0241d24cf705ea09b84"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO support Byte and short literal types \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":"tests/run-macros/from-type/Test_2.scala"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"593326f1a133db2ed0dae83cfd7af644be0285f8594b376a297d871e2fad3aa8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME should print fed \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":"tests/run-macros/expr-map-1/Test_2.scala"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"54b85e661217871e48c4eb1071ac352313fdc401bc0009634a995a460b504ae9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO make unrollLast the macro annotation and remove unrollHelper \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":"tests/run-macros/annot-unrollLast/Macro_1.scala"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d7941e753d6cbcb0e0b762fb57154948a828419e8c480e1ea6d29262049edd9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //\u003E private val fibCache$macro$1: mutable.Map[(n : Int), Int] = mutable.Map.empty[(n : Int), Int] // FIXME: leaks (n : Int) \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":"tests/run-macros/annot-memo/Test_2.scala"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"f65de0fc4f066a2aba1df218b71c78527d5fe421e487e764b0d51bb5bd086337"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO improve performance \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":"tests/run-deep-subtype/Tuple-apply.scala"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"c41ebbd5e343ffb9fd0aa1e213cb986c70faabe774312cd5a3d6db0921327148"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME performance \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":"tests/run-deep-subtype/Tuple-apply.scala"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"d893f3569ec9921d47cb668346bccba4101328e78c9a7c210932a00968245576"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME performance \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":"tests/run-deep-subtype/Tuple-apply.scala"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"90205c6fce36ea5257a03a8cc90a040140f48dcff3f5fcdc260b3ebc9b958fbd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME ProductN for N \u003E 22 does not extends product \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":"tests/run/Tuple-fromProduct.scala"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b539869cd2c31a7fe761abb3f1557c09e9d7b2dde873d4fb23f2f9f40423c64"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // Dotty FIXME: type argument should not be needed \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/run/UnrolledBuffer.scala"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cf5ceb4434a6c1c5e97f9d74a0355b9b298f655b73da431af498e6924a6c092"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: case objects are not handled like Scala 2 currently, see #723"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/run/case-class-toString.scala"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"5596bddfb2a953db68f0b4bffc71fafa4aaa7436dc31305d8a3bc941484b6260"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: maybe reflect.Selectable should catch 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":"tests/run/enum-values.scala"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2a37b568e855efe224ef503e782872325db4954d6af7b677a89c3b785cd5a61"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: enable after https://github.com/scala/scala3/issues/11700 is fixed"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/run/i11583.scala"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"cde187b6a04338a8381dda8da4dcd30bd33d52982f12d4d730594890a3d10a68"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // i // FIXME: See #5350"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/run/i5340.scala"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bd9002bfd59a3b58412c7bd83e4a7f7b98a274a06360c907e1cbd295fbd72bd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Erase \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":"tests/run/nothing-lazy-val.scala"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"e28e3da6d22e468eff379749d7f6ff73c939c6670fa38852ccc9f26fd9378855"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Erase \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":"tests/run/null-lazy-val.scala"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"93353dcaa1bcf474d7604122ee3288983d25a5140c5b80c015ad0b48c79eb535"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Erase \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":"tests/run/unit-lazy-val.scala"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d2c2d515e0fe5777c2a6c4a51b9aca0fb67853824fd15cec43bbb9bc2180fb9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: breaks ycheck, broken type inferencing. Gets a large union type \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":"tests/run/numbereq.scala"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"896dad626f22172215b4fcd58559079ed3aaf448db7a2dd9339e10cd90428c66"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: breaks ycheck, broken type inferencing. Gets a large union type \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":"tests/run/numbereq.scala"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0ac300eb527e75e2be057bca73ba552b876a93a0e2b8b6e8f2b6b54bf90e5a4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: test bytecode equality for f and fDirect (and g and gDirect), \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":"tests/run/t4577.scala"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"df5d65035c1f5897019ade0f10314b63511f83feb99c7abc4d9bfb00b9730c50"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove this test case in 2.12, when the deprecation will go into effect and this will no longer compile \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":"tests/run/t6111.scala"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c6fc1c3566a4c88faa611091a4cf02abbbf3c88f783884cadb7a5b0a1761649"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO - Fail getOrElse? \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":"tests/run/t6333.scala"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b4ba3a6efdceea10f664f4b384bfdc43450a3b404a0983b04c252573360feb1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo signal test runner that test is skipped \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":"tests/run/t6488.scala"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"845df98246ce9a8ef8441fd5c88df544755522dde47b9b05586212cddd5480de"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // hack for Mirrors: allow passing of method names \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":"tests/run/tcpoly_parseridioms.scala"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"57a1f141fa0068f0969a3bc280f9a66295678029c4dd705e9e7f177206e37f56"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: \u0060.\u0060 --\u003E  java.lang.ClassFormatError: Illegal method name \u0022.\u0022 in class Idioms$Id$ \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":"tests/run/tcpoly_parseridioms.scala"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd8db083b6e09dd36319a6854dec2e068f77371b6affd2f0db3e9d9a1830b149"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // where x \u003C: s=\u003Et -- TODO can this be expressed without generalised constraints? \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":"tests/run/tcpoly_parseridioms.scala"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"68d1b7068832bd20ee4613688f8e79b2427a7735f4ef9c57cfe09e5ac84f3288"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: how can parserIdiom(curry2(_)) be omitted? \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":"tests/run/tcpoly_parseridioms.scala"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a288b922b852cc8196c7596f7924e099a1a8c611c2f5cb27805ddfd1cf6b783"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // Todo: Make it strongly typed like the other cases \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":"tests/run/tyql.scala"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cc39e64dfee27594eccdc11c7957482ab55fde921b02f9586f80e80defe46fd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: irrefutability should indicate we don\u0027t actually need to test, just deconstruct \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":"tests/run/virtpatmat_valdef.scala"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"88c76f65340651472812052ad4521c8f5d10db0611cacc1e0f11f0ecaae4f4d9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO add a bridge during mixin so we can expose \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":"tests/run/t3452d/Test.java"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bd2956170fdc878006bc66a9b5d6e2f5d436e9986d1df2beed4ee113771accf"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // val _: java.math.BigDecimal = BigDecimal(1).underlying // FIXME: inferred result type of non-private method \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":"tests/run/scala2-library-test/Main.scala"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1c19a5bda59b429e2a25e23cac0a3dc7488d68cffbe4402b3dd00becdf6dec0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: would prefer to do scp.result(step) but this breaks capture checking error messages \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":"tests/run/errorhandling/Validator.scala"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b76d97c1b9271a791550aec64f47a7c1bc175892237bcb9dcdef19e3a81d414"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: there are some other issues with this test case, so it is currently disabled \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":"tests/pos-special/i24547/ReproTest_2.scala"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc43ae47807eacebf60a203632648fc72ee33998553f419ca848154df4df1dfb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME \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":"tests/pos-macros/quote-this.scala"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"abe0ccd56e1583a7bf66332cab2d9a8f65c0ccb03faa1d1ccc3864c42754d5eb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME \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":"tests/link/strawman/nil.scala"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"01b9a43ff024f10b6237dbabe5009ce8c1cfb017ee11b291fbfb4537860f1100"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME \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":"library/src/scala/quoted/ExprMap.scala"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dfe8c9c58ac2ca79ad348666d4d786a1c04e2ade5c06b17b73639aa65d8e174"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO remove _ ?=\u003E // Implementation restriction: polymorphic function literals must have a value parameter \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":"tests/pos-macros/quoted-with-precise-types.scala"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"031d679e9807ed32d3c81cf0150019ac5f3e6adda2fdca3c1da8726cc9bafb51"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO remove _ ?=\u003E \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":"tests/pos-macros/quoted-with-precise-types.scala"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac5e1d42f38546608235022cbf0e78988d3b29ccaf0d5ad12c48410d3c3886ab"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO remove _ ?=\u003E \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":"tests/pos-macros/quoted-with-precise-types.scala"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"cef06ad4216889585f6d1504897348521421df4c262932c73e6992dde5686cd0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME Sometimes stack overflows in CI \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":"tests/pos-macros/power-macro/PowerInlined-1k_2.scala"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"be347649f3d370f957be10ea9d09028f0be54f9edc3239ab1bde97b795a77ba1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: very wrong \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":"tests/pos-macros/i7592/Macros_1.scala"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"09c57b751664aacac6bd1b08292bc8705a23975accedeb47300f3a3554c4e5f6"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // hacky workaround to missing owner tracking in transform \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":"tests/pos-macros/i10151/Macro_1.scala"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fbc4f25d55af021072877ce419bef4254a7d814dfbfa5c44b0d3395b63a0571"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: optimize the subtype checking for large intersection types further \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":"tests/pos-deep-subtype/i20516.scala"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"69782ea4c029a295062601bde234f8597a08ad651b6f2ba117f6445431efb4b5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: why we need to use _ explicitly 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":"tests/pos-custom-args/captures/cc-poly-source-capability.scala"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"d964b3e44f6ea4ae0a8790124629093c412534adcd13021aa314ef53fb2bb225"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This looks fishy, need to investigate \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":"tests/pos-custom-args/captures/flatmapInPlace.scala"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"e89ef233835e7cbaf008d09bfcca8f85b7ca3158e1d82fcf94caa153caf7ee95"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this is an irregularity: it works if we write caps.Contains[Cap, this.type], but we should expect to write caps.Contains[{Cap}, this.type]! \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":"tests/pos-custom-args/captures/i21313.scala"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ef10665775f08612012e2bef97abb042410ae6bf85853ce9c178489ef1148f9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME dito \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":"tests/pos-custom-args/captures/i21313.scala"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"644d151e1d2ade7154f29544ced7171e72650b3a79418000a53f7f6130133eac"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME issue #5257"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pos/automatic-tupling-of-function-parameters.scala"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bbdefd75d6f984c7d1855d393dd7120c811390335f4cd3a8b81bb4c941b71c8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // def apply[S: ZipWith](s : S) = ?[ZipWith[S]].zipWith(s) // TODO: bug return type should be inferred \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":"tests/pos/depmet_implicit_norm_ret.scala"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"c94079349adfde981df8f3fbe2603b47f04d4b0bd9930e566bfb6474d1fd93c9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Scala 3.1.4 bug: false unexhaustive match warning \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":"tests/pos/i16777.scala"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"23704233bece4ed63b3a550cedaed6b05e9f4e4025bdf3b72041556c8c85a997"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Figure igure out why \u0060M\u0060 below cannot be inferred \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":"tests/pos/kindPolySemiGroup.scala"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"b74c035911eec51eca6dd088e0b406c5bd48775b446b84c98931541bf6954988"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO - Remove this test once SI-8334 is fixed and has its own test."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pos/list-optim-check.scala"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"a213e01f49ec48f657382f0f762d398a67c6914f8a3855538ee72090e07ca3d0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: process \u0026 format doc comment \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":"tests/pos/main-method-scheme-class-based.scala"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9ae873b1dc02c23f0560808e3d545f8b434d69b02f45ef9194078b8e6b80679"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: process \u0026 format doc comment \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":"tests/pos/main-method-scheme.scala"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa6dfee0ea86883fcd80e1c23b2af55f685374c9323706924b16ac27811a9b91"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment repeated across 16 files: The identical TodoComment appears in 16 files (34 occurrences) \u2014 almost certainly one boilerplate line from a single migration or decision, not 34 independent debts. Fix the systemic cause once rather than file-by-file. Text: \u0022// TODO NEEDS MANUAL CHANGE (early initializers)\u0022. Source code is not a task system: track the cleanup where tasks live. (Every occurrence still counts toward the score and metrics.)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pos/needstypeearly.scala"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"43e51048bcd68d9132fa2d76c5a73675ceedd325f211262ef028cad0def3602b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove any2stringadd \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":"tests/pos/opaque-xm.scala"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6a58207705d4e6e7db7b1fa85473796018d6c1d2662bc7e9646954a52d208d2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove any2stringadd \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":"tests/pos/opaque.scala"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"da560c8d6544dac565a9e6317a42a205859f012a82ff98f3e67c9d8ccf020900"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: def apply(x: String): x.type does NOT work yet \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":"tests/pos/sammy_single.scala"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"81b5b25ebb0d04c4591959cae811022df1b1d86570450d0522e5ddc3f6ea6a21"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO!!! fix this bug for real, it compiles successfully, but weird types are inferred \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":"tests/pos/t1279a.scala"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"c815c19b4bafae26d9291649e2ec0e4697973daddfb14a5b87d70d5fc9f14614"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX Following works fine: \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":"tests/pos/t2795-new.scala"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"812cb1cce6316929c1444651f68e59dfcc8a40785d6af8f79637bdff7d640594"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX Following works fine: \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":"tests/pos/t2795-old.scala"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"79c87cafdb65304d97249c57ae40d1a0d9025274a16dad538b35f83c7114db40"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: variances! \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":"tests/pos/tcpoly_bounds1.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7947d0b7056dd9995700d52d4425ad147632bb2154946d7375d308b10c231ad3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: should not need explicit call to lifttoOO \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":"tests/pos/tcpoly_infer_ticket716.scala"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"69671eee1e24cc7ab9f812904d612d326624cc1da2d852bd6e675150cf8c44a0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO:  would a viewbound for resColl[x] be better? \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":"tests/pos/tcpoly_seq.scala"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"50ffe4a0c45cf9095c34f58c8dde3a3692de2413c0669f799eda51f9ee41180d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO:  would a viewbound for resColl[x] be better? \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":"tests/pos/tcpoly_seq_typealias.scala"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"6918c246d1d99b52ad85ba0b303af9fb67dfd0f036dc883fb9a76a6026fc33f6"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // hack: ::\u0027s tail will actually be last \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":"tests/pos/tcpoly_seq.scala"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"74993bd7abe8e2d3faf4718dc64dc47978ee948b8c9c62fe6fbb9575c34975a3"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // hack: ::\u0027s tail will actually be last \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":"tests/pos/tcpoly_seq_typealias.scala"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"20ddc76afee90e382c4b72bda4e22b73a108c27574a3db1cc8477e7dcec1fda2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: the var tl approach does not seem to work because subtyping isn\u0027t fully working yet \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":"tests/pos/tcpoly_seq.scala"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb3be4d56a548ea54c85433e4dc44dd999e96ccc2c57cd6a43df2dfd7dc2c35f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: the var tl approach does not seem to work because subtyping isn\u0027t fully working yet \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":"tests/pos/tcpoly_seq_typealias.scala"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6c1ecfa239c76a243c789a6f4102f950d33dafde8dfd39e55ac867d8ecde5d2"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // hack \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":"tests/pos/tcpoly_seq.scala"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b602a26f89b7a4055b794c9f4b317fdb5c64a35d36034a67cfd530320443030"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // hack \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":"tests/pos/tcpoly_seq_typealias.scala"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b5c36b3e67588d7c1bb93dc91c966c636422535858d953bb33bdc3614e99677"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Make this a run test once we have run tests. \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":"tests/pos/pos_valueclasses/nullAsInstanceOfVC.scala"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ab4d1393cee7491d7f0bc1f9105f824fe9f2c35c49dc39f280e4ca13a5e9cef"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this should be a run test once we have run tests \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":"tests/pos/pos_valueclasses/t9298/Use.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"898508a80fb091f30b1dc3558a93f3b11719ce067a6c6f92ba088aa9a3eda9b5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME reimplement TrivialMacroLogger on Scala 3 \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":"tests/pos/i17222.izumi.rep/InspectorBase.scala"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"ade74bda4926dfe54278f8609f4ebaa00fa9415f9005ef86185125724757ec4f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME we need to do FullDbInspector.inspectTypeReprToFullBases.lambdify/LightTypeTagImpl.makeLambdaOnlyBases.makeLambdaParents \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":"tests/pos/i17222.izumi.rep/ReflectionUtil.scala"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f02b2bf923fdb2018759a5baa2cc277e981dfbe3ba01588c621578434adfec6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Due to https://github.com/lampepfl/dotty/issues/16107 not being fixed we have to make sure we\u0027re actually"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pos/i17222.izumi.rep/ReflectionUtil.scala"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab37caf834fa7b7bfbacabb3a50b444e877f1e37959107186b0ce63f1218c4aa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: \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":"tests/pending/run/sequenceComparisons.scala"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"243c8fb99787b37f78ed0ae39ab33c0618c2daacf445c591b5bcfa392c56a32a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //  check(\u0022c1.gl\u0022,   c1.gl)   // FIXME *.gl are failing because of the issue described in SUGGEST-11"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pending/run/synchronized.scala"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae24d9928e36f00223e8021276b41d2a65979f8ebd9b4c909c392903c43eb188"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Future.{onSuccess, onFailure, recoverWith, andThen} \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":"tests/pending/run/t6448.scala"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c6722a8db2eb696282ddb4236589b29e30a74ad4cfd009f2c75ec5dc26fe7fc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Future.{onSuccess, onFailure, recoverWith, andThen} \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":"library/test/scala/CollectTest.scala"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d2e99bc7f7c57199b88234931117ea855df30f4884d4a8c8bf8507ea80da0a5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: can we relax the ordering restrictions on dependencies so that we can use \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":"tests/pending/pos/depmet_implicit_oopsla_session.scala"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c2ecbe2d59ef99a4208dceaca6df15d00d57c8888bf98431406c1926ca848a3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: can we relax the ordering restrictions on dependencies so that we can write \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":"tests/pending/pos/depmet_implicit_oopsla_session_2.scala"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"a70dbadbec61fa008d564d9587af5cb43396c2383dc2b128a0461293eb616dce"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Ensure that this inlines properly. So far only \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":"tests/pending/pos/inlinetuple.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6b7ffdf17b7b091259414870b5baee6f747605a9b3d6236504c9111bcc30a26"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // Todo \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":"tests/old-tasty-interpreter-prototype/Precompiled.scala"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"905e9669d61ef5d5f0bb38e086882a7e7248190ea733b272e6373c7caba38210"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: check the correct sig and object enclosement for main \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":"tests/old-tasty-interpreter-prototype/interpreter/TastyInterpreter.scala"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a9289658eaa3844d25b4e2bba369ff09dfebe7f0ed5272eb55c0b6525b8af6b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: recurse only for PackageDef, ClassDef \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":"tests/old-tasty-interpreter-prototype/interpreter/TastyInterpreter.scala"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"31306ac522d6859bc7bd65ffd4e88d0dbb24faab86e7d5323343784f6ff29ee9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO use \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":"tests/old-tasty-interpreter-prototype/interpreter/TreeInterpreter.scala"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5d9be311d4201e82f40ae9a6ebad73234040ec8be8ce87117295a7e976b52b3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: record the environment for closure purposes \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":"tests/old-tasty-interpreter-prototype/interpreter/TreeInterpreter.scala"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"868ed4ef3419b3cffc3bcc18702b69df93e36ab2733a5f94c5d3ede94e1c7cca"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME not necesarly static \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":"tests/old-tasty-interpreter-prototype/interpreter/jvm/Interpreter.scala"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"6503bbe6242f550c05c92b4ff14e1a29d88a82ed8590a42d6c531959aa7318c4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO complete: Float Double Char \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":"tests/old-tasty-interpreter-prototype/interpreter/jvm/Interpreter.scala"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3fdeb873930180a8ba86719c46e998901370b33a2d4170b0b41314577594b19"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO can we use interpretMethodCall instead? \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":"tests/old-tasty-interpreter-prototype/interpreter/jvm/JVMReflection.scala"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"adbaa0ea98e2e8c452c20345e462b04f9562c686e7dce0042b680593bffd3902"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: rootTransform \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":"tests/neg-macros/i13809/Macros_1.scala"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e1c8805952b94cea0c336389c90d788c295f1a8543cf79293aa26ef527c490a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Why do we get error without the return type 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":"tests/neg-custom-args/captures/capset-members-nohat.scala"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c55a8f04c5aaefdaecbd21074d710ac14dbc5972684ec32b43e9b1df92c1a7b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Why do we get error without the return type 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":"tests/neg-custom-args/captures/capset-members.scala"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"d679aec70da95245bf2da53ff38d3b46d79f1686386dc8272a3068fe56cbd5e6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We have to put \u0060c\u0060 in the different argument list to make it work. \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":"tests/neg-custom-args/captures/path-connection.scala"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"b254d00f8f2be4218e21822e6af59da3bea7420ac1d319e74dfe10ddbd057b86"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // error TODO improve error message \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":"tests/neg-custom-args/captures/reference-cc.scala"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"65e39f20314fce29a95a89b10e476d25052e290d0fc13e78ce710bcfe612798b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME needs to be classified as Foo, too \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":"tests/neg-custom-args/captures/sep-paths-derivedcaps-consume.scala"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a00413efee594607ac2c16f875c8405731d5057fac9313f8bf8729c20107e38"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //val a4 = A4(a22) // FIXME should work? \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":"tests/neg-custom-args/captures/sep-paths-derivedcaps-consume.scala"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcf115b140b8677637056b194d5ac76f257fce07680e5282c54e7c3324e5eff1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //val a6 = A4(a222) // FIXME should work? \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":"tests/neg-custom-args/captures/sep-paths-derivedcaps-consume.scala"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"55fa8635838bd9866444f93d3c8631ea000ee6e5bf10df152f846ef9900bcfe0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO remove \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":"tests/neg-custom-args/captures/caseclass/Test_2.scala"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"e33b7f2b96e1b61c8102180abd8f20fddb02cb1a94848b9246305de7a318bd63"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO remove \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":"compiler/src/scala/quoted/runtime/impl/QuoteMatcher.scala"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"020f887d5782e45fa781746d5438824c35c18c66108cdec6171488ef0d1ca379"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO error: deprecation waring \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":"tests/neg/IsInstanceOfClassTag.scala"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"2723c305b47978b5cb3984a3d44528006e96d9461d2a5aeae0b6c48745983ed4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // no separation checking, TODO enable and move to neg-customargs \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":"tests/neg/capture-vars-subtyping.scala"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4ad0053cd2c8f78d9aea0d3020677d7d33265dda88ab0e831310a810aa3945b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: make \u0022CapSet-ness\u0022 of type variables somehow contagious? \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":"tests/neg/capture-vars-subtyping.scala"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"e73db3911af000161d472daa880971a55f19df95bd24305ca98604d26e725426"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this should be pure, see #26800 #24990 #26578"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/neg/i24990.scala"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6ec29773fb5f021ac52d51f8a6e082451ad4d1c2aae5dd73b04e7a59b600eec"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this should be pure, see #26800 #24990 #26578"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/neg/nested-module-no-inits.scala"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"afa827350758038081b469cf1f83cea3268b6bf5da4cdb8245c619d6bab294e7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // G.valBinaryAPI2 \u002B // FIXME should error (now fails -Ycheck) \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":"tests/neg/inline-unstable-accessors.scala"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"318f97dc4141a7e9d6b512af6f5e46d4ea032fbb7e3cb43deac24d469c2f2799"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: need test for rank N with N \u003E: 2 \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":"tests/neg/tcpoly_variance_enforce.scala"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcd87b732f4b0a047c431537b1891665256f6ea769d169cb0a82433962a0f9fe"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: issue loading package object \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":"tests/link/strawman/iterator-1.scala"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac485431bebf3bc107b42327066ed757530ecd83a1312222832de4925685457f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME issue loading class inheriting a type parameter \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":"tests/link/on-custom-lib/builder2.scala"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"29f6ecfd24193e21645acf9aa142d1fffc6a56d4586b69c33ae5e0792c20d484"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Issue when loading type bindings from Tasty \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":"tests/link/on-custom-lib/map2.scala"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eb994d8244b7f4f393059c04f590baba2d92d8546539217df109e933cd1cffd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // case that: Map2[b] =\u003E that.get(3.asInstanceOf[K]) // FIXME \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":"tests/link/custom-lib/strawman/collection/Map2.scala"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"60d5d4a25d8bcffb56d09fb1d7cc6ca893da1415884c91eb4d4ba70ecabd1a9b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: drop the .asInstanceOf when explicit nulls are implemented \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":"tests/explicit-nulls/pos/notNull.scala"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a267bd147833fbb0e566e621e4e5bfc6dd34df890af3df6f50bb94eaec31905"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: not working now \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":"tests/explicit-nulls/neg/flow-varref-in-closure.scala"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b344203e350170b9a52a95a4898583dfa22830995587aea04504c9f4c408195"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO complaints classdef can\u0027t be found for some reason, runs fine in my case \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":"tests/disabled/reflect/run/SymbolsTest.scala"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"182e6b3c02191d031e7d54a4435974a8329ac01537245d7ec236c1b36ecacc8a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // locally(Early.x) TODO sort out VerifyError in Early$.\u003Cinit\u003E \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":"tests/disabled/reflect/run/t6259.scala"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf1a578124bb618c5274fc65124f0b7e959eac1889a8d1a4267e3d1e000058e6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // DoubleOk         TODO sort out VerifyError in DoubleOk$.\u003Cinit\u003E \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":"tests/disabled/reflect/run/t6259.scala"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"f10cf0b30542cc54aca535208131facc7f5996d519c9ab16622d79ac5dfc9698"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: disabled because of SI-7056"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/disabled/reflect/run/t6411a.scala"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"454c2d0a1d16916e47b34e237183f18a817152e471f859bccbe68f96dc73916c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: disabled because of SI-7056"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/disabled/reflect/run/t6411a.scala"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"30f6af8fe6ff5983e60caa9fbb1d73091b86613ece332818ed49b117c97d3277"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO SI-8576 unstable under -Xcheckinit"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/disabled/reflect/run/t8549.scala"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"1473b3ed48051a48ea7772166748e3125b8d36fab8b23f180d91511fc7a4c636"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO SI-8576 unstable under -Xcheckinit"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/disabled/reflect/run/t8549.scala"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"9939dcd6b10b2ef3e8730bb824812bb55acd4405b4dbcc3216d3b4aff601d342"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO SI-8576 unstable under -Xcheckinit"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/disabled/reflect/run/t8549.scala"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"9af86b7323a5038029c46328ec20d6f0372704ac37e645df1e9d526ca7d5f07c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO SI-8576 unstable under -Xcheckinit"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/disabled/reflect/run/t8549.scala"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"d139bb90cbae2b92e4f77fe12679cdc8479b5d6f00785f4ceaaa33eff99c6d78"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO SI-8576 unstable under -Xcheckinit"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/disabled/reflect/run/t8549.scala"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0de091ed0598ebb87881d4b7ce781d5c9ae915fa1440613bf3f3c7c84004816"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO SI-8576 unstable under -Xcheckinit"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/disabled/reflect/run/t8549.scala"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ef67491e3c7aecb695221c7c831ab068f2152ed768f955a4a4f8b2f64b72d73"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO SI-8576 throws scala.UnitializedFieldError under -Xcheckinit"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/disabled/reflect/run/t8549.scala"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"28d9ff27563d95c754657c9675eea6299345c2ec69c924c24bc9fb4b4a3fd51f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO SI-8576 throws scala.UnitializedFieldError under -Xcheckinit"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/disabled/reflect/run/t8549.scala"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9393ae384f4d35408b8d0a9cbb1599e4c81bb0b54e690b2445dc246a601e822"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO provoke HashMapCollision1 \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":"tests/disabled/reflect/run/t8549.scala"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"da8c7966f7a67478ee2f58234e80ce6564421483e9f1715feae76d50bde04416"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO provoke HashSetCollision1 \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":"tests/disabled/reflect/run/t8549.scala"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"436f5df1fadd31c720786ce60c306c4e4d68cf2dec035e7d3e170b5517ad6a68"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO SI-8576 Uninitialized field: IndexedSeqLike.scala: 56"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/disabled/reflect/run/t8549.scala"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"01cca2af138497173fcbeea65d64c480a6fbc4233b3560fe3863b84d88f3cd34"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO SI-8576 Uninitialized field under -Xcheckinit"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/disabled/reflect/run/t8549.scala"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"21063d593c797047038187dc0920615949ef3c58e2cfbd3b8062887233dbb6e8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO SI-8576 Uninitialized field under -Xcheckinit"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/disabled/reflect/run/t8549.scala"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"c87c9383e2e841d55a393fbc31d2c6d1e65a79d5c7db8529d6cd048e4dc0f26b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO SI-8576 Uninitialized field under -Xcheckinit"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/disabled/reflect/run/t8549.scala"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d79d14285e886ccd5d7aef277d4e942e6ba39b90409210a168efdee8d7c56e4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO SI-8576 Uninitialized field under -Xcheckinit"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/disabled/reflect/run/t8549.scala"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae7869f86e9befe50bad2a98de77e36838b8e067cb798a90458c52491d654c8e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO come up with a non-trivial universe different from ru \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":"tests/disabled/reflect/pos/typetags.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"443ccb3f5a72fc50983ccc2f4d203ee270c2b5289f7cc9e699ba30f5f2a690d6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: SI-7066"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/disabled/macro/run/t7008-scala-defined/ScalaClassWithCheckedExceptions_1.scala"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"9534d85c96113ad67a8ed88bfc0ea209d865f678e188ef28902a46b708b18a54"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // was:    if (level.splice.id \u003C 4) // TODO Remove hack! \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":"tests/disabled/macro/run/t5713/Impls_Macros_1.scala"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"0676c264ef11738e3f6e5fd3b703a4a8ee2dab0e64253b541c7701cff372fe6c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Remove hack! \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":"tests/disabled/macro/run/t5713/Impls_Macros_1.scala"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c0030a57f1fc0cde269670fea76cad0b17011f3d8cbf15c07c94652543ea288"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: does it ever make sense *not* to perform a shallowDuplicate on \u0060to.head\u0060? \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":"tests/disabled/macro/run/macro-range/Common_1.scala"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"282beb7fc2975ff8cde9a14d887df619df0e080d3238c8c89c6dbfbfbc37579b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo. read the compiler config and print if -Ydebug is set \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":"tests/disabled/macro/run/macro-range/Common_1.scala"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"4092c80598417afa0d94d9933a1e9fda54fc0ec98cef03668199c74be1acb617"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo. read the compiler config and print if -Ydebug is set \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":"tests/disabled/macro/run/macro-range/Expansion_Impossible_2.scala"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"7778953b95ebc090f498ed965cea1c5211de442193fa6ec17c1d6b5cce9de21a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo. read the compiler config and print if -Ydebug is set \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":"tests/disabled/macro/run/macro-range/Expansion_Impossible_2.scala"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"c013cc5fb400ab6ecb62d1b26cba0752f54319c025c35e57eda859b531eaa1a3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO swap SIGNED and TARGETSIGNED codes on next major version bump \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":"tasty/src/dotty/tools/tasty/TastyFormat.scala"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5e3f6687c2e7eb84832e7f370e39b280d2cdb98468f4e43ebc1bc32add9687e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO avoid using default parameters (for binary compat) \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":"staging/src/scala/quoted/staging/Compiler.scala"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"beeef21dfb5fbe46810ca9a97ec2cf6d5ce3511b3e0d3820a656da8d1671158d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO propagate the right Java version 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":"staging/src/scala/quoted/staging/QuoteDriver.scala"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"92691d04ed7cd9165ff08599c300ac72723d45b89bb8403fc577a55d1daac202"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO We do not see members from companions val valInsideDocObject = ??? \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":"scaladoc-testcases/src/tests/classSignatureTestSource.scala"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"54aebc75ca466fe9d22b92684f5b0b18aefcdcb67b0465639fa21471bb5b0374"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO #25 do we need to add \u0027val\u0027 in case class signatures?"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scaladoc-testcases/src/tests/classSignatureTestSource.scala"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c13a853f5fd1bdb95414e91418867f4bb670989ce1a05d53336c8a97c389586"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO #26 this is not supported :( class D1[T ]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scaladoc-testcases/src/tests/genericSignatures.scala"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"b14719bb0ec4433a73f194cce31807b857caf546d98a571dd1e216d3457504fd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //opaque type Permission \u003C: Permissions \u0026 PermissionChoice = Int TODO: #112"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scaladoc-testcases/src/tests/opaqueTypes.scala"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"af9e3d0d5449afad92402929bd3f85607c03d36ace6f57cbf10d720945af9f38"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //                                     ^^^^^^^ TODO fix \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":"scaladoc-testcases/src/tests/thisType.scala"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"f58de5af75cbe4894184180a79140a6a553f588fd7df7224841ecc94ed9ab0d5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //todo extract \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":"scaladoc-js/main/src/searchbar/engine/PageSearchEngine.scala"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8335fde83e351aa9ee5c4835e81ca30d764cb5f2a2ff7168d19f2fcd9e92fb8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: handle synthetic givens, for now we disable them from testing \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":"scaladoc/test-source-links/dotty/tools/scaladoc/source-links/RemoteLinksTest.scala"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ff1e09293bc3e623aa9889c889986e766519b4857f98c61b92ab2183b757101"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // OtherPackageMembers - does not work, TODO? \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":"scaladoc/test/dotty/tools/scaladoc/tasty/comments/IntegrationTest.scala"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"8beed6aed8ce3d4d0955d9dbcf73f6130298f4e987a1fdfa66c62703f58fb0dc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // SamePackageMembers - does not work, TODO? \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":"scaladoc/test/dotty/tools/scaladoc/tasty/comments/IntegrationTest.scala"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4601692bbb477b5ecec48c23e7ac355a81ad9e1a553623318cb0ae45a97205e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO (https://github.com/lampepfl/scaladoc/issues/240): configure source root"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scaladoc/test/dotty/tools/scaladoc/source-links/SourceLinksTest.scala"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe471dd48bc765200c8d6d775eb9e3a00f3da37e12c670353c6193db002f2b4a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO add negative and more details tests \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":"scaladoc/test/dotty/tools/scaladoc/site/SidebarParserTest.scala"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc7e2de70c9d5d860bcdea722da52eff41439040f1c1663360fa9f678d6a07c0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO add docs for packages \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":"scaladoc/test/dotty/tools/scaladoc/signatures/SignatureTest.scala"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"7828921995927e08e4a31d7c997aad0a8bec59b638104d8b93963d378d863ff2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO we still cannot filter out all constructor-based fields \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":"scaladoc/test/dotty/tools/scaladoc/signatures/TranslatableSignaturesTestCases.scala"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"48c8c8f40d50a148d457629e0fe22109e2cd55066767f072b864733da0e05816"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME remove this copy of the file \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":"scaladoc/src/scala/tasty/inspector/Inspector.scala"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ad35756a191813e98422deee977317c5461c73b56bc647e45c36f86d997c8a4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME remove this copy of the file \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":"scaladoc/src/scala/tasty/inspector/Tasty.scala"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"10151b71038baa629be3cbf74bf539727c35b7e36fd3df2f37e4a85445eb6328"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME remove this copy of the file \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":"scaladoc/src/scala/tasty/inspector/TastyInspector.scala"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e12f9ac752e272b8df96c8c13343252b11b1e4ff6022956e2bc193e0d6161d0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO (https://github.com/lampepfl/scala3doc/issues/238): provide proper error handling"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scaladoc/src/dotty/tools/scaladoc/DocContext.scala"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"110343d5fb370167b7f2846ce0a9af2863cb11dc2d3e716e7fbf1301cc23f6b1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: #13243"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scaladoc/src/dotty/tools/scaladoc/Inkuire.scala"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"40b479a63af895ae83be76f5136782d309d5046efa1c1aade0ff50d91b0aac9f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO (longterm) properly represent signatures \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":"scaladoc/src/dotty/tools/scaladoc/api.scala"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"09c1c9207327b189619c6df7d5656759b1ef9c92e537b304e5329e1c48fd7876"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO (#220): We can expand this on generic etc"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scaladoc/src/dotty/tools/scaladoc/transformers/ImplicitMembersExtensionTransformer.scala"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"68411c79b7e9537a0c3c32f99a871166c81cbcd2a7a38e95b89067e4031b7bc1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: check if those two cases can occur at the same time \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":"scaladoc/src/dotty/tools/scaladoc/tasty/ClassLikeSupport.scala"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d08dbbf73778917b7584c62d3d388634caeb1f57b10607e5302e7bba1ca7b0f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: add exists function to position methods in Quotes and replace the condition here for checking the JPath \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":"scaladoc/src/dotty/tools/scaladoc/tasty/ClassLikeSupport.scala"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"9145a13d30556475b0dcebfb42c9373b8d4eface5c4c5f53fed7ff770ad22111"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO [Inkuire] Implicit parameters \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":"scaladoc/src/dotty/tools/scaladoc/tasty/InkuireSupport.scala"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"52a377a7cf51bdb5738303476e1d30be884a4400c43ad00dc143f7656ceea0ee"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO [Inkuire] Type bounds \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":"scaladoc/src/dotty/tools/scaladoc/tasty/InkuireSupport.scala"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"b31474f6bdc495ecb0b4681e1831dc9685436fd28ad9bae3c59904fbab5a9896"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO [Inkuire] Type bounds \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":"scaladoc/src/dotty/tools/scaladoc/tasty/InkuireSupport.scala"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd32c793408d9131af90350386cf459ed858c3afdf012120efa085451a7978a5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO [Inkuire] Type bounds \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":"scaladoc/src/dotty/tools/scaladoc/tasty/InkuireSupport.scala"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4e0750b742e8224690150da2339826fc65cf761594744116baee785ceea4d83"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO [Inkuire] Type bounds \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":"scaladoc/src/dotty/tools/scaladoc/tasty/InkuireSupport.scala"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"02e96471e10bd8de75a3ae8fadd8b2627812a69f536e869b344ef4faa3d28903"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO [Inkuire] Type bounds \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":"scaladoc/src/dotty/tools/scaladoc/tasty/InkuireSupport.scala"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba1651bbfa65e17c8e73c1964d055cc03f7319c9bf2a00456125684a902e36ab"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO [Inkuire] Type bounds (other than just HKTs) \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":"scaladoc/src/dotty/tools/scaladoc/tasty/InkuireSupport.scala"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ae18edf24034fda6009b4348be523f3a0d803bfa5af75c1295c64fc7037b6a1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO [Inkuire] Repeated types \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":"scaladoc/src/dotty/tools/scaladoc/tasty/InkuireSupport.scala"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"d533b20c53fff95bccf512c7a3a0df3bd8a800a643d84766eb95bc7e103a027c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO [Inkuire] Repeated types \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":"scaladoc/src/dotty/tools/scaladoc/tasty/InkuireSupport.scala"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa5e84ec0c7dcd6e6e0694fad40e1f16c715c83f93e42b6b31c3fd12283d6e44"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO [Inkuire] Refinements \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":"scaladoc/src/dotty/tools/scaladoc/tasty/InkuireSupport.scala"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3da9b923bdf6da27e2766a85a175fc3f1c3734f5bceaf2e5644cd0a6236075e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO [Inkuire] \u003C- should be handled by Singleton case, but didn\u0027t work \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":"scaladoc/src/dotty/tools/scaladoc/tasty/InkuireSupport.scala"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c2ad4cf2bee340d882d2244263fa11772f2ec0834880826d2e2a299ea6de2a5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO handle other cases without using show (show does not have a stable representation) \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":"scaladoc/src/dotty/tools/scaladoc/tasty/Scaladoc2AnchorCreator.scala"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d599bf4f8e642f8c074667cdc7b8991368cbe50f251c022e8ce4ec2ed5265ad"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO: Retrieve string that will match scaladoc anchors \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":"scaladoc/src/dotty/tools/scaladoc/tasty/SymOps.scala"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9c4b61740c4649a0b4ecbd810837e22f641f259a125cf90fa9c5d24b9ebac51"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO find a better way to handle this cache and move the methods to SymOps \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":"scaladoc/src/dotty/tools/scaladoc/tasty/SymOps.scala"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"64f62116650abf7c103c1746670e86fb792fa9d100274645efd454fcb13fcb0f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO #263: Add anchor support"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scaladoc/src/dotty/tools/scaladoc/tasty/SymOps.scala"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b5ccfcdd1f5e1966cb90d7cecbe32e10f126515e45743da2072e03ba900c93a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Add tests for it! \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":"scaladoc/src/dotty/tools/scaladoc/tasty/SymOps.scala"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"6717e3a5003ad87f5bd426ce4cc38defceeaf159e4ad489e35b9d6a14814462b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO #22 make sure that DRIs are unique plus probably reuse semantic db code?"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scaladoc/src/dotty/tools/scaladoc/tasty/SymOps.scala"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"f58c6aac84f441f3a91fe7157d0d3030ff3a7b816ef9ef02fd96d34a5874c16e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO #23 add support for all types signatures that make sense"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scaladoc/src/dotty/tools/scaladoc/tasty/TypesSupport.scala"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"98bbdc434f5d1bc2affa5f16635a5a75de556bdb73a3b91fefda856d46a6092d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO why we do need null? \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":"scaladoc/src/dotty/tools/scaladoc/tasty/comments/Comments.scala"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dca5a0ef6f906df0f5aa9b873800f04ae527416f67c3c9c60c7bf31cec7226d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: figure out why \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":"scaladoc/src/dotty/tools/scaladoc/tasty/comments/Comments.scala"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"86ef9ce642937095246978f4df42660af43e2d69f6e4d10eda1c56a5443575cd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: The header row must match the delimiter row in the number of cells. If not, a table will not be recognized: \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":"scaladoc/src/dotty/tools/scaladoc/tasty/comments/wiki/Parser.scala"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0b3a8f9c37cd380776d1b7878dcbd9acddeabf9f080e30257dcbb41562dd9e8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Break at following block level element: The table is broken at the first empty line, or beginning of another block-level structure: \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":"scaladoc/src/dotty/tools/scaladoc/tasty/comments/wiki/Parser.scala"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdcfc4b10193acf409a96330e50b27ea51f251af674f51072957d46ec7cbc521"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Do not return a table when: The header row must match the delimiter row in the number of cells. If not, a table will not be recognized \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":"scaladoc/src/dotty/tools/scaladoc/tasty/comments/wiki/Parser.scala"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f9f33479fc83cd40fd5fc6ed5d77544babe5512417ebf8282b9388aff0e9caf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Abandon table parsing when the delimiter is missing instead of fixing and continuing. \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":"scaladoc/src/dotty/tools/scaladoc/tasty/comments/wiki/Parser.scala"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"9464313a6fa8da97f21eebd5f36a50cd8283ad3994710cc1c8944ca7d235940e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Parse the second row without parsing inline markdown \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":"scaladoc/src/dotty/tools/scaladoc/tasty/comments/wiki/Parser.scala"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd2e65993dbc67a65791fdbea8c3f9d1c98f32cd19d72a3c948448734fadc543"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Save pos when delimiter row is parsed and use here in reported errors \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":"scaladoc/src/dotty/tools/scaladoc/tasty/comments/wiki/Parser.scala"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbe827bb57ac8998fd663605c6c08a0859462cca50ca4a14eb2d5512a02fbfbf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO use style \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":"scaladoc/src/dotty/tools/scaladoc/renderers/DocRenderer.scala"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"4437ecb1c304033c92d4da660e1e6605b33ea789dd86e89143752a507b1f3ac5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO verify if location exisits \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":"scaladoc/src/dotty/tools/scaladoc/renderers/Locations.scala"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7a1e4573d3a30692113450106cc035e99aa7134410936d7fa5ad1e5cdb4019b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO we should switch that to warning probably or has dedicated setting \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scaladoc/src/dotty/tools/scaladoc/renderers/Locations.scala"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bbca1e763e5c8327313c505a50f48e04e5de6b1fd29ee59937c8bfea5f10d82"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO merge it with new renderer \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":"scaladoc/src/dotty/tools/scaladoc/renderers/SignatureRenderer.scala"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"9344d8b27934fea7534e08818001901af5c16320872d443bc0c8b32f6675d737"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO be more clever about writting - make it much faster! \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":"scaladoc/src/dotty/tools/scaladoc/renderers/Writer.scala"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a523661a1445969eb8e13d7927a71ab5f7939a5b9e2817629631735a55c3bbe"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this doesn\u0027t work yet because inherited classes are not extracted \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":"sbt-bridge/test/xsbt/ExtractAPISpecification.scala"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea29c2fe314aa7c970d0f78de27924f3b43fed04878992d6bf271cd93029914c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: we should fix it by having special treatment of \u0060selectDynamic\u0060 and \u0060applyDynamic\u0060 calls \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":"sbt-bridge/test/xsbt/ExtractUsedNamesSpecification.scala"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"2723d82d11b40fc14fa3997eb44b68d926e83f5c7cdae9662dc6e338d76eef3c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO handle failure during initialisation \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":"sbt-bridge/src-bootstrapped/ConsoleInterface.java"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"078e85f7ddf568a45814603af5fbb7f2f17aafafe239ce91c4c5717ff5fee33e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: possible situation here where we use -from-tasty and TASTy source files but \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":"sbt-bridge/src/dotty/tools/xsbt/CompilerBridgeDriver.java"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e99f9f7a8eae0936c72463b8a776fd4339699fc0e8454a2f3665e6c4053ecc8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: atomic boolean? \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":"sbt-bridge/src/dotty/tools/xsbt/ProgressCallbackImpl.java"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9f9773b58f49a113da536862fafbeaf31400fbcd2308944ac03d51d969699b0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME Could be a List[TypeDef] too, although I\u0027m not \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":"repl/src/sourcecode/Macros.scala"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"608af3d44fafb2ad9e4c28bafe7a28b59b6f997c603c3a42f4a36973b0333fef"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME Could be a List[TypeDef] too, although I\u0027m not \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":"repl/src/sourcecode/Macros.scala"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c14a4dfbed29808e10cc41fabcceedf41e6f8a540670622eb9248b90f11a148"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: support every alias coursier does, once the Coursier Interface exposes its own \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":"repl/src/dotty/tools/repl/DependencyResolver.scala"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4f6e9cdde2e996fa5da889d3ef208c719680c244bd1c9e999d6b6f3e3ea4217"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO use for documentation? \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":"repl/src/dotty/tools/repl/ReplDriver.scala"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"96ecab1965ca43db046c513aa6354c4cf982f2902e3c8c64841c43abec69e558"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: i5069 \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":"repl/src/dotty/tools/repl/ReplDriver.scala"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8892343acbabeda6320739c4e3ed965ee962f54259cba01e3aa74172026ac01"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Would this actually evict the reference compiler in scala-tool? \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":"project/Build.scala"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aad121188c7b80afd225a85e44518003fb00cc4c29b42dad233f6b06fc8fa47"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Would this actually evict the reference compiler in scala-tool? \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":"project/Build.scala"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d24b978c0d88d7aeb7f0bdd596159b10a6065cc9cc07f218423b67d1187583"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We should use the val above instead of \u0060-usejavacp\u0060 below. SBT crashes we we have a val and we call toTask \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":"project/Build.scala"},"region":{"startLine":916}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc9c0a6ef73f63cb2be1679e8c544ce6d258364b801127c299c828266b980bda"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO #23743: once Scaladoc supports snippet checking without full page rendering,"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"project/Build.scala"},"region":{"startLine":1902}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d54a7a9dccce0de3496dbf0371bed87b0af33236ed421c3dbb09c8659ceed51"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // something crashes the optimizer, TODO investigate \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":"project/Build.scala"},"region":{"startLine":2256}}}],"partialFingerprints":{"codehealthFindingId/v1":"15a99d9a0b7de50fb5f98451eac9ab33b2a0dfe213fd299f2413b744924236e6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO This apparently breaks signature help. \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":"presentation-compiler/test/dotty/tools/pc/tests/signaturehelp/SignatureHelpSuite.scala"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ffe911d0fe603d5d0e1db93b3f5ed0aa00290248a1db9533b6883b231df5af7"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // hacky way to add a source file to the presentation compiler sources \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":"presentation-compiler/test/dotty/tools/pc/tests/info/InfoSuite.scala"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"12d5fe3da7850f81be2faad0558d76fa3a978f4cd5bd430779142eb5fcda1458"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO SemanticdbSymbols.inverseSemanticdbSymbol does not support params and type params search \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":"presentation-compiler/test/dotty/tools/pc/tests/definition/PcDefinitionSuite.scala"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"79476194417134b7ce587b05f358524af831d5456f4ebef743222229f4cf0642"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO We first need to detect support when to add additional braces / colon \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":"presentation-compiler/test/dotty/tools/pc/tests/completion/CompletionExtraConstructorSuite.scala"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"7abd6f0040442ecff39cf5a5a7a2e01342d8601e67dc361308f2bd4affcfba91"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO We first need to detect support when to add additional braces / colon \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":"presentation-compiler/test/dotty/tools/pc/tests/completion/CompletionExtraConstructorSuite.scala"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"da61e98d94b23e2583c6a2e6e8d1fbe904aca3747d54fc28106aaf3be834b78d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO We first need to detect support when to add additional braces / colon \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":"presentation-compiler/test/dotty/tools/pc/tests/completion/CompletionExtraConstructorSuite.scala"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"54bcad6cea0401edfbf8ff246ede04c774aaca29c8e8f8966bcc719a1f0ee550"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO We first need to detect support when to add additional braces / colon \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":"presentation-compiler/test/dotty/tools/pc/tests/completion/CompletionExtraConstructorSuite.scala"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"239794191b46e5c44ea5adabef2aa3470e4bf0e87811e762b354dd3371f57cf1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO We first need to detect support when to add additional braces / colon \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":"presentation-compiler/test/dotty/tools/pc/tests/completion/CompletionExtraConstructorSuite.scala"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b364f8b2ad41091fe6391b24498231f35b9265786052a3e9f6c3a6b1adae473"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO We first need to detect support when to add additional braces / colon \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":"presentation-compiler/test/dotty/tools/pc/tests/completion/CompletionExtraConstructorSuite.scala"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeb8b6ee18823a3575b5041811a788c0bb975ec04b867b13d283ea4b8c9cf4c3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO We first need to detect support when to add additional braces / colon \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":"presentation-compiler/test/dotty/tools/pc/tests/completion/CompletionExtraConstructorSuite.scala"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"9600ead6cc648eaa55ca290f48f403fcf07353d655c4c8a8ea62bedf4bda34ce"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO We first need to detect support when to add additional braces / colon \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":"presentation-compiler/test/dotty/tools/pc/tests/completion/CompletionExtraConstructorSuite.scala"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c042cba1f05f31280f1b39a3f92e4f0c131441fa6f314a05cd8e901a1671542"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO We first need to detect support when to add additional braces / colon \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":"presentation-compiler/test/dotty/tools/pc/tests/completion/CompletionExtraConstructorSuite.scala"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c5da93936946bdaca5139641e181b46c72d85c74f5a341b341cbe43c46bd760"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO We first need to detect support when to add additional braces / colon \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":"presentation-compiler/test/dotty/tools/pc/tests/completion/CompletionExtraConstructorSuite.scala"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"79d42584fc06ee25f609215d5c654ee3eca793bf39e1222c6ed967ba36bce4de"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO We first need to detect support when to add additional braces / colon \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":"presentation-compiler/test/dotty/tools/pc/tests/completion/CompletionExtraConstructorSuite.scala"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"90905255f6dfcb50c076a44b2861c6a5d346b92236b06272c2486b5b5fe086c4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO We first need to detect support when to add additional braces / colon \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":"presentation-compiler/test/dotty/tools/pc/tests/completion/CompletionExtraConstructorSuite.scala"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e11e5d83a68f529e252a26325121884e37f27eb86e276847e95b39c906dbf17"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Should provide empty completions \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":"presentation-compiler/test/dotty/tools/pc/tests/completion/CompletionKeywordSuite.scala"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"7402526d7ba3e1c87b6ae6997f7312d78cae79314f8e2104de7b4fdbf1bd7b88"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: check the positions for NamedArg and Import \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":"presentation-compiler/src/main/dotty/tools/pc/MetalsInteractive.scala"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"697ea409d2bfd19ddb7a51a5d1afa02bfaf443bc1cd3aeccc6fb8665a8744136"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO remove this type and return \u0060Compiler\u0060, \u0060Workspace\u0060 instead \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":"presentation-compiler/src/main/dotty/tools/pc/completions/CompletionValue.scala"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"85dae22baa2cd218f5082cbd0334ca86e440706bfe5458db58965ce158fc2dea"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO This has to be refactored to properly split extension 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":"presentation-compiler/src/main/dotty/tools/pc/completions/Completions.scala"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc97d570bc02fab2f08d6b6c26da93ee9497cd3c1619d0eac7094c442b1f8fc3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Get this value from \u0027import scala.scalajs.LinkingInfo.ModuleKind.WasmModule\u0027 \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":"library-js/src/scala/runtime/BoxesRunTime.scala"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"53dfa6ac1c969bfab5f0d89907b72267eb130f72ee9c31b03c3f9c69bec4ba01"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: bytecode Object.clone() will in fact work here and avoids \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":"library-js/src/scala/runtime/ScalaRunTime.scala"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"6951255550044777f5f43df953f2c08d8af23ad8a64e65cfc8734c5c2b2f835e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: bytecode Object.clone() will in fact work here and avoids \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":"library/src/scala/runtime/ScalaRunTime.scala"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"d099e7d320f7be801a331857759fed3ed8a541ef1f08fd5fa37f8ee2eb42ba2b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO undeprecated until Scala reflection becomes non-experimental \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":"library-js/src/scala/reflect/Manifest.scala"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9187858263669551c58dec1e8be3eeb2199961ffa5b9b38b3aa9d6bb0470a35"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO undeprecated until Scala reflection becomes non-experimental \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":"library-js/src/scala/reflect/Manifest.scala"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"713e9540b12a3373d8938833d7c5790062bf67a173bc03e37975adc4ac0ef700"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO undeprecated until Scala reflection becomes non-experimental \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":"library-js/src/scala/reflect/Manifest.scala"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"49a5b0fc27e3312a82c9cfcc2440431254e832b608a2387c77ec9755a0631734"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO undeprecated until Scala reflection becomes non-experimental \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":"library/src/scala/Predef.scala"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dc4f2abb74ce31c6453c1a7bde3db2ba56d4ef6b92626d7938f4bf44fa570a6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO undeprecated until Scala reflection becomes non-experimental \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":"library/src/scala/Predef.scala"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"da06dc62813ab5159de78b4aa8be136ac81b17605c7562f43fcaec0f386a2933"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO undeprecated until Scala reflection becomes non-experimental \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":"library/src/scala/Predef.scala"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"674846ab8d48796fe1f0cd145477eb424d1b1a91e2ad2b96bdc274c4d3b7d6d9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO undeprecated until Scala reflection becomes non-experimental \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":"library/src/scala/Predef.scala"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"868fea62a049085c1d00ed2a9e92fd25cb74d9c64d1d53d867e297903f2003e5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO undeprecated until Scala reflection becomes non-experimental \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":"library/src/scala/Predef.scala"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"37e1d458a3553435ae8afcbaf8d0c74aad57f589b47df6a3d83cc1d0a0046b9b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO undeprecated until Scala reflection becomes non-experimental \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":"library/src/scala/Predef.scala"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e9b06f66c48a5d5afd6dd7dcc433945a6bb9972dbc3060d9cad0f8b8d730ba7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO undeprecated until Scala reflection becomes non-experimental \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":"library/src/scala/reflect/Manifest.scala"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"30df6eed9d3f1345381a50acfd9fce17d7e0892bab692e2b9dff92051ae2790d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO undeprecated until Scala reflection becomes non-experimental \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":"library/src/scala/reflect/Manifest.scala"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"560c0a38fbd895c2f6152538181005d70912f1498d88f7479baa29b6b32cae25"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO undeprecated until Scala reflection becomes non-experimental \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":"library/src/scala/reflect/Manifest.scala"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"52bb6b7528caa5ec5959a2d1efe067e7c13fccb0aeb39eb80f9f562a6f74ca1d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO undeprecated until Scala reflection becomes non-experimental \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":"library/src/scala/reflect/NoManifest.scala"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"75fa856c05e0f59a3883335afb5b936448ef44afab22b8e54c9958010d74246d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO undeprecated until Scala reflection becomes non-experimental \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":"library/src/scala/reflect/OptManifest.scala"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"77980a64497aa2c11ab5a418814ada8f9277d9736b4e5c5b129cca2f7d841d59"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO Prepend is a logical choice for a readable name of \u0060\u002B=:\u0060 but it conflicts with the renaming of \u0060append\u0060 to \u0060add\u0060 \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":"library-js/src/scala/collection/mutable/Buffer.scala"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"897ba1e71d3117b2969496b82e4ec769fcb73807c47250134a2646bfb46a4fb8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO Prepend is a logical choice for a readable name of \u0060\u002B=:\u0060 but it conflicts with the renaming of \u0060append\u0060 to \u0060add\u0060 \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":"library/src/scala/collection/mutable/Buffer.scala"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"aff18e4914a86cb4f53e14c7c4d328323f35b3dc7afe766874efe9230c78a9df"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: these private methods are straight copies from Range, duplicated \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":"library-js/src/scala/collection/immutable/NumericRange.scala"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"d75311753b9397409f9fe5865a2632564bcdb57b048004998a5525813ff3ddeb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: these private methods are straight copies from Range, duplicated \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":"library/src/scala/collection/immutable/NumericRange.scala"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"f72502f7ad447cd97be87cf41d5f32b18390200b75f6e9b196d39d9b617990eb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: move to compiler tests, this is not stdlib testing \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":"library/test/tools/AllocationTest.scala"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"18cdff9a182e4f410792c4a5f4be50575ec254e11baa8b19222c69762d69eb4e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO: None of these currently work because there are no native Stepper implementations: \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":"library/test/scala/jdk/StepperConversionTest.scala"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"91155961aff8b1c281cb38b377b7460d650c312c160cd39cdcbd602defc60b38"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // Todo: test all sets/maps this way \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":"library/test/scala/collection/SetMapConsistencyTest.scala"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"9483f36f1555a5dbd2a0a26d8e6c4eef665eaf6b1b3c018824716881d5595d82"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Port {HashMap, HashSet}.concat allocation reduction \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":"library/test/scala/collection/immutable/HashMapTest.scala"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb1188aba9bc0f8fcd5e3975da83507b88244a91f8e5603cc80cdb16ec06be88"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Port {HashMap, HashSet}.concat allocation reduction \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":"library/test/scala/collection/immutable/HashMapTest.scala"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"85deb41f1f78eb81b0cd14fb2d755db03a80934fd7b3a8a88ca5dcd448790054"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Port {HashMap, HashSet}.concat allocation reduction \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":"library/test/scala/collection/immutable/HashSetTest.scala"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"980ce0a8c4c14dd8e66755b9847d6849777447883c7f3216d051c798cbf4e104"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Port {HashMap, HashSet}.concat allocation reduction \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":"library/test/scala/collection/immutable/HashSetTest.scala"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae84884ee1f6a0197d81306a349b40eb0cc794a34560174fbd7ec179132bafbf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Port {HashMap, HashSet}.concat allocation reduction \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":"library/test/scala/collection/immutable/HashSetTest.scala"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fa65bad102c00b333425aed6b213ca38f80c3116858ba6265b3610c6f0ac758"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Port {HashMap, HashSet}.concat allocation reduction \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":"library/test/scala/collection/immutable/HashSetTest.scala"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdcfc6e475e2a3fa8dc545054a5ab5911335374b27396320c222cb779ff81f17"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Port {HashMap, HashSet}.concat allocation reduction \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":"library/test/scala/collection/immutable/HashSetTest.scala"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3848c59a788f843e192a3858a08cf286e374d337857b6b7e35eec6891847245"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Port {HashMap, HashSet}.concat allocation reduction \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":"library/test/scala/collection/immutable/HashSetTest.scala"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"7884d8023f439ba4c2d10ac186ec87eff55818cb59bc885932ed6741c65c2568"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Port {HashMap, HashSet}.concat allocation reduction \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":"library/test/scala/collection/immutable/HashSetTest.scala"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9246b79b49004c0cdd2a58c3e828449c3e846c6998e0c0997d4d8474f2c9460"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Port {HashMap, HashSet}.concat allocation reduction \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":"library/test/scala/collection/immutable/HashSetTest.scala"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"5993a44f40090faf2485b259ada4f3d8dd03666ae938876052e483824e651a1c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Port {HashMap, HashSet}.concat allocation reduction \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":"library/test/scala/collection/immutable/HashSetTest.scala"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"213bf784735a881a67a474afffa2c082d62be6be5f769faf1455dc1e172cabdd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Port {HashMap, HashSet}.concat allocation reduction \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":"library/test/scala/collection/immutable/HashSetTest.scala"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdffa755df9ec7cdf5dbda1df4a969ea3a47cf490cff011c220e3ae75b7d1cfd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Port {HashMap, HashSet}.concat allocation reduction \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":"library/test/scala/collection/immutable/HashSetTest.scala"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"461fc19d9494feff6225af28b308dfe3665a9403708e357428076fb796fc43b2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: fill this out with all relevant LazyList 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":"library/test/scala/collection/immutable/LazyListGCTest.scala"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"352265c4b623a0f874e061a32cef8504626b77a9c7c33d20f8f579e5698f8173"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO: why not overload it with orElse(that: F1): F1? \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":"library/src/scala/PartialFunction.scala"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5b11197a03bceaab2c8eae9dbbc9f944b7395594851e71c17d1b71a5e288305"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: when dependent method types are on by default, give this result type \u0060e.type\u0060, so that inliner has better chance of knowing which method to inline in calls like \u0060implicitly[MatchingStrategy[Option]].zero\u0060 \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":"library/src/scala/Predef.scala"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a039935045451ff90b6ccd6c8a7114bdcbb7302e48c5b8764482e0bf87d50e4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: should not need @inline. add heuristic to inline factories for value classes. \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":"library/src/scala/Predef.scala"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b0d992c2cd133588135eb752e01e0bd8bdba27f2438e2778bce6833b70b2caa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove \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":"library/src/scala/UninitializedError.scala"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"8abe7dbb99083dd84bb46e564cc4ae902d7515954ea4f5800ea0e887c9e5ecaf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove \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":"compiler/src/dotty/tools/dotc/parsing/Tokens.scala"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d54ed4eb55c75d4b9770938ba2875b0f34e517026e886cd83dde4cd45852306"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: add upper bound: T \u003C: AnyRef, propagate to callers below (not binary compatible) \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":"library/src/scala/util/Sorting.scala"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0661ce58b4aaba99cccb7cb355b286f416d92676cebf5f06cd1b28353a8c530"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: make this fast for primitive K (could be specialized if it didn\u0027t go through Ordering) \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":"library/src/scala/util/Sorting.scala"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a526c05b9ba45f9dbf7f1ec3ea7954be04f399144b4261329133c8df0014a52"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: make this fast for primitive K (could be specialized if it didn\u0027t go through Ordering) \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":"library/src/scala/util/Sorting.scala"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"41d3dfcd4403a9c48296704afa80bf13a3b5b782ef4e1ab24725a7dcf92e8115"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: consider whether layering a Map on top of Java\u0027s properties is really needed -- we could simply provide: \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":"library/src/scala/sys/package.scala"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"51535f6ba18f03dbd0e3d718fd1ae59f4b9b72edf269bea0b15c6e80e8597e51"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: come up with a more realistic number \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":"library/src/scala/runtime/MethodCache.scala"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"629df775b199f1ffc50cc730f1960fc255ec0feeb715358fc1ccf5f149d0dd03"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // @annotation.nowarn(\u0022cat=lint-unit-specialization\u0022) TODO: Add warning back when specialization is implemented \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":"library/src/scala/runtime/NonLocalReturnControl.scala"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9e8300ee909cf505defe394d1e3b16471df5bfa3185c3105e323fd8cc9e97b1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO 3.T: move to \u0060Statics\u0060 \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":"library/src/scala/runtime/PStatics.scala"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"49c3454fa83793eae8c08ff1b752cbaab6ef21975a646ba96b5432802d2567b8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO use IArray.tail \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":"library/src/scala/runtime/TupleXXL.scala"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"12d4284b46f5d5a89e464795c253f54ab27045260f3e81bd1d6aa1dc1ecb95a4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO use IArray.toArray \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":"library/src/scala/runtime/TupleXXL.scala"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f5c34141b37cc8865e37d05af2fda6be67d30dbd44a0b4406ac527a52a997bb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO use Iterator.toIArray \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":"library/src/scala/runtime/TupleXXL.scala"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb5ea338aa209bb824cdad6135399222b87fc1a0af532d95f9e730c78b4e5c60"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO use Iterator.toIArray \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":"library/src/scala/runtime/Tuples.scala"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb376fc0caaff5b38ab4c9604b4681309d64be6e9ae2ebf5c71f094093349e22"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO use IArray.toSeq \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":"library/src/scala/runtime/TupleXXL.scala"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b04f0b8b4f6abb8d9c387f3039e4f333bc2f74f515f19691ee0f43101359a9a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO use toIArray \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":"library/src/scala/runtime/Tuples.scala"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"18bda000e306c56636f843e2791c67638f5d50e53f01ab607d9f95dc44a58c75"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: reduce duplication with and in StdNames \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":"library/src/scala/reflect/NameTransformer.scala"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"3075adad89cc459bc444622fbc43857bd92f7229c176f00d34d2cbdbb534c002"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: replace by \u0060canAccess\u0060 once we\u0027re on JDK 9\u002B \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":"library/src/scala/reflect/package.scala"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"67a86a6d14ea4a29bf350b2183eacc40e5ab61af4f818a3f96e163266d715e30"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo. once we have implicit macros for tag generation, we can remove this anchor \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":"library/src/scala/reflect/package.scala"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd65b2ab6165c062f706f4120d0a9cb2e3a365eece9c0057c187038644090ca2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO use proper zipConserve \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":"library/src/scala/quoted/ExprMap.scala"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"a88dd2102331f3c17167422dbe46dcb3be535c2bc888d172bae9824944112e73"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO add selfOpt: Option[ValDef]? \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":"library/src/scala/quoted/Quotes.scala"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"c789689a97a4be5be0c9660dac66d8ea4b31df353f46b8a68d9b2ffd94240274"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO add selfOpt: Option[ValDef]? \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":"library/src/scala/quoted/Quotes.scala"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"38f87fa8b2eb55651b57775d8b00ba601f8e2c1b06e57ece81c5d38bee9484e9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO update when we will have more tuples \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":"library/src/scala/quoted/Quotes.scala"},"region":{"startLine":5353}}}],"partialFingerprints":{"codehealthFindingId/v1":"a63b6adb33fae0c65d2a26be63d158c014f251f31377efa0c38e353742e74a67"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // @nowarn(\u0022cat=other-non-cooperative-equals\u0022) TODO: Implement the category \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":"library/src/scala/math/BigInt.scala"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"237f7b7baf94d1faa2f05feb706eccc63e4d0c5770a30760d0f71d3d3f745226"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: consider if NonFatals should simply be \u0060reportFailure\u0060:ed rather than rethrown \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":"library/src/scala/concurrent/BatchingExecutor.scala"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"479602035e8d29d04029370062d78a6def6f1c28cf1ed68020d008748dc8203e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Handle InterruptedException differently? \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":"library/src/scala/concurrent/BatchingExecutor.scala"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e7bdfbd34d3deca16449fc8a99fd9e9d45157dd356a75be824fcb2a00c94baa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Handle InterruptedException differently? \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":"library/src/scala/concurrent/BatchingExecutor.scala"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"264b4a967b3841ecd3e6931eacb6b48e689669e475bd17072461a0c7cf3b2661"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove this implementation and make Future#zipWith abstract \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":"library/src/scala/concurrent/Future.scala"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"eef5a1b7ee65e200112784f142594e3e73e2d2dad3a7938af265faa82e3c4f66"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use \u0060finally\u0060? \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":"library/src/scala/concurrent/Future.scala"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac6ff1edc5261e0dc4c36ecaae1788202c985b2327b2ad6f324bd73845c80a16"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO: Reuse a prototype instance \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":"library/src/scala/collection/BuildFrom.scala"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aad2a0cd508e697b16833d01b3e56f66f6a7bc023fca1264c64f72748665663"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO: Reuse a prototype instance \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":"library/src/scala/collection/BuildFrom.scala"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"04ddf1f4a531d4dc090cd900b3f504f6be6f587c88fca7d02500e76e8f5c3f28"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO is uncheckedVariance sound 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":"library/src/scala/collection/Factory.scala"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"2457c331e2133fec7673afa0bfe90a7431246571ba19dc12f5938ee7a2366210"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO is uncheckedVariance sound 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":"library/src/scala/collection/Factory.scala"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8e5355f5b65ab0ec9d3127e52b45e94e1f1d9048813cf1e62bf38ba7dd1ad99"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: seems like CC cannot figure this out yet \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":"library/src/scala/collection/IndexedSeq.scala"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ae5172494a54431d7468d723a5efb123a08974473b5a22c5085af10ed26f3fa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO will go away when buffer is fixed \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":"library/src/scala/collection/IterableOnce.scala"},"region":{"startLine":1523}}}],"partialFingerprints":{"codehealthFindingId/v1":"1adbaa9549dd198f3f78bb52b366d6fd046b70ce32387b1680b3c8408341e3f5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO We should be able to prove that origElems is safe even though it is \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/collection/Iterator.scala"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e78ec5dc5422e29121a07d5fd9ccbcfff7bc9a7d2bf1c3410bc78448ff04f20"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: I\u0027m not sure what\u0027s happening here, need to investigate a bit further. \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":"library/src/scala/collection/Map.scala"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f04b4bb721c29990018e14d171bb839b0677c07157db58eec32da4f555685c8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: W is originally Nothing in return type, but breaks CC \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":"library/src/scala/collection/MapView.scala"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6ed6b1f95dc5c13a5e8b029963bf8af019b46fe8b0b9bf88463ad72a3151ec9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO remove when pattern matching 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":"library/src/scala/collection/View.scala"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"390c6d565c91aa64f815485b99469ad64f9d3594244bf8db65087421dff7f179"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: return \u0060IndexedSeqView\u0060 rather than \u0060ArrayBufferView\u0060 \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":"library/src/scala/collection/mutable/ArrayBuffer.scala"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"d56f28c70c7e2cbb041e8eb11d71571e7a025d3403ea52b598f6701b4f85d5f3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use \u0060CheckedIndexedSeqView.Id\u0060 once we can change the return type of \u0060ArrayBuffer#view\u0060 \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":"library/src/scala/collection/mutable/ArrayBuffer.scala"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8083b47359f99855c07c520b874c9796f0c0e4162e4e5551b5a2471bf36064f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO: SeqOps should be fluent API \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/collection/mutable/ArrayDeque.scala"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f0777188f325cc8a30cf18b922d9315d2bd36f3a296b516f7a1303ed2a15922"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO \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":"library/src/scala/collection/mutable/CollisionProofHashMap.scala"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"0db663f40be5ed61e48e9a489e68da317bbbc14eb65aa45498ef88b6914d2e9d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO This causes a conflict in StringBuilder; looks like a compiler bug \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":"library/src/scala/collection/mutable/Growable.scala"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"78a563b20553f2a043419b4bd400b8971e207abf50105f246758952eef28643f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: rename to \u0060mapValuesInPlace\u0060 and override the base version (not binary compatible) \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":"library/src/scala/collection/mutable/HashMap.scala"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"520d05721e14dd8383eff3d6c3584306a6a441a53f1d712edf4007597dea3ab8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: override clear() with an optimization more tailored for efficiency. \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":"library/src/scala/collection/mutable/LongMap.scala"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfcef2707470813da4c2ec647f0cb87e2954f2c009788198b66362f69566cb07"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO should this be the default implementation of this method in StrictOptimizedIterableOps? \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":"library/src/scala/collection/mutable/LongMap.scala"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"926f03376974a7f348259bc4d05736f95786fa437196625b09489315758f4773"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO should this be the default implementation of this method in StrictOptimizedIterableOps? \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":"library/src/scala/collection/immutable/LongMap.scala"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a1c882d6b0ea8d3b2e17a84e9801fb562d325faf33f573bde52d04e4f30e17e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO PERF override these for efficiency. See immutable.LongMap for how to organize the code. \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":"library/src/scala/collection/mutable/LongMap.scala"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b613c083e8c5e15dd1e544ad34e29aa0a1ff9f2b51d783a79d106195ea8f0b5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: An empty capture annotation is needed in the result type to satisfy the overriding checker. \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":"library/src/scala/collection/mutable/LongMap.scala"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"0439ff363ae48407c4b304bd60c76bcf5be9e849d120db9ecbc986802a3c75a4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO consider keeping \u0060remove\u0060 because it returns the removed entry \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":"library/src/scala/collection/mutable/Map.scala"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b973175e3a6bbe4845fb7b26949dab20763823d0d76980c69f8d80c085617e8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO refactor \u0060put\u0060 to extract \u0060findOrAddEntry\u0060 and implement this in terms of that to avoid Some boxing. \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":"library/src/scala/collection/mutable/OpenHashMap.scala"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"314cca3b4744c03719822d1ef8dadb2b9f6571fd17596fc052ed8f37e4e97ddc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO find a way to assign a default 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":"library/src/scala/collection/mutable/UnrolledBuffer.scala"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"7972bf284867fe7662cd46c7e751b66901a25e083f11fa1cdb67e3d8296af25a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // Todo -- revisit whether inheritance is the best way to achieve this functionality \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":"library/src/scala/collection/mutable/UnrolledBuffer.scala"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c593424c82d8511b2e56d3f14d096703664dda1745aa3a0ba5e1e8070fdd176"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove all keys from the hashSet in a sub-linear fashion by only visiting the nodes in the tree \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/collection/immutable/HashMap.scala"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c22fe99a49940b2f2564ee4164d01f56a3035e87d1fb1e950e3f6c4f4e24200"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Develop more sophisticated heuristic for which branch to take \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":"library/src/scala/collection/immutable/HashSet.scala"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c57b16c205a5b6de06f5438226dae9deef2c983427cadcfd52869b62e910fa9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: When filtering results in a single-elem node, simply \u0060(A, originalHash, improvedHash)\u0060 could be returned, \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":"library/src/scala/collection/immutable/HashSet.scala"},"region":{"startLine":1093}}}],"partialFingerprints":{"codehealthFindingId/v1":"9496fbea30b7bedef39815ad8237bcfc6b42311fdaf75eaaa281baf4ed01046e"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: //hack to preserve sharing \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":"library/src/scala/collection/immutable/IntMap.scala"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee320c28f4515d39332c454d38c32f0efc73189d0e3602b4841cb56baca7dc4f"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: //hack to preserve sharing \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":"library/src/scala/collection/immutable/LongMap.scala"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"058ba97c6ee9f6dbcacd9e8ecd10e28a2aa3a36ea450febde45e6adc56e0d6a3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO This should be (xss: (collection.Iterable[A]^)*) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/collection/immutable/LazyListIterable.scala"},"region":{"startLine":1472}}}],"partialFingerprints":{"codehealthFindingId/v1":"e47e02c2c59c4b737518dc49a0b3fd987dcf71abdf84968421d796afd9afae89"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: uncomment once bincompat allows (reference: scala/scala#9365)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/collection/immutable/List.scala"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cb410ac39bf671bc5961ecb9c8709fe38a849ea57f4881a973893e438557bb9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //@SerialVersionUID(3L) //TODO Putting an annotation on Stream.empty causes a cyclic dependency in unpickling \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":"library/src/scala/collection/immutable/Stream.scala"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"e765134f4b4f1d7b85a2d561d198db61cc7d9e5527e81f9e5baeba9545519e72"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO consider writing a mutable-safe union for TreeSet/TreeMap builder \u002B\u002B= \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":"library/src/scala/collection/immutable/TreeMap.scala"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5b53bd1c16468949e1cb2d79f1b26c456072343a73b773e00a19ee412199960"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO consider writing a mutable-safe union for TreeSet/TreeMap builder \u002B\u002B= \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":"library/src/scala/collection/immutable/TreeSet.scala"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb04b31d323ea9f95561b2cb6a8a121f92d95fa289c73943d6e61988a3da427b"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // hack to preserve sharing \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":"library/src/scala/collection/immutable/TreeSeqMap.scala"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e4bd332c118dcb8e2619c0e18d3ddbe9aea20b1ef2c7b5d95717033ae98aacb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO add an implementation of a mutable subtractor similar to TreeMap \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":"library/src/scala/collection/immutable/TreeSet.scala"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f4e2ac960e7079bc94f7e338cd62e2ed290fbc38d70bd3590d9e0e273a26865"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO Make public; this method is private for now because it is not forward binary compatible \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":"library/src/scala/collection/immutable/Vector.scala"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1a5c3eb51ec3993b90a67226c7445550d0c8bd3271fa3c61ba8f73f9ef98421"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO Make public; this method is only private for binary compatibility \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":"library/src/scala/collection/immutable/Vector.scala"},"region":{"startLine":1689}}}],"partialFingerprints":{"codehealthFindingId/v1":"7202c6ad7388baa517c9760b74c6f9cb575a2bb6932a2f73b0e3617f3149f90c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove when pattern matching recognizes this is safe \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":"library/src/scala/collection/convert/AsScalaConverters.scala"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"57c3f6a166a7d3c46ffda97efba57bfb0d7abcf21fbd4dfa8c6ccd84ea1621ab"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove when pattern matching recognizes this is safe \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":"library/src/scala/collection/convert/AsScalaConverters.scala"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6c3c0cca2cdb48d295cc67a30a6ad1cdc503b02ad0afd7ca560dcab526825f1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove when pattern matching recognizes this is safe \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":"library/src/scala/collection/convert/AsScalaConverters.scala"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"69597ee5d0b713d2e7512564026589c492e23dd8cbf04decc9bd9ebc224b07d9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove when pattern matching recognizes this is safe \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":"library/src/scala/collection/convert/AsScalaConverters.scala"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"86cbf52415b761ad6447447d2952fa8cc9119f9ced53a070826d8fa6fa9e25d7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: make part of the API in a future version \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":"library/src/scala/collection/concurrent/Map.scala"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"d02dee8f4179ba052ff0283d8ef7bd6c72cfb7de4c90e6d9bffc98a8692fbfed"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: make part of the API in a future version \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":"library/src/scala/collection/concurrent/Map.scala"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b033fc1c565cb5f2e5d4aab2b0d9abfdf688e64b0bd24b2cc71f73639b549e5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO once computeIfAbsent is added to concurrent.Map, \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":"library/src/scala/collection/concurrent/TrieMap.scala"},"region":{"startLine":979}}}],"partialFingerprints":{"codehealthFindingId/v1":"7821876308484ae53d797cd0d354df18105f8254c2dbe87c34bf6df137825f74"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO in which package should this class be located? \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":"library/src/scala/annotation/MacroAnnotation.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"45f655566ddb6a9a74775a8287d7fc2f408186a877ae715c6afee7a073be8891"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove this once we migrate the test suite \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":"compiler/test/dotty/Properties.scala"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"707da5d87072e9fd550211dbe16c32357b42c7299aa3f5129d9e805697480ddb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove this once we migrate the test suite \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":"compiler/test/dotty/Properties.scala"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"19f22d9166fb99562c029f4c3adbb02738b948127060c98f1254f7f832f9fdce"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this won\u0027t work when using other versions of compiler \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":"compiler/test/dotty/tools/vulpix/ParallelTesting.scala"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d18174bfe88b3ab8a1db9b783a2603b3fab2af1f48c684dbe2e8d60f389fbf6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo a better mechanism than ONLY. test: -scala-only? \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":"compiler/test/dotty/tools/vulpix/ParallelTesting.scala"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"5003ab8909836b50709dc6432f23b5aaeb2cd1d4c7718a3f71d0a5478ecb97dc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: The \u0022suppress output\u0022 feature should do this on its own. \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":"compiler/test/dotty/tools/vulpix/VulpixUnitTests.scala"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"c93c1f67a341636475f30ae92a5ea3a3453964de78a4b1daa8ea9bbdb1291a5c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO reduce to limitThreads(1) if it still causes problems, this would be around 50% slower based on local benchmarking \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":"compiler/test/dotty/tools/dotc/BootstrappedOnlyCompilationTests.scala"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"64cb6aa84ca55adf34056dd9857097ad933f82f82a4f9eba936776f61870d3bd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO create a folder for capture checking tests with the stdlib, or use tests/pos-custom-args/captures under this mode? \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":"compiler/test/dotty/tools/dotc/CompilationTests.scala"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"27e206004c6596c3e937c0356373eee0d13016d2fe16329d912b88cad9984e05"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this test should be much simpler if we used source roots correctly in Vulpix and in Context.getSource, \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":"compiler/test/dotty/tools/dotc/CompilationTests.scala"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"873c2c30e0e71da827c2eb032be6010538d8977817071b837c94f56c354368b4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: fix compiler determinism for this to pass \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":"compiler/test/dotty/tools/dotc/DeterminismTest.scala"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"03604b60f68a72862b54205c03d73bc8d53f02b795a8d4ea940a1fdc9d9d52a2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: fix compiler determinism for this to pass \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":"compiler/test/dotty/tools/dotc/DeterminismTest.scala"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3745dfcbc2939b23049774261e175e8f955c0af3a17255e7375742f0cca6cc7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: test cancellation \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":"compiler/test/dotty/tools/dotc/sbt/ProgressCallbackTest.scala"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"73e66b18aae34c1f7cf1c9d99434d0d2b8905a74e7feea1cd8fc4bbc09dc0284"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO look into trying to remove the extra space that is left behind \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":"compiler/test/dotty/tools/dotc/reporting/CodeActionTest.scala"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"85eeb25845564222224a6f5fb5b29611ddac836b23d5e24760d23ecd210bff78"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: The same test in scalac uses different labels because their LineNumberTable isn\u0027t the same as ours, \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":"compiler/test/dotty/tools/backend/jvm/DottyBytecodeTests.scala"},"region":{"startLine":1054}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f49163fa2a098cbf399466e19ae8ea650388258da399cd2ab08c05a5c296836"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO move to cases \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":"compiler/src/scala/quoted/runtime/impl/QuoteMatcher.scala"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf8b7e8befab2deec7758c59d54fc319fce4ebb6a36e2e95e5191a0df3579f33"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO remove 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":"compiler/src/scala/quoted/runtime/impl/QuoteMatcher.scala"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"c946281feb97a33d62388453d0db0d4bf2ea3a888fd1bc8297cd3dc0b0591e24"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO match tpt1 with tpt2? \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":"compiler/src/scala/quoted/runtime/impl/QuoteMatcher.scala"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3df783070e52aa00b96245662855fc48488aba5d0aef6ecd964f5607745be7e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO-18271: Duplicate with QuotePatterns.unrollHkNestedPairsTypeTree"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/scala/quoted/runtime/impl/QuoteMatcher.scala"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c4d3fef542f2bbd7fb1521d37bd0a7465082ccc9a67abe3fedc9738ded15366"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Now, the name should alwas be a term name \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":"compiler/src/scala/quoted/runtime/impl/QuotesImpl.scala"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"c58cc9a5adb1de0c0812c2d390490dd7170c523f72b03f7478672dd8b749576b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO expose Quote AST in Quotes \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":"compiler/src/scala/quoted/runtime/impl/QuotesImpl.scala"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d5ddf132f438910ca64f62ca19c3bd1cb7cff5ad7e79fc288bcd7a595739e50"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO expose Quote AST in Quotes \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":"compiler/src/scala/quoted/runtime/impl/QuotesImpl.scala"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"432f81029c13368bf929d260d0023d2b7dd113f1a28dded08afaf6bbe4a4efa1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO expose Quote AST in Quotes \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":"compiler/src/scala/quoted/runtime/impl/QuotesImpl.scala"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"193550a8f18c23052af888c921065341f7b7ae4ce1b04135b2a79eb62b346de8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO expose Splice AST in Quotes \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":"compiler/src/scala/quoted/runtime/impl/QuotesImpl.scala"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee2b8bf62bcb2d0216725dfc724a3c85b5f88f3087ed76e7c9b4ad2620538f5a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO expose Splice AST in Quotes \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":"compiler/src/scala/quoted/runtime/impl/QuotesImpl.scala"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"2021a7366458bc72e16171c3a6b597345d4ff236948889d6ec96a7c42f3eee5f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO expose Splice AST in Quotes \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":"compiler/src/scala/quoted/runtime/impl/QuotesImpl.scala"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"725e8a0ce5bdf4a6142e2f6b9d5f64375f95e821137082e1af38041b0207803f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO expose QuotePattern AST in Quotes \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":"compiler/src/scala/quoted/runtime/impl/QuotesImpl.scala"},"region":{"startLine":1626}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5fbc30ebd45f2ed77687ba5b3f384b0211924d22717ee9cf531d60022c24071"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO expose QuotePattern AST in Quotes \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":"compiler/src/scala/quoted/runtime/impl/QuotesImpl.scala"},"region":{"startLine":1631}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1ba6a30a99db52b1a65819366051f65f21912a3d1d227ad2dc0e3911b43abf4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO expose QuotePattern AST in Quotes \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":"compiler/src/scala/quoted/runtime/impl/QuotesImpl.scala"},"region":{"startLine":1648}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3df188bb6d2e73a83faa2c688d6fa2164618f1c5f9cae47dad0adfe3f43ce7a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO expose QuotePattern AST in Quotes \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":"compiler/src/scala/quoted/runtime/impl/QuotesImpl.scala"},"region":{"startLine":1651}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4dc36d5ffe32b6f20912016a37279f7636930e26f7da5a057549e2e71e0c37f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO expose QuotePattern AST in Quotes \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":"compiler/src/scala/quoted/runtime/impl/QuotesImpl.scala"},"region":{"startLine":1654}}}],"partialFingerprints":{"codehealthFindingId/v1":"369c57201f5b86cefd48875f51b1a31cfd85c6d9a11cab640cbee4ff25c39a73"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: handle import bounds \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":"compiler/src/scala/quoted/runtime/impl/QuotesImpl.scala"},"region":{"startLine":1755}}}],"partialFingerprints":{"codehealthFindingId/v1":"575f4d8a358769bd6039712e2f50a1a537a3bdc15857cb95f4c30effdb7609d9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Replace with dotc.core.Flags.|(self)(that)  once extension names have stabilized \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":"compiler/src/scala/quoted/runtime/impl/QuotesImpl.scala"},"region":{"startLine":3367}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7082c7f8533ebeae271da01b3494a459f483470b41f50987c9581886714442c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Replace with dotc.core.Flags.\u0026(self)(that)  once extension names have stabilized \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":"compiler/src/scala/quoted/runtime/impl/QuotesImpl.scala"},"region":{"startLine":3368}}}],"partialFingerprints":{"codehealthFindingId/v1":"b90a745e6aa11f45b6229d3dd33a2bb32b6dfc2a3f0b41f8cec1297d7d56d4d2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO try to move this logic into \u0060printType\u0060 \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":"compiler/src/scala/quoted/runtime/impl/printers/SourceCode.scala"},"region":{"startLine":1007}}}],"partialFingerprints":{"codehealthFindingId/v1":"b284b0c50cf972f22bbc387d97bc843c877b0c1d4703675431cf113fac2b71c0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO should these be in the prefix? These are at least \u0060scala\u0060, \u0060java\u0060 and \u0060scala.collection\u0060. \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":"compiler/src/scala/quoted/runtime/impl/printers/SourceCode.scala"},"region":{"startLine":1110}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfe23e9110bc8a94008a28763776a8db497d2652502f1209ca4714468ffa127c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Provide some of these in scala.tasty.Reflection.scala and implement them using checks on symbols for performance \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":"compiler/src/scala/quoted/runtime/impl/printers/SourceCode.scala"},"region":{"startLine":1495}}}],"partialFingerprints":{"codehealthFindingId/v1":"e97e5e809942ae206481bf5f0514427aa0cb5e5136a22c9bfa3f172a46e4bb5a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Proper path support for VirtualFile, should be integrated with VirtualDirectory... \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":"compiler/src/dotty/tools/io/VirtualFile.scala"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd2fb0a32f4ae620ee57c7c0cc2810199623481b3a724d7049919ec7d1e7cca7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Initially InitialRunId - 1, so that the first nextRunId call would return InitialRunId \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":"compiler/src/dotty/tools/dotc/Compiler.scala"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1a894eab74e5dc3fd0f1e142934fe58a7dffc8263c87acd54502ba467f75c66"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This makes \u0060runContext\u0060 unusable after being reset. \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":"compiler/src/dotty/tools/dotc/Run.scala"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"aecca2a8baa2c6567d471371baf2141985b01c070cc257cda025fa324e0358f3"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: We can\u0027t just collect the classpath from arbitrary parent \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":"compiler/src/dotty/tools/dotc/util/ClasspathFromClassloader.scala"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a1a7142a6a305db90aaf9f2ee61b87615d26808d8c853efcbd42c1d4505263c"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: For Java 9\u002B, if the classloader is an AppClassLoader then use the classpath from the system \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":"compiler/src/dotty/tools/dotc/util/ClasspathFromClassloader.scala"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"4effe336b448eb593229fcafa2c6aff678263261816334877fa011fbe8d80df7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: It\u0027d be good to drop trailing whitespace 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":"compiler/src/dotty/tools/dotc/util/CommentParsing.scala"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b18171a43c3dde89f2248d759ee8ba5d107f17bd0b04cc4b82d721047034972"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: there is one in JDK 21, use it instead of this substring once that becomes the minimum version \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":"compiler/src/dotty/tools/dotc/util/Signatures.scala"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7d3debb2df7d6213e6a2909660a6d7f43160c0e15d605ddc7cfc9352d854e93"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO after we migrate ShortenedTypePrinter into the compiler, it should rely on its api \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/util/Signatures.scala"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"c396bab14ec0249faf6546506370d4aa95ae42009f253ee8f73638ef49b410c3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Add more checks 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":"compiler/src/dotty/tools/dotc/typer/Checking.scala"},"region":{"startLine":1715}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed486a7c0f4e0f1a6fcff736fd86ca98bf21405cc5d80c2d816e62cc04765982"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO do we need to check checkDeprecatedOvers(tree)? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/CrossVersionChecks.scala"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe5cce0f61429912657c15a1580caf3ba3cd7b6f0512ff25531a02c096d27fe0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: investigate why we can\u0027t TyperState#test 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":"compiler/src/dotty/tools/dotc/typer/Implicits.scala"},"region":{"startLine":892}}}],"partialFingerprints":{"codehealthFindingId/v1":"34068aa960ae60b657c74341f95ec83b100ca94f7e44a5c8acf79de916c7803f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //end best  TODO: re-enable with new syntax \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":"compiler/src/dotty/tools/dotc/typer/ImportSuggestions.scala"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f7369f78a7e08d7f4e6b423f18d9a9d39b01c68a23fa37bfa4f70595b2bf489"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // \u0026\u0026 !treeInfo.hasExplicitUnit(t)           // suppressed by explicit expr: Unit // TODO Should explicit \u0060: Unit\u0060 be added as warning suppression? \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":"compiler/src/dotty/tools/dotc/typer/Linter.scala"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"103baaef994f7801158b6f160009718e70942ed8cac98d4ef5817366419ba4e8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This probably needs to be filtered to avoid adding some annotation \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":"compiler/src/dotty/tools/dotc/typer/Namer.scala"},"region":{"startLine":1461}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c58085354d00242d6a7bb48c8760b92613980dbb7b50edeb434586db66eb88a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // AVOIDANCE TODO: Follow up why this happens, and whether there \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":"compiler/src/dotty/tools/dotc/typer/Namer.scala"},"region":{"startLine":1974}}}],"partialFingerprints":{"codehealthFindingId/v1":"6421f20a646b62914835f38450a55fa3659736a5a631f9c835e0e0a88ee03ff0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Look only at member of supertype instead? \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":"compiler/src/dotty/tools/dotc/typer/Namer.scala"},"region":{"startLine":2192}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec3c6c3f5cbe70605ead0c81caaf3c315468887ec05e0c73f1001782ca67dd55"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Add constant pattern if the constant type is not nullable \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":"compiler/src/dotty/tools/dotc/typer/Nullables.scala"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"e08fc99474889656e86ae6124d78b268a85fc9b0d0fc298f6a503b858a4fcce2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // specific after instantiation. TODO: Should we also use Wildcards for non-inline \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":"compiler/src/dotty/tools/dotc/typer/ProtoTypes.scala"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9e35d314d0195ca316bed3bdc2f671b1b834bdd059165f6257c97ba30b3b8b0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: investigate why flow typing is not working on \u0060targ\u0060 \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":"compiler/src/dotty/tools/dotc/typer/ProtoTypes.scala"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7541ab07b88524738d6f30949e7aec2feaa478d1c3a863ae00e24ae6a9f5d7a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO typecheck directly (without \u0060exprQuote\u0060) \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":"compiler/src/dotty/tools/dotc/typer/QuotesAndSplices.scala"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a39fc8e869074b1e769e5023484c7bf5ba2b1bb950862ce871e96a72985712f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO typecheck directly (without \u0060exprSplice\u0060) \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":"compiler/src/dotty/tools/dotc/typer/QuotesAndSplices.scala"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6712602354c56122fb869ed58f9c1b3ea4b7f2ae7c661c02f69b6888bd0306a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO support these patterns. Possibly using scala.quoted.util.Var \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":"compiler/src/dotty/tools/dotc/typer/QuotesAndSplices.scala"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"6987fecbbcc6ca0d1d70c03f202190173c74c24109699b31f276372f293e5ae6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: handle TypeBoundsTree, LambdaTypeTree as well as method parameters in DefTrees? \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":"compiler/src/dotty/tools/dotc/typer/QuotesAndSplices.scala"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd036e6e876f368a4a7d25fae943a11782ac4a4dc4cb5ab179302c1683eaa15d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: align accessibility implication checking with isAccessible in Contexts \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":"compiler/src/dotty/tools/dotc/typer/RefChecks.scala"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbcc60a842aa0fbdecc2bc360e53abe8509e6e3907f023851c3e1146ff7a3e8d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Should we exclude all refinements inherited from parents? \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":"compiler/src/dotty/tools/dotc/typer/RefChecks.scala"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"f80358d4a93236647005d973f55df41bc44001cc606c730ce208fb1c2b29ff76"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove quotesException once we bootstrap with 3.10. \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":"compiler/src/dotty/tools/dotc/typer/TypeAssigner.scala"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"62f11ba7f847b7e0d064593611c80e07623059ca20436743bf153c88efef2df8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO drop once we bootstrap with 3.10 \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":"compiler/src/dotty/tools/dotc/typer/TypeAssigner.scala"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"464aaa444e06b798f7ed15681130ec424c55562cc2f6512036f18b54a572d167"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#8680): Quoted patterns do not support Array repeated arguments"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/Typer.scala"},"region":{"startLine":1378}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a792d918ae001ebd9094e8349306eaf6f61f0223c12bb12193d3c8327986b46"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // and would not pass Ycheck. We have to use a cast instead. TODO: follow-up why \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":"compiler/src/dotty/tools/dotc/typer/Typer.scala"},"region":{"startLine":1657}}}],"partialFingerprints":{"codehealthFindingId/v1":"96bd215c712a07955e500a2994583bdd19548d5daa757ede8a19d4cd927e3149"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: move the check above to patternMatcher phase \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":"compiler/src/dotty/tools/dotc/typer/Typer.scala"},"region":{"startLine":2330}}}],"partialFingerprints":{"codehealthFindingId/v1":"822052c80a48c36b410db779a22760654da98d98cdde4125fabfbe12a750a71f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: get clarity whether we want to enforce these conditions \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":"compiler/src/dotty/tools/dotc/typer/Typer.scala"},"region":{"startLine":2759}}}],"partialFingerprints":{"codehealthFindingId/v1":"78f2ec3bf716596910257a10f549e5c0ba316bdab51dbc96ccf3cddf3edecd93"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //todo: make sure dependent method types do not depend on implicits or by-name params \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":"compiler/src/dotty/tools/dotc/typer/Typer.scala"},"region":{"startLine":3294}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccfdce8dada025af7dc54079f8f164ef67bab3a529a50a2ddf830cbd4c783f76"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo later: check that \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":"compiler/src/dotty/tools/dotc/typer/Typer.scala"},"region":{"startLine":3666}}}],"partialFingerprints":{"codehealthFindingId/v1":"d00cf659bf83d5fc49a819eff458e286adee368e2d7cec76ab33aa263e3af708"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Not clear that hiding is what we want, actually \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":"compiler/src/dotty/tools/dotc/typer/Typer.scala"},"region":{"startLine":4083}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dc79332ea86a4e73fcd85265e085c241831156f80d150a4ee87559ae34abaea"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: report NotAMember instead, but need to be aware of failure \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":"compiler/src/dotty/tools/dotc/typer/Typer.scala"},"region":{"startLine":4527}}}],"partialFingerprints":{"codehealthFindingId/v1":"18f6425c5dfee22191ce6150c17a6c4f408533099a07f0612e7b35a52ae01cd7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // is thrown. TODO Find out why the bad typer state arises and prevent it. The try-catch \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":"compiler/src/dotty/tools/dotc/typer/Typer.scala"},"region":{"startLine":4738}}}],"partialFingerprints":{"codehealthFindingId/v1":"d23731b70151532ebf157d61603fa2771ab963d5c3df09d324b639e14558b8a2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO check that call is to a method with valid signature \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":"compiler/src/dotty/tools/dotc/typer/Typer.scala"},"region":{"startLine":5477}}}],"partialFingerprints":{"codehealthFindingId/v1":"88f653b94fde72b77e2dd4c94fc961df6403c657ea0f088ec9a6e80398a5bfb4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO use an import or shorten if possible \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":"compiler/src/dotty/tools/dotc/typer/VarianceChecker.scala"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8832c3d07a02cd140b017a6e165be44abe53d69afa454f08bb1b385a40c544c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO need to use a \u0060:\u0027 if annotation is on term \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":"compiler/src/dotty/tools/dotc/typer/VarianceChecker.scala"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb152e6fc531a7f2fe61fc9417a06cb35a41d660752a9359e7c7f8fffbe11391"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: should we exclude all synthetic members? \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":"compiler/src/dotty/tools/dotc/typer/VarianceChecker.scala"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"12f4727e6ff8e85d61f6e5389b2184efea893204a72d16e4c2a123098ef3699b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: create a proper accessor for the private constructor \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":"compiler/src/dotty/tools/dotc/transform/AccessProxies.scala"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"396236ef2397bb89030d655e3b8378ab17afe22b3115bddda18c4f9ef617f7af"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO is this a code path \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":"compiler/src/dotty/tools/dotc/transform/CheckUnused.scala"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa0286a4f99bb724319476effb2e9d9f2ed2fa820debc98922d99aa355912893"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo improve to include offset of next line, endline \u002B 1 \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":"compiler/src/dotty/tools/dotc/transform/CheckUnused.scala"},"region":{"startLine":889}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4c53f0c701ee1433f2b0018f9e2a33bca56e66322591e3b5fa18f527164b863"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO improve to use class path or reflect \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":"compiler/src/dotty/tools/dotc/transform/CheckUnused.scala"},"region":{"startLine":1088}}}],"partialFingerprints":{"codehealthFindingId/v1":"b29d215969dcf560bd0d53653c6b79b9ffacbc6cb6e6881656490ad32118ebda"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this happens to work only because Constructors is the last phase in group \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":"compiler/src/dotty/tools/dotc/transform/Constructors.scala"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fc06839e9eda6c18ac2b56e3c5f5efaed710ed506249c9c9eacbb9c30647ac5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Show errors where they actually show up in the inline trait and not at the type of the user \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":"compiler/src/dotty/tools/dotc/transform/DesugarSpecializedTraits.scala"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d34c407d113ec978dcbab9d7cb5b44d0818a587e2e25277dd5d232b175f5b36"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: I reckon to get the best miniphase style processing we can do everything except \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":"compiler/src/dotty/tools/dotc/transform/DesugarSpecializedTraits.scala"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"99cb1199cf69b63fef7fda66d98e379a36ea2e43cd2cd15dcc36d786a93cccd4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Do we want to compress this more by adopting e.g. specializedTypeNames from scala 2? \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":"compiler/src/dotty/tools/dotc/transform/DesugarSpecializedTraits.scala"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"a329988e7a8f2a3ec06f933e965e66126affeffb36af843327173425dfda067e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // erasure. TODO: Verify that this is OK. \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":"compiler/src/dotty/tools/dotc/transform/ElimErasedValueType.scala"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7bf938fd92c4ce01f08aeebb674272b484a005282700951e5031c2504610c77"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: define derivedSymDenotation? \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":"compiler/src/dotty/tools/dotc/transform/Erasure.scala"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"60fa2decbbbdb68285ddbf296022528f87db737f39cedf2f1f54d030f2f5c1f8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: replace with assertion once pattern matcher is active \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":"compiler/src/dotty/tools/dotc/transform/Erasure.scala"},"region":{"startLine":1238}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f40b6fd119379f60505ad8d7104ab523455cfa6f8e2fe38c458d63a15200bcf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: should we test absolute paths instead? \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":"compiler/src/dotty/tools/dotc/transform/ExpandPrivate.scala"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"88ba68cdce3fae7d964aac6ba621ac0b7a772ca4d7eb21785171aadbc7f40455"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: check that when transformation finished map is empty \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":"compiler/src/dotty/tools/dotc/transform/ExtensionMethods.scala"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd8d1cf5e66bf5c9107ac2a067f3fb35b7da0a156aaef53335d5a7b0d574931e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME use toStatic instead? \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":"compiler/src/dotty/tools/dotc/transform/ExtensionMethods.scala"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"646eacc5449fec6482fb71626efbfdb83acc2810290be64f02fdc0145cb61cbe"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO merge with BetaReduce.scala \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":"compiler/src/dotty/tools/dotc/transform/InlinePatterns.scala"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3290affcfdfae60a8432c2b238e23afe950ca15b95d9ad33f584c6757dd5eaf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: figure out why pos.end can be out of range, e.g., in \u0060tests/run/targetName-modules-2\u0060 \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":"compiler/src/dotty/tools/dotc/transform/InstrumentCoverage.scala"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a3ed48f82ba5f85b13104c9eb423a166e4f2cdd3e08a442d584f4b383df7f12"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: add missing cases from scalac \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":"compiler/src/dotty/tools/dotc/transform/InterceptedMethods.scala"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"f70c4cf67c5b2ebb17ffe9d2c722b7d7cc35455f7fa12b2868398fac452a9d91"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement Unit-typed lazy val optimization described below \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":"compiler/src/dotty/tools/dotc/transform/LazyVals.scala"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1a746a103aa3a130de8d0c7401af5d670c5593d8fa398944ad1462b026498f4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove when scala.annotation.MacroAnnotation is no longer experimental \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":"compiler/src/dotty/tools/dotc/transform/MacroAnnotations.scala"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ef487bd6340c5a0cdd8f2256bc623a3d9dea3c7d2aff6cf0987e37f88ecf913"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Make this error handling stronger (no error handling at the moment) \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":"compiler/src/dotty/tools/dotc/transform/MacroAnnotations.scala"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"a321be9974a47f60ec5eced1ba7c95847c38971e0af6bf1851e591ef312fdd61"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove when scala.annaotaion.MacroAnnotation is no longer experimental \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":"compiler/src/dotty/tools/dotc/transform/MacroAnnotations.scala"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"23c0414b6fa9a742b591dd2d5d1210c0787c8ece6f2d79531452da65992790a3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Replace this case when scala.annotation.MacroAnnotation is no longer experimental and reflectiveSelectable is not used \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":"compiler/src/dotty/tools/dotc/transform/MacroAnnotations.scala"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"26c58e19c497f16d34c806a5427a8945d20bc26875820b1b8b460f7cf78c731c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Find out why TraitSetterNames can\u0027t be defined over QualifiedNames \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":"compiler/src/dotty/tools/dotc/transform/Mixin.scala"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"dceb919b145fc3744ad39a81ecbc112dece74b3200afa23d67b9c860577c9e34"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Drop Case once we use everywhere else \u0060isPatmatGenerated\u0060. \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":"compiler/src/dotty/tools/dotc/transform/PatternMatcher.scala"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fc63edfd71a25e39701e9e4defdfa158a7d82dcd599661647ee931def0117f8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO factor out duplicated logic in Splicing \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":"compiler/src/dotty/tools/dotc/transform/PickleQuotes.scala"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"4db77f751d96a48db851a26f7679eacf5714e847f8ce8cfeba18cfb8299b1ffb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO should all constants be pickled as Literals? \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":"compiler/src/dotty/tools/dotc/transform/PickleQuotes.scala"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"6798531e65e8cf648ebe3fc916ea9fb42e23467c9a8a7cc176ea1edfbd1897c4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: beta reduce inner closure? Or wait until BetaReduce phase? \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":"compiler/src/dotty/tools/dotc/transform/PickleQuotes.scala"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"13e4b759bf8356d0508a7064ba659ab025c1657cca15498ebb36f57d3b881589"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: later we may want outline for Scala sources too \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":"compiler/src/dotty/tools/dotc/transform/Pickler.scala"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"037f237fa63859965b478356c271c0a9cb26c8e8690b53f9d259aaad7fe0f993"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO fill in \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/PostTyper.scala"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac070008214d8de9dc065a4759aae4ff4f9c32e3b8c550c7822e9b75225d29f5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO move CaseDef case lower: keep most probable trees first for performance \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":"compiler/src/dotty/tools/dotc/transform/PostTyper.scala"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"2826d7d3b9e8105108eef9d41b33659508e08321066c33a3f3a0cf3429b4169e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: investigate what goes wrong we Ycheck directly after rechecking. \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":"compiler/src/dotty/tools/dotc/transform/Recheck.scala"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"e21829d5249d5d11d40098ad48cbaba6cf3e1a05965602460940066ffa624581"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Should we allow for completers as for ValDefs or DefDefs? \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":"compiler/src/dotty/tools/dotc/transform/Recheck.scala"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"55ce88bba106c7d751ecbf192df8f23cd998221a0b14b65d88b41997a71a6a90"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: check that things are inlined properly \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":"compiler/src/dotty/tools/dotc/transform/SpecializeInlineTraits.scala"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"15328bc41a6b44e17e960ac2acd7ced48d770481947b4101c37d737ea15d6423"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO suggest use of @binaryAPI once we have the annotation \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":"compiler/src/dotty/tools/dotc/transform/Splicer.scala"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"e565cc527c0a17e7fd222a0ec51c1310d20ea20c8530ab91cfb8ae02ff4739ca"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: add to the context \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":"compiler/src/dotty/tools/dotc/transform/Splicing.scala"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"169aa2f9feb72bed8346c610f1ad3e2e9f530ae9a622ba8612b559b291acc558"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: want to report this error on \u0060tree.nameSpan\u0060, but \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":"compiler/src/dotty/tools/dotc/transform/TailRec.scala"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b505bc1e595c6f252901f603af1bf4213280add37ce4274c56c1cc8494bd66f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO CHECK. Check that we are bootstrapped \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":"compiler/src/dotty/tools/dotc/transform/TreeChecker.scala"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e66b064ebc1f742165d7078b2d10b241ec41fcc7bee45ce8dc0a70470c788d2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: compare trees inside annotations \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":"compiler/src/dotty/tools/dotc/transform/TreeChecker.scala"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"6207df3b6094a7aa14647504e73cdb88912c9a31629fb4b6805429f2575bf4aa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO add check for module initialization after erasure (LazyVals transformation) \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":"compiler/src/dotty/tools/dotc/transform/TreeChecker.scala"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c81f5e08f2821f0dc12e92c39b252eaa0036a14422929f48fe9ec45ebceb67a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO should this code be here? Or assert(size \u003E specializedSize) \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":"compiler/src/dotty/tools/dotc/transform/TupleOptimizations.scala"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0212019973ca7f6e5a69f83321ef89fc6286ae8208d8bd79e96be2d988ca632"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO outline this code for the 22 alternatives (or less, may not need the smallest ones)? \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":"compiler/src/dotty/tools/dotc/transform/TupleOptimizations.scala"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd0328ce103be5b14838a5634fe8a595d5d32d9f1ed2d294bea657967559ae75"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO also check types, currently we do not add Inlined(EmptyTree, _, _) for types. We should. \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":"compiler/src/dotty/tools/dotc/transform/YCheckPositions.scala"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"97f9d89038d0ad925e4b3a97e931eb31c454c0b9c49e43b33f5cbe08b2eb6112"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO check inline proxies (see tests/tun/lst) \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":"compiler/src/dotty/tools/dotc/transform/YCheckPositions.scala"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"16908d80783d644b1da96e5db4e9cc6d3040145da9448daf3ca99c57871b049e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // bindings.foreach(traverse(_)) // TODO check inline proxies (see tests/tun/lst) \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":"compiler/src/dotty/tools/dotc/transform/YCheckPositions.scala"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4f95c5a1c0b07c2d2e8f9624f2c534a38d519a1a2b39ddee9a3b7096b22e3e5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME macro implementations can drop Inlined nodes. We should reinsert them after macro expansion based on the positions of the trees \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":"compiler/src/dotty/tools/dotc/transform/YCheckPositions.scala"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"63fa6ee97c822c92adcdadbecc9a7453e8ae0a33216d33c25c5261e50e0bb297"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME The patched symbol has a different source as the definition of Predef. Solution: define them directly in \u0060Predef\u0060s TASTy and do not patch (see #19231)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/YCheckPositions.scala"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"129ee9bd38d07712e42d43390d25b67051b711a38b9614b0bdc89896314817c9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO remove this distinction once Inline nodes of expanded macros can be trusted (also in Inliner.inlineCallTrace) \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":"compiler/src/dotty/tools/dotc/transform/YCheckPositions.scala"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"d00c17b05399e5adbf32b715a1491e181fa13292a81554ffa187829b2344f5ee"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Warn for known duplicate property names \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":"compiler/src/dotty/tools/dotc/transform/sjs/PrepJSInterop.scala"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1e4aa283586be2911eb92b6682c41be4a7d8ef28c114184de2dcfef74ca60a2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO: remove once there is less restrictive bincompat \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":"compiler/src/dotty/tools/dotc/transform/localopt/StringInterpolatorOpt.scala"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a5510b6c33388560ffd17e14f44c6d3cdd77834f8bf79e7c8c5c5441e5a766"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this should really be an annotation on the rhs of the field initializer rather than the field itself. \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":"compiler/src/dotty/tools/dotc/transform/init/Objects.scala"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9888a186473f816aec755cf1055d560f9dc6aa21689ec1dd2076b3724b0100c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: rename it to reflect that it is key to the heap \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":"compiler/src/dotty/tools/dotc/transform/init/Objects.scala"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"456029f50046adda4d2e687fe4ba228c344adbe2c57465370be960a592470267"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: try to remove packages \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":"compiler/src/dotty/tools/dotc/transform/init/Objects.scala"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e0855cd3f5c914a605e03b84a20f78ab0bcf07eb8f06c36dff7178d45100416"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: do garbage collection on the heap \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":"compiler/src/dotty/tools/dotc/transform/init/Objects.scala"},"region":{"startLine":1562}}}],"partialFingerprints":{"codehealthFindingId/v1":"3759a23c959886e5281b8ca12ead0ac3703c6404a5b5335ea57dea6ed11c714e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO:  disallow \u0060var x: T = _\u0060 \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":"compiler/src/dotty/tools/dotc/transform/init/Objects.scala"},"region":{"startLine":1612}}}],"partialFingerprints":{"codehealthFindingId/v1":"edb96e47c96f17e844f820b7f73641cfb35384ebdb6684c4477c7d8f40f55dad"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO:  disallow \u0060var x: T = _\u0060 \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":"compiler/src/dotty/tools/dotc/transform/init/Semantic.scala"},"region":{"startLine":1260}}}],"partialFingerprints":{"codehealthFindingId/v1":"978bb2cbbc17ad518547f25deeccd9c16daf522a48ef50e62c9659c9e5894a56"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: refactor the code of product sequence match, avoid passing NoType to parameter elemTp in evalSeqPatterns \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":"compiler/src/dotty/tools/dotc/transform/init/Objects.scala"},"region":{"startLine":1927}}}],"partialFingerprints":{"codehealthFindingId/v1":"87fb61b542a70b35ce8858b0f44fcd74f0c660ae2dead4f0d6af9d5a2500c364"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: receiverType is the companion object type, not the class itself; \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":"compiler/src/dotty/tools/dotc/transform/init/Objects.scala"},"region":{"startLine":1962}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc6aa56455dcf5289f5ce7049bf0c17d0c807de150d550d4bf6847ef8636028e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: store the parent objects and resolve \u0060p.this\u0060 for parent classes \u0060p\u0060 \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":"compiler/src/dotty/tools/dotc/transform/init/Objects.scala"},"region":{"startLine":2155}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f23d279951b74852c17a99456f8d440fd33acec8decaf73c28d4b418d307e66"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: improve performance \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":"compiler/src/dotty/tools/dotc/transform/init/Semantic.scala"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbfaac8cb5326299410d734e00849c64ccc89d3549fcb6f38ace997f495d288c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Improve promotion to avoid handling enum initialization specially \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":"compiler/src/dotty/tools/dotc/transform/init/Semantic.scala"},"region":{"startLine":1643}}}],"partialFingerprints":{"codehealthFindingId/v1":"44c31dc1ce1f00f8f88e09ddeba10e4d22a769ac2aa27f53bb790545e4e184c1"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // hack for inline code \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":"compiler/src/dotty/tools/dotc/semanticdb/ExtractSemanticDB.scala"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"b08aef1baca7972c631e9f90fb8279bff52ad9fe3761f40ccc56f16e85d7c050"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO - need to check how to implement this properly \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":"compiler/src/dotty/tools/dotc/semanticdb/SemanticSymbolBuilder.scala"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bc957df98386b6e1ff25bbc2ccf3781233930e37ad72777caf9145296a53593"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO - need to check how to implement this properly \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":"compiler/src/dotty/tools/dotc/semanticdb/SemanticSymbolBuilder.scala"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"701bf30282d2d06f97224981b5bb3022cd60a388cf018ccb4b728c9e64986d36"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //todo: labels is not supported \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":"compiler/src/dotty/tools/dotc/semanticdb/internal/SemanticdbInputStream.scala"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e62ce2bf5ccd42f561047040afc100ea2077fb177c58b8845ec6f8c67530793"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(martinrb): We could save a pass by validating while decoding. \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":"compiler/src/dotty/tools/dotc/semanticdb/internal/SemanticdbInputStream.scala"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"18841a9395a5326a54171fdfb8d2eae94edc57074d581db5572941e07b4a20e0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We shouldn\u0027t have to compute inherited members. Instead, \u0060Structure\u0060 \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":"compiler/src/dotty/tools/dotc/sbt/ExtractAPI.scala"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"627bf5396ce3e1b01544cb190672a99131c8e238415ec578005e83513b47efa5"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // Hack to represent dotty types which don\u0027t have an equivalent in xsbti \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":"compiler/src/dotty/tools/dotc/sbt/ExtractAPI.scala"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"b37268aee399eecd11570cf2ff8c23c253cc7affdc9ca06849c8f1dcab956045"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Never dealias. We currently have to dealias because \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":"compiler/src/dotty/tools/dotc/sbt/ExtractAPI.scala"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"a78b601e86eb0ce0ada8889ffcd16df147bb5ac3d465cd37c9592176503b53d8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Distinguishing parameters based on their names alone is not enough, \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":"compiler/src/dotty/tools/dotc/sbt/ExtractAPI.scala"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"f57644bb5b004fa0817f9e959b51d2916fdd2d8ad24ae0ded6d47486cbfba4cf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: The sbt api needs a convenient way to make a lazy type. \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":"compiler/src/dotty/tools/dotc/sbt/ExtractAPI.scala"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa002d9d623458dd355467f615d47d64c2ab18907d0676f4f3a5b8049da06ed2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: If \u0060p\u0060 is a tree we should probably take its type into account \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":"compiler/src/dotty/tools/dotc/sbt/ExtractAPI.scala"},"region":{"startLine":835}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ae2408124e976e8ead664942fdcbb8cafa292ebf6b348e29d916a3065637956"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Add a \u0060Phase#runsBefore\u0060 method ? \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":"compiler/src/dotty/tools/dotc/sbt/ExtractDependencies.scala"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ea3f62693e1eebe3fac4edcbc5c28cc26ad3ae54ece4e27b9ef8560373931f2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: ideally we should avoid unnecessarily caching these Zinc specific \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":"compiler/src/dotty/tools/dotc/sbt/package.scala"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddf319260c2b13ecc8ac09085be102e0669a1e474c8f9a0f1d0c643a6e6ac6c7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: show 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":"compiler/src/dotty/tools/dotc/reporting/Diagnostic.scala"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"a29ef3a46f5a7ddb60df695312f6d1ee5eb83d183a70836a194de31617bf8b0f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // this happens in dotty.tools.repl.ScriptedTests // TODO add name of source or remove \u0060:\u0060 (and update test files) \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":"compiler/src/dotty/tools/dotc/reporting/MessageRendering.scala"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bd1f9672eaca48fcfd8f21487c0afd3538aad891a4a23f167981fe435076af0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: don\u0027t split on escaped \\\u0026 \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":"compiler/src/dotty/tools/dotc/reporting/WConf.scala"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"05be4e64b66a61c3bac4fce86ce5f93906ababb85413934577d28c7d9ae3228b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME also handle SynthesisFailure \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":"compiler/src/dotty/tools/dotc/reporting/messages.scala"},"region":{"startLine":3297}}}],"partialFingerprints":{"codehealthFindingId/v1":"3074384a7a025f2b0ad026d96cd3b0d28f4b08e17ef52452f52440ea96162656"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO upgrade to a full type tag check or something similar \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":"compiler/src/dotty/tools/dotc/quoted/Interpreter.scala"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"97643c13f65b4d5e86468551ff3f5a26d3b11e79c997ab752b4bc2dc43e48fe4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO disallow interpreted method calls as arguments \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":"compiler/src/dotty/tools/dotc/quoted/Interpreter.scala"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"8706067cc57248b253b5c5e0dd179e81b95260acf2fadf4b8537fa822f3cf36b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: The first assigned runId is equal to 2 instead of 1 (InitialRunId). \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":"compiler/src/dotty/tools/dotc/profile/Profiler.scala"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dd6c384e6ee7068cf7aebafc577df0d76cecf61d80dd5415e80311ee14be7e7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO move underlying type to an addendum, e.g. ... z3 ... where z3: ... \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":"compiler/src/dotty/tools/dotc/printing/PlainPrinter.scala"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d2ec2e6d8e5d8c0b2da90cc474ad74c1602ceb0eafe5d7a7134477df0d39f0c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Better printing? USe a mode where we print more \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":"compiler/src/dotty/tools/dotc/printing/PlainPrinter.scala"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"26cacbfe8969a4861d551fdf02b0da1cc7a3cde641daa171a8c917f890dee367"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX Return to this once we have more ARM support \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":"compiler/src/dotty/tools/dotc/plugins/Plugin.scala"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a4297e3f94c1bd75c78a2cfeb3fd71884a4d7f263249ee8d0b1a461c600272f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: syntax.md should be adjusted to reflect the difference that \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":"compiler/src/dotty/tools/dotc/parsing/Parsers.scala"},"region":{"startLine":4778}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7142431dceed8d7f9334bc91975486c578dfe6e76b2e208aa68bd3cd8f846df"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // A final modifier means the local definition is \u0022class-like\u0022.  // FIXME: Deal with modifiers separately \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":"compiler/src/dotty/tools/dotc/parsing/Parsers.scala"},"region":{"startLine":5229}}}],"partialFingerprints":{"codehealthFindingId/v1":"40e8ed45fed47cd00b81b2a8286589e516d5d2643ffe94c1586645e2bef37bcc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //inline val QUOTEID = 13;        enter(QUOTEID, \u0022quoted identifier\u0022) // TODO: deprecate \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":"compiler/src/dotty/tools/dotc/parsing/Tokens.scala"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"d409966722ba616816ca2e93785c9447b67ea8a28b4125165ecce8537bf9387c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //inline val FORSOME = 61;          enter(FORSOME, \u0022forSome\u0022) // TODO: deprecate \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":"compiler/src/dotty/tools/dotc/parsing/Tokens.scala"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"92b9a7e922b69a4cec6d0ee59ff4fc8ad8ee5f491278447b1f44fbbd9f6ef131"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: deprecate \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":"compiler/src/dotty/tools/dotc/parsing/Tokens.scala"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"36a5f5e39c925dce3f6132f2c40d85cfe297622a050ccd6e7ca4536eff415850"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: deprecate \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":"compiler/src/dotty/tools/dotc/parsing/Tokens.scala"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f2b8ea0a53ba1a1b5df0a6a2a94bca6278d274e4b6dcc12f17a01f93ebea186"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: deprecate \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":"compiler/src/dotty/tools/dotc/parsing/Tokens.scala"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"403ee7337d222cfc061218ca65569831ada1a38c4b167d84f1f718707875fe67"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: drop QUOTEID when symbol literals are gone \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":"compiler/src/dotty/tools/dotc/parsing/Tokens.scala"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4433b5ed1caa9f7cd3ba86e4d87c91261081d46673c39ca835b0ee16d7bec47"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX this is where we\u0027d like to put Select(value, nme.toString_) for #1787"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/parsing/xml/SymbolicXMLBuilder.scala"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"90b926fcfe15bd1f09b3c039dacea5cd4e2a4de4642c006e99c473f1e76b4cf4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Figure out what phases should be run in IDEs \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":"compiler/src/dotty/tools/dotc/interactive/InteractiveCompiler.scala"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"f59543b24fddf0e8f0bdf0b8310a85fb10bc4d1526bde05ce874868f3a500b80"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Merge with NameTree#namePos ? \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":"compiler/src/dotty/tools/dotc/interactive/SourceTree.scala"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"996ba0b497066f3f2fbbc58d59bc9dfaa14a12c4ae5a4c003e01d4696440c640"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This is incorrect in some cases, like with backquoted identifiers, \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":"compiler/src/dotty/tools/dotc/interactive/SourceTree.scala"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3d4cf53d3718f501b37e8c7c79b89edf480e1291ae4966da931aade79735524"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: No SourceFile annotation on SourceFile itself \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":"compiler/src/dotty/tools/dotc/interactive/SourceTree.scala"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"84eb37bd1b880a59a6c2f2133e9eb250c44e852a1b680fccc2d84f71cfd4c0e9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We cannot deal with external projects yet \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":"compiler/src/dotty/tools/dotc/interactive/SourceTree.scala"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"b93b79937cb0c9b386b581d89222c539dcd3a0ff8e14c01aff89ea7498d4f745"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO is this the correct span \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":"compiler/src/dotty/tools/dotc/inlines/Inliner.scala"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad3b03672d5110d19aaee7f5e989d9dd5f1b39a44624be9cdc73675586678e66"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO this might not be useful if we do not support #11291"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/inlines/Inliner.scala"},"region":{"startLine":1154}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c1fd933bbbd8beb83d09f18923ddce2888fa1becb0054172e033514a2fdd5fa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We need to stop inlining if there is a non-inline trait or class that sits between the inline trait and the current class. \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":"compiler/src/dotty/tools/dotc/inlines/Inlines.scala"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d71b5e1a5f057e0549d398b6ac83acbc16b41c0a25c7a7f0711f9d7d7a3e0ce"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This inlines also some calls to inline defs that were made in the inline trait body, is that ok? \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":"compiler/src/dotty/tools/dotc/inlines/Inlines.scala"},"region":{"startLine":1110}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0311e70d81bc78f205da3bda81193145526d5c025c79ec27be03eb2ba5d7b41"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: pass type parameters in two sections? \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":"compiler/src/dotty/tools/dotc/inlines/PrepareInlineable.scala"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"70c9fdfed89184b042079c04b32e442c6b2f13ba8088bdbf940170ef89a52a2d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Handle references to non-public types. \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":"compiler/src/dotty/tools/dotc/inlines/PrepareInlineable.scala"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"8314927290c8d6a2bd388511a202da01b48d9ce1d2fdf608f9d16763c5815da4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Support this pattern \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":"compiler/src/dotty/tools/dotc/inlines/PrepareInlineable.scala"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"60f4dbf2e9a67ddfe29434bf3836dd385dc65ac3925e0e58ded4d5b527dde06b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO handle correctly this case correctly to get the tree or avoid it completely. \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":"compiler/src/dotty/tools/dotc/fromtasty/ReadTasty.scala"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6db675d9de82f6f64e7e36c39a4dbfde6774785a5db13ff12f2aeee87f9ec7e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO: enable this once you know how to get \u0060sym.paramss\u0060 \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":"compiler/src/dotty/tools/dotc/core/Comments.scala"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"2de1d9ddf66f7f74620d7e2036b37eaed848454ded459a4f7553ed5bfce77128"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO: could also be \u0060sym.owner.allOverrid..\u0060 \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":"compiler/src/dotty/tools/dotc/core/Comments.scala"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9ccefc39693a76f4d0bde729e5c2bf0239149e2184f6ed575ae0e60438cd0c0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Fix issue when converting ModeChanges and FreshModeChanges to extension givens \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":"compiler/src/dotty/tools/dotc/core/Contexts.scala"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a0559c7c09d6766232ba8e859b3a78aabc3c70258d3c79363597719640056dc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO check for refinement? \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":"compiler/src/dotty/tools/dotc/core/Definitions.scala"},"region":{"startLine":1946}}}],"partialFingerprints":{"codehealthFindingId/v1":"6993572d5f8797b0cffb3960a00927ee726f556a9c16c8a8a098fafd6785a48d"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // Hack to make super accessors from traits work. They would otherwise fail because of #765 \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":"compiler/src/dotty/tools/dotc/core/NameKinds.scala"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"218afc93fd3ce19b1977f318e8ae72d7b4159a3bf7d5dea671d6e4af2b5a664d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Reduce code duplication with UniqueExtMethName \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":"compiler/src/dotty/tools/dotc/core/NameKinds.scala"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6c8e96452737e57a57bac48a5efa1231fd28075f50730b1eb4af40626ca9e4a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: investigate why flow typing is not working on \u0060es\u0060 \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":"compiler/src/dotty/tools/dotc/core/OrderingConstraint.scala"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b14792539d5130d0bd5b647533cc34b335af514386e3eadcd5b25ff14a1d444"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Refactor this code to take \u0060prev\u0060 as a parameter and add \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":"compiler/src/dotty/tools/dotc/core/OrderingConstraint.scala"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5e594cd0212431e8175035c465dcdde83b72fb34ffa5e3f459586c4f39b1c57"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This might test an unintended condition. \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":"compiler/src/dotty/tools/dotc/core/Phases.scala"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec314ad35fa3e05c49d52157f43673fb9e0c1c27b39c069eeab4ee4c597b01b9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: \u0060if result == null then this else result\u0060 should work here, improve flow typing to handle it \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":"compiler/src/dotty/tools/dotc/core/Scopes.scala"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbb7604c3ee12310b1adfa04594c4645540f16c7cf25c4626f11a13c296c15c3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Scala 3.x: only check for inline vals (no final ones) \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":"compiler/src/dotty/tools/dotc/core/SymUtils.scala"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdb3922242b129e5236c6ebeaf31dfb6d3eba036554e4a05d79fd71080165b17"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: figure out what\u0027s wrong in the setup of CommentPicklingTest and re-enable assertion. \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":"compiler/src/dotty/tools/dotc/core/Symbols.scala"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"6836abf28110a219a12d1b587474d12deed206537425a00cf2d74f3f808dbea9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Merge with isSubInfo in hasMatchingMember. Currently, we can\u0027t since \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":"compiler/src/dotty/tools/dotc/core/TypeComparer.scala"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"065b0bc3856b93045eee5e035c772455ec5519d709b73d3e8fa55a0de8aa5360"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Analyze cases where they are not box compatible \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":"compiler/src/dotty/tools/dotc/core/TypeComparer.scala"},"region":{"startLine":2929}}}],"partialFingerprints":{"codehealthFindingId/v1":"25c459e640e5eb0a0a905b18ac4449a8a9aeb2601a4efade4eca1c81b1e2b0a5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: what about repeatedParam? \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":"compiler/src/dotty/tools/dotc/core/TypeErasure.scala"},"region":{"startLine":1146}}}],"partialFingerprints":{"codehealthFindingId/v1":"c79de0e1a30eb83906c3d635e9a0c8f4ceafb1e1c44ffa4123b6fa605bacd960"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: generalize the inlining trick? \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":"compiler/src/dotty/tools/dotc/core/TypeOps.scala"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"4002077a1992c75695abd53771a3c835a09284367f1168ee9e263fa9db1de205"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO does not conform to spec \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":"compiler/src/dotty/tools/dotc/core/Types.scala"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"9af482285b45f7c4e0a9ec87dc286d4f3f70b93edd26231b72e9620250adba2f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Move all dependent functions to PolyFunctionOf and drop the \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/Types.scala"},"region":{"startLine":2049}}}],"partialFingerprints":{"codehealthFindingId/v1":"7768eb76e714128c8cd711687114806a5debd33842e80e3dbb125d97aedb876f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO ^^^ handle ranges in capture sets as well \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":"compiler/src/dotty/tools/dotc/core/Types.scala"},"region":{"startLine":6734}}}],"partialFingerprints":{"codehealthFindingId/v1":"07a0652830e6692a1acc8594d0bc349eae62859c96abe8bd13870678626bae72"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: make LIFTED = latePRIVATE? \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":"compiler/src/dotty/tools/dotc/core/unpickleScala2/Scala2Flags.scala"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"550eb906a5471f82c4b21851a230a38462ff4d3ae751939bc7c39b7033b923f5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // !!! TODO: pull out primary constructor \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":"compiler/src/dotty/tools/dotc/core/unpickleScala2/Scala2Unpickler.scala"},"region":{"startLine":1198}}}],"partialFingerprints":{"codehealthFindingId/v1":"d42ab7821e94900b733e8c5fb7dbca77c67ea540d92679030b3dc522638ffa11"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Decouple CliCommand from Context and use CliCommand.distill? \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":"compiler/src/dotty/tools/dotc/core/tasty/TastyPrinter.scala"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"34946eb98d5b17e9d81b866f666003d20443edfd6a3d134137640c0eb5e98908"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Should we elide attributes under testPickler? (i.e. \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":"compiler/src/dotty/tools/dotc/core/tasty/TastyPrinter.scala"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"4130b69dccc2170187ba125c3d367bf5c650598721d5dc7a959dbd8ce12e7da6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // to a closure parameter outside the closure itself. TODO: track this down, so that we \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":"compiler/src/dotty/tools/dotc/core/tasty/TreePickler.scala"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6f8c7732be1967af4bf706e04e13a7087101abdfaa313cc4310861869d63082"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: if we introduce outline typing for Scala definitions \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":"compiler/src/dotty/tools/dotc/core/tasty/TreePickler.scala"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"910a670cd16c53c7530d9822456923a4c08a242f56bb6bf6edbe47a933943116"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Use this to tag the symbols of this dependency as compiled with explicit nulls (see use of unpicklingScala2Library). \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":"compiler/src/dotty/tools/dotc/core/tasty/TreeUnpickler.scala"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0f81e84f7873bbfaee3e597182d6505a1d41026239b0f799fbd9ac80a27f416"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO 1: parse runtime visible annotations on parameters \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":"compiler/src/dotty/tools/dotc/core/classfile/ClassfileParser.scala"},"region":{"startLine":1091}}}],"partialFingerprints":{"codehealthFindingId/v1":"52ae55ea0d541b2b6b6af3e53c6536f1d8c1de1f8f98056a01510a768d0e8b96"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO 2: also parse RuntimeInvisibleParamAnnotation \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":"compiler/src/dotty/tools/dotc/core/classfile/ClassfileParser.scala"},"region":{"startLine":1094}}}],"partialFingerprints":{"codehealthFindingId/v1":"63d9f5bdbe3a09b9195c228d1be7fe77576a0491aed17e7fdb104cf716b4b8b7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this performs an equivalent of getExceptionTypes instead of getGenericExceptionTypes (SI-7065)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/classfile/ClassfileParser.scala"},"region":{"startLine":1145}}}],"partialFingerprints":{"codehealthFindingId/v1":"5358d8ade85895f0ccbfea41d22636fde9a6c5d874843da65ead78bd60efb7e1"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX It must be time for someone to figure out what all these things \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":"compiler/src/dotty/tools/dotc/config/PathResolver.scala"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"f95223d9096396c9adc892e12effb522ba20a5f8adbcf528118778ff88587569"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use JAR compression level, Java output version \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":"compiler/src/dotty/tools/dotc/config/ScalaSettings.scala"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"c47b10afeeafa189c1b635ffffccc52db4408a1eb316aeb8a7d3a99f84f1915d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //ChoiceWithHelp(\u0022inlined\u0022, \u0022Apply -Wunused to inlined expansions\u0022), // TODO \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":"compiler/src/dotty/tools/dotc/config/ScalaSettings.scala"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce32a585043fa305ff919642fff2b2fee8c306fe8ed449d81f8455c778fbc172"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO support closing \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":"compiler/src/dotty/tools/dotc/classpath/ZipAndJarFileLookupFactory.scala"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ed78dea2507988d30ca76c0b38a8ced0fa580019a379d1a19e18159de4c3b91"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO we should drop retains from inferred types before unpickling \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":"compiler/src/dotty/tools/dotc/cc/CaptureOps.scala"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f4158546dbcad6476cd78da32391e6cfc62296939bf4900fb4901fdc2838f77"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Can we drop withCollapsedLocalCaps?. Without it we get errors in \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/cc/CaptureSet.scala"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"67b9b4af93b4014a90b50126e9d203ab1d226ac2b69333ab63ada5e96ea789c8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO This scheme should also apply whenever code under strict mutability interfaces \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":"compiler/src/dotty/tools/dotc/cc/CaptureSet.scala"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"145777f32810c4e376994e53123a42d307bc6d33a77f8d3029061567ef10dbbd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We should instead mark the variable as impossible to instantiate \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":"compiler/src/dotty/tools/dotc/cc/CaptureSet.scala"},"region":{"startLine":1122}}}],"partialFingerprints":{"codehealthFindingId/v1":"e240f1ab130fb4f1b3458e850d8ca8baf4cdd8074c68cd056f77d49b6323823f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: once except carries a list of classes, fuse except[A] \u2218 except[B] into one map; \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":"compiler/src/dotty/tools/dotc/cc/CaptureSet.scala"},"region":{"startLine":1765}}}],"partialFingerprints":{"codehealthFindingId/v1":"661595bde6d8bd3e4d8ae3ac6a0d994e377d36ead3e9db4b27d3a4e0581ecc48"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO In other situations we expect that the type is already transformed to a \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/cc/CapturingType.scala"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"8914ce171449326d19576b076f4ec96590184e7f69ef8e2026dbd47436ade29e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO follow up on 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":"compiler/src/dotty/tools/dotc/cc/CheckCaptures.scala"},"region":{"startLine":1241}}}],"partialFingerprints":{"codehealthFindingId/v1":"0854487f0c561316cd7e0f9b3c066196db8b33744ddd6925a73ef4a45e245a9b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Do bounds still contain GlobalAny? \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":"compiler/src/dotty/tools/dotc/cc/CheckCaptures.scala"},"region":{"startLine":2531}}}],"partialFingerprints":{"codehealthFindingId/v1":"afce80b37b5b94fca5d07ed57b35857c1f685f37eb781edc033ffbd7c33c141d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo capture check Using \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":"compiler/src/dotty/tools/dotc/cc/SafeRefs.scala"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"16a5651155a5ef75d4ab15876645d624c4eda3f48625998ec47358cbb894196e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // ---- Error reporting TODO Once these are stabilized, move to messages -----\u0022 \u002B \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":"compiler/src/dotty/tools/dotc/cc/SepCheck.scala"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"c83c21a149c57d9f245f3de2f63587497f2bf2687fec33943f802645ae227222"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // have inferred universal types. TODO come back to 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":"compiler/src/dotty/tools/dotc/cc/SepCheck.scala"},"region":{"startLine":890}}}],"partialFingerprints":{"codehealthFindingId/v1":"86633aaaa321df67b2d82f181ed32eb98c1c71feac866eaed4795d41c0d782c2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO can we use fn instead? \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":"compiler/src/dotty/tools/dotc/cc/SepCheck.scala"},"region":{"startLine":961}}}],"partialFingerprints":{"codehealthFindingId/v1":"270ba1c34f51eda0571e33cb3762ba8322f012066b24907d6f85ca930291203e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // case class Filter. TODO Investigate to decide what needs to be done \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/cc/SepCheck.scala"},"region":{"startLine":1066}}}],"partialFingerprints":{"codehealthFindingId/v1":"defdde62a21ed34766caf1eff2a0d58a28f7fc15e2e845a840579f6d66daab88"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: drop this once we do not silently insert empty class parameters anymore \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":"compiler/src/dotty/tools/dotc/ast/Desugar.scala"},"region":{"startLine":1116}}}],"partialFingerprints":{"codehealthFindingId/v1":"49d9cb3eb5a644775dbaaf928efd8a65950644c4810928ed9a05b4dee4e8e18b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use \u0060pushAttachment\u0060 and investigate duplicate attachment \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":"compiler/src/dotty/tools/dotc/ast/Desugar.scala"},"region":{"startLine":1489}}}],"partialFingerprints":{"codehealthFindingId/v1":"5199dc40310941b57f44a397707a8794c029b5cfdb0320bb90408addfa483d2b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Handle trees with mixed source files \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":"compiler/src/dotty/tools/dotc/ast/NavigateAST.scala"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"e375b7364de2bf25a05f2f43fe00d2ae7df8edb9da73a64b285937855d7d7dc8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We shouldn\u0027t be manually forcing trees here, we should replace \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":"compiler/src/dotty/tools/dotc/ast/NavigateAST.scala"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"778c0dd7dd0252843946f83f968d8a4fcd3ce8ea744d1cfa6ef7b55c42161450"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Trees generated by the XML parser do not satisfy \u0060checkPos\u0060 \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":"compiler/src/dotty/tools/dotc/ast/Positioned.scala"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b9b1d26ebb53c01fa95c7fd1f6676792c9202c63df3d7f2ca950ed85ac4ae63"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: It seem like this should be exprPurity(tree) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/ast/TreeInfo.scala"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"73370b4a9928eeda282285fb3a6b24cf498857eab34082d64850a7d7b01e7324"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: It might be better to cater for the asserted-away conditions, by \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":"compiler/src/dotty/tools/dotc/ast/TreeTypeMap.scala"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"a327252ffcb062e195948206dc10c5268c59587ac24578639dff1524f97ce5ac"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TupleXXL.apply(elems*) // TODO add and use Tuple.apply(elems*) ? \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":"compiler/src/dotty/tools/dotc/ast/tpd.scala"},"region":{"startLine":1640}}}],"partialFingerprints":{"codehealthFindingId/v1":"608ab872d6c3ab3347201b34f0dd1d1b64c6f63ef459bfc797227bd06ea5176e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Make bound a typed tree? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/ast/untpd.scala"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0b26f904a04ed73be1c8b0c7608e584c6f89cf4592114777cc8daa758a84383"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO report the warnings in the expression \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":"compiler/src/dotty/tools/debug/ExpressionReporter.scala"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"02b598b1590c0f6c3fa32dabd82705ad56ace610e0ab8cf2e4a147c4083bff23"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO move reflection methods (callMethod, getField, etc) to scala3-library \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":"compiler/src/dotty/tools/debug/InsertExpression.scala"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"aed0f5c3d14460ee78a24b23e8ea1af9e5880497288410c57aceb09d9de78d38"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO This fails for OFFSET$x fields. Re-enable when we can. \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":"compiler/src/dotty/tools/backend/sjs/JSCodeGen.scala"},"region":{"startLine":2070}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bfa7d8fe9a8b7fd770201d9056fa4133e98b842bcce93e375f890e158915af5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO? We could optimize this a bit by putting together all the \u0060argCount\u0060s that have the same 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":"compiler/src/dotty/tools/backend/sjs/JSExportsGen.scala"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3889cd9dc488fe1090d4cd0f01e336c024596df898e26002826ec76ec817742"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use Select \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":"compiler/src/dotty/tools/backend/jvm/BCodeBodyBuilder.scala"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0b69a91e020ae887308e7f35a4e79c7d02230d881080b783a85ed1a9ab0fcd2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO @lry make pattern match \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":"compiler/src/dotty/tools/backend/jvm/BCodeBodyBuilder.scala"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"a139b1771f4137d7721fd6a4e9351c3f2d007614f636f53c21eb4f516f6dd997"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: remove \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":"compiler/src/dotty/tools/backend/jvm/BCodeBodyBuilder.scala"},"region":{"startLine":1695}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab0532871ca3215f7bdc2bde0786589245e0cbb80a9c0ba8af3baa20baf97027"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO specialization \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":"compiler/src/dotty/tools/backend/jvm/BCodeBodyBuilder.scala"},"region":{"startLine":1811}}}],"partialFingerprints":{"codehealthFindingId/v1":"a906cb691c3d3ec43786d6816f8274b6d3219587ec68b29367d635089f5d2c40"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: evaluate the other flags we might be dropping on the floor 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":"compiler/src/dotty/tools/backend/jvm/BCodeHelpers.scala"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c68d440f998317c8d57ec60174e7ba1d5de23a91269513baece52f69455708c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO needed? for(ann \u003C- m.annotations) { ann.symbol.initialize } \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":"compiler/src/dotty/tools/backend/jvm/BCodeHelpers.scala"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c981c49f77cbefaf6ccb5f6d8faf7d38e881c20a67fdf8703a87cabf527fab9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: now we have paramSymss and could use it 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":"compiler/src/dotty/tools/backend/jvm/BCodeHelpers.scala"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f403018e159d01d8a7a913237633ea33fa1d94f59590fbc686f646d5e85d2c8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO index on to.sort \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":"compiler/src/dotty/tools/backend/jvm/BCodeIdiomatic.scala"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a1bac763466656aa2cb7871da0dbe3891a88867444f9b9e6819c515f9e2fabf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO ICode also requires: but that\u0027s too much, right? assert(!isBoxed(tk),     \u0022checkcast on boxed type: \u0022 \u002B tk) \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":"compiler/src/dotty/tools/backend/jvm/BCodeIdiomatic.scala"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"e13bd1ea21ef67a40a2dc0dab5502074b5491c8a25fa773bb93c6bb3c3472f6f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove \u0060!f.name.is(LazyBitMapName)\u0060 once we change lazy val encoding \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":"compiler/src/dotty/tools/backend/jvm/BCodeSkelBuilder.scala"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae4cfb84c7a73842ead16a96cddd7db835a7a8667d7f35e3d48027791dfbcfd5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO needed? for(ann \u003C- m.symbol.annotations) { ann.symbol.initialize } \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":"compiler/src/dotty/tools/backend/jvm/BCodeSkelBuilder.scala"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cca9f29becbf81cd35b2fe21674021569be9eceea0c847adf5f1e90e23610bd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use existsSubTree \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":"compiler/src/dotty/tools/backend/jvm/BCodeSyncAndTry.scala"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"73a09b6f989db54aadb11550b2e87ffdaf444f668300db9a2c6d6f308a8bfba7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //todo is handled specially for JavaDefined symbols in scalac \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":"compiler/src/dotty/tools/backend/jvm/BTypeLoader.scala"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"595b6f961b2811f0f642e42483663c15f81e372e3b4462877a9f2ac0a091a138"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This feels like something fundamentally weird in trees that should not exist. \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":"compiler/src/dotty/tools/backend/jvm/BTypeLoader.scala"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5fd413b0b8ec3e15fca6d50e26922445b2f2a6378ab4bd661bd3ed89ba13a3b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: it would be cleaner to make \u0060methodNode\u0060 return a list of methods and deal \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":"compiler/src/dotty/tools/backend/jvm/opt/BCodeRepository.scala"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"36e412039eb60f55e2ea34a7f7df81ea7d3926c999009f0c3313004b4f026835"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: if \u0060c\u0060 is an interface, should directly go to \u0060findInInterfaces\u0060 \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":"compiler/src/dotty/tools/backend/jvm/opt/BCodeRepository.scala"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"500b63f56167a487150648bf5c6b39aa58df8b672abd590ad9d237ad8bdce4f4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: we need to remove them also for classes that are not parsed from classfiles, why not simplify and do it once when inlining? \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":"compiler/src/dotty/tools/backend/jvm/opt/BCodeRepository.scala"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"f114dfce6f9d33de471b67f169498efea45120edc1e67117dec9c90b60f1f402"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: add more \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":"compiler/src/dotty/tools/backend/jvm/opt/BoxUnbox.scala"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"711b82f7a3a76ba879254fb28accedbbfb669aa396d573405410478d4a90778e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This is maybe over-cautious. \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":"compiler/src/dotty/tools/backend/jvm/opt/ClosureOptimizer.scala"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"51a8cff75603dfed4cec2a4e6fdfee48c8c70a6536cb1058608cd69b8226a3d8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use copyProp once we have cached analyses? or is the analysis invalidated anyway because instructions are deleted / changed? \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":"compiler/src/dotty/tools/backend/jvm/opt/CopyProp.scala"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"61bb3cd773e3b727b2e0280caf7959415839af000c9300a307fa7177b3caffdd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO it seems the !threadsafe case (admittedly not much code) is dead? \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":"compiler/src/dotty/tools/backend/jvm/opt/FifoCache.scala"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ed64fa83530b2a0e1b4ac43b44ec85a8c1af07bda6fd534ae884732e6400309"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove those that were rolled back to their original form? \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":"compiler/src/dotty/tools/backend/jvm/opt/Inliner.scala"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"0234fb4609d25d457bb7286117eebca9a2b59c7ef21f34dcf63e934b12b4d382"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: replace by dev warning after testing \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":"compiler/src/dotty/tools/backend/jvm/opt/Inliner.scala"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"97715f533fc5f16dc2c83adcbff1c3a5613973ffebd967f9176a599361d75c01"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: A2 requires \u0022same run-time package\u0022, which seems to be package \u002B classloader (JVMS 5.3.). is the below ok? \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":"compiler/src/dotty/tools/backend/jvm/opt/Inliner.scala"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"d824da748bc81ad98be67b9733a9b370870808530515805052bfd973de36a1be"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: B3 requires \u0022same run-time package\u0022, which seems to be package \u002B classloader (JVMS 5.3.). is the below ok? \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":"compiler/src/dotty/tools/backend/jvm/opt/Inliner.scala"},"region":{"startLine":1007}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f517d87622132e6aa25ecd38fbfc02099556b558d9bcf9b12fd7cdb4f7904e7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO instead of getOrElse, we should bubble the warning up... \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":"compiler/src/dotty/tools/backend/jvm/opt/LocalOptimizer.scala"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"42249b24a663292fb7d5984078b10edf9c1a51e4ff8f8979692d8901802218fb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO instead of getOrElse, we should bubble the warning up... \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":"compiler/src/dotty/tools/backend/jvm/opt/LocalOptimizer.scala"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8870ce9e3820183d814d923d1e126ce91699e67e13093ad3a79365b174cc4a7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO suspicious: top never updated in the loop... \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":"compiler/src/dotty/tools/backend/jvm/opt/LocalOptimizer.scala"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2a27416bddde79ee2c1a6aba8eb576d3d416b01c5e8cef0899546bfd76529a2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO bubble up warning instead \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":"compiler/src/dotty/tools/backend/jvm/opt/OptimizerCallGraph.scala"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"f08e94b0bfd3d8a508b4abd261b72fb8bf4bc2a143106e25c873c7ed8b45f7c3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: (2) doesn\u0027t cover the following example: \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":"compiler/src/dotty/tools/backend/jvm/opt/OptimizerCallGraph.scala"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb30600519398d8b041f6a0d6d9e91a0896c23262a599ba3635ef5d79079c9fd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: type analysis can render more calls statically resolved. Example: \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":"compiler/src/dotty/tools/backend/jvm/opt/OptimizerCallGraph.scala"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"2602ce1d1ee41fd612d93407f62ee652ff3a85336410068f18a92584062fdb8a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this should be a subtype of CannotInlineWarning \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":"compiler/src/dotty/tools/backend/jvm/opt/OptimizerWarning.scala"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"37200b8471e1df477c358eebd8fa5bfb03c2934d6f010e5899b42b1937dde896"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // hacky side effect, used for performance of AliasingFrame.merge. \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":"compiler/src/dotty/tools/backend/jvm/analysis/AliasingAnalyzer.scala"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed5d601977838b4a005cef1b656b1554cc27942a659f45cda051e2f00099635f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: fix this to pass consistently \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":"community-build/src/scala/dotty/communitybuild/projects.scala"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b145eea616fd6e2fda11cf1a994e1fbd558dd0f0486709340b900febae2adf1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO @odersky? It got broken by #5458"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"community-build/src/scala/dotty/communitybuild/projects.scala"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6e01639307ad198715f9e97bb8369dc9fca6b04a8a7bdd19568e44486889f57"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO enable -Xcheck-macros \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":"community-build/src/scala/dotty/communitybuild/projects.scala"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7a9b9e523bb63ba8f826ac6dab61e9b5650bcdb7ed2dd8ac36019d4a3a8c9e9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO remove ascriptions (issue with type variable constraints) \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":"bench-run/src/main/scala/dotty/tools/benchmarks/tuples/TupleOps.scala"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a7729979ef222ee42a35bd21f69bf199a797f15fcd8b4d1360b28aee0e271c1"}},{"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 \u0060project/plugins.sbt\u0060 makes this repository a deployable product (line 1)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"project/plugins.sbt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ea8ed3a05e2d91bb078a16dc97d760db3de1c13a80af63b97ac551973da3b86"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060emitRETURN\u0060 spells \u0060RETURN\u0060 where 31 names in the project spell it \u0060Return\u0060: 31 of 32 names in project repository spell the token \u0060Return\u0060 (31 of 32; unit: names in project repository containing \u0060Return\u0060). Peers: PlainBodyBuilder.genReturn (compiler/src/dotty/tools/backend/jvm/BCodeBodyBuilder.scala:633); BCodeUtils.isReturn (compiler/src/dotty/tools/backend/jvm/BCodeUtils.scala:114); LocalNameGenerator.getEnclosingReturnLabel (compiler/src/dotty/tools/backend/sjs/JSEncoding.scala:137); LocalNameGenerator.makeLabeledIfRequiresEnclosingReturn (compiler/src/dotty/tools/backend/sjs/JSEncoding.scala:146); Setup.toResultInReturnType (compiler/src/dotty/tools/dotc/cc/Setup.scala:235). Rename to \u0060emitReturn\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/backend/jvm/BCodeIdiomatic.scala"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"de1da8d7e063ff930a40633d810afb6ff41a22f28151ef72b84716fcd5cc660c"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060readTASTY\u0060 spells \u0060TASTY\u0060 where 58 names in the project spell it \u0060Tasty\u0060: 58 of 59 names in project repository spell the token \u0060Tasty\u0060 (58 of 59; unit: names in project repository containing \u0060Tasty\u0060). Peers: CodeGen.addTastyUuidToClassNode (compiler/src/dotty/tools/backend/jvm/CodeGen.scala:196); CodeGen.addTastyUuidToClassNode(serializedTasty) (compiler/src/dotty/tools/backend/jvm/CodeGen.scala:196); Driver.fromTastySetup (compiler/src/dotty/tools/dotc/Driver.scala:117); Run.asyncTasty (compiler/src/dotty/tools/dotc/Run.scala:285); Run.initializeAsyncTasty (compiler/src/dotty/tools/dotc/Run.scala:287). Rename to \u0060readTasty\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/fromtasty/ReadTasty.scala"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee34dfbfa50a437405b320f530422138097b1cbfd3180c61b2651ce38b07453e"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060dynamicJsData\u0060 spells \u0060Js\u0060 where 89 names in the project spell it \u0060JS\u0060: 89 of 91 names in project repository spell the token \u0060JS\u0060 (89 of 91; unit: names in project repository containing \u0060JS\u0060). Peers: JSCodeGen.acquireContextualJSClassValue (compiler/src/dotty/tools/backend/sjs/JSCodeGen.scala:118); JSCodeGen.genNonNativeJSClass (compiler/src/dotty/tools/backend/sjs/JSCodeGen.scala:572); JSCodeGen.genRawJSClassData (compiler/src/dotty/tools/backend/sjs/JSCodeGen.scala:701); JSCodeGen.genClassInterfaces(forJSClass) (compiler/src/dotty/tools/backend/sjs/JSCodeGen.scala:783); JSCodeGen.genJSClassCapturesAndConstructor (compiler/src/dotty/tools/backend/sjs/JSCodeGen.scala:1179). Rename to \u0060dynamicJSData\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scaladoc/src/dotty/tools/scaladoc/renderers/Resources.scala"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"7565b8e6d99c94f36a0682b1c3bb133fdb8c929e0436f926b28c1c74722d522d"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060deferJs\u0060 spells \u0060Js\u0060 where 89 names in the project spell it \u0060JS\u0060: 89 of 91 names in project repository spell the token \u0060JS\u0060 (89 of 91; unit: names in project repository containing \u0060JS\u0060). Peers: JSCodeGen.acquireContextualJSClassValue (compiler/src/dotty/tools/backend/sjs/JSCodeGen.scala:118); JSCodeGen.genNonNativeJSClass (compiler/src/dotty/tools/backend/sjs/JSCodeGen.scala:572); JSCodeGen.genRawJSClassData (compiler/src/dotty/tools/backend/sjs/JSCodeGen.scala:701); JSCodeGen.genClassInterfaces(forJSClass) (compiler/src/dotty/tools/backend/sjs/JSCodeGen.scala:783); JSCodeGen.genJSClassCapturesAndConstructor (compiler/src/dotty/tools/backend/sjs/JSCodeGen.scala:1179). Rename to \u0060deferJS\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scaladoc/src/dotty/tools/scaladoc/renderers/Resources.scala"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b7a2685060901c06232dcc47bb6cb2a3acb73448e9b606d6a4b2b54651d31c4"}},{"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 (331085 LoC, 5413 module-visible types across 174 directories). Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d5a94650dc74886a0f1f08eb9fb6775f1fc395279ef7e901c970c9d26f767a72"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"272772361a047f7e41b8e5afa745cf0710d48a3be27665f95c247c67625999c9"},"properties":{"commitSha":"a0713797442414c1d8d1215ecb5d80a5f9650565"}},{"ruleId":"D28","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3cdfd7beb31b791ae18dcb425e21eb157c842e7bbcd522cc330573c1a6538db1"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d5b8f11381d61a58459ffc7c595fd52d09c03c711894a63a9578043d2338412b"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7d8ecd8cc50fd39f8919ee588b260f62f4636eaf740c0419ebb5dc250da2849b"},"taxa":[{"id":"CWE-214","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"fb17b69ec1007f3eb89be001fe1db8b9ff56d158ec30d9013887449d05d1f7a9"},"taxa":[{"id":"CWE-250","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"073893b3bc0fa510ec095a3c0a89beb31b9d7123b5c4647efdf01bc8a2b59345"},"taxa":[{"id":"CWE-250","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"96fd9c229bf41db5f5532d8ca53722806751a485a7332f1c91786aeddc14ab1e"},"taxa":[{"id":"CWE-250","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"aaf127e2c1b9ed8074d3ab2d2342f97734d66a5bb36d39b4c67eb2406bf8b022"},"taxa":[{"id":"CWE-250","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6959d72820cf63acf77a1183dd26b52e5b29893f33a1fa47f6eb76f0a9c8aa67"},"taxa":[{"id":"CWE-250","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6d6553b63e2a7e65c022f67662346a1ab72c4182619c824df2655853372753b2"},"taxa":[{"id":"CWE-250","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"75a0b60fff9f09970a26718ca9ec3b9417e2a8eac519da0d853517fb3de8060f"},"taxa":[{"id":"CWE-250","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7cc6522d2c5f8d2592e5502f8e9b3204c08c158d9831dddc55e9674c5ebb20ba"},"taxa":[{"id":"CWE-250","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f98857cf0c00f8732f5910c879dcbcdb271ae4a85a6073593c47e22f4be3c997"},"taxa":[{"id":"CWE-250","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b82748778f37b8cd5589018330d4281ec0c95b1158824bef4952e219e6c9ebb0"},"taxa":[{"id":"CWE-250","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ffd44306b60e25e4d6bace5e95cdb7adae70f4709487dff06a5b7fae264d858f"},"taxa":[{"id":"CWE-250","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"21e74cb387c88c1fa18f00ca48c9f2788a0732e6431914aaf925d04fa0010c74"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"de3abf22ba9243671040bdcad37584e076f579bc4e077e10c5357cd1a01a3ca1"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"382a16e02492e55281c53475ecb06066670e62373e485da8a9bbf5625e273024"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7a94e86400bcd131e286ffe151b231a034446d64a6a3743b526f1beec7c2fc35"},"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":"b6722f9a5008165f56b6600902a4db8048e0f7e0e371912841afab9ed5ffb641"},"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":"647802e76566372dbdb6cd28d65201841c87af526267c6d20569ee0d07eda221"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"792d5e0208ff2035ed7ad3a6c7e8acf25179bad1742647e924f178db863e4f73"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"compiler/src/dotty/tools/dotc/transform/init/Semantic.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd232fe8ed4b5ffff68a6810830830c378abb029488fe090d3292660c6d2cbfe"}},{"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":"library-js/src/scala/reflect/Manifest.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aca9470135755ac2401f2dc73fe71e3f39acecc5ab36d29272446c351ea7d0f6"}},{"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":"scaladoc/src/dotty/tools/scaladoc/tasty/comments/wiki/Parser.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2662ef46d7ad9fe0119c7c474d15577d82955ab6f64e1d883da13493ff107c7a"}},{"ruleId":"D34","level":"note","message":{"text":"Further orphaned files (smaller): 123 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: compiler/src/scala/quoted/runtime/impl/printers/Extractors.scala, scaladoc/src/dotty/tools/scaladoc/tasty/InkuireSupport.scala, compiler/src/dotty/tools/dotc/quoted/QuotePatterns.scala, compiler/src/dotty/tools/dotc/transform/Splicing.scala, library/src/scala/sys/process/Process.scala, compiler/src/dotty/tools/dotc/core/GadtConstraint.scala, library/src/scala/sys/process/package.scala, library/src/scala/runtime/TupledFunctions.scala (and 115 more) (126 orphaned of 868 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; 868 of the 1626 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":"compiler/src/scala/quoted/runtime/impl/printers/Extractors.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce5d3fb87455b958ef36e53d929d42abdf537ac5fa89b1fa92bc96120f673cf0"}},{"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":"scaladoc/src/dotty/tools/scaladoc/tasty/InkuireSupport.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4825a3d379eb1df9f6f008ff3ce9c6b5ead65cdaee491964f605e58ef9a4946b"}},{"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":"compiler/src/dotty/tools/dotc/quoted/QuotePatterns.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c3ffb9e5be544e3204db6d88dc0dfb18ee87baff67cd7025f57998e7f04c37d"}},{"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":"compiler/src/dotty/tools/dotc/transform/Splicing.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8fd1d9f4cc649f8d6dc3acf24015fc06fa75139f1e0e432f476cf27cc024ec5"}},{"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":"library/src/scala/sys/process/Process.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2889ba3187a53121ab19d1837cf96224e2ec310b3a269d8aff343638955ae7f6"}},{"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":"compiler/src/dotty/tools/dotc/core/GadtConstraint.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9544f10f6aebc607c409108fec1c876f2a813b4ca02f8d55927f745973376c36"}},{"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":"library/src/scala/sys/process/package.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"12714575d3e288c837aab6a89f4236d4a8c6930eb520d30eac0c33e715b1fd56"}},{"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":"library/src/scala/runtime/TupledFunctions.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dee0affc119c66425433b7ef2cffe6472ce4dc6bbd22e5bea63c451c7dd3a9c6"}},{"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":"compiler/src/dotty/tools/dotc/staging/CrossStageSafety.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d47ea2570d6f552ef7aa3746c33e43dce87c604ed2d68dbd33f8075e602c7666"}},{"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":"scaladoc/src/dotty/tools/scaladoc/Inkuire.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"315029e2c326c063ee4426d0bec432eca0e4a4b0463f6ea1c5528acb1ebfff65"}},{"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":"library/src/scala/typeConstraints.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"15dae60ef68c5a965fe5b0a716f9ded636d5707bae27e54b76e014668c20b19c"}},{"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":"compiler/src/dotty/tools/dotc/core/unpickleScala2/PickleFormat.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"88f8b289f6c568ea6001f9fd110b24c2f8cf47e88cffda2f7bc7fc8c2be468cd"}},{"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":"compiler/src/dotty/tools/dotc/typer/ConstFold.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b1796ae3a59e69d0a24457e950e2ed8337fc0a41fd811009b056ee3427f9b94"}},{"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":"scaladoc/src/dotty/tools/scaladoc/tasty/comments/Preparser.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6242dbf97e97ef7608448504a66dd29906d1b215b12a382e399aae2c10362906"}},{"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":"scaladoc-js/main/src/searchbar/engine/PageSearchEngine.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"58d725248dbc7f8cbffd9e926b87f92285b45193c3291c6ba9d2c81d58d9dcfa"}},{"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":"library/src/scala/io/StdIn.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"34525700df3b127ff1c26ed696eb8cd183ebdcd895d26817aa9119279f6fe161"}},{"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":"library/src/scala/collection/immutable/ChampCommon.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f71d14ffd2a28dc038bb4d3fe9ccd9b20135a9376f249bdf88425d0848314ada"}},{"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":"scaladoc/src/dotty/tools/scaladoc/tasty/comments/markdown/SnippetRenderer.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"363346d3f2e71051c07b8e3e0c87754adfd240c6395cbbb3e089edfc59e0cd7b"}},{"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":"compiler/src/dotty/tools/dotc/util/ParsedComment.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"95a619febc5d5962b9dcaaeaf460701cd42eb67f5cab061a65bccd560b0e3cd7"}},{"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":"library/src/scala/collection/concurrent/Map.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"93cbc768b970d874202cad25db698f7ba951610a19775cb7577ebb285f5408b0"}},{"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":"compiler/src/dotty/tools/dotc/transform/init/Cache.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b988ef0bb533f646a105b9491778a6f473f26c3820a48cfaa57e02866fa1f364"}},{"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":"library-js/src/scala/reflect/ClassTag.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"790f37fa8e4b5f5aef63517aa8dda5fbb50b51e81d0d339a0eae0d5c360157d5"}},{"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":"compiler/src/dotty/tools/dotc/core/unpickleScala2/Scala2Flags.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf4c2193281e1ea3c77ff8dd4c3cf01da1200ba01d187dd9d6a36070968b238f"}},{"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":"project/ScalaJarValidate.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"17294aab2cdf57f3468c975bb30551454363a74de5db5f6b8c8d8184b2214099"}},{"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":"bench-micro/src/main/scala/dotty/tools/benchmarks/specializedtraits/MatrixMultiplicationPoly.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dee52dc3516c785e4dc48c35e170c54ee6ff30b1a919b08eacea70de9943359"}},{"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":"library/src/scala/concurrent/Promise.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee1e69b9a1d71210aed6d7cc137f1648067fba5d979e99334860f70450d97168"}},{"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":"scaladoc/src/dotty/tools/scaladoc/parsers/WikiCodeBlockParser.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2e771049184b5e47986b012a8e480fce863aeb92181b9f0eff0acde1daf47a9"}},{"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":"library/src/scala/Product22.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7dcc816e6b0982c3b22fbb71fbbd7c785ed5c5025fb79cb050fb81e3c6602ce"}},{"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":"library/src/scala/package.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9556f1f166448bf2042a787ca17ed0c28ed2fd635f70097427a04db619879b50"}},{"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":"library-js/src/scala/package.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"00054e897948e4fd6378e41e38652422ca49c9662b4e8639a10b1e2bcbc2b5ce"}},{"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":"library/src/scala/runtime/Tuple3Zipped.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3e3f75eb7e085d1bd7f6acd7a774df4ac278867a2614bbabe6aa32a9c173bec"}},{"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":"library/src/scala/Product21.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b14b11d9d9efa8e69ab215deb7f534d4a2c4f15b2edebff02e50c8700337eac"}},{"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":"bench-micro/src/main/scala/dotty/tools/benchmarks/specializedtraits/VectorDotProductPoly.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"75bcfcc8e4b18622053a4c37e33a6bbb193563c2aeeac5b2b9bf5454b9fd3cbe"}},{"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":"library/src/scala/Product20.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c16104fc06af57c1ef96e3dafb03f0bc464590589d27e02988232e3ab7483cd"}},{"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":"sbt-bridge/src/xsbt/CompilerClassLoader.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac3943983725061b15cc5eba735856316cd26dc2ee710452e35f9126d2fd134c"}},{"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":"tasty-inspector/src/scala/tasty/inspector/TastyInspector.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f5b4c85a4cab510bdae0c2e10373198571c2db5c41f0da0c02c80098e502ba3"}},{"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":"library/src/scala/Product19.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de1cc48ff35531644462052f5f9641a25437175f4bfe3f2118a961bac2e7f86f"}},{"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":"library/src/scala/runtime/LazyRef.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5c09d803cc2b752dd287bd9360cfae4bd7ec15d2fc4fe5500ccdb0935c51fc3"}},{"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":"library/src/scala/Product18.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c5ea1b9ba3d5bcabd17e6fe366d112637b3248bfbd2f3c5d868bd6de3bc2bc0"}},{"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":"scaladoc/src/dotty/tools/scaladoc/tasty/comments/wiki/Entities.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"86d6f28fce71f3f6096a11b6e693097d50345458e46209b61caadd535892163e"}},{"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":"library/src/scala/collection/mutable/Queue.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a749ed1a3b2296624923704ba02b8b6d9cfc86b10394a9e0cceeead75b8d35a9"}},{"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":"library/src/scala/collection/immutable/ListSet.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ae7a3a67cba844fdd35946449dd53e074fab52a9beb189221b52d8a52fed1db"}},{"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":"library/src/scala/runtime/Tuple2Zipped.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4e970dc65a0b812ee612d2069a1c60ccc99d995a2a68fc719237aeb9d09ebb9"}},{"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":"library/src/scala/Product17.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ed27ac41252d65f60a67a7e8f85e7f132999880621e2fd037c6248eafc6c4eb"}},{"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":"compiler/src/dotty/tools/dotc/staging/HealType.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a2fd862d01745203b41383509e7ae6e0b0055ca4e4aa5bc65ae282967a2a3f7"}},{"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":"compiler/src/dotty/tools/dotc/transform/Instrumentation.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e8b2d5c5cff3dab0e3a2d5af4c206e427f685205719359ccb525169b58e869f"}},{"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":"library/src/scala/collection/mutable/SortedMap.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c680f9391843cbe9d1ce1660f029200b9aa47adf387f3f4e9e3ae842ffa2f84"}},{"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":"library/src/scala/jdk/javaapi/OptionConverters.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff41c854845a97e74e275b00f129e05b4fd59444a2839ee2a209d3fb519cabf4"}},{"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":"compiler/src/dotty/tools/dotc/transform/init/Util.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b399109d93e761a713abf9800d338f4723f787ec94f891f92162ffd7ad69491"}},{"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":"library/src/scala/Product16.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c6b22953de63f66fdb37b0cf46476719ac0b5de74be5a7ffa569277fe2821a0"}},{"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":"library/src/scala/collection/generic/IsMap.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f3d9c25ed0f3ce4aabaf0f974301f3508523f7681c9d4c6ae082a9643b9cd54"}},{"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":"compiler/src/dotty/tools/dotc/transform/SpecializeApplyMethods.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a5855ac56efe5a76910eb0bef247cd72b9ee518fbe1083e795fc5ad5765034a"}},{"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":"scaladoc-js/common/src/utils/html.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7e5f89cae1080ebc29c3a086c3d337ce16da017f7f5c2022341e4045a8810a8"}},{"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":"library/src/scala/sys/process/ProcessIO.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c14edb7be53b8b6c8df8ffdb5aff35465fd685e3802be3db43b4a266ff6ba9c"}},{"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":"library/src/scala/Product15.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cf694d6dbdb2a9a7701e1bbfaac9364bdf447e0e977651fbbac54d48ff8d146"}},{"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":"presentation-compiler/src/main/dotty/tools/pc/WithCompilationUnit.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"73ec384d01eaaa68b504fe5aa4c1adbe2e8502cd2e56c5aa17fd041626c0833a"}},{"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":"compiler/src/dotty/tools/dotc/transform/MoveStatics.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"561abd8fd15a05bc88c4dba6eb2dbe76608a67ae8beae73275482cbc1229bd96"}},{"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":"library/src/scala/Product14.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f544a533fa945ada01b08890642310a571d9094bcca153328475746ed7a2c34f"}},{"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":"scaladoc/src/dotty/tools/scaladoc/renderers/DocRenderer.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ab5fd4909b53b0e7643e83342f3bef4cb703568f121342a6a28d24bea3b21e0"}},{"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":"compiler/src/dotty/tools/dotc/transform/ReifiedReflect.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d6a48e06ee880e5a3ab53c4fe6c74e65851ad8d621f7842b42ef31d280d8cce"}},{"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":"compiler/src/dotty/tools/dotc/transform/init/Trace.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d6d9c9652b2f1bfef1ffd26e98e8f79f3b4db75b012eea159b3bc089ef18bcf"}},{"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":"compiler/src/dotty/tools/dotc/transform/init/Errors.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"26b5e62bf6ce573abb954a5ed71ea733303c4778b06f9b47ad344df957e29b8b"}},{"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":"library/src/scala/Product13.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a8aead7db3912611b4549026085f70bcf55c87f00f5abba072c5563e8c8fab9"}},{"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":"scaladoc/src/dotty/tools/scaladoc/renderers/Locations.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d488527aa63f8c423507436ecfa945938563d09bd2a5219b682d0fcb2feac43"}},{"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":"compiler/src/dotty/tools/dotc/parsing/JavaTokens.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdd9cbc1afcbe451d2c5b63a1398a64b62dd3548f483819e38eb48d0de480e32"}},{"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":"scaladoc/src/dotty/tools/scaladoc/tasty/comments/markdown/DocFlexmarkExtension.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a586e251f7e2c6254e5550ce67f8914644b50c27ef41ff5750c813e76453eb1"}},{"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":"library/src/scala/Product12.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc53fbaae787e71487a19d036ae6efff3991d3c57a893688a9ff5a2cf1175479"}},{"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":"library/src/scala/collection/generic/DefaultSerializationProxy.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5ec2cc3e253930463f66aad0db2802265222ecdde1d15f34f51653483ec720c"}},{"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":"library/src/scala/Tuple22.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dba732d794adec1878d125491ea1961b99dc36c072c105fe5b45a734ff33294"}},{"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":"library/src/scala/runtime/RichChar.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8426be4d6591877c9c08014ab2b3a8f1425ef35cb0eba97b5a254dc29f4350c"}},{"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":"compiler/src/dotty/tools/dotc/transform/sjs/AddLocalJSFakeNews.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a76a6c2ecf5ba9ab91533f676fcb810f8d1c2d67cae7cdd3cee12799ec45a199"}},{"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":"scaladoc/src/dotty/tools/scaladoc/util/html.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a90f5cbd1a4d23d04e561c3e70ac7f283f8f2f1b468ac0d7832269ce6a81c1af"}},{"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":"project/DocumentationWebsite.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e1bf7c1c824d989114caac371e03e655d33cd02a5b7be3b5723502ad528584d"}},{"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":"compiler/src/dotty/tools/dotc/transform/Staging.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"baaa5c8ea686c9108ba261009a27a2ccb2ea576340269157f4676ca4377d3f9e"}},{"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":"compiler/src/dotty/tools/dotc/ast/TreeMapWithTrackedStats.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dfc5498b834f4e881a81efe6e3aafb46ce4fd82fde6de3788feeea857489405"}},{"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":"library/src/scala/Product11.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d86b9abe7e0a562c3da3b23a3ab25c31bbe22931b4492955eafd49afbe7fa69d"}},{"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":"library/src/scala/Tuple21.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"52b6a25cf22fad3390d7463f8744c9da1b0f397dd3df3b3ef53cc10066602222"}},{"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":"library/src/scala/runtime/RichFloat.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7294a7796c078c0ae2811ff216ab27c6ae34c2bc717a50a57d418fd5ce2a289f"}},{"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":"library/src/scala/Tuple20.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5160645fb6b2e2ca688d6d7825cb109c6144c1b1df50b935c1f385da8749d506"}},{"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":"scaladoc/src/dotty/tools/scaladoc/tasty/ScalaDocSupport.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfdbd7ecfdb159bcb7837aa5178a67af3f55c1614f990de680c87794935e1b79"}},{"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":"library/src/scala/collection/mutable/Growable.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"80fd364cd0a97419a958052e977eb21ae9b47ae8cc1067c7c25fb4909dab2662"}},{"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":"scaladoc/src/dotty/tools/scaladoc/tasty/Scaladoc2AnchorCreator.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"51dae3975e102d6af4dfd3f04ff2a88a8830b446af66d914ecab4a86d9c43202"}},{"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":"bench-micro/src/main/scala/dotty/tools/benchmarks/specializedtraits/PairHashingPoly.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db9f72c5b3c8b854768cf92c65462e9c8d6776dcbd50d15271f216a2d0e47863"}},{"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":"library/src/scala/runtime/RichDouble.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7763466db4e0d02234caa6fe531ff45a50e57cf56199f7f748b66095bbd6115"}},{"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":"bench-micro/src/main/scala/dotty/tools/benchmarks/specializedtraits/MatrixMultiplication.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9ea52ce93a814e8e5b8cbeaa279bc52c46e78d743be8cae4df35cc4ca7206d8"}},{"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":"library/src/scala/Product10.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca8028bd78cdc408bc877842cdfcc5c443db979615fff17da36f5949d7adeac7"}},{"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":"compiler/src/dotty/tools/debug/JavaEncoding.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"339854c33b31e1b970748ef144725eb9113b12377433eaf9f8013b9e48baa473"}},{"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":"scaladoc-js/contributors/src/content-contributors/ContentContributors.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9382fad8145d21b4beeffea41a4aa8372f9e1429f5e24db0532fc6ea08664bb"}},{"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":"compiler/src/dotty/tools/dotc/interactive/SourceTree.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"15013db7dc36e27084ca5296197886cd03db24fea6c96fa31c579abe8db40676"}},{"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":"compiler/src/dotty/tools/dotc/core/DenotTransformers.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"37ad19691c8b39940ab1ecdcb4afb25dfd14705c6d4f9bfc82f6ad68fe00a89b"}},{"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":"library/src/scala/collection/mutable/MutationTracker.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"13d1700533f296e11c9e8ebb04cc7de1fbb9ab2f5e2a3f32cd4c7f01c3b5c82e"}},{"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":"library/src/scala/Tuple19.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4de87e7ee21ff88b8487f6e0bda0b94c61aecae93dc90205aa7c3e986d42a379"}},{"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":"library-js/src/scala/App.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"708dec7272d950dbfd24275a4d385cd4685e583211d10541a4b35a0b53bedb9d"}},{"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":"compiler/src/dotty/tools/dotc/transform/DropOuterAccessors.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9cfc46caa603d9583712ceaa786377c4831b6b8e17a6ef5aa863f9ea57c5eb7"}},{"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":"library/src/scala/collection/mutable/ListMap.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6d52276f970fc75d94514f2165dc15b30529fab2d9b6250a41523e7ad7f768b"}},{"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":"library/src/scala/jdk/javaapi/CollectionConverters.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a622eb1897a35c047fa3e4daaa30971e8af048667c96ac1a87cf75db08f6136"}},{"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":"library/src/scala/deriving/Mirror.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f22f7756973bae95a160f16f9238720f1d3b056e4dcb77ae5f26626c4d492bae"}},{"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":"library/src/scala/Product9.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cab49e23fbe13ea5a38225729f57d5a9b3b6e75b79c9d4eceee69b106b5d2b92"}},{"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":"library/src/scala/Tuple18.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"68a23747a5c028fbca8056ad1517d829b5945a21c14d74a90e4240a3189db946"}},{"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":"library/src/scala/deprecated.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9148340dcd7d6eeed0682c75f329ce1691bf724d296c11602e672650afbbb54c"}},{"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":"library/src/scala/annotation/init.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"35ed28b56ad5948cf98ce7b0e5bd733de1c9b27dcfb1d04834a7a1a580a3bf7e"}},{"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":"scaladoc/src/dotty/tools/scaladoc/tasty/SyntheticSupport.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"970558db571aed119b46b3c93c7a221794c591e54107d33207db0c08b6726226"}},{"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":"library/src/scala/Tuple17.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"efef965eb09d4b34d014551acd0da48ed7ae4ecd840fe14c1df00992beea78a6"}},{"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":"bench-micro/src/main/scala/dotty/tools/benchmarks/specializedtraits/VectorDotProduct.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"33a948fb44acebf8891b1da75e7ac99013a19cb122d30d548c86a46a37de8c72"}},{"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":"library/src/scala/concurrent/Awaitable.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"38ff4e00a214f8a50997579767f02a56f6ef44c53336d584dc277ecec73a3b50"}},{"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":"library/src/scala/Product8.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3edca47dcded85060bf15a5f820a631e71655673bae4e81adfa80cf7c7b3dec0"}},{"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":"library/src/scala/quoted/runtime/QuoteMatching.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bbf1c3c4151fa0aae6e0ce8d73f6db54c36f228abe6eab2f52525cbc3556aac"}},{"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":"staging/src/scala/quoted/staging/Compiler.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfa9c43b134a527265f7cc5c983d34b074055cc7daa9a23e922cc5a740ad1e95"}},{"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":"scaladoc/src/dotty/tools/scaladoc/ExternalDocLink.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb4df025828b2dbcd892f836246efde96d7264397dcc7c5aa251c255316d12c6"}},{"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":"scaladoc/src/dotty/tools/scaladoc/tasty/comments/MarkdownParser.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dacf218fcd41eb4e1c0e500c585d271af01830746ca556ffb0688879b50e3acf"}},{"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":"library/src/scala/Tuple16.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"19216e028d853008554acfc077e507130d8147134f3443c497138f60207de295"}},{"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":"project/Shading.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"36b45cc14c7f0200256bac5c05485e80228b13daccef7bcaec13dcdfccabfeae"}},{"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":"compiler/src/dotty/tools/debug/ExpressionCompilerConfig.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a86172648dbcbacd9ae55e8d24b7543d9cece0601f01e624da36098e60858aff"}},{"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":"compiler/src/dotty/tools/dotc/transform/InlineVals.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1acbe1ca162662e8ee25936234ebdb4fb572361b7073df6676f5d582083f2298"}},{"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":"compiler/src/dotty/tools/dotc/transform/RepeatableAnnotations.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f270f0d504ff55c3be9a8714e25a61b7a1e57c4c1fcc1cb81f608ddb6580e657"}},{"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":"compiler/src/dotty/tools/dotc/transform/ElimOpaque.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"036273f3b79b5bf493c24a16991024a55256e969a3184d4e6993fc54dd8f2df7"}},{"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":"library/src/scala/Product7.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e89c7626c2fad72af2ba2d91809b0b7bac9408bb61ff7c82427df6068276101e"}},{"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":"bench-run/src/main/scala/dotty/tools/benchmarks/Main.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"65fc3344b854c28f22bde8a0ba8dd633586607922e221274887cc20c7fb1fec9"}},{"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":"library/src/scala/Tuple15.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fba9c51a7cd1e121fc9ae19a7fd0a2c95725f379378fa771ae50a9f2142b6acd"}},{"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":"compiler/src/dotty/tools/dotc/transform/SpecializeTuples.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"93d009e4a3496006ca4ad7dd0e9f036257932b8f8342ac523175def5d2e11ff9"}},{"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":"compiler/src/dotty/tools/dotc/transform/init/Checker.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"09dfb2fdeab49c6e15eec3d00bdce232667e816875407d829c3b7cc59c8c3397"}},{"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":"scaladoc/src/dotty/tools/scaladoc/tasty/comments/markdown/SnippetRenderingExtension.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"74fdd2ca8acd5252f4817946deed717f9c81262ca283e9e477d07e4f0acde040"}},{"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":"library/src/scala/runtime/RichLong.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"213b3f163b171a461ec7054086962cfc29b56ac7946f7dfb207793b7f77acfb3"}},{"ruleId":"AX6","level":"note","message":{"text":"Fat interface: Product16[T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16] (16 abstract members): \u0060Product16[T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16]\u0060 declares 16 abstract members: \u0060_1\u0060, \u0060_2\u0060, \u0060_3\u0060, \u0060_4\u0060, \u0060_5\u0060, \u0060_6\u0060, \u0060_7\u0060, \u0060_8\u0060, \u0060_9\u0060, \u0060_10\u0060, \u0060_11\u0060, \u0060_12\u0060, \u0060_13\u0060, \u0060_14\u0060, \u0060_15\u0060, \u0060_16\u0060. Counted over its ABSTRACT members \u2014 a \u0060def\u0060 with no body or a \u0060val\u0060/\u0060var\u0060 with no initializer, once per signature; concrete members, private and protected members, and members of a companion \u0060object\u0060 are not counted, because no implementer is forced to write them. A wide interface forces every implementer and caller to depend on methods they don\u0027t use (the Interface-Segregation \u0027I\u0027 in SOLID). Split it into focused role-interfaces."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/Product16.scala"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"852dae9fc445e837c624696b597f010f6718ef8bb6686f64fe1f2b4d19625110"}},{"ruleId":"AX6","level":"note","message":{"text":"Fat interface: Product17[T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16, T17] (17 abstract members): \u0060Product17[T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16, T17]\u0060 declares 17 abstract members: \u0060_1\u0060, \u0060_2\u0060, \u0060_3\u0060, \u0060_4\u0060, \u0060_5\u0060, \u0060_6\u0060, \u0060_7\u0060, \u0060_8\u0060, \u0060_9\u0060, \u0060_10\u0060, \u0060_11\u0060, \u0060_12\u0060, \u0060_13\u0060, \u0060_14\u0060, \u0060_15\u0060, \u0060_16\u0060, \u0060_17\u0060. Counted over its ABSTRACT members \u2014 a \u0060def\u0060 with no body or a \u0060val\u0060/\u0060var\u0060 with no initializer, once per signature; concrete members, private and protected members, and members of a companion \u0060object\u0060 are not counted, because no implementer is forced to write them. A wide interface forces every implementer and caller to depend on methods they don\u0027t use (the Interface-Segregation \u0027I\u0027 in SOLID). Split it into focused role-interfaces."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/Product17.scala"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac3cfa17422e5cbbe86e1b9e01ec6786190ac856557bc487ff20119c8a711e12"}},{"ruleId":"AX6","level":"note","message":{"text":"Fat interface: Product18[T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16, T17, T18] (18 abstract members): \u0060Product18[T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16, T17, T18]\u0060 declares 18 abstract members: \u0060_1\u0060, \u0060_2\u0060, \u0060_3\u0060, \u0060_4\u0060, \u0060_5\u0060, \u0060_6\u0060, \u0060_7\u0060, \u0060_8\u0060, \u0060_9\u0060, \u0060_10\u0060, \u0060_11\u0060, \u0060_12\u0060, \u0060_13\u0060, \u0060_14\u0060, \u0060_15\u0060, \u0060_16\u0060, \u0060_17\u0060, \u0060_18\u0060. Counted over its ABSTRACT members \u2014 a \u0060def\u0060 with no body or a \u0060val\u0060/\u0060var\u0060 with no initializer, once per signature; concrete members, private and protected members, and members of a companion \u0060object\u0060 are not counted, because no implementer is forced to write them. A wide interface forces every implementer and caller to depend on methods they don\u0027t use (the Interface-Segregation \u0027I\u0027 in SOLID). Split it into focused role-interfaces."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/Product18.scala"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ea99e34bfa2a2d148d99a84919874d8e1d27700464d6512590280ba0b36755f"}},{"ruleId":"AX6","level":"note","message":{"text":"Fat interface: Product19[T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16, T17, T18, T19] (19 abstract members): \u0060Product19[T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16, T17, T18, T19]\u0060 declares 19 abstract members: \u0060_1\u0060, \u0060_2\u0060, \u0060_3\u0060, \u0060_4\u0060, \u0060_5\u0060, \u0060_6\u0060, \u0060_7\u0060, \u0060_8\u0060, \u0060_9\u0060, \u0060_10\u0060, \u0060_11\u0060, \u0060_12\u0060, \u0060_13\u0060, \u0060_14\u0060, \u0060_15\u0060, \u0060_16\u0060, \u0060_17\u0060, \u0060_18\u0060, \u0060_19\u0060. Counted over its ABSTRACT members \u2014 a \u0060def\u0060 with no body or a \u0060val\u0060/\u0060var\u0060 with no initializer, once per signature; concrete members, private and protected members, and members of a companion \u0060object\u0060 are not counted, because no implementer is forced to write them. A wide interface forces every implementer and caller to depend on methods they don\u0027t use (the Interface-Segregation \u0027I\u0027 in SOLID). Split it into focused role-interfaces."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/Product19.scala"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"e98bd25cb84e08e91f751b97807657598f8a791c862bfda40c74017e996b784c"}},{"ruleId":"AX6","level":"note","message":{"text":"Fat interface: Product20[T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16, T17, T18, T19, T20] (20 abstract members): \u0060Product20[T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16, T17, T18, T19, T20]\u0060 declares 20 abstract members: \u0060_1\u0060, \u0060_2\u0060, \u0060_3\u0060, \u0060_4\u0060, \u0060_5\u0060, \u0060_6\u0060, \u0060_7\u0060, \u0060_8\u0060, \u0060_9\u0060, \u0060_10\u0060, \u0060_11\u0060, \u0060_12\u0060, \u0060_13\u0060, \u0060_14\u0060, \u0060_15\u0060, \u0060_16\u0060, \u0060_17\u0060, \u0060_18\u0060, \u0060_19\u0060, \u0060_20\u0060. Counted over its ABSTRACT members \u2014 a \u0060def\u0060 with no body or a \u0060val\u0060/\u0060var\u0060 with no initializer, once per signature; concrete members, private and protected members, and members of a companion \u0060object\u0060 are not counted, because no implementer is forced to write them. A wide interface forces every implementer and caller to depend on methods they don\u0027t use (the Interface-Segregation \u0027I\u0027 in SOLID). Split it into focused role-interfaces."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/Product20.scala"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"360e8cf648af8cfc1e3b98c34b67c7c49ec81af02bd3e93fca0e966d0324e5a1"}},{"ruleId":"AX6","level":"note","message":{"text":"Fat interface: Product21[T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16, T17, T18, T19, T20, T21] (21 abstract members): \u0060Product21[T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16, T17, T18, T19, T20, T21]\u0060 declares 21 abstract members: \u0060_1\u0060, \u0060_2\u0060, \u0060_3\u0060, \u0060_4\u0060, \u0060_5\u0060, \u0060_6\u0060, \u0060_7\u0060, \u0060_8\u0060, \u0060_9\u0060, \u0060_10\u0060, \u0060_11\u0060, \u0060_12\u0060, \u0060_13\u0060, \u0060_14\u0060, \u0060_15\u0060, \u0060_16\u0060, \u0060_17\u0060, \u0060_18\u0060, \u0060_19\u0060, \u0060_20\u0060, \u0060_21\u0060. Counted over its ABSTRACT members \u2014 a \u0060def\u0060 with no body or a \u0060val\u0060/\u0060var\u0060 with no initializer, once per signature; concrete members, private and protected members, and members of a companion \u0060object\u0060 are not counted, because no implementer is forced to write them. A wide interface forces every implementer and caller to depend on methods they don\u0027t use (the Interface-Segregation \u0027I\u0027 in SOLID). Split it into focused role-interfaces."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/Product21.scala"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"7581ed6b42c3f51aa27256e399e137916ccbe8c019478ddd5f2036ed4df6e241"}},{"ruleId":"AX6","level":"note","message":{"text":"Fat interface: Product22[T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16, T17, T18, T19, T20, T21, T22] (22 abstract members): \u0060Product22[T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16, T17, T18, T19, T20, T21, T22]\u0060 declares 22 abstract members: \u0060_1\u0060, \u0060_2\u0060, \u0060_3\u0060, \u0060_4\u0060, \u0060_5\u0060, \u0060_6\u0060, \u0060_7\u0060, \u0060_8\u0060, \u0060_9\u0060, \u0060_10\u0060, \u0060_11\u0060, \u0060_12\u0060, \u0060_13\u0060, \u0060_14\u0060, \u0060_15\u0060, \u0060_16\u0060, \u0060_17\u0060, \u0060_18\u0060, \u0060_19\u0060, \u0060_20\u0060, \u0060_21\u0060, \u0060_22\u0060. Counted over its ABSTRACT members \u2014 a \u0060def\u0060 with no body or a \u0060val\u0060/\u0060var\u0060 with no initializer, once per signature; concrete members, private and protected members, and members of a companion \u0060object\u0060 are not counted, because no implementer is forced to write them. A wide interface forces every implementer and caller to depend on methods they don\u0027t use (the Interface-Segregation \u0027I\u0027 in SOLID). Split it into focused role-interfaces."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/Product22.scala"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c4970d66fd8f60fa9882c9ae570a9a2005be4925729a1146579c784d06211ef"}},{"ruleId":"AX6","level":"note","message":{"text":"Fat interface: reflectModule (111 abstract members): \u0060reflectModule\u0060 declares 111 abstract members: \u0060CompilationInfo\u0060, \u0060Tree\u0060, \u0060PackageClause\u0060, \u0060Import\u0060, \u0060Export\u0060, \u0060Definition\u0060, \u0060ClassDef\u0060, \u0060DefDef\u0060, \u0060ValDef\u0060, \u0060TypeDef\u0060, \u0060Term\u0060, \u0060Ref\u0060, \u0060Ident\u0060, \u0060Wildcard\u0060, \u0060Select\u0060, \u0060Literal\u0060, \u0060This\u0060, \u0060New\u0060, \u0060NamedArg\u0060, \u0060Apply\u0060, \u0060TypeApply\u0060, \u0060Super\u0060, \u0060Typed\u0060, \u0060Assign\u0060, \u0060Block\u0060, \u0060Closure\u0060, \u0060Lambda\u0060, \u0060If\u0060, \u0060Match\u0060, \u0060SummonFrom\u0060, \u0060Try\u0060, \u0060Return\u0060, \u0060Repeated\u0060, \u0060Inlined\u0060, \u0060SelectOuter\u0060, \u0060While\u0060, \u0060TypedOrTest\u0060, \u0060TypeTree\u0060, \u0060Inferred\u0060, \u0060TypeIdent\u0060, and 71 more. Counted over its ABSTRACT members \u2014 a \u0060def\u0060 with no body or a \u0060val\u0060/\u0060var\u0060 with no initializer, once per signature; concrete members, private and protected members, and members of a companion \u0060object\u0060 are not counted, because no implementer is forced to write them. A wide interface forces every implementer and caller to depend on methods they don\u0027t use (the Interface-Segregation \u0027I\u0027 in SOLID). Split it into focused role-interfaces."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/quoted/Quotes.scala"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e2e1098bfff7ca2ca3b74c935d7a2a7ff07ca19e68048dfba726c1f2e804529"}},{"ruleId":"AX6","level":"note","message":{"text":"Fat interface: SymbolModule (18 abstract members): \u0060SymbolModule\u0060 declares 18 abstract members under just 15 distinct name(s): \u0060spliceOwner\u0060, \u0060requiredPackage\u0060, \u0060requiredClass\u0060, \u0060requiredModule\u0060, \u0060requiredMethod\u0060, \u0060classSymbol\u0060, \u0060newClass\u0060, \u0060newClass\u0060, \u0060newClass\u0060, \u0060newModule\u0060, \u0060newMethod\u0060, \u0060newMethod\u0060, \u0060newVal\u0060, \u0060newBind\u0060, \u0060newTypeAlias\u0060, \u0060newBoundedType\u0060, \u0060noSymbol\u0060, \u0060freshName\u0060. Counted over its ABSTRACT members \u2014 a \u0060def\u0060 with no body or a \u0060val\u0060/\u0060var\u0060 with no initializer, once per signature; concrete members, private and protected members, and members of a companion \u0060object\u0060 are not counted, because no implementer is forced to write them. That is an OVERLOAD SET, not 18 separate responsibilities: a caller binds to 15 operation(s) and uses the overload it selected, so the Interface-Segregation harm does NOT apply on the caller\u0027s side and splitting this into role-interfaces would scatter one operation without relieving anything. The burden that does remain is the IMPLEMENTER\u0027s \u2014 all 18 signatures must be written and kept in step. Reduce it by collapsing overloads (optional or default parameters, or an options object) rather than by segregating the interface."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/quoted/Quotes.scala"},"region":{"startLine":4362}}}],"partialFingerprints":{"codehealthFindingId/v1":"4587d9428a6b8da8c26bc6c0977213d45f9e352d8e0d838a0e8fa8c56ae613fe"}},{"ruleId":"AX6","level":"note","message":{"text":"Fat interface: defnModule (46 abstract members): \u0060defnModule\u0060 declares 46 abstract members: \u0060RootPackage\u0060, \u0060RootClass\u0060, \u0060EmptyPackageClass\u0060, \u0060ScalaPackage\u0060, \u0060ScalaPackageClass\u0060, \u0060AnyClass\u0060, \u0060MatchableClass\u0060, \u0060AnyValClass\u0060, \u0060ObjectClass\u0060, \u0060AnyRefClass\u0060, \u0060NullClass\u0060, \u0060NothingClass\u0060, \u0060UnitClass\u0060, \u0060ByteClass\u0060, \u0060ShortClass\u0060, \u0060CharClass\u0060, \u0060IntClass\u0060, \u0060LongClass\u0060, \u0060FloatClass\u0060, \u0060DoubleClass\u0060, \u0060BooleanClass\u0060, \u0060StringClass\u0060, \u0060ClassClass\u0060, \u0060ArrayClass\u0060, \u0060PredefModule\u0060, \u0060Predef_classOf\u0060, \u0060JavaLangPackage\u0060, \u0060ArrayModule\u0060, \u0060Array_apply\u0060, \u0060Array_clone\u0060, \u0060Array_length\u0060, \u0060Array_update\u0060, \u0060RepeatedParamClass\u0060, \u0060RepeatedAnnot\u0060, \u0060OptionClass\u0060, \u0060NoneModule\u0060, \u0060SomeModule\u0060, \u0060ProductClass\u0060, \u0060FunctionClass\u0060, \u0060FunctionClass\u0060, and 6 more. Counted over its ABSTRACT members \u2014 a \u0060def\u0060 with no body or a \u0060val\u0060/\u0060var\u0060 with no initializer, once per signature; concrete members, private and protected members, and members of a companion \u0060object\u0060 are not counted, because no implementer is forced to write them. Those 46 declarations carry 44 distinct name(s), so part of the width is overloading rather than separate responsibilities \u2014 but 44 operations clears the \u003E15 bar on its own, so the row is about responsibilities, not signatures. A wide interface forces every implementer and caller to depend on methods they don\u0027t use (the Interface-Segregation \u0027I\u0027 in SOLID). Split it into focused role-interfaces."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/quoted/Quotes.scala"},"region":{"startLine":5200}}}],"partialFingerprints":{"codehealthFindingId/v1":"cddc4acc68d176ff75a0b99a369f146745965ada0210e2c046d8f22b042ea94e"}},{"ruleId":"AX6","level":"note","message":{"text":"Fat interface: FlagsModule (47 abstract members): \u0060FlagsModule\u0060 declares 47 abstract members: \u0060Abstract\u0060, \u0060AbsOverride\u0060, \u0060Artifact\u0060, \u0060Case\u0060, \u0060CaseAccessor\u0060, \u0060Contravariant\u0060, \u0060Covariant\u0060, \u0060Deferred\u0060, \u0060EmptyFlags\u0060, \u0060Enum\u0060, \u0060Erased\u0060, \u0060Exported\u0060, \u0060ExtensionMethod\u0060, \u0060FieldAccessor\u0060, \u0060Final\u0060, \u0060Given\u0060, \u0060HasDefault\u0060, \u0060Implicit\u0060, \u0060Infix\u0060, \u0060Inline\u0060, \u0060Invisible\u0060, \u0060JavaDefined\u0060, \u0060JavaStatic\u0060, \u0060JavaAnnotation\u0060, \u0060Lazy\u0060, \u0060Local\u0060, \u0060Macro\u0060, \u0060Method\u0060, \u0060Module\u0060, \u0060Mutable\u0060, \u0060NoInits\u0060, \u0060Opaque\u0060, \u0060Open\u0060, \u0060Override\u0060, \u0060Package\u0060, \u0060Param\u0060, \u0060ParamAccessor\u0060, \u0060Private\u0060, \u0060PrivateLocal\u0060, \u0060Protected\u0060, and 7 more. Counted over its ABSTRACT members \u2014 a \u0060def\u0060 with no body or a \u0060val\u0060/\u0060var\u0060 with no initializer, once per signature; concrete members, private and protected members, and members of a companion \u0060object\u0060 are not counted, because no implementer is forced to write them. A wide interface forces every implementer and caller to depend on methods they don\u0027t use (the Interface-Segregation \u0027I\u0027 in SOLID). Split it into focused role-interfaces."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/quoted/Quotes.scala"},"region":{"startLine":5405}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3eee2a66924b23dfe43c059be3ad09f5b09ba3c5653165a0745443e1f51abf2"}},{"ruleId":"AX6","level":"note","message":{"text":"Fat interface: ProcessBuilder (35 abstract members): \u0060ProcessBuilder\u0060 declares 35 abstract members under just 15 distinct name(s): \u0060!!\u0060, \u0060!!\u0060, \u0060!!\u003C\u0060, \u0060!!\u003C\u0060, \u0060lazyLines\u0060, \u0060lazyLines\u0060, \u0060lazyLines\u0060, \u0060lazyLines\u0060, \u0060lazyLines_!\u0060, \u0060lazyLines_!\u0060, \u0060lazyLines_!\u0060, \u0060lazyLines_!\u0060, \u0060lineStream\u0060, \u0060lineStream\u0060, \u0060lineStream\u0060, \u0060lineStream\u0060, \u0060lineStream_!\u0060, \u0060lineStream_!\u0060, \u0060lineStream_!\u0060, \u0060lineStream_!\u0060, \u0060!\u0060, \u0060!\u0060, \u0060!\u003C\u0060, \u0060!\u003C\u0060, \u0060run\u0060, \u0060run\u0060, \u0060run\u0060, \u0060run\u0060, \u0060run\u0060, \u0060#\u0026\u0026\u0060, \u0060#||\u0060, \u0060#|\u0060, \u0060###\u0060, \u0060canPipeTo\u0060, \u0060hasExitValue\u0060. Counted over its ABSTRACT members \u2014 a \u0060def\u0060 with no body or a \u0060val\u0060/\u0060var\u0060 with no initializer, once per signature; concrete members, private and protected members, and members of a companion \u0060object\u0060 are not counted, because no implementer is forced to write them. That is an OVERLOAD SET, not 35 separate responsibilities: a caller binds to 15 operation(s) and uses the overload it selected, so the Interface-Segregation harm does NOT apply on the caller\u0027s side and splitting this into role-interfaces would scatter one operation without relieving anything. The burden that does remain is the IMPLEMENTER\u0027s \u2014 all 35 signatures must be written and kept in step. Reduce it by collapsing overloads (optional or default parameters, or an options object) rather than by segregating the interface."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/sys/process/ProcessBuilder.scala"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"83ab12d6b2f467f32aa76148391af797d3738d6626084152288b1846347f6e52"}},{"ruleId":"GD1","level":"warning","message":{"text":"Unfinished stub \u2014 body is \u0060???\u0060: \u0060patternConstrStr\u0060 is a shipped member whose whole body is still \u0060???\u0060, and nothing in the repository overrides it \u2014 generated scaffolding that was never completed. Implement it or remove the dead surface."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/ErrorReporting.scala"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"e775aa22e1d458befdfbf9226c6400a48d1d58566647d5aed8667173311e6f7a"}},{"ruleId":"GD1","level":"warning","message":{"text":"Unfinished stub \u2014 body is \u0060???\u0060: \u0060parseLinkDefinition\u0060 is a shipped member whose whole body is still \u0060???\u0060, and nothing in the repository overrides it \u2014 generated scaffolding that was never completed. Implement it or remove the dead surface."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scaladoc/src/dotty/tools/scaladoc/SourceLinks.scala"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"0711b63d54ca9eb32ccbf67d67e0f54eb6e6961223aacf6d92647cb1d4db416a"}},{"ruleId":"GD1","level":"warning","message":{"text":"Unfinished stub \u2014 body is \u0060???\u0060: \u0060setValue\u0060 is a shipped member whose whole body is still \u0060???\u0060, and nothing in the repository overrides it \u2014 generated scaffolding that was never completed. Implement it or remove the dead surface."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scaladoc/src/dotty/tools/scaladoc/site/LoadedTemplate.scala"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"c76cc324a0af435056d3138bab142cc1f7d8fa1d69f4a0d1883157186b862944"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060enableAliasing\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/semanticdb/internal/SemanticdbInputStream.scala"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc03d4563d85c95907a53a58788b211cbfacf8b77d9ebf27b8adb53869e785e4"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished stub \u2014 body is ??? / NotImplementedError: \u0060patternConstrStr\u0060 is a shipped method whose whole body is \u0060???\u0060 (or throws NotImplementedError), and nothing in the repository overrides it \u2014 scaffolding that was never completed. Implement it or remove the dead surface."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/ErrorReporting.scala"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6f5866c14a323ef81d6d49ae6815beecbd52429cc6b2e57876856f5e04f9e54"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished stub \u2014 body is ??? / NotImplementedError: \u0060parseLinkDefinition\u0060 is a shipped method whose whole body is \u0060???\u0060 (or throws NotImplementedError), and nothing in the repository overrides it \u2014 scaffolding that was never completed. Implement it or remove the dead surface."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scaladoc/src/dotty/tools/scaladoc/SourceLinks.scala"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca7c35caba7c7a658333ec948afdfa043928769b0504d3e67267954b075217ef"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished stub \u2014 body is ??? / NotImplementedError: \u0060setValue\u0060 is a shipped method whose whole body is \u0060???\u0060 (or throws NotImplementedError), and nothing in the repository overrides it \u2014 scaffolding that was never completed. Implement it or remove the dead surface."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scaladoc/src/dotty/tools/scaladoc/site/LoadedTemplate.scala"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"30610f086845d851d1bff12b9ebc372182c3b9088969a4b7accaec329bc540a8"}},{"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":"compiler/src/dotty/tools/dotc/profile/Profiler.scala"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbcf9adcfec5fa428e630b551e4923ed0fe35c8f6e9e5b7c97c04299ea7d2678"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/test/dotty/tools/dotc/BootstrappedOnlyCompilationTests.scala"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4670d8ad457075a3114b7ba45114f76e608443a615bf1fda2c488196e9902ad"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/test/dotty/tools/dotc/DeterminismTest.scala"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"f58441255192dcbbb13f5066a135b59c528581cd80ed85e5b66c1fd49a757c4b"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/test/dotty/tools/dotc/DeterminismTest.scala"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"63f3d6bc65198fff8fffcfa8c37c8433cd684caa1ab5d3eeaf4bc656d7a8a7bc"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/test/dotty/tools/dotc/Playground.scala"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0fcdcba1dab026b88e0925f8cf0f645fc23bb5d69289dcbeb842ebe290202ec"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/test/dotty/tools/dotc/printing/SyntaxHighlightingTests.scala"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"b17c0a78a9911f0f74b6f5b386c9cd699d4b4efbf8572236acd7e00514494d78"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/test/dotty/tools/dotc/profile/FileUtilsTest.scala"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a43692d3a2e7950e15e427b06540eab22ba58af082092806a13f991ca881a59"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/test/dotty/tools/scripting/BashExitCodeTests.scala"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"adb318a1b4292cabf02228ed977b0bbeefdbb6989dd244a87694c1ff8399c06b"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/test/dotty/tools/scripting/BashScriptsTests.scala"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a5d73514cbac68081b8122908f1b49b1a23498fcf93862d738685d0593d5445"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/test/dotty/tools/scripting/BashScriptsTests.scala"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"52105929c66425e229827b2f45d02cb339ad867a97af8ad5e57facd8d13c3823"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/test/dotty/tools/scripting/BashScriptsTests.scala"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"51f062a11c4121a9961d87140feb6d2e15e6d8cd351d3c1e909d2e10b1519a43"}},{"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":"library/src/scala/io/Position.scala"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"4877c636d2ec1ac721dff2a3caa1210f9a16e7cf30a19d4f888ac22a5f893b56"}},{"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":"library/src/scala/jdk/DoubleAccumulator.scala"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d0a09ebb16959aecd758d1b0a5f56ed0aab94615f4baf260d2e870d2cc9bfc6"}},{"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":"library/src/scala/jdk/IntAccumulator.scala"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"5911acc28714a2aa0d4a1cf48e6f8933acb932bd3dda75b3d3cde6697292d7ab"}},{"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":"library/src/scala/jdk/LongAccumulator.scala"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f307f10f487f4b7eeb6e75fd6b8c839e49f01e300e15fb607b7a22a8d0786e5"}},{"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":"library/src/scala/runtime/LazyVals.scala"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"be4890f09c1060b30f7de670b9ff49c4403c0039e6bf7d6a706051fe5d7050e3"}},{"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":"library/src/scala/specialize/Specialized.scala"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"345fa11857b6688eacc3d542dfad7955a681d885654d01b12f6558fc8ba9fb80"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/test/scala/collection/immutable/HashMapTest.scala"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"a34db5ff194a296292898926d219e9295aa2ecb1cd565218b5662ed0c6db5796"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/test/scala/collection/immutable/HashMapTest.scala"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"89c71225eb61b91fb2f1ccfe410e354303ae19bd29506ad6367104b229c7f3ee"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/test/scala/collection/immutable/HashSetTest.scala"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2e79e51a874720f04f6e015a13f4b9e1035ce17a3429e795bbf56c4f221a86b"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/test/scala/collection/immutable/HashSetTest.scala"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"edeeef00134c1d3b0081eb253d43e0ed71b3c139bb36660e3333758bf556cc32"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/test/scala/collection/immutable/HashSetTest.scala"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"58a0c6c92aaaba2586fea2e527d2e044608ee64c28fd9c13059a4119483c642b"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/test/scala/collection/immutable/HashSetTest.scala"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eb80257ccbecb6872eeabc136e2f545a6712cb79962ac0b2c866f4938d3798c"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/test/scala/collection/immutable/HashSetTest.scala"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5112bcec74b3201ac4f1b5fc3c9f5ede9afdac744a38b87d2e547c9ef5dd741"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/test/scala/collection/immutable/HashSetTest.scala"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"32bc7fda3b5c66eef84accb0ce3072856743ae614361e1e5cccfc27cf59ff35f"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/test/scala/collection/immutable/HashSetTest.scala"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9e47bbfc7c578a217d13b661ae4cc197266877841ad12310b78df3c63b56aff"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/test/scala/collection/immutable/HashSetTest.scala"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"07c36a5864e5afdf99e156d908a3e23a51c49f5eb3cb35483fde65e381588416"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/test/scala/collection/immutable/HashSetTest.scala"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"312d0ddf92d522425179b2b3bcab94f01a57ee16a6aed79637b365e6fb33fe8e"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/test/scala/collection/immutable/HashSetTest.scala"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"faf9942ae20afc24d6f85139f69050d6fc66c1eb96a00b3289b9d74e2ca9d8a3"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/test/scala/collection/immutable/HashSetTest.scala"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"78dc63b823dc46d07b0e33872d71de1336f8139d0c19c5452480b9e4c72fd072"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/test/scala/collection/immutable/SortedMapTest.scala"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4b38cc1cc9d09c1e53b54e1c8041863ec32504bf5221583b9b38f1e00c92acf"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/test/scala/collection/immutable/SortedSetTest.scala"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"4866d509960e7ed504d3da4c71b3dfa95c6caedd65f7717c2bd22fa597f1d217"}},{"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":"presentation-compiler/src/main/dotty/tools/pc/completions/CompletionValue.scala"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"71b7811e6785281c5b408f890791edcc1d32c9704f4b99f5ec8b820b4eda4983"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"presentation-compiler/test/dotty/tools/pc/tests/NoIndentSuite.scala"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"44449d426b613c75fb0c3016935ef4b7f30dd4db47ecb391ce0ec99ef0f518ff"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"presentation-compiler/test/dotty/tools/pc/tests/completion/CompletionArgSuite.scala"},"region":{"startLine":1176}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c901daedcf1a52d250e2c683422792a4e182c3a13111a4f85b1a11bcbaf94ec"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"presentation-compiler/test/dotty/tools/pc/tests/completion/CompletionCaseSuite.scala"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"a619201711de923e80ea00b9f862a979ad557f7c4fb6973c0605e226d09b455f"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"presentation-compiler/test/dotty/tools/pc/tests/completion/CompletionCaseSuite.scala"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"232d8a0baeaa5087904a0b3ceed46f34879e0601fe7fbbff9fb89fa71c2d1d6c"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"presentation-compiler/test/dotty/tools/pc/tests/completion/CompletionCaseSuite.scala"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cc8d8d1050f84949dc52af6633b98a636831cfb1fb2bfe2f65b6df4ab87f8e4"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"presentation-compiler/test/dotty/tools/pc/tests/completion/CompletionCaseSuite.scala"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3daa42a133a10674df58664befc2909421efe4ec53e759d79b8c05ed13cae8a"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"presentation-compiler/test/dotty/tools/pc/tests/completion/CompletionInterpolatorSuite.scala"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"943c93f6a14aa1cb4da2bd1cf6e1e7ad3b6dd753981b2a9db8783cdb6ba2a52b"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"presentation-compiler/test/dotty/tools/pc/tests/completion/CompletionKeywordSuite.scala"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1c518792d4e28c55718e91de5a1399cb5295746e02ba8661f7f85d633b6d76a"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"presentation-compiler/test/dotty/tools/pc/tests/completion/CompletionKeywordSuite.scala"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"e60c13710e221a4f1bdd45bb9110b9401cd178e365f77c2469b330d9840db432"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"presentation-compiler/test/dotty/tools/pc/tests/completion/CompletionKeywordSuite.scala"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad9d9d3e89c834f9c2494f6feca2cf45a3c123979d1ed12a7df2887b23123ef7"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"presentation-compiler/test/dotty/tools/pc/tests/completion/CompletionKeywordSuite.scala"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"61f821d3ea35f4f4443d40c21c698395ccda88fa60d07460783840e3bcb87ebd"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"presentation-compiler/test/dotty/tools/pc/tests/completion/CompletionKeywordSuite.scala"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"8483c93a69565235e7805c3a951f336a70e3c91e98ce47d4be6ed72764f50f1b"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"presentation-compiler/test/dotty/tools/pc/tests/completion/CompletionKeywordSuite.scala"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fa45884250eb4b19f337a6982eb344c6110fc28318c2408c9d6ba68c2db5059"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"presentation-compiler/test/dotty/tools/pc/tests/completion/CompletionMatchSuite.scala"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0818d5e94f69b107a3db2712e7b72b5f2b724a16a56c315710ea067d41ac601"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"presentation-compiler/test/dotty/tools/pc/tests/completion/CompletionMatchSuite.scala"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"296e7aff6964dfa3c22d5adfd66768dd3d9abc2b2414ace2baf8d8f272c08f52"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"presentation-compiler/test/dotty/tools/pc/tests/completion/CompletionScalaCliSuite.scala"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a8c5c809f12945047f02d56c7fb0f7bfb594c59faca3ee24e91bdc61b2e426e"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"presentation-compiler/test/dotty/tools/pc/tests/completion/CompletionScalaCliSuite.scala"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"ada9ea8181639697ec7c28dac336fef09febc6d419d882cdfc55a78aeb125b11"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"presentation-compiler/test/dotty/tools/pc/tests/completion/CompletionScalaCliSuite.scala"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"41fa8b4a7bf448ce6cece33f73437c9e861136191a6bc15f83653bb8b539af88"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"presentation-compiler/test/dotty/tools/pc/tests/completion/CompletionScalaCliSuite.scala"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"f41cd22d42ae0d0ef44bf41e944b96fd8d855d1aa5a8349b5b226f8c2e61a481"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"presentation-compiler/test/dotty/tools/pc/tests/completion/CompletionSnippetSuite.scala"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"151e875dca7e50ed56a4b1ca89072342d4a2a405f3c282b04d8597119bf6e14a"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"presentation-compiler/test/dotty/tools/pc/tests/completion/CompletionSnippetSuite.scala"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b1519d094ecca445732e6f66d1f3fd7f0aa293a7325a56bd8a32a867d674c78"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"presentation-compiler/test/dotty/tools/pc/tests/completion/CompletionSnippetSuite.scala"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f666675b17e94d515f991865c083712ffcb508f7e81a0943398296a4035a9f1"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"presentation-compiler/test/dotty/tools/pc/tests/completion/CompletionSuite.scala"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"968ddb32ccbd249d8db171ebd5edfb19e1f3d91e3dfe4202a5614bb590c17229"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"presentation-compiler/test/dotty/tools/pc/tests/completion/CompletionSuite.scala"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"da62ce08558ca240726d2591c9e0700f6026c195e10c5e3f0d78f67a2f3a4688"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"presentation-compiler/test/dotty/tools/pc/tests/completion/CompletionSuite.scala"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5131cd8010133cb159092b75f2e0dccc22405a4253d6d3d833893d5478875f9"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"presentation-compiler/test/dotty/tools/pc/tests/completion/CompletionSuite.scala"},"region":{"startLine":1716}}}],"partialFingerprints":{"codehealthFindingId/v1":"8975086b7b63510430e8c43cb1766f04c57abb160035fc266136b3495da04864"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"presentation-compiler/test/dotty/tools/pc/tests/definition/PcDefinitionSuite.scala"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"f04c56a73df2a8cec26ef27c40a21d24cda25b5f30efca1adeacb98f6cd752be"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"presentation-compiler/test/dotty/tools/pc/tests/definition/TypeDefinitionSuite.scala"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"f32710e2ca64fcd42193bc9a47a709ed8f6bba2d3107da9ef319fa750eb5f628"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"presentation-compiler/test/dotty/tools/pc/tests/edit/ConvertToNamedLambdaParametersSuite.scala"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"658b44f4c65277b6648e1722ae9b69dd0c9f713459171e58f78c1cbeea8bf1d2"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"presentation-compiler/test/dotty/tools/pc/tests/highlight/TypeDocumentHighlightSuite.scala"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"a264c1c6ae350b5b4c9d3bad74675cfd6579a808ee65885f26b1d9ed0b4c7396"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"presentation-compiler/test/dotty/tools/pc/tests/highlight/TypeDocumentHighlightSuite.scala"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf16730deffea5d0a6657111ee5534da6d043cbe18273dfd5ed6cba5fa28aac0"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"presentation-compiler/test/dotty/tools/pc/tests/hover/HoverTermSuite.scala"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"c10895d6d660eb413214cd44f996e982e0d59dfe8f207dac355a63a643beb637"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"presentation-compiler/test/dotty/tools/pc/tests/hover/HoverTermSuite.scala"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e94598e79a7f5ee6e651986e158b783cbd2dc6e7faac0e50c2d304af886fdd0"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"presentation-compiler/test/dotty/tools/pc/tests/signaturehelp/SignatureHelpInterleavingSuite.scala"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bd361b51e1c18375fdf13212095ee38281f538e98291c192835251593c4daa3"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"presentation-compiler/test/dotty/tools/pc/tests/signaturehelp/SignatureHelpInterleavingSuite.scala"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"e66da14c1f106f683322394f50a450a81796a46b9d3e04cefa679525f4a91d78"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"presentation-compiler/test/dotty/tools/pc/tests/signaturehelp/SignatureHelpInterleavingSuite.scala"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"21392c8dc630adcc57cc475ba423c166700597bfe8857e1639ba8c5706dfd55b"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"presentation-compiler/test/dotty/tools/pc/tests/signaturehelp/SignatureHelpInterleavingSuite.scala"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb67af9b91687df50b74e44a41c880a1eb99154d24e62b55e7152065e821521b"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"presentation-compiler/test/dotty/tools/pc/tests/signaturehelp/SignatureHelpPatternSuite.scala"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"1df6f1c90c87f59e59bc507d3805b7404006a07cc4730ffb8a61c8cb83947a7b"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"presentation-compiler/test/dotty/tools/pc/tests/signaturehelp/SignatureHelpPatternSuite.scala"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e24fc359467d8590b510ff1605ba17b43fc8775d108979f0a3a004f9e796abe"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"presentation-compiler/test/dotty/tools/pc/tests/signaturehelp/SignatureHelpSuite.scala"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c7a0d2db363e4de18cd93e6b5a5bbcf355521a48f361e37f9a2f77c3ac1b66"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"presentation-compiler/test/dotty/tools/pc/tests/signaturehelp/SignatureHelpSuite.scala"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fe8b09d5746f01bafd874569d46d175346344a33e3cdf1d17c03c5ed8c3dd56"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"presentation-compiler/test/dotty/tools/pc/tests/signaturehelp/SignatureHelpSuite.scala"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7a4889a5328a79c4cbbfecffee033e2651ea10180982f25149fec9f50efbff8"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"presentation-compiler/test/dotty/tools/pc/tests/signaturehelp/SignatureHelpSuite.scala"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b8801209417e8c582a9ea44a84d49c70e20abe1556a72e1025ba1b97d11a95f"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"repl/test/dotty/tools/repl/JLineTerminalTests.scala"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"5497b113e65410f15780bbe87dc1e718121c46ae15e61652d9c16e794ad92702"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"repl/test/dotty/tools/repl/JLineTerminalTests.scala"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"87d767864df9177bda066fa6a74c7eb0b48ce43bc8a8a6cf2556e1a8d79749a1"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"repl/test/dotty/tools/repl/ReplDirectiveTests.scala"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"879ef64869b67b591e404a60af32cdb15df606124f660f25ebb46fc00098c285"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"repl/test/dotty/tools/repl/ReplInteractiveTests.scala"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e9e413980eaf97cf8cc8ddf86bdeb9cf9f9f8505ef7869f29d909db3c70c0f6"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"repl/test/dotty/tools/repl/ReplInteractiveTests.scala"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"4470d13c728f1ca5f55771bdd3e7878a8ed6ca818a9f2281840af5d69c01b12f"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"repl/test/dotty/tools/repl/ReplInteractiveTests.scala"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c9944067262ac368a356de7b1c37b8655d6224893ee441ae3cbb1fab325e672"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sbt-bridge/test/xsbt/ExtractAPISpecification.scala"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"80b0c71ac5db9118bc6a50c88e82400a77608f8c8b74abda15e04fba785ec0e9"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sbt-bridge/test/xsbt/ExtractAPISpecification.scala"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"baeb901fb6e64924d75d32a3b76a4367c23f3468734caddfc9be2ca85129e2f6"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sbt-bridge/test/xsbt/ExtractAPISpecification.scala"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8002639eeeb514fa1e7f03f4a54a47691366432f4d578182ab134098c8ea1b4"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sbt-bridge/test/xsbt/ExtractAPISpecification.scala"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f43e47fd112886130af1a13b78436045cd37c999ea95ee74d9a274d5ab0ce55"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sbt-bridge/test/xsbt/ExtractAPISpecification.scala"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"56ebc807f21062834a70b4365f608e94f4358fe465efd13ea2246ad2cd513b65"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sbt-bridge/test/xsbt/ExtractUsedNamesSpecification.scala"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a19fc24f5247ec798e426e2bad6376d2a66b916cd9e5e40b13b67782c738d63"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scaladoc/test/dotty/tools/scaladoc/linking/DriTestCases.scala"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"288d52d1f839fb755441a34d173abcc0f59d7fa07d43c6ed11b2b0aae8985a72"}},{"ruleId":"M1","level":"note","message":{"text":"Thin README: The root README is 108 words, against a bar of 120. Of the three newcomer-critical sections this check looks for by heading, in the README and in the repository documents it links, it found no a testing section, no an architecture or project-map section. Sections are matched on HEADING text only, so material written under a heading this check does not recognise \u2014 or with no heading at all \u2014 is not seen and this row may understate what the document covers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c88b11295dc6ac6146c259ace6043143959f96dc98628f8c8578b6c5f95b8149"}},{"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":"P10","level":"note","message":{"text":"Implementation type on the public API: 2 public types in \u0060scala.annotation.internal\u0060 are marked as implementation by their own namespace, folder or name: \u0060TASTYLongSignature\u0060 (library/src/scala/annotation/internal/TASTYLongSignature.java:11, \u0060internal\u0060), \u0060TASTYSignature\u0060 (library/src/scala/annotation/internal/TASTYSignature.java:11, \u0060internal\u0060). While they are public, every consumer of the library can bind to them, so changing them is a breaking change for those consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/annotation/internal/TASTYLongSignature.java"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f9dc2f447dff4cf6d33dfb469957a5cb0861bb02d521c7df7f484c3252daf87"}},{"ruleId":"P10","level":"note","message":{"text":"Implementation type on the public API: 1 public type in \u0060dotty.tools.xsbt\u0060 is marked as implementation by its own namespace, folder or name: \u0060ProgressCallbackImpl\u0060 (sbt-bridge/src/dotty/tools/xsbt/ProgressCallbackImpl.java:8, name ends in \u0060Impl\u0060). While it is public, every consumer of the library can bind to it, so changing it is a breaking change for those consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sbt-bridge/src/dotty/tools/xsbt/ProgressCallbackImpl.java"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"dae7e89f2b31e88715f02f3ccaa764b266a548beaca74be3b0fa06b09394af57"}},{"ruleId":"P10","level":"note","message":{"text":"Implementation type on the public API: 1 public type in \u0060xsbt\u0060 is marked as implementation by its own namespace, folder or name: \u0060CachedCompilerImpl\u0060 (sbt-bridge/src/xsbt/CachedCompilerImpl.java:23, name ends in \u0060Impl\u0060). While it is public, every consumer of the library can bind to it, so changing it is a breaking change for those consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sbt-bridge/src/xsbt/CachedCompilerImpl.java"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"640194b73382866b7a57934d7308a35e2e2eef5e80751c9a29623f6c7df48b3f"}},{"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 28 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.yaml"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P3","level":"note","message":{"text":"Dependabot does not watch gitsubmodule: \u0060.github/dependabot.yml\u0060 schedules updates, but no \u0060package-ecosystem\u0060 entry covers \u0060gitsubmodule\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":"189dbbebbc083d2f437329c82dc1cae8adbf1b7293a5bc9e2de708f747e84eda"}},{"ruleId":"R1","level":"warning","message":{"text":"Type Safety: 0 typed \u00B7 13 plain JS \u2014 the untyped files are scaladoc/resources/dotty_res/hljs/highlight.pack.js, scaladoc/resources/dotty_res/scripts/common/component.js, scaladoc/resources/dotty_res/scripts/common/utils.js, scaladoc/resources/dotty_res/scripts/components/DocumentableList.js, scaladoc/resources/dotty_res/scripts/components/Filter.js, scaladoc/resources/dotty_res/scripts/components/FilterBar.js (\u002B7 more)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d00ee7953f55325a823d27e5db9657c80ca9b9861c0c0abf8fe487cd3fa586d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): scaladoc/resources/dotty_res/hljs/highlight.pack.js:310 \u00B7 scaladoc/resources/dotty_res/hljs/highlight.pack.js:451 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scaladoc/resources/dotty_res/hljs/highlight.pack.js"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd7b900e451c396f8e34602083b1960b4817788635206b22c7ca50f88d54617a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): scaladoc/resources/dotty_res/scripts/featureToggles.js:14 \u00B7 scaladoc/resources/dotty_res/scripts/theme.js:1 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scaladoc/resources/dotty_res/scripts/featureToggles.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"601b7dc287997c490dc64d12918ee4fe735584edac54988ed4b08aed3af589a8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): scaladoc/resources/dotty_res/scripts/ux.js:647 \u00B7 scaladoc/resources/dotty_res/scripts/ux.js:659 \u2014 both copies are in the same file, so extract the block 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":"scaladoc/resources/dotty_res/scripts/ux.js"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dbd96e29d4d8aafc3f163398c3d88e20a442e684f2eb919934b32baadbb0f4b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function t (cyclomatic 24, cognitive 19): t has cyclomatic complexity 24 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scaladoc/resources/dotty_res/hljs/highlight.pack.js"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"49309cd28099ea7ed4536704b931703a8b96599e1156ef315c4b933fce6a914d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function x (cyclomatic 18, cognitive 17): x has cyclomatic complexity 18 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scaladoc/resources/dotty_res/hljs/highlight.pack.js"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"66a9a2a3881e9206cbd93c389d4abe0c3524a913a41d18cf111dd2b2dd44e144"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function attachAllListeners (cyclomatic 17, cognitive 26): attachAllListeners has cyclomatic complexity 17 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scaladoc/resources/dotty_res/scripts/ux.js"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"39178ee5707bc440f7282ca3b43cc2f16f6782cddb71a1ad68b640650466fa5a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function b (cyclomatic 14, cognitive 10): b has cyclomatic complexity 14 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scaladoc/resources/dotty_res/hljs/highlight.pack.js"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"596bc7310c4d9cb85fe45ea5671a5490b510207e0416f2dacbddd861d5f07536"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onload (cyclomatic 13, cognitive 11): onload has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scaladoc/resources/dotty_res/scripts/ux.js"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0b4138baeb3a53cb3f566ed582a6a540acb9598618a03e436392125453ea91f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 9): (anonymous) has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scaladoc/resources/dotty_res/hljs/highlight.pack.js"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"1874686bef81e5705d5319e2fbc9d6f2a6aaf70a3e0b5090f613a5234ea1337b"}},{"ruleId":"R3","level":"warning","message":{"text":"scaladoc/resources/dotty_res/hljs/highlight.pack.js: 1064 lines of code: scaladoc/resources/dotty_res/hljs/highlight.pack.js has 1064 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scaladoc/resources/dotty_res/hljs/highlight.pack.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"408c28e4fd1f49ef3721169e351eed83042e8a3637533f5d58e40fc6115844ff"}},{"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":"compiler/src/dotty/tools/dotc/core/NameOps.scala"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f767ffe961ee630003983fc5ac3116ed6f2c2b70132139cd861c4aee2b60ba7"}},{"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":"compiler/src/dotty/tools/dotc/semanticdb/internal/MD5.scala"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbdf919f9eecc408f33000eeab585256dfe32a9c1f26acb33b4182920e831bb3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!isEmpty \u0026\u0026 ( (step \u003E zero \u0026\u0026 start \u003C= elem \u0026\u0026 elem \u003C= last ) || (step \u003C zero \u0026\u0026 last \u003C= elem \u0026\u0026 elem \u003C= start) )\u0060 appears character-identically in 2 files \u2014 library-js/src/scala/collection/immutable/NumericRange.scala, library/src/scala/collection/immutable/NumericRange.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library-js/src/scala/collection/immutable/NumericRange.scala"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff9755003ed5825d4312b54c7cd8c838ca126fbd08a692e7d71dca41d1095d6e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!r.isInclusive \u0026\u0026 num.equiv(remainder, num.zero)\u0060 appears character-identically in 2 files \u2014 library-js/src/scala/collection/immutable/NumericRange.scala, library/src/scala/collection/immutable/NumericRange.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library-js/src/scala/collection/immutable/NumericRange.scala"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7e1be74b22f153195f8e9712f47c2d1aa72d120291f498ea124725cf8334a93"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(_size \u002B _vacant) \u003E 0.5*mask || _vacant \u003E _size\u0060 appears character-identically in 2 files \u2014 library/src/scala/collection/mutable/AnyRefMap.scala, library/src/scala/collection/mutable/LongMap.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/collection/mutable/AnyRefMap.scala"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"447dac7e98ebe6395a3c777f15b8f5acb6c8d26723b042ab0f9ef520abe30884"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(ctx.mode is Mode.Pattern) \u0026\u0026 untpd.isVarPattern(id) \u0026\u0026 (id.name == nme.WILDCARD || id.name == nme.WILDCARD_STAR)\u0060 appears character-identically in 2 files \u2014 compiler/src/dotty/tools/dotc/transform/TreeChecker.scala, compiler/src/dotty/tools/dotc/typer/ReTyper.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/TreeChecker.scala"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"143ae837e8b2da71a61bf2aa73c7e678544b9454c59c34f0971f6cf3569b410e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(currentValueCursor \u003C currentValueLength) || searchNextValueNode()\u0060 appears character-identically in 2 files \u2014 library/src/scala/collection/convert/impl/ChampStepper.scala, library/src/scala/collection/immutable/ChampCommon.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/collection/convert/impl/ChampStepper.scala"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"d66e5943161fa0be7bf5d087a6667aba81a7720ac1bffd64762656ecbaf0df4c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(isEmpty) || (start == x.start \u0026\u0026 last == x.last)\u0060 appears character-identically in 2 files \u2014 library-js/src/scala/collection/immutable/NumericRange.scala, library/src/scala/collection/immutable/NumericRange.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library-js/src/scala/collection/immutable/NumericRange.scala"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"0794e4b211d12a5aabfc4688748b3010e4cfcd5587788ff6f52d80a69557c48b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(key == key1) || (key == key2) || (key == key3)\u0060 appears character-identically in 2 files \u2014 library/src/scala/collection/immutable/Map.scala, library/src/scala/collection/immutable/SeqMap.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/collection/immutable/Map.scala"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"3af06e0e523d9f9e0a68f0244d3b41cedb2038c4bd254a9b479b8294896e1629"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(key == key1) || (key == key2) || (key == key3) || (key == key4)\u0060 appears character-identically in 2 files \u2014 library/src/scala/collection/immutable/Map.scala, library/src/scala/collection/immutable/SeqMap.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/collection/immutable/Map.scala"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"054e89af9631fda82ed5be70c5971595c0e446247f5c677a10a2ef3934c48d17"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(len - i) \u003E= 6 \u0026\u0026 ch1 == \u0027u\u0027 \u0026\u0026 ((Character.isDigit(ch2)) || (\u0027A\u0027 \u003C= ch2 \u0026\u0026 ch2 \u003C= \u0027F\u0027))\u0060 appears character-identically in 2 files \u2014 compiler/src/dotty/tools/dotc/util/NameTransformer.scala, library/src/scala/reflect/NameTransformer.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/util/NameTransformer.scala"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"425d783c7ecf001054d6fbf40f5de7772b98c231cb167f85528e726b1aba4ec3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(num.gt(end, start) \u0026\u0026 num.gt(step, num.zero)) || (num.lt(end, start) \u0026\u0026 num.sign(step) == -num.one)\u0060 appears character-identically in 2 files \u2014 library-js/src/scala/collection/immutable/NumericRange.scala, library/src/scala/collection/immutable/NumericRange.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library-js/src/scala/collection/immutable/NumericRange.scala"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a4328d66707a6a75646fff49c200609163d57c25ca0ba41bcfa7a6935761ee6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(num.gt(start, end) \u0026\u0026 num.gt(step, num.zero)) || (num.lt(start, end) \u0026\u0026 num.lt(step, num.zero)) || (num.equiv(start, end) \u0026\u0026 !isInclusive)\u0060 appears character-identically in 2 files \u2014 library-js/src/scala/collection/immutable/NumericRange.scala, library/src/scala/collection/immutable/NumericRange.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library-js/src/scala/collection/immutable/NumericRange.scala"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"41d7dcc74480033f718c59bdfa022093aaedf0d2945e184c998bcf91207eb758"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(posStep \u0026\u0026 num.lt(startlim, start)) || (!posStep \u0026\u0026 num.gt(startlim, start))\u0060 appears character-identically in 2 files \u2014 library-js/src/scala/collection/immutable/NumericRange.scala, library/src/scala/collection/immutable/NumericRange.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library-js/src/scala/collection/immutable/NumericRange.scala"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"806c6f2c05fb91ac67d2d5f8d0c8760f97e76c04e141c95c222e5d79a4ccfa7a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060_size \u002B _vacant \u003E= 0.5*mask \u0026\u0026 !(_vacant \u003E 0.2*mask)\u0060 appears character-identically in 2 files \u2014 library/src/scala/collection/mutable/AnyRefMap.scala, library/src/scala/collection/mutable/LongMap.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/collection/mutable/AnyRefMap.scala"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3c3f1e488ed6456db4643d5700f938b5b06bdde925cf8c508335f1b898f4fd0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060checkIsStringify(tp1) || checkIsStringify(tp2)\u0060 appears character-identically in 2 files \u2014 compiler/src/dotty/tools/dotc/transform/localopt/FormatChecker.scala, compiler/src/dotty/tools/dotc/transform/localopt/StringInterpolatorOpt.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/transform/localopt/FormatChecker.scala"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"c356e84457d5b6b62367203d8f3fe90d259dcfcb8dac49a5880ac85919e5c159"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060clazz.isAnonymousClass || clazz.is(Module)\u0060 appears character-identically in 2 files \u2014 compiler/src/dotty/tools/dotc/reporting/messages.scala, compiler/src/dotty/tools/dotc/typer/RefChecks.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/reporting/messages.scala"},"region":{"startLine":3978}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c3cac833381f6fb3e377773d1949ff9d905316145a1bf6093d1e8d04366a2ce"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060cls.isSpecializedTraitImplementationClass \u0026\u0026 !cls.isRawSpecializedTraitImplementationClass\u0060 appears character-identically in 2 files \u2014 compiler/src/dotty/tools/dotc/core/TypeErasure.scala, compiler/src/dotty/tools/dotc/transform/Erasure.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/TypeErasure.scala"},"region":{"startLine":909}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f4e0fd4fa45e310b07960b2e99c42c941bd44ab78d94377b6c4055787b2ebe4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060coll1.isEmpty || coll2.isEmpty || coll3.isEmpty\u0060 appears character-identically in 2 files \u2014 library/src/scala/collection/LazyZipOps.scala, library/src/scala/runtime/Tuple3Zipped.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/collection/LazyZipOps.scala"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2fca7084983b991b41018a3851d0de6be98240c8b5c4437e006cd2779cf15e8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ctx.mode.is(Mode.SafeNulls) \u0026\u0026 !ctx.phase.erasedTypes\u0060 appears character-identically in 3 files \u2014 compiler/src/dotty/tools/dotc/core/Definitions.scala, compiler/src/dotty/tools/dotc/core/SymDenotations.scala, compiler/src/dotty/tools/dotc/core/Types.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/Definitions.scala"},"region":{"startLine":1726}}}],"partialFingerprints":{"codehealthFindingId/v1":"d372d63a773ca26a044e281b76f41c7cad2d1c8a9906a311fe73c8149f31ff20"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ctx.settings.XprintTypes.value \u0026\u0026 tree.hasType\u0060 appears character-identically in 2 files \u2014 compiler/src/dotty/tools/dotc/printing/PlainPrinter.scala, compiler/src/dotty/tools/dotc/printing/RefinedPrinter.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/printing/PlainPrinter.scala"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad72a475ce4ff4c0a75f1e101ea6ad770b4102109e98801517d6b87ef2dcbfef"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060elems1.hasNext \u0026\u0026 elems2.hasNext \u0026\u0026 elems3.hasNext\u0060 appears character-identically in 2 files \u2014 library/src/scala/collection/LazyZipOps.scala, library/src/scala/runtime/Tuple3Zipped.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/collection/LazyZipOps.scala"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"66b78ce1a5c424facd3ae023f112311e7894e15c934e7cb8b3bc4d93104a39c8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060file.isExperimental \u0026\u0026 file.major == read.major \u0026\u0026 file.minor \u003C= read.minor\u0060 appears character-identically in 2 files \u2014 compiler/src/dotty/tools/tasty/besteffort/BestEffortTastyHeaderUnpickler.scala, tasty/src/dotty/tools/tasty/TastyHeaderUnpickler.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/tasty/besteffort/BestEffortTastyHeaderUnpickler.scala"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6da41c99e00eff29b054813d36722291d5d9af94bb133dca2f2ee068e78a780"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060file.major == read.major \u0026\u0026 file.minor == read.minor \u0026\u0026 file.isExperimental \u0026\u0026 read.isExperimental\u0060 appears character-identically in 2 files \u2014 compiler/src/dotty/tools/tasty/besteffort/BestEffortTastyHeaderUnpickler.scala, tasty/src/dotty/tools/tasty/TastyHeaderUnpickler.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/tasty/besteffort/BestEffortTastyHeaderUnpickler.scala"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6178aa49f48fc2083d93ecafab72362482b8c01031608bb87a5fbf52840fbcc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060fileVersion.isExperimental \u0026\u0026 experimentalVersion == 0\u0060 appears character-identically in 2 files \u2014 compiler/src/dotty/tools/dotc/core/tasty/TastyUnpickler.scala, tasty/src/dotty/tools/tasty/TastyHeaderUnpickler.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/tasty/TastyUnpickler.scala"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ff6d8083f60597160b840904a56331d4c83039b01f198f62b2d23246e77778f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060fitsInInteger(leftLength) \u0026\u0026 fitsInInteger(rightLength)\u0060 appears character-identically in 2 files \u2014 library-js/src/scala/collection/immutable/NumericRange.scala, library/src/scala/collection/immutable/NumericRange.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library-js/src/scala/collection/immutable/NumericRange.scala"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"59341f1d2ce3e358ad6505b63700dbae809e840e9457a14635148de3dccc5c6f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060from.isEmpty || ordering.compare(from.get, key) \u003C= 0\u0060 appears character-identically in 2 files \u2014 library/src/scala/collection/mutable/TreeMap.scala, library/src/scala/collection/mutable/TreeSet.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/collection/mutable/TreeMap.scala"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"874a4469548bd15eb0a3a584e61cefafb76c99de68f7a6f01f3be0553ec1d285"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060fun.symbol.exists \u0026\u0026 fun.symbol.name == nme.apply \u0026\u0026 fun.symbol.owner.exists \u0026\u0026 fun.symbol.owner == defn.NamedTupleModule.moduleClass\u0060 appears character-identically in 2 files \u2014 compiler/src/dotty/tools/dotc/interactive/Completion.scala, presentation-compiler/src/main/dotty/tools/pc/MetalsInteractive.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/interactive/Completion.scala"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"567a95a7b3494895b3ef5de3bc530d0d4b72154d173834ebab3a492673cae706"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060getState == 0 \u0026\u0026 compareAndSetState(0, 1)\u0060 appears character-identically in 2 files \u2014 library/src/scala/collection/immutable/LazyListBase.scala, library/src/scala/collection/immutable/LazyListIterableBase.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/collection/immutable/LazyListBase.scala"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"42fe203e4a2ea795d2e6831cb3d73325aaf6afa52d9a347943ba7c43a406b69d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060h \u003E= that.hIndex \u0026\u0026 current.length - index - 1\u003E= that.index\u0060 appears character-identically in 2 files \u2014 library/src/scala/jdk/DoubleAccumulator.scala, library/src/scala/jdk/LongAccumulator.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/jdk/DoubleAccumulator.scala"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"f29aa1320b293ff4a728f3ed17f5046ec8cca9c7304dc3231f6d6304ded6e8aa"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060i \u003C array.length \u0026\u0026 array(i) == thatArray(i)\u0060 appears character-identically in 2 files \u2014 library/src/scala/collection/immutable/ArraySeq.scala, library/src/scala/collection/mutable/ArraySeq.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/collection/immutable/ArraySeq.scala"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"81a615326e4b42dc415c707a8234822d79fea3fd65b933d5455cb8e8af0a58a5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060idx \u003C table.length \u0026\u0026 table(idx) == null\u0060 appears character-identically in 2 files \u2014 compiler/src/dotty/tools/dotc/util/GenericHashMap.scala, compiler/src/dotty/tools/dotc/util/GenericHashSet.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/util/GenericHashMap.scala"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"41bc9cabae9a312335f51c5fc2e45df08bfee83589658913e63a14bc0a781486"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isBlack(w.nn.left) \u0026\u0026 isBlack(w.nn.right)\u0060 appears character-identically in 2 files \u2014 library/src/scala/collection/mutable/CollisionProofHashMap.scala, library/src/scala/collection/mutable/RedBlackTree.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/collection/mutable/CollisionProofHashMap.scala"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1324e73c715c73fafa8e7187c2c0fc53da3f16f7b61f7244af0a40c081ca802"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isBlack(w.nn.right) \u0026\u0026 isBlack(w.nn.left)\u0060 appears character-identically in 2 files \u2014 library/src/scala/collection/mutable/CollisionProofHashMap.scala, library/src/scala/collection/mutable/RedBlackTree.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/collection/mutable/CollisionProofHashMap.scala"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c272ed65b0d7e5e055fca68fc8376699976b0755c5dad69c81a8c9091951198"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isInScope(tycon) \u0026\u0026 args.forall(isInScope)\u0060 appears character-identically in 2 files \u2014 presentation-compiler/src/main/dotty/tools/pc/InferredTypeProvider.scala, presentation-compiler/src/main/dotty/tools/pc/PcInlayHintsProvider.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"presentation-compiler/src/main/dotty/tools/pc/InferredTypeProvider.scala"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"d883636f8008ffce07580ed4bad1450cf8dd9a2d866917883c63a10be5748cc4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isInsideViewBounds(key) \u0026\u0026 RB.contains(tree, key)\u0060 appears character-identically in 2 files \u2014 library/src/scala/collection/mutable/TreeMap.scala, library/src/scala/collection/mutable/TreeSet.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/collection/mutable/TreeMap.scala"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ffbe00b0d76db13b4b39baa2051bdd119134e8aaa2b7083afff17821c85f464"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isWithinBoundaries(x) \u0026\u0026 (((x - start) % step) == zero)\u0060 appears character-identically in 2 files \u2014 library-js/src/scala/collection/immutable/NumericRange.scala, library/src/scala/collection/immutable/NumericRange.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library-js/src/scala/collection/immutable/NumericRange.scala"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0bd2925166704a9b0b199916281a94df446df481d7e769823cee623c529286a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060iter.hasNext \u0026\u0026 j \u003C replaced0 \u0026\u0026 i \u002B j \u003C length\u0060 appears character-identically in 2 files \u2014 library-js/src/scala/collection/mutable/Buffer.scala, library/src/scala/collection/mutable/Buffer.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library-js/src/scala/collection/mutable/Buffer.scala"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"91080e17a568339bc474bce23c711a06345b63c5612dabd8ca4dbf3ebd98438a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060l.toDouble == self || l == Long.MaxValue \u0026\u0026 self \u003C Double.PositiveInfinity || l == Long.MinValue \u0026\u0026 self \u003E Double.NegativeInfinity\u0060 appears character-identically in 2 files \u2014 library/src/scala/Double.scala, library/src/scala/runtime/RichDouble.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/Double.scala"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d63113ecdced6c14a51cd2ff1e838887af76b509f46d3c20141652c03d66870"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060lookahead.ch == \u0027\u002B\u0027 || lookahead.ch == \u0027-\u0027\u0060 appears character-identically in 2 files \u2014 compiler/src/dotty/tools/dotc/parsing/JavaScanners.scala, compiler/src/dotty/tools/dotc/parsing/Scanners.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/parsing/JavaScanners.scala"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"33926ef1c2089272d617f1c6f2bd7482cdaeada2e15e387ae5a9a50225e1acd8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060mt.paramInfos.nonEmpty \u0026\u0026 mt.paramInfos.last.isRepeatedParam\u0060 appears character-identically in 3 files \u2014 compiler/src/dotty/tools/dotc/core/Types.scala, compiler/src/dotty/tools/dotc/typer/EtaExpansion.scala, compiler/src/dotty/tools/dotc/typer/Namer.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/Types.scala"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"3358c5fedb09ea07ed07f97eccd2a06a98b03b705cbdd1a2f130e6445625bfcc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060name == nme.applyDynamic || name == nme.selectDynamic || name == nme.updateDynamic || name == nme.applyDynamicNamed\u0060 appears character-identically in 3 files \u2014 compiler/src/dotty/tools/dotc/ast/TreeInfo.scala, compiler/src/dotty/tools/dotc/semanticdb/Scala3.scala, compiler/src/dotty/tools/dotc/typer/Dynamic.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/ast/TreeInfo.scala"},"region":{"startLine":1173}}}],"partialFingerprints":{"codehealthFindingId/v1":"e99812e220ce5a0ed9875ad1ec9657dcfdcc6e188832721974f751a7af0b27fe"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060num.equiv(start, end) || n \u003C= 0 || !stepIsInTheSameDirectionAsStartToEndVector\u0060 appears character-identically in 2 files \u2014 library-js/src/scala/collection/immutable/NumericRange.scala, library/src/scala/collection/immutable/NumericRange.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library-js/src/scala/collection/immutable/NumericRange.scala"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"009e101819a78eac8fa99ce16d93cdbbc8e4cb4dc8a09c482fe9874f0219b4be"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060parents.nonEmpty \u0026\u0026 !parents.head.typeSymbol.is(dotc.core.Flags.Trait)\u0060 appears character-identically in 2 files \u2014 compiler/src/dotty/tools/dotc/core/Symbols.scala, compiler/src/scala/quoted/runtime/impl/QuotesImpl.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/Symbols.scala"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"f676e2705f1f12fcbcf0de617c58c9d877b337cc9e235bf729c0981ce64f79ce"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060super.isRunnable \u0026\u0026 !ctx.usedBestEffortTasty\u0060 appears character-identically in 5 files \u2014 compiler/src/dotty/tools/backend/jvm/GenBCode.scala, compiler/src/dotty/tools/backend/sjs/GenSJSIR.scala, compiler/src/dotty/tools/dotc/core/DenotTransformers.scala, compiler/src/dotty/tools/dotc/transform/MacroTransform.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/backend/jvm/GenBCode.scala"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c87513221ec860cd2b91b20acef7683676f1d59cfe7d163d94a2c2bc85fcba6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060super.isRunnable \u0026\u0026 Feature.ccEnabledSomewhere\u0060 appears character-identically in 2 files \u2014 compiler/src/dotty/tools/dotc/cc/CheckCaptures.scala, compiler/src/dotty/tools/dotc/cc/Setup.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/cc/CheckCaptures.scala"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd57c8278b5b1b6666a73f0b308d64fb0d6172dcc7a1c9f6bbcbc29bfded3e34"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060sym.span.exists \u0026\u0026 sym.span != sym.owner.span\u0060 appears character-identically in 2 files \u2014 compiler/src/dotty/tools/dotc/reporting/messages.scala, compiler/src/dotty/tools/dotc/transform/UnrollDefinitions.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/reporting/messages.scala"},"region":{"startLine":2498}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc5f69250d15a091a8b4497bd8e482db407cb2dadf4abda6d7c3c6953f591e6e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060t.name == \u0022\u003Crepeated\u003E\u0022 \u0026\u0026 t.qualifier.match\u0060 appears character-identically in 2 files \u2014 scaladoc/src/dotty/tools/scaladoc/tasty/InkuireSupport.scala, scaladoc/src/dotty/tools/scaladoc/tasty/TypesSupport.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scaladoc/src/dotty/tools/scaladoc/tasty/InkuireSupport.scala"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ae2b503348855db49865fc3ff710be79c47eee2d526b1376b5b9999c37b3c45"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060t.name == \u0022Repeated\u0022 \u0026\u0026 t.qualifier.match\u0060 appears character-identically in 2 files \u2014 scaladoc/src/dotty/tools/scaladoc/tasty/InkuireSupport.scala, scaladoc/src/dotty/tools/scaladoc/tasty/TypesSupport.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scaladoc/src/dotty/tools/scaladoc/tasty/InkuireSupport.scala"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"82bade97407432eb339fb6f959a2bbfceebfa1bf5c5f4a08fa2d63726c18122d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060t.symbol.isAbstractOrParamType \u0026\u0026 !seen.contains(t.symbol)\u0060 appears character-identically in 2 files \u2014 compiler/src/dotty/tools/dotc/cc/CaptureOps.scala, compiler/src/dotty/tools/dotc/cc/Setup.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/cc/CaptureOps.scala"},"region":{"startLine":1021}}}],"partialFingerprints":{"codehealthFindingId/v1":"2341238ac2822ac4b821d9ac085daa081bbb9bc2e859ed7efa6b32845adae0a0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060this.payloadArity == 2 \u0026\u0026 this.nodeArity == 0\u0060 appears character-identically in 2 files \u2014 library/src/scala/collection/immutable/HashMap.scala, library/src/scala/collection/immutable/HashSet.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/collection/immutable/HashMap.scala"},"region":{"startLine":901}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb03bb40fa20cf06ad830261081daae178d4fe464dd6983dc93a38ad881c161a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060tp1.isExactlyNothing || tp2.isExactlyNothing\u0060 appears character-identically in 2 files \u2014 compiler/src/dotty/tools/dotc/core/TypeComparer.scala, compiler/src/dotty/tools/dotc/core/Types.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/TypeComparer.scala"},"region":{"startLine":3179}}}],"partialFingerprints":{"codehealthFindingId/v1":"4488d2aa6026cb993fbd6c35380b1f2512c2671305e52b561cfce4d8b5b0e094"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060tree.source != ctx.source \u0026\u0026 tree.source.exists\u0060 appears character-identically in 5 files \u2014 compiler/src/dotty/tools/dotc/ast/Trees.scala, compiler/src/dotty/tools/dotc/staging/CrossStageSafety.scala, compiler/src/dotty/tools/dotc/staging/TreeMapWithStages.scala, compiler/src/dotty/tools/dotc/transform/MegaPhase.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/ast/Trees.scala"},"region":{"startLine":1702}}}],"partialFingerprints":{"codehealthFindingId/v1":"c905b782fb8fb27a784bd35c3fc5c3a67f72653ee4c8267b73ec79b045e766c8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060until.isEmpty || ordering.compare(key, until.get) \u003C 0\u0060 appears character-identically in 2 files \u2014 library/src/scala/collection/mutable/TreeMap.scala, library/src/scala/collection/mutable/TreeSet.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/collection/mutable/TreeMap.scala"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe64a6319b2c520137a31c34505b021440a8a6f27a55aa6bda08df52fe1be5fc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060vparamss.isEmpty || vparamss.tail.isEmpty\u0060 appears character-identically in 2 files \u2014 compiler/src/dotty/tools/backend/jvm/BCodeSkelBuilder.scala, compiler/src/dotty/tools/backend/sjs/JSCodeGen.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/backend/jvm/BCodeSkelBuilder.scala"},"region":{"startLine":899}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a7ce83f639e95dab04f8d69c7472c68d46a81d0f7ad7503aeb1d70acd12aaa2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060x != null \u0026\u0026 isArrayClass(x.getClass, atLevel)\u0060 appears character-identically in 2 files \u2014 library-js/src/scala/runtime/ScalaRunTime.scala, library/src/scala/runtime/ScalaRunTime.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library-js/src/scala/runtime/ScalaRunTime.scala"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f99c38f0709d574e350769aac703ac682c5e9edd7cdd37724cb9e3692e2e8c9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060x != null \u0026\u0026 x.getClass.getName.startsWith(\u0022scala.Tuple\u0022)\u0060 appears character-identically in 2 files \u2014 library-js/src/scala/runtime/ScalaRunTime.scala, library/src/scala/runtime/ScalaRunTime.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library-js/src/scala/runtime/ScalaRunTime.scala"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"20cdd3172ee420b52a9e3dbe9c879f18e02fdefeb00c589aade42ab25cc628b4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060x.head.isWhitespace || x.last.isWhitespace\u0060 appears character-identically in 2 files \u2014 library-js/src/scala/runtime/ScalaRunTime.scala, library/src/scala/runtime/ScalaRunTime.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library-js/src/scala/runtime/ScalaRunTime.scala"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"939af230c8ff1c88a19d88e9112c4ab42bd880bfdcc26b12ca4179379c28efa9"}},{"ruleId":"X18","level":"warning","message":{"text":"Disposable created and abandoned in the function that made it: \u0060Files.walk(\u2026)\u0060 opens something that has to be given back \u2014 a file descriptor, a socket, a directory handle \u2014 and its only use reads \u0060.iterator\u0060 through it and drops it, so this expression both creates the value and is the last place that can release it, and does not. Every call leaks one more open handle until the collector happens to reach it: \u0060Too many open files\u0060 under load, and on Windows a file that cannot be replaced or deleted while it is held. Open it with \u0060scala.util.Using.resource(Files.walk(\u2026)) { r =\u003E \u2026 }\u0060, which releases it on every path including a throw, or hold it and call \u0060.close()\u0060 in a \u0060finally\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"project/ScalaLibraryPlugin.scala"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"2519967e0856891a931f2cce493daa3bd523adfaadbe70a8941aeadf2d574898"}},{"ruleId":"X18","level":"warning","message":{"text":"Disposable created and abandoned in the function that made it: \u0060scala.io.Source.fromFile(\u2026)\u0060 opens something that has to be given back \u2014 a file descriptor, a socket, a directory handle \u2014 and its only use reads \u0060.mkString\u0060 through it and drops it, so this expression both creates the value and is the last place that can release it, and does not. Every call leaks one more open handle until the collector happens to reach it: \u0060Too many open files\u0060 under load, and on Windows a file that cannot be replaced or deleted while it is held. Open it with \u0060scala.util.Using.resource(scala.io.Source.fromFile(\u2026)) { r =\u003E \u2026 }\u0060, which releases it on every path including a throw, or hold it and call \u0060.close()\u0060 in a \u0060finally\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"project/scripts/bisect.scala"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"edb2754779f96a63a09bcb092ac859be2c404f099a954eb8a21929e5d1959f74"}},{"ruleId":"X18","level":"warning","message":{"text":"Disposable created and abandoned in the function that made it: \u0060Files.newDirectoryStream(\u2026)\u0060 opens something that has to be given back \u2014 a file descriptor, a socket, a directory handle \u2014 and its only use reads \u0060.iterator\u0060 through it and drops it, so this expression both creates the value and is the last place that can release it, and does not. Every call leaks one more open handle until the collector happens to reach it: \u0060Too many open files\u0060 under load, and on Windows a file that cannot be replaced or deleted while it is held. Open it with \u0060scala.util.Using.resource(Files.newDirectoryStream(\u2026)) { r =\u003E \u2026 }\u0060, which releases it on every path including a throw, or hold it and call \u0060.close()\u0060 in a \u0060finally\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/classpath/DirectoryClassPath.scala"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe87e1f01c86661e90179e3ea4a1bea5f72e6141ab1e7910a056886f27bf510e"}},{"ruleId":"X18","level":"warning","message":{"text":"Disposable created and abandoned in the function that made it: \u0060Files.walk(\u2026)\u0060 opens something that has to be given back \u2014 a file descriptor, a socket, a directory handle \u2014 and its only use reads \u0060.iterator\u0060 through it and drops it, so this expression both creates the value and is the last place that can release it, and does not. Every call leaks one more open handle until the collector happens to reach it: \u0060Too many open files\u0060 under load, and on Windows a file that cannot be replaced or deleted while it is held. Open it with \u0060scala.util.Using.resource(Files.walk(\u2026)) { r =\u003E \u2026 }\u0060, which releases it on every path including a throw, or hold it and call \u0060.close()\u0060 in a \u0060finally\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/classpath/DirectoryClassPath.scala"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ceb1e51eafe9afca2376f1c344983c1d0570075d4af05c609caa395748c0b51"}},{"ruleId":"X18","level":"warning","message":{"text":"Disposable created and abandoned in the function that made it: \u0060Files.list(\u2026)\u0060 opens something that has to be given back \u2014 a file descriptor, a socket, a directory handle \u2014 and its only use reads \u0060.iterator\u0060 through it and drops it, so this expression both creates the value and is the last place that can release it, and does not. Every call leaks one more open handle until the collector happens to reach it: \u0060Too many open files\u0060 under load, and on Windows a file that cannot be replaced or deleted while it is held. Open it with \u0060scala.util.Using.resource(Files.list(\u2026)) { r =\u003E \u2026 }\u0060, which releases it on every path including a throw, or hold it and call \u0060.close()\u0060 in a \u0060finally\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/classpath/DirectoryClassPath.scala"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"816edcfd236b87454b73df1f66ae67159b31ff8bc07dbd4cedb4e17263da2c3d"}},{"ruleId":"X21","level":"warning","message":{"text":"Pattern guard mutates state while matching: The \u0060if\u0060 guard on line 5084 (\u0060case wtp: MethodType if wtp.isImplicitMethod \u0026\u0026 ({ resMatch = constrainResult(tree.symbol, wtp, sharpenedPt); resMatch } || !functionExpected) \u0026\u0026 !ctx.mode.is(Mode.InQuotePatternHoasArgs) =\u003E\u0060) changes \u0060resMatch\u0060 with \u0060resMatch = \u2026\u0060 while the match is deciding whether that case applies. Scala tests a guard during PATTERN MATCHING \u2014 after the case\u0027s pattern has matched and before the case is chosen, going on to the next case when it is false \u2014 so the change lands whenever this case is merely TESTED, whether or not it is then chosen, and never once an earlier case has matched. And \u0060\u0026\u0026\u0060 can skip it, so it does not happen at all whenever what decides first already answers the guard. The accounting therefore depends on evaluation order and on how many cases the subject was tested against, not on any statement a reader can point at: a counter kept this way misses exactly the path the deciding operand rules out, so it cannot reach a limit it is checked against on that path. Move the change out of the guard \u2014 leave it reading only (\u0060if resMatch \u002B 1 \u003E= limit\u0060) and put the assignment in the case\u0027s BODY, where it runs precisely when the case is chosen, or hoist it above the \u0060match\u0060 if it must happen for every subject."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/typer/Typer.scala"},"region":{"startLine":5084}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3265e409749154a631d02184fcf9e24d73142fe517e39d6a9c0b6fae249ebed"}},{"ruleId":"X23","level":"note","message":{"text":"Diagnostic log message is built whether or not it is wanted: \u0060fine\u0060 at line 743 is called with an argument built by \u0060ex.getStackTrace().mkString(\u0022\u2026\u0022)\u0060 (line 744), 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 fine 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":"compiler/src/dotty/tools/dotc/interactive/Completion.scala"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab39a7ef7e8a7bc3db00f8db8af56251f732e1434bd84dd222c3583754a11a39"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060e.innerHTML.replace(/\\n/g,\u0022\u0022).replace(/\u003Cbr[ /]*\u003E/g,\u0022\\n\u0022)\u0060 is text this program did not author, and it is written into the text of an element through \u0060innerHTML\u0060 with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scaladoc/resources/dotty_res/hljs/highlight.pack.js"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"a57770967a81769bc2d7456ac29f025070473be3306894621963e025029f3346"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060a.value\u0060 is text this program did not author, and it is written into the text of an element through \u0060innerHTML\u0060 with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scaladoc/resources/dotty_res/hljs/highlight.pack.js"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"79681d132ea48be7262c5b8266c45f7726fd96b9a91efa4a02fbf20f2d438218"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060a.value\u0060 is text this program did not author, and it is written into the text of an element through \u0060innerHTML\u0060 with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scaladoc/resources/dotty_res/hljs/highlight.pack.js"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"c34ad657a324b6222afb9d070edb2612c83efbef7d10758b9c5260912f726397"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060htmlToString(html)\u0060 is text this program did not author, and it is written into the text of an element through \u0060innerHTML\u0060 with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scaladoc/resources/dotty_res/scripts/common/utils.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"14cabf47d062c8741ffcab6426754647752b8c7bf14d628c7310d11aa91fdd7c"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060saved.mainDiv\u0060 is text this program did not author, and it is written into the text of an element through \u0060innerHTML\u0060 with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scaladoc/resources/dotty_res/scripts/ux.js"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"47227ca2539887e7bbb6c29834700c20747c85493e84d70c311f5e0c49fdaa50"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060saved.leftColumn\u0060 is text this program did not author, and it is written into the text of an element through \u0060innerHTML\u0060 with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scaladoc/resources/dotty_res/scripts/ux.js"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"b32f61773a09c71a619d5e4ca3dc130e22e405b548f7d209a4b7a2ae967d4c56"}},{"ruleId":"X28","level":"warning","message":{"text":"Index access outside its own emptiness guard: This condition tests \u0060first\u0060 for emptiness and then indexes it on a branch that test does not reach. \u0060first(0)\u0060 is evaluated whenever the guarded half is false \u2014 which includes the case the guard exists to anticipate, \u0060first\u0060 being empty \u2014 so an empty \u0060first\u0060 indexes position 0 of nothing and throws. This same condition already shows the intended bracketing: \u0060first(1)\u0060 sits INSIDE the guard. Either the guard is load-bearing, in which case this access escapes it and crashes, or \u0060first\u0060 cannot be empty here, in which case the guard beside it is dead code \u2014 the condition is wrong under both readings. Move the parenthesis so the emptiness test brackets every access to \u0060first\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/NameOps.scala"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dab324b2eedf7dec0346f9493cb08d8981e9afb3ce75ab7537cd18477a3261d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case _\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scaladoc-js/common/src/utils/SafeLocalStorage.scala"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"c82406bc0024b52ea8e9511ae3537dff9eed54e42b44153ba98ba0eaaaaece7c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case _\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scaladoc-js/common/src/utils/SafeLocalStorage.scala"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"93c3cd58ac8116fa8a9897332153bdde75603d43444f3f5870256b10767c060e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case NonFatal(_)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scaladoc/src/dotty/tools/scaladoc/tasty/TypesSupport.scala"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"a11148b8266ba6e899c9b5672ad51ad3d6f277be6666d5916e213470fa0f9979"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case _: Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scaladoc/src/dotty/tools/scaladoc/tasty/comments/MemberLookup.scala"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"79604bd20fe89b16f460ea3040f3ca598b90649f95454fbf6c5e19c23a30fadc"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case _: Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scaladoc/src/dotty/tools/scaladoc/snippets/SnippetExpectations.scala"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"0750929311f2431f214c2183fdb6011d33c215757f51e33ded60afcd29c786b3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case _: Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"repl/src/dotty/tools/repl/JLineTerminal.scala"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aabb4e8e22ddd9ac83377fb364b423c673e47ce9fc765a7b76fec4c2a13a9aa"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case NonFatal(_)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"repl/src/dotty/tools/repl/Rendering.scala"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f123985b06076862e8861c1a7989bb2fba17ab04ac1d756fb84a2805968b0a6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case NonFatal(_)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"repl/src/dotty/tools/repl/ReplBytecodeAnalysis.scala"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c62188b5bdecee51acca2b66a8c8ad8824316e90af3bd1d4f1d14ada61cd6cd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case ex: Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"repl/src/dotty/tools/repl/ReplBytecodeInstrumentation.scala"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"afc9580e203e0dfe28b974acb6ad71e855193674aeb32825ba16470e8b49c9d8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case NonFatal(_)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"repl/src/dotty/tools/repl/ScalaClassLoader.scala"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"3520ba618bc0df440f169bc49c909bf9e2c84682451eb82e513c5f3053d02941"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case NonFatal(_)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"presentation-compiler/src/main/dotty/tools/pc/SymbolInformationProvider.scala"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"868b4d2f07b4f887d10efa8a876b8e09154a0c922369d91a364bcddad2e56c6f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case NonFatal(_)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"presentation-compiler/src/main/dotty/tools/pc/utils/InteractiveEnrichments.scala"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"26c80ee8af9dd1ca5de14fde40166f450baf01af6f2e6752a6e1ccd866434239"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case NonFatal(_)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"presentation-compiler/src/main/dotty/tools/pc/completions/CompletionProvider.scala"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"3db4563464bdb8e502329ce0e054649337ce8e73a9125bc575a58a587472c1a9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case NonFatal(_)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"presentation-compiler/src/main/dotty/tools/pc/completions/CompletionProvider.scala"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"f85a40be5928bd5deb6b01449732fc884bc5199b76b91b17f3b1a2f9b28926fa"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case NonFatal(_)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"presentation-compiler/src/main/dotty/tools/pc/completions/Completions.scala"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"7521c69dff73a789609e7f70963344bf8f553acf53cdbefde240914120d08d94"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case NonFatal(_)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"presentation-compiler/src/main/dotty/tools/pc/completions/Completions.scala"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"76359d131c51c65356497751dc99cdaea608412ac20b2b31dfd8de5f17c14ae7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case NonFatal(_)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"presentation-compiler/src/main/dotty/tools/pc/completions/Completions.scala"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"685734732f4f37c99039fda2fb77cb00c7a2d04f7cfd627084cc61f9c3d46621"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case NonFatal(_)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"presentation-compiler/src/main/dotty/tools/pc/completions/Completions.scala"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ae51c7b4709c12edb224250964b8725f4083f0ea6bab803cbb6d0909a498633"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case _\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"presentation-compiler/src/main/dotty/tools/pc/completions/Completions.scala"},"region":{"startLine":837}}}],"partialFingerprints":{"codehealthFindingId/v1":"f25907c02bbcc7ad310b123104f824dd2083d3c5e6a27dbd9bca3744d5b2ead6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case _: Throwable\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library-js/src/scala/MatchError.scala"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"799f20bc4751b3446ff0ddfe6189020fc5cde61199cc0c01a0e3f003667e0bd7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case NonFatal(_)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/MatchError.scala"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"e86130e5b24a083f665f58d3f5cbc70c67ff96405b0093fd9406cd427e2d2b29"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case NonFatal(_)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/sys/process/ProcessBuilderImpl.scala"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"844603e2b0d3a7eafe8df6d3c896f7b1fd058cb054f556278d00bca406e86b80"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case _: RuntimeException\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/src/scala/concurrent/duration/Duration.scala"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6e74fc046364b33316384424a35842d62d14303dd8219bf5429cabc6a9d74a8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case _: Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/io/VirtualFile.scala"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"f01563406f309a5d12b572ef1007fcbcaa734be50b279d191d5c56ad4285d676"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case _: Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/semanticdb/SemanticSymbolBuilder.scala"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4fe4f4982bc41fa5a4cb02fb1adbeea75a3f6491bed132c0582ff37014b4060"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case e: Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/semanticdb/SemanticSymbolBuilder.scala"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b5fd28c2e958227bfe78ca77b38a91c55fef0fbd7c7510aa6368b1706a14295"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case ex: Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/reporting/DidYouMean.scala"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d561a8756192af8157628e5d978ed440b3e5bf03f12c66c0764fd8c1c8770a0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case ex: Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/reporting/messages.scala"},"region":{"startLine":814}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b40bdaabcdfb549636e5b8f82f095ec4160f9cb0a6e2c002db814dbee37857d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case ex: Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/printing/PlainPrinter.scala"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dece1497700f4eff12941755f11298b7fc6e9762b16915578091997ecd911ae"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case _: Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/printing/RefinedPrinter.scala"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1d277d8c7092731c11d18f6153ca47bdfec7bc42752e28ae579a4f772a2689b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case _: Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/interactive/Completion.scala"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"17cc291b57f47fc15e1b47bd473438eda0d000d869c16a6fb7ca9341cfa8c704"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case ex: Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/interactive/Completion.scala"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"8061783cfc2ccb3216b8b76fc7aa9520dae9c37d5158e1054ea70e50369c022b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/interactive/LogicalPackagesProvider.scala"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeeea221aab0e1e53d38f46c110282dc6914754255b51ffd5035e71725654e73"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/interactive/LogicalPackagesProvider.scala"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"780966b60f025168e23b57a952561b0ae8a3e434f6f8362c59da32e9dca89d6d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/interactive/LogicalPackagesProvider.scala"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"de612e7f75955762d7dc45843aea07f5a5ffae9e95e4e1e714e4bc942ee4f59f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case ex: Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/SymDenotations.scala"},"region":{"startLine":2749}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d53d8b3d819759b2c8ab320e0dd0fd2aa08cea80a98e5c0fcae4f34542eb1bb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case _: Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/TypeErrors.scala"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"763af1fbf61344264fa328a43933552ed774bb923ed27bc7fa62313bd925f2a5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case _: Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/classpath/ClassPath.scala"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"c30edc2d7cea79e93e1830f9e32cc8603b2a63bee64d9dea9abf00b8adee866d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case _: Throwable\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench-run/src/main/scala/dotty/tools/benchmarks/Main.scala"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"d908dc27538bee54d7e65cbf068cbc1fd5728460efa1f679fffcebff8626e66f"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This JVM code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scaladoc/src/dotty/tools/scaladoc/tasty/comments/CommentRegex.scala"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"e12ef9b14187257f0394fb74a128ec2e79d012d9c2abfcc37e7ad553771a673f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060compareCaptured\u0060 (in \u0060isSubArgs\u0060) answers \u0060false\u0060 when \u0060TypeError\u0060 is thrown, with no log or throw \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment in the catch case or in the Scaladoc, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/TypeComparer.scala"},"region":{"startLine":1919}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d61635b26a3674e09fc0f1ed4c20ae0ddaf4797428b0bd9bdd61728d32b4bdf"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060getMessage\u0060 swallows every exception into \u0060\u0022TypeError\u0022\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it propagate. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment in the catch case or in the Scaladoc, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/core/TypeErrors.scala"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc8de61a1dd717f167048abac19d6ab074787db99a74cb044a44af1c81a6d153"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060safeExtensionCompletions\u0060 (in \u0060selectionCompletions\u0060) answers \u0060Map.empty\u0060 when \u0060TypeError\u0060 is thrown, with no log or throw \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment in the catch case or in the Scaladoc, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/interactive/Completion.scala"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1a7bd773ff23643119f34b2287dffdbaf24402030e903dffd26bc72a6622e49"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060safely\u0060 answers \u0060Nil\u0060 when \u0060TypeError\u0060 is thrown, with no log or throw \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment in the catch case or in the Scaladoc, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/interactive/Interactive.scala"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0a96144a201794e7dfcafffb8d19ce2d11eab75245c163be51fa60e76536787"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060loop\u0060 (in \u0060inverseSymbol\u0060) swallows every exception into \u0060Nil\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it propagate. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment in the catch case or in the Scaladoc, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/semanticdb/SemanticSymbolBuilder.scala"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"87a910cba81ffdedb76787bcc698cb7560b583803b78998900e6cab2a63eb669"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060inverseSymbol\u0060 swallows every exception into \u0060Nil\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it propagate. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment in the catch case or in the Scaladoc, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/dotty/tools/dotc/semanticdb/SemanticSymbolBuilder.scala"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"687af8f60273828c32f6cf8db73892167dacd1ee50a423f8625377779d189737"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060compilerSymbols\u0060 swallows every exception into \u0060Nil\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it propagate. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment in the catch case or in the Scaladoc, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"presentation-compiler/src/main/dotty/tools/pc/SymbolInformationProvider.scala"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c036162d7e9236dc7a3ae39c2aca275de858c449d82cb3a3a8afe9d01dc8a0e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060safeConstructorMembers\u0060 (in \u0060completionsWithAffix\u0060) swallows every exception into \u0060Nil\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it propagate. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment in the catch case or in the Scaladoc, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"presentation-compiler/src/main/dotty/tools/pc/completions/Completions.scala"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"7465b6ff52759445013ee5638cab819c5d41d7253a11d2842d58712c6cbeff2f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060possibleLinks\u0060 (in \u0060driForLink\u0060) swallows every exception into \u0060Seq.empty\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it propagate. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment in the catch case or in the Scaladoc, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scaladoc/src/dotty/tools/scaladoc/site/StaticSiteContext.scala"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"e733ec1a715d32151297ae283c94fa25c1a521d7bc1e8b538d6e4a7c5fef280b"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1032","guid":"5f21e517-68aa-a650-9a25-5771ef024637","name":"OWASP Top Ten \u2014 Security Misconfiguration category","shortDescription":{"text":"OWASP Top Ten \u2014 Security Misconfiguration category"},"helpUri":"https://cwe.mitre.org/data/definitions/1032.html"},{"id":"CWE-1059","guid":"a2381a08-60f6-9554-a8b8-f3018cfaaca5","name":"Insufficient Technical Documentation","shortDescription":{"text":"Insufficient Technical Documentation"},"helpUri":"https://cwe.mitre.org/data/definitions/1059.html"},{"id":"CWE-125","guid":"98717707-96bf-ca5b-9568-8d1d257574c1","name":"CWE-125","shortDescription":{"text":"CWE-125"},"helpUri":"https://cwe.mitre.org/data/definitions/125.html"},{"id":"CWE-1333","guid":"11a336ce-63de-c45c-845e-29ca1e8df13d","name":"CWE-1333","shortDescription":{"text":"CWE-1333"},"helpUri":"https://cwe.mitre.org/data/definitions/1333.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-16","guid":"659db3ea-affc-8453-8add-c1218fbfcb92","name":"Configuration","shortDescription":{"text":"Configuration"},"helpUri":"https://cwe.mitre.org/data/definitions/16.html"},{"id":"CWE-214","guid":"b10ad120-fb22-1351-9348-aa23b453e815","name":"CWE-214","shortDescription":{"text":"CWE-214"},"helpUri":"https://cwe.mitre.org/data/definitions/214.html"},{"id":"CWE-250","guid":"52ee12e8-390a-7351-b1e6-388afa694e54","name":"CWE-250","shortDescription":{"text":"CWE-250"},"helpUri":"https://cwe.mitre.org/data/definitions/250.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-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-532","guid":"1cd8877a-76e8-ce54-b40b-779af23364a0","name":"Insertion of Sensitive Information into Log File","shortDescription":{"text":"Insertion of Sensitive Information into Log File"},"helpUri":"https://cwe.mitre.org/data/definitions/532.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":"A01:2025","guid":"df693558-c822-0452-8f7b-4d53cb6bcc59","name":"Broken Access Control","shortDescription":{"text":"Broken Access Control"},"helpUri":"https://top10.owasp.org/2025/A01_2025-Broken_Access_Control/"},{"id":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A06:2025","guid":"491554d7-b8e4-9652-91a9-53700dc92ece","name":"Insecure Design","shortDescription":{"text":"Insecure Design"},"helpUri":"https://top10.owasp.org/2025/A06_2025-Insecure_Design/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"},{"id":"A09:2025","guid":"78892bc9-3c98-495d-881c-8af1390d643c","name":"Security Logging \u0026 Alerting Failures","shortDescription":{"text":"Security Logging \u0026 Alerting Failures"},"helpUri":"https://top10.owasp.org/2025/A09_2025-Security_Logging_and_Alerting_Failures/"}]}],"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":22,"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."]}]}