{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D9","name":"Test Distribution","shortDescription":{"text":"Test Distribution"},"helpUri":"https://codehealth.canine.dev/dimensions/D9"},{"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":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D31","name":"IaC \u0026 Container Security","shortDescription":{"text":"IaC \u0026 Container Security"},"helpUri":"https://codehealth.canine.dev/dimensions/D31","relationships":[{"target":{"id":"CWE-1032","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-16","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1032","CWE-732","CWE-16"],"owasp":"A02:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"AC2","name":"Forms \u0026 labels","shortDescription":{"text":"Forms \u0026 labels"},"helpUri":"https://codehealth.canine.dev/dimensions/AC2"},{"id":"AC3","name":"Page structure","shortDescription":{"text":"Page structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AC3"},{"id":"AC4","name":"Keyboard semantics","shortDescription":{"text":"Keyboard semantics"},"helpUri":"https://codehealth.canine.dev/dimensions/AC4"},{"id":"AC6","name":"Visual \u0026 motion safety","shortDescription":{"text":"Visual \u0026 motion safety"},"helpUri":"https://codehealth.canine.dev/dimensions/AC6"},{"id":"AC7","name":"A11y enforcement","shortDescription":{"text":"A11y enforcement"},"helpUri":"https://codehealth.canine.dev/dimensions/AC7"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX8","name":"Test isolation","shortDescription":{"text":"Test isolation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX8"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"PF1","name":"Benchmark discipline","shortDescription":{"text":"Benchmark discipline"},"helpUri":"https://codehealth.canine.dev/dimensions/PF1"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"R1","name":"Type Safety","shortDescription":{"text":"Type Safety"},"helpUri":"https://codehealth.canine.dev/dimensions/R1"},{"id":"R10","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/R10"},{"id":"R2","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/R2"},{"id":"R3","name":"Large Files","shortDescription":{"text":"Large Files"},"helpUri":"https://codehealth.canine.dev/dimensions/R3"},{"id":"R4","name":"Test Coverage","shortDescription":{"text":"Test Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/R4"},{"id":"R7","name":"Dead Code","shortDescription":{"text":"Dead Code"},"helpUri":"https://codehealth.canine.dev/dimensions/R7"},{"id":"R9","name":"Circular Imports","shortDescription":{"text":"Circular Imports"},"helpUri":"https://codehealth.canine.dev/dimensions/R9"},{"id":"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":"X31","name":"Test-only surface in a production module","shortDescription":{"text":"Test-only surface in a production module"},"helpUri":"https://codehealth.canine.dev/dimensions/X31"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"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":"gleam_core::error::failed_module_diagnostics (cyclomatic 160): gleam_core::error::failed_module_diagnostics has cyclomatic complexity 160 (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-core/src/error.rs"},"region":{"startLine":2772}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf87a49975d2261b9db1621d4d47dc3eecb199d7da1c217bd6fe66b633105322"}},{"ruleId":"D1","level":"warning","message":{"text":"Error::to_diagnostics (cyclomatic 124): Error::to_diagnostics has cyclomatic complexity 124 (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-core/src/error.rs"},"region":{"startLine":1092}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aaee727541de913c2ee54794aca2f42faa892738103e3f24b806f24547fb52b"}},{"ruleId":"D1","level":"warning","message":{"text":"Warning::to_diagnostic (cyclomatic 99): Warning::to_diagnostic has cyclomatic complexity 99 (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-core/src/warning.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"fecdb17f27443d3f95be9d94861d034c8f6b978896ecc121eeba13370448101c"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer::consume_character (cyclomatic 78): Lexer::consume_character has cyclomatic complexity 78 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/parse/lexer.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f4263fec393f8c6e23fa20d2375b85344381c9818a3fe374d160fc766ed7035"}},{"ruleId":"D1","level":"warning","message":{"text":"ParseErrorType::details (cyclomatic 75): ParseErrorType::details has cyclomatic complexity 75 (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-core/src/parse/error.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf9a9badd674accbbb48584436828e8b40920a77b41a510ec29e9114e1c5f1cf"}},{"ruleId":"D1","level":"warning","message":{"text":"TypedExpr::syntactically_eq (cyclomatic 70): TypedExpr::syntactically_eq 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-core/src/ast/typed.rs"},"region":{"startLine":1536}}}],"partialFingerprints":{"codehealthFindingId/v1":"f13b89542afffa0f2ab0e59db631ca348e9da036694eff106c38af745bbc2a65"}},{"ruleId":"D1","level":"warning","message":{"text":"PatternTyper::unify (cyclomatic 49): PatternTyper::unify has cyclomatic complexity 49 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/type_/pattern.rs"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"86bfcf828196eba90456a4f2726a16de8c5142105284a5c9bbcaaec1cf02aa81"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_expression_unit (cyclomatic 47): Parser::parse_expression_unit 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-core/src/parse.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7ece575ed058d0bdea149ad49dca867959ddc72d9b7ce0bee92a3e72004cd8c"}},{"ruleId":"D1","level":"warning","message":{"text":"ConstantTyper::do_infer (cyclomatic 44): ConstantTyper::do_infer 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-core/src/type_/constant.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec9f9c6e9ad638a3469c749521f13a574a988db7100f67abac1ab0eafacf4723"}},{"ruleId":"D1","level":"warning","message":{"text":"gleam_language_server::reference::reference_for_ast_node (cyclomatic 38): gleam_language_server::reference::reference_for_ast_node has cyclomatic complexity 38 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"language-server/src/reference.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"e277b1e241864f892574df956fbc4e0fb4489f88329073e0fdcc6908e54befce"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_pattern (cyclomatic 37): Parser::parse_pattern 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-core/src/parse.rs"},"region":{"startLine":1319}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b0eafd20f3f3c6216bafba13a0b0433cca42d63a646b659860124f356f4759a"}},{"ruleId":"D1","level":"warning","message":{"text":"Generator::compile (cyclomatic 36): Generator::compile has cyclomatic complexity 36 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/javascript.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed3ef839a8bb9680f48871799e53c16e6d9d57fb283b14b3c0ce1b2e6d30ba05"}},{"ruleId":"D1","level":"warning","message":{"text":"TypedExpr::find_node (cyclomatic 35): TypedExpr::find_node 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-core/src/ast/typed.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"d73dc29edc48d33c925c71fa086acb7200c0d4da1650b5709e52d17de9a78b92"}},{"ruleId":"D1","level":"warning","message":{"text":"CallGraphBuilder::expression (cyclomatic 35): CallGraphBuilder::expression has cyclomatic complexity 35 (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-core/src/call_graph.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"df0a8108c728390eee40ec7d5cfe2d075fcc8686c3084b779de49113da0e3c8a"}},{"ruleId":"D1","level":"warning","message":{"text":"gleam_core::ast::pattern_and_expression_are_the_same (cyclomatic 35): gleam_core::ast::pattern_and_expression_are_the_same 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-core/src/ast.rs"},"region":{"startLine":2231}}}],"partialFingerprints":{"codehealthFindingId/v1":"980c26f020e1176684a9ec2296800cbc36a9ab2587ea52b1c7de982043e3205f"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionGenerator::expression (cyclomatic 34): FunctionGenerator::expression 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-core/src/erlang.rs"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbc235ec7a20e311cc71f241ae843c8d7e38fda962125b2f0c667dd60b26ab5c"}},{"ruleId":"D1","level":"warning","message":{"text":"GuardTyper::do_infer (cyclomatic 34): GuardTyper::do_infer 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-core/src/type_/guard.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"540bc2db63debd51347e820b0e4e647cdddefae9a230e3f24af17b2bebd8635a"}},{"ruleId":"D1","level":"warning","message":{"text":"ExprTyper::infer_binop (cyclomatic 32): ExprTyper::infer_binop 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-core/src/type_/expression.rs"},"region":{"startLine":1837}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1ea98d016b5d7a3e1612a7b2a0c8a6ae3d48eedff9373889b938f8011dcd092"}},{"ruleId":"D1","level":"warning","message":{"text":"gleam_core::bit_array::type_options (cyclomatic 32): gleam_core::bit_array::type_options 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-core/src/bit_array.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"af2ba25f03ce4ade43a3e6eab8dddfe0843087316ee6ea057322f82a64511c63"}},{"ruleId":"D1","level":"warning","message":{"text":"Generator::constant_expression (cyclomatic 31): Generator::constant_expression 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-core/src/javascript/expression.rs"},"region":{"startLine":2671}}}],"partialFingerprints":{"codehealthFindingId/v1":"a50af16f1b520661caceff7e79d1996e1374e7a6bdd3a9326f31a125ba27ef8e"}},{"ruleId":"D1","level":"warning","message":{"text":"gleam_core::type_::expression::static_compare (cyclomatic 30): gleam_core::type_::expression::static_compare has cyclomatic complexity 30 (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-core/src/type_/expression.rs"},"region":{"startLine":5012}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed18e5d02afec7ea3805695fd0cef122bd433027bf2923f837a782c0c3c17bf6"}},{"ruleId":"D1","level":"warning","message":{"text":"Completer::completion_values (cyclomatic 30): Completer::completion_values 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":"language-server/src/completer.rs"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"29ac004d38a6a291c74654da2629797cbd4b370c7ab5b11e4334577192809f12"}},{"ruleId":"D1","level":"warning","message":{"text":"LanguageServerEngine::hover (cyclomatic 30): LanguageServerEngine::hover has cyclomatic complexity 30 (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":"language-server/src/engine.rs"},"region":{"startLine":1350}}}],"partialFingerprints":{"codehealthFindingId/v1":"a59f91f4c5da82d77e33235494c9ac76d41c1740f963ac7c82bf697b0fd6f517"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_const_value_unit (cyclomatic 29): Parser::parse_const_value_unit 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-core/src/parse.rs"},"region":{"startLine":3440}}}],"partialFingerprints":{"codehealthFindingId/v1":"64a2c962b8dd2cde7b45f7bda2a35bfa331f8d98b6dcfc612bdf1d8f00ad9b71"}},{"ruleId":"D1","level":"warning","message":{"text":"TypedExpr::find_statement (cyclomatic 28): TypedExpr::find_statement has cyclomatic complexity 28 (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-core/src/ast/typed.rs"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"45a3a0442c09330b2947ff35821acdbddfcd66c69c909f67be4eae1334426bda"}},{"ruleId":"D1","level":"warning","message":{"text":"Variables::runtime_check (cyclomatic 27): Variables::runtime_check 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-core/src/javascript/decision.rs"},"region":{"startLine":1497}}}],"partialFingerprints":{"codehealthFindingId/v1":"fef797a0d3564a7ca868fe138bee0375106f277416777cdc75859a573ff8d448"}},{"ruleId":"D1","level":"warning","message":{"text":"ErlangSourceBuilder::new_expression (cyclomatic 27): ErlangSourceBuilder::new_expression 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":"erlang-generation/src/lib.rs"},"region":{"startLine":2701}}}],"partialFingerprints":{"codehealthFindingId/v1":"72da40fcc6347a0a985efc49626b90e18e04fc9dcdb190b1291c08dff5ce72a4"}},{"ruleId":"D1","level":"warning","message":{"text":"pretty_arena::format (cyclomatic 26): pretty_arena::format 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":"pretty-arena/src/lib.rs"},"region":{"startLine":1184}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e5f5067462111f33a0496116c0aafc85497b8b5767f0aa8773e4d1175f80edb"}},{"ruleId":"D1","level":"warning","message":{"text":"PatternGenerator::pattern (cyclomatic 25): PatternGenerator::pattern 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-core/src/erlang/pattern.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c0d47f3cab4eca9da9dbe86cbb79fb61c2fa9014f09900286141583b7e4c5d4"}},{"ruleId":"D1","level":"warning","message":{"text":"Generator::guard_expression (cyclomatic 25): Generator::guard_expression 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. This is NOT this file\u0027s highest cyclomatic complexity: Generator::expression (cyclomatic 29) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/javascript/expression.rs"},"region":{"startLine":3080}}}],"partialFingerprints":{"codehealthFindingId/v1":"c117430156085ad42e70d26fb6af9c82dbfe2821833a3a86acfaf64733f9f90c"}},{"ruleId":"D1","level":"warning","message":{"text":"ExprTyper::do_infer_call_with_known_fun (cyclomatic 24): ExprTyper::do_infer_call_with_known_fun has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: ExprTyper::check_for_redundant_comparison (cyclomatic 25) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/type_/expression.rs"},"region":{"startLine":3718}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f2c378090f00419e4c601d3ea6398a453ab4b8c48f1dd58a28ef821a40db120"}},{"ruleId":"D1","level":"warning","message":{"text":"Hydrator::type_from_ast (cyclomatic 23): Hydrator::type_from_ast 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-core/src/type_/hydrator.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"f31045fb183f62e98b6ed7b53ea756bad403c5a4ecfd94cceb41421c9bb9184a"}},{"ruleId":"D1","level":"warning","message":{"text":"ErlangSourceBuilder::close_currently_open_item (cyclomatic 23): ErlangSourceBuilder::close_currently_open_item 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":"erlang-generation/src/lib.rs"},"region":{"startLine":3126}}}],"partialFingerprints":{"codehealthFindingId/v1":"58689ab24fc41867e9c04a4c8c2e24f27ea18778003b59e42cddcfd6b84db8d3"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionGenerator::inlined_constant (cyclomatic 22): FunctionGenerator::inlined_constant 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. This is NOT this file\u0027s highest cyclomatic complexity: FunctionGenerator::clause_guard (cyclomatic 26) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/erlang.rs"},"region":{"startLine":2433}}}],"partialFingerprints":{"codehealthFindingId/v1":"536ed8ce8b10b8cba1bc28205913f7a575c5a77cd6f9be4ea659ebd49f243d1b"}},{"ruleId":"D1","level":"warning","message":{"text":"pretty_arena::fits (cyclomatic 22): pretty_arena::fits 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":"pretty-arena/src/lib.rs"},"region":{"startLine":1381}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e975a53ef2471e95d8fa65474b2001c86982a0273cf4cb320e08f9c1320b92b"}},{"ruleId":"D1","level":"warning","message":{"text":"Echo$Inspector.inspect (cyclomatic 22): Echo$Inspector.inspect 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-core/templates/echo.mjs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"d408b903b3fca279046af7af375207a2add6085efa4fe4eaeea0a11162b60d6a"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::searchLoaded::update::addResult (cyclomatic 22): (anonymous)::searchLoaded::update::addResult 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-core/templates/docs-js/index.js"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"20b28ed65403a550b46daf03743455de6b9ceda43721d330cafa91845a6bb72b"}},{"ruleId":"D1","level":"warning","message":{"text":"Printer::print (cyclomatic 21): Printer::print 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-core/src/exhaustiveness/printer.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"23b8bc5bfb5e49429ee77a1550921d7295bcbef141d49c96d034b5fc79bd7ad0"}},{"ruleId":"D1","level":"warning","message":{"text":"ConstantTyper::infer_record (cyclomatic 21): ConstantTyper::infer_record 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-core/src/type_/constant.rs"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e9bbb2e9a8a32de1c16820c2ae17cf708a467a2fc9fe1417e241c134c6ed254"}},{"ruleId":"D1","level":"warning","message":{"text":"gleam_core::type_::environment::unify (cyclomatic 21): gleam_core::type_::environment::unify 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-core/src/type_/environment.rs"},"region":{"startLine":1091}}}],"partialFingerprints":{"codehealthFindingId/v1":"94f1941bb1a75e41a83cbdc64e8c80164210df1e75af7e0851191c7293fb02fa"}},{"ruleId":"D1","level":"warning","message":{"text":"prelude.toBitArray (cyclomatic 21): prelude.toBitArray has cyclomatic complexity 21 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/templates/prelude.mjs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5f5b3f43429d1c892b8f5b3bc67eddcee427319e248e54cd6441d05b7cf8d1e"}},{"ruleId":"D1","level":"warning","message":{"text":"ErlangSourceBuilder::bit_array_segment_specifiers (cyclomatic 20): ErlangSourceBuilder::bit_array_segment_specifiers 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":"erlang-generation/src/lib.rs"},"region":{"startLine":2362}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e8a0c649102b2aef1cd15dd3676684f430895726b16de20af90ee3e4081eba1"}},{"ruleId":"D1","level":"warning","message":{"text":"Completer::completion_types (cyclomatic 20): Completer::completion_types 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":"language-server/src/completer.rs"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"77594697096912b531f7053d48d778efcb5e137276a8d923472cfb56e146f0fe"}},{"ruleId":"D1","level":"warning","message":{"text":"CasePrinter::switch (cyclomatic 19): CasePrinter::switch 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-core/src/javascript/decision.rs"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0a29ae78c54bf762335122469a1c278ecd7daa00bb7f9a60d8d994392ca90e2"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer::next (cyclomatic 19): Lexer::next 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":"hexpm/src/version/lexer.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a19b29cb1ebcb3013767298bd14057b47f98058c125d1f9343963f02ad95128"}},{"ruleId":"D1","level":"warning","message":{"text":"LanguageServerEngine::folding_range (cyclomatic 19): LanguageServerEngine::folding_range has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: LanguageServerEngine::completion (cyclomatic 28) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"language-server/src/engine.rs"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"97299d5d8b0f872461cb60f00e9b3903ef3d8f6c5a2a318ff5b2d100d993aa65"}},{"ruleId":"D1","level":"warning","message":{"text":"Branch::move_unconditional_patterns (cyclomatic 18): Branch::move_unconditional_patterns has cyclomatic complexity 18 (threshold 15). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/exhaustiveness.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc6718bb12bb17ff9906cad6ce5733f6e833b71cc0dbea81a485ccc25447d5ae"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer::lex_string (cyclomatic 18): Lexer::lex_string has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: gleam_core::parse::lexer::string_to_keyword (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/parse/lexer.rs"},"region":{"startLine":1297}}}],"partialFingerprints":{"codehealthFindingId/v1":"32f9f48f327c5442b2b749d755cb2f9aaa95f3bdc328ef9c763cfd02c798ddc5"}},{"ruleId":"D1","level":"warning","message":{"text":"PatternTyper::infer_pattern_segment (cyclomatic 18): PatternTyper::infer_pattern_segment 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-core/src/type_/pattern.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c95b958b886b4de76690d3943e7a63444b8cc40ed054b800741a9b35a5aaacf"}},{"ruleId":"D1","level":"warning","message":{"text":"gleam_core::error::edit_distance (cyclomatic 18): gleam_core::error::edit_distance has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: gleam_core::error::hint_alternative_operator (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/error.rs"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f6f6fe7d7bb700833ae85989657294bca764941cb8b3b6ae078f6dceb3fcaa8"}},{"ruleId":"D1","level":"warning","message":{"text":"JsonEncoderPrinter::encoder_for (cyclomatic 18): JsonEncoderPrinter::encoder_for 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":"language-server/src/code_action.rs"},"region":{"startLine":5430}}}],"partialFingerprints":{"codehealthFindingId/v1":"79c2a1da75194a53264cea5bd2a8588b714c6506073b9ffdd453b85e523f2145"}},{"ruleId":"D1","level":"warning","message":{"text":"prelude.isEqual (cyclomatic 18): prelude.isEqual 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-core/templates/prelude.mjs"},"region":{"startLine":1481}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f786cccdf0043aaa6b38178fc2e07f843f96d6922a4d9e9647382d4b7fa736c"}},{"ruleId":"D1","level":"warning","message":{"text":"gleam_cli::text_layout::space_table (cyclomatic 17): gleam_cli::text_layout::space_table 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-cli/src/text_layout.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"09493f83eccaa166b62c158ce54f3411bc0fe91aa403ba5d4004a86f43c5c710"}},{"ruleId":"D1","level":"warning","message":{"text":"CallGraphBuilder::constant (cyclomatic 17): CallGraphBuilder::constant has cyclomatic complexity 17 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/call_graph.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"b88912ef977bf53b3ce3ad691bd0f542ed8f86f2ca5f6e0294de07b99e3e33ce"}},{"ruleId":"D1","level":"warning","message":{"text":"ExprTyper::infer_record_update_arguments (cyclomatic 17): ExprTyper::infer_record_update_arguments 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: ExprTyper::check_for_redundant_comparison (cyclomatic 25) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/type_/expression.rs"},"region":{"startLine":2826}}}],"partialFingerprints":{"codehealthFindingId/v1":"4855e547820c1864e978381d3f3aa27525dfeeb6e90e8f27f264a38e3dc62956"}},{"ruleId":"D1","level":"warning","message":{"text":"ModuleAnalyzer::infer_module (cyclomatic 16): ModuleAnalyzer::infer_module has cyclomatic complexity 16 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This is NOT this file\u0027s highest cyclomatic complexity: gleam_core::analyse::infer_bit_array_option (cyclomatic 17) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/analyse.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f0481b2c181234d2ae62a6b0569ede3a3bdf402990dc44a25942f53088dceae"}},{"ruleId":"D1","level":"warning","message":{"text":"gleam_core::strings::convert_string_escape_chars (cyclomatic 16): gleam_core::strings::convert_string_escape_chars 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-core/src/strings.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"07ce5395b1cb3542459c8c34484951f04275c27699f4e0c49c5812786d00e764"}},{"ruleId":"D1","level":"warning","message":{"text":"LanguageServerEngine::find_references_in_scope (cyclomatic 16): LanguageServerEngine::find_references_in_scope 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. This is NOT this file\u0027s highest cyclomatic complexity: LanguageServerEngine::completion (cyclomatic 28) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"language-server/src/engine.rs"},"region":{"startLine":1094}}}],"partialFingerprints":{"codehealthFindingId/v1":"61a11af4457fb2c56f6aa941b67037995d088cd990b3d77e8161a9f526b6564e"}},{"ruleId":"D1","level":"warning","message":{"text":"prelude.sizedInt (cyclomatic 16): prelude.sizedInt 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-core/templates/prelude.mjs"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f98ac11d1b083741b0a22212f1c3a2aa0f13ed0862a6c2a575c27598dd93ede"}},{"ruleId":"D2","level":"warning","message":{"text":"gleam_core::error::failed_module_diagnostics (cognitive 133): gleam_core::error::failed_module_diagnostics has cognitive complexity 133 (threshold 15). Drivers by points: if/else 42 (73 pts), match/switch 22 (43 pts), loops 6 (16 pts), boolean chains 1 (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-core/src/error.rs"},"region":{"startLine":2772}}}],"partialFingerprints":{"codehealthFindingId/v1":"367e2ecab0feb81593cab4e49225eb8ec95191cf511526e5a316836ba43d3c46"}},{"ruleId":"D2","level":"warning","message":{"text":"PatternTyper::unify (cognitive 88): PatternTyper::unify has cognitive complexity 88 (threshold 15). Drivers by points: if/else 17 (48 pts), match/switch 12 (24 pts), loops 3 (12 pts), boolean chains 4 (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":"compiler-core/src/type_/pattern.rs"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc62fb00ed48190e4fc43a31a56394d9a469c3be8c48b04cda151854c8e87d92"}},{"ruleId":"D2","level":"warning","message":{"text":"Warning::to_diagnostic (cognitive 88): Warning::to_diagnostic has cognitive complexity 88 (threshold 15). Drivers by points: if/else 22 (46 pts), match/switch 16 (42 pts) (nesting depth added 50). 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-core/src/warning.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"12da94eeaf990ecbbd0fbc283603eadba345dfe31d142321c10eb9e777db069b"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_expression_unit (cognitive 86): Parser::parse_expression_unit has cognitive complexity 86 (threshold 15). Drivers by points: if/else 17 (48 pts), match/switch 13 (36 pts), boolean chains 1, loops 1 (nesting depth added 54). 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-core/src/parse.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"81c28630a0d96ef077605653144c6d9ba7a294ffffb0d54175ccf7a0c725bf89"}},{"ruleId":"D2","level":"warning","message":{"text":"ConstantTyper::do_infer (cognitive 73): ConstantTyper::do_infer has cognitive complexity 73 (threshold 15). Drivers by points: if/else 18 (43 pts), match/switch 11 (23 pts), loops 2 (4 pts), boolean chains 3 (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-core/src/type_/constant.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2a50e4ea6517074beeab14c49b5ec8035d6074b8c41f4761a794b891b737c4d"}},{"ruleId":"D2","level":"warning","message":{"text":"GuardTyper::do_infer (cognitive 61): GuardTyper::do_infer has cognitive complexity 61 (threshold 15). Drivers by points: if/else 16 (44 pts), match/switch 7 (15 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-core/src/type_/guard.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c49f089a401a7a11a6019979f1508c0380298b85da09779f3396e778348cff2"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::searchLoaded::update::addResult (cognitive 58): (anonymous)::searchLoaded::update::addResult has cognitive complexity 58 (threshold 15). Drivers by points: if/else 13 (37 pts), loops 7 (19 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-core/templates/docs-js/index.js"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"8745e6b30cf4ee23a9eed6c452951e093807400a1a716d894616918c423b93ea"}},{"ruleId":"D2","level":"warning","message":{"text":"Error::to_diagnostics (cognitive 57): Error::to_diagnostics has cognitive complexity 57 (threshold 15). Drivers by points: if/else 18 (28 pts), match/switch 13 (27 pts), boolean chains 2 (nesting depth added 24). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/error.rs"},"region":{"startLine":1092}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5d685566147af9fec7ae955caf8bf2b00e0de2a95434d7e438c2ae4dcea09db"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer::lex_string (cognitive 57): Lexer::lex_string has cognitive complexity 57 (threshold 15). Drivers by points: if/else 11 (44 pts), loops 2 (6 pts), match/switch 2 (6 pts), boolean chains 1 (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-core/src/parse/lexer.rs"},"region":{"startLine":1297}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc6dea2112c874976d9a6a5aba544897256ec4d8050ddda8e206fc8ba2ff7399"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_pattern (cognitive 57): Parser::parse_pattern has cognitive complexity 57 (threshold 15). Drivers by points: match/switch 14 (34 pts), if/else 9 (22 pts), boolean chains 1 (nesting depth added 33). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep 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-core/src/parse.rs"},"region":{"startLine":1319}}}],"partialFingerprints":{"codehealthFindingId/v1":"85b37d19124d64278ca048d2bdb4ea1098b7de9726f9b92bde87a88da0b274f4"}},{"ruleId":"D2","level":"warning","message":{"text":"Completer::completion_values (cognitive 56): Completer::completion_values has cognitive complexity 56 (threshold 15). Drivers by points: if/else 14 (33 pts), loops 8 (15 pts), match/switch 2 (5 pts), boolean chains 3 (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":"language-server/src/completer.rs"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"7305aa740eb5178bb334afa36b9e0eec5d6a033100b9daaed90af0473692d44e"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer::consume_character (cognitive 46): Lexer::consume_character has cognitive complexity 46 (threshold 15). Drivers by points: if/else 12 (25 pts), match/switch 8 (15 pts), loops 2 (6 pts) (nesting depth added 24). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/parse/lexer.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"10b91f742a2b706adc1916b91bff25855f41e267e9a25f1bd52661a298bd1459"}},{"ruleId":"D2","level":"warning","message":{"text":"CallGraphBuilder::expression (cognitive 45): CallGraphBuilder::expression has cognitive complexity 45 (threshold 15). Drivers by points: loops 11 (24 pts), if/else 8 (20 pts), match/switch 1 (nesting depth added 25). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/call_graph.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7ec86669e630f021d6f3a30ab8cabc13f301eac0ee28c944e89c30a6818f487"}},{"ruleId":"D2","level":"warning","message":{"text":"TypedExpr::find_node (cognitive 42): TypedExpr::find_node has cognitive complexity 42 (threshold 15). Drivers by points: if/else 15 (32 pts), loops 3 (6 pts), match/switch 2 (3 pts), boolean chains 1 (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-core/src/ast/typed.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"df43618d65a8c30e0cae9bba2fc1125c571eda6acbef9621f52d7d33fcac7eda"}},{"ruleId":"D2","level":"warning","message":{"text":"gleam_core::bit_array::type_options (cognitive 41): gleam_core::bit_array::type_options has cognitive complexity 41 (threshold 15). Drivers by points: if/else 15 (25 pts), match/switch 7 (11 pts), boolean chains 4, 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-core/src/bit_array.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"faff5f32e6581a15213ce2b72d2deec447c491150cdae8643d8a1c8e9cf7bfd1"}},{"ruleId":"D2","level":"warning","message":{"text":"Printer::print (cognitive 40): Printer::print has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (28 pts), match/switch 3 (7 pts), loops 2 (4 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-core/src/exhaustiveness/printer.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef50cce6d02045d7b00f3794acd7f6a05faae24aac3330d6644d8a7c6289fd1a"}},{"ruleId":"D2","level":"warning","message":{"text":"prelude.toBitArray (cognitive 40): prelude.toBitArray has cognitive complexity 40 (threshold 15). Drivers by points: if/else 21 (36 pts), loops 3, boolean chains 1 (nesting depth added 15). Of this number, 34 points are the body\u0027s own statements and 6 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/templates/prelude.mjs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"c20055fdb6c83864f09c174e8180c38161f7f5e58b295acfc678c0efefbbd3d7"}},{"ruleId":"D2","level":"warning","message":{"text":"Completer::completion_types (cognitive 39): Completer::completion_types has cognitive complexity 39 (threshold 15). Drivers by points: if/else 10 (24 pts), loops 7 (13 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":"language-server/src/completer.rs"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"13a741b50fe8b62a4f933bbfef1ddb45d157da055b1faf1dff203ca00e2ecc4b"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_const_value_unit (cognitive 38): Parser::parse_const_value_unit has cognitive complexity 38 (threshold 15). Drivers by points: match/switch 8 (18 pts), if/else 5 (17 pts), boolean chains 3 (nesting depth added 22). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/parse.rs"},"region":{"startLine":3440}}}],"partialFingerprints":{"codehealthFindingId/v1":"882b95700d5ab8725c205495020bbb56e8cdc59a9f414f697d09a7a8a502a09f"}},{"ruleId":"D2","level":"warning","message":{"text":"Generator::compile (cognitive 36): Generator::compile has cognitive complexity 36 (threshold 15). Drivers by points: if/else 29, boolean chains 6, loops 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-core/src/javascript.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9c0f9a7f41aaaa216717853d2b2b2a161c300aed1def0a788ca505ba0988d48"}},{"ruleId":"D2","level":"warning","message":{"text":"pretty_arena::format (cognitive 36): pretty_arena::format has cognitive complexity 36 (threshold 15). Drivers by points: loops 5 (15 pts), match/switch 4 (12 pts), if/else 4 (8 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":"pretty-arena/src/lib.rs"},"region":{"startLine":1184}}}],"partialFingerprints":{"codehealthFindingId/v1":"9afe66187ae5d9b2d8fbc228303b5e297bbf4c1619513ff8e070a5172a78ae49"}},{"ruleId":"D2","level":"warning","message":{"text":"prelude.sizedInt (cognitive 36): prelude.sizedInt has cognitive complexity 36 (threshold 15). Drivers by points: if/else 14 (24 pts), loops 4 (12 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-core/templates/prelude.mjs"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aa15a81b671b695090a416146c7af8a1e7d9e8717be36855b333a5b6f5e9d98"}},{"ruleId":"D2","level":"warning","message":{"text":"gleam_cli::text_layout::space_table (cognitive 35): gleam_cli::text_layout::space_table has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (27 pts), loops 6 (8 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-cli/src/text_layout.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef688f11e8a65aabd5f5e2487d28e6f8b24bf66da366499911ea5b11d6665c65"}},{"ruleId":"D2","level":"warning","message":{"text":"Hydrator::type_from_ast (cognitive 34): Hydrator::type_from_ast has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 6 (12 pts), loops 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":"compiler-core/src/type_/hydrator.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"edd8c8e8ad0ef973cb21122af0a5bba5ccaf905f2db0ae02c2d159747d1601be"}},{"ruleId":"D2","level":"warning","message":{"text":"gleam_core::error::edit_distance (cognitive 34): gleam_core::error::edit_distance has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (23 pts), loops 3 (4 pts), match/switch 2 (4 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-core/src/error.rs"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fe42fd26f93e3a8fb74f9325d8e58552c221da39a56e2f4c8bd007ed5e942a0"}},{"ruleId":"D2","level":"warning","message":{"text":"gleam_core::type_::expression::static_compare (cognitive 33): gleam_core::type_::expression::static_compare has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (19 pts), match/switch 6 (12 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/type_/expression.rs"},"region":{"startLine":5012}}}],"partialFingerprints":{"codehealthFindingId/v1":"11ee8f81869c332905040dd73bcafaff859928fb9c230c9e36479809469f2305"}},{"ruleId":"D2","level":"warning","message":{"text":"PatternGenerator::pattern (cognitive 32): PatternGenerator::pattern has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 4 (9 pts), match/switch 4 (9 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-core/src/erlang/pattern.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"d43e8a50ed297a48f4b33da4e056a03bccee6ab994befb4850985965524aa47e"}},{"ruleId":"D2","level":"warning","message":{"text":"ExprTyper::infer_record_update_arguments (cognitive 31): ExprTyper::infer_record_update_arguments has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (24 pts), match/switch 2 (4 pts), loops 2, 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-core/src/type_/expression.rs"},"region":{"startLine":2826}}}],"partialFingerprints":{"codehealthFindingId/v1":"d52a5a5d0de9d5b5bb2f1a5cbf33ef042a762ea782d51b4a31753ac30f33d769"}},{"ruleId":"D2","level":"warning","message":{"text":"TypedExpr::find_statement (cognitive 30): TypedExpr::find_statement has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (20 pts), loops 3 (6 pts), match/switch 2 (3 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-core/src/ast/typed.rs"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"50ce87fb95d10aef026aaa6e62e15e6b79257f3c24f8d361a176106e3d42cb1a"}},{"ruleId":"D2","level":"warning","message":{"text":"ExprTyper::do_infer_call_with_known_fun (cognitive 30): ExprTyper::do_infer_call_with_known_fun has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (16 pts), loops 4 (7 pts), boolean chains 5, match/switch 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-core/src/type_/expression.rs"},"region":{"startLine":3718}}}],"partialFingerprints":{"codehealthFindingId/v1":"2395612238c63eac5000fcb4ae49fed818cdbf60f134a9e3bd4d5b17516ee003"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonEncoderPrinter::encoder_for (cognitive 30): JsonEncoderPrinter::encoder_for has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (19 pts), match/switch 3 (9 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":"language-server/src/code_action.rs"},"region":{"startLine":5430}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2618f632aae856d1866d4ab4b0ebbe9203c7d7b25d952b08dd6ed6ce5bae737"}},{"ruleId":"D2","level":"warning","message":{"text":"pretty_arena::fits (cognitive 30): pretty_arena::fits has cognitive complexity 30 (threshold 15). Drivers by points: match/switch 9 (27 pts), if/else 1 (2 pts), loops 1 (nesting depth added 19). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pretty-arena/src/lib.rs"},"region":{"startLine":1381}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9202f9c2894105726c752fd24f14daf58e0ca6a7b5dfe96355f2455a1ea7f1b"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleAnalyzer::register_values_from_custom_type (cognitive 29): ModuleAnalyzer::register_values_from_custom_type has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (18 pts), match/switch 3 (8 pts), loops 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/analyse.rs"},"region":{"startLine":1126}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5d8cb5b04d84844b911444310513e13223bfdfaed3d643eba348fb372f6a0ee"}},{"ruleId":"D2","level":"warning","message":{"text":"CasePrinter::switch (cognitive 28): CasePrinter::switch has cognitive complexity 28 (threshold 15). Drivers by points: if/else 17 (22 pts), match/switch 2 (4 pts), boolean chains 1, loops 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-core/src/javascript/decision.rs"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"02dd20443ca8bd5d1869f65211a4710d613f32a1e67839fa2948f86ec797d982"}},{"ruleId":"D2","level":"warning","message":{"text":"Variables::runtime_check (cognitive 28): Variables::runtime_check has cognitive complexity 28 (threshold 15). Drivers by points: match/switch 6 (14 pts), if/else 6 (12 pts), boolean chains 2 (nesting depth added 14). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/javascript/decision.rs"},"region":{"startLine":1497}}}],"partialFingerprints":{"codehealthFindingId/v1":"542cd409980ea9bb261995edd3d82542b1deb3f65259909965099ecf1666f883"}},{"ruleId":"D2","level":"warning","message":{"text":"Generator::constant_expression (cognitive 28): Generator::constant_expression has cognitive complexity 28 (threshold 15). Drivers by points: match/switch 8 (14 pts), if/else 5 (10 pts), boolean chains 4 (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-core/src/javascript/expression.rs"},"region":{"startLine":2671}}}],"partialFingerprints":{"codehealthFindingId/v1":"24c138561d2cd19626b69628e04e823b926e8bf3b5b60c3b8ac9d7e5c501d151"}},{"ruleId":"D2","level":"warning","message":{"text":"isEqual (cognitive 28): isEqual has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 8, error handling 1 (3 pts), loops 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-core/templates/prelude.mjs"},"region":{"startLine":1481}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f92d013d35e93144643685c3d04844be81e3379a88952587e6e476d5ae913f1"}},{"ruleId":"D2","level":"warning","message":{"text":"LanguageServerEngine::folding_range (cognitive 27): LanguageServerEngine::folding_range has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 8 (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":"language-server/src/engine.rs"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"25eeba480efd95a3f7f2e601adf3ce3ba092ef66f4b74015b8ded2a36c14b6e6"}},{"ruleId":"D2","level":"warning","message":{"text":"prelude.intFromUnalignedSliceUsingNumber (cognitive 27): prelude.intFromUnalignedSliceUsingNumber has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 3 (8 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. This shape REPEATS in the file: one other method here (prelude.intFromUnalignedSliceUsingBigInt) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/templates/prelude.mjs"},"region":{"startLine":986}}}],"partialFingerprints":{"codehealthFindingId/v1":"1316069bf2a076278d9c9db4df3b8a9d89ba7e268579d4e6a3fb418a9c45a970"}},{"ruleId":"D2","level":"warning","message":{"text":"prelude.intFromUnalignedSliceUsingBigInt (cognitive 27): prelude.intFromUnalignedSliceUsingBigInt has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 3 (8 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. This shape REPEATS in the file: one other method here (prelude.intFromUnalignedSliceUsingNumber) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/templates/prelude.mjs"},"region":{"startLine":1108}}}],"partialFingerprints":{"codehealthFindingId/v1":"7744ca0a2276873aa1692f1d66b426a2c01ed52d7c06b54bcbfd8806d7f87401"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionGenerator::inlined_constant (cognitive 26): FunctionGenerator::inlined_constant has cognitive complexity 26 (threshold 15). Drivers by points: loops 5 (13 pts), match/switch 6 (13 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-core/src/erlang.rs"},"region":{"startLine":2433}}}],"partialFingerprints":{"codehealthFindingId/v1":"9056f782a1e5feef55aa80511db8f1d31311e7b1d5615a29688c4674bc0857db"}},{"ruleId":"D2","level":"warning","message":{"text":"ConstantTyper::infer_record (cognitive 26): ConstantTyper::infer_record has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 5 (6 pts), loops 3 (5 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-core/src/type_/constant.rs"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c88602f2cd6ee9983ef34dc1eea62d245aa5f77f1e245927574e31d72c2e45f"}},{"ruleId":"D2","level":"warning","message":{"text":"gleam_core::type_::environment::unify (cognitive 26): gleam_core::type_::environment::unify has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3 (6 pts), match/switch 3 (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-core/src/type_/environment.rs"},"region":{"startLine":1091}}}],"partialFingerprints":{"codehealthFindingId/v1":"414792a7a6073f3eb65547fb4842374e53cbe9eb93243e75f7906fac5020534c"}},{"ruleId":"D2","level":"warning","message":{"text":"TypedExpr::syntactically_eq (cognitive 25): TypedExpr::syntactically_eq has cognitive complexity 25 (threshold 15). Drivers by points: boolean chains 14, match/switch 6 (11 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-core/src/ast/typed.rs"},"region":{"startLine":1536}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d1603c2ae838b89e00744eb0bfd7674f15bd89dcf60a192d3b18f5d9fe4da39"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeAst::print (cognitive 25): TypeAst::print has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 3 (7 pts), match/switch 2 (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":"compiler-core/src/ast.rs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8808c4f87195c0c3b9c72383753ec77cc6d0b65b3837d770eaba68e72973aaa"}},{"ruleId":"D2","level":"warning","message":{"text":"gleam_core::analyse::get_compatible_record_fields (cognitive 25): gleam_core::analyse::get_compatible_record_fields has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 4 (10 pts), loops 2 (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-core/src/analyse.rs"},"region":{"startLine":2085}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a6fc4f845fd1b3f7e3d92200538ecb687921c9b1c3126c431347eeb6fb537ac"}},{"ruleId":"D2","level":"warning","message":{"text":"Completer::unqualified_completions_from_module (cognitive 25): Completer::unqualified_completions_from_module has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 5 (9 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":"language-server/src/completer.rs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"d737d6b4f549f31572109f755ef90f8ecda1861b10300abe3ae8ddd188c6d3af"}},{"ruleId":"D2","level":"warning","message":{"text":"Branch::move_unconditional_patterns (cognitive 24): Branch::move_unconditional_patterns has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 3 (11 pts), if/else 3 (9 pts), loops 2 (4 pts) (nesting depth added 16). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/exhaustiveness.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"a72a73aa09288099b95b4e4aa16a9ed29b5b97368b7036066e3e3f79df394f61"}},{"ruleId":"D2","level":"warning","message":{"text":"BitArray.equals (cognitive 24): BitArray.equals has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 2 (4 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-core/templates/prelude.mjs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"897d7c084507e0d3e79b0505c21fdcc4e57be146e98bbe234a7593b5056f52b2"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer::lex_lt (cognitive 23): Lexer::lex_lt has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (6 pts), match/switch 2 (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-core/src/parse/lexer.rs"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"b962a49fb4052f6baec52c6217ef3a858de5091e8e8048e13889766ffd619f6f"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer::lex_gt (cognitive 23): Lexer::lex_gt has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (6 pts), match/switch 2 (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-core/src/parse/lexer.rs"},"region":{"startLine":922}}}],"partialFingerprints":{"codehealthFindingId/v1":"48aee11425aa7815d519d8ade0cfc1154e6fb5e703a59560118886063ddde7c2"}},{"ruleId":"D2","level":"warning","message":{"text":"Echo$Inspector.inspect (cognitive 23): Echo$Inspector.inspect has cognitive complexity 23 (threshold 15). Drivers by points: if/else 20, loops 1 (2 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-core/templates/echo.mjs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"8473b65d79207533fdb45f421e26fb5afa9ab73fed0b31a401240c041f2423b7"}},{"ruleId":"D2","level":"warning","message":{"text":"Generator::record_constructor (cognitive 22): Generator::record_constructor has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 3, 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-core/src/javascript/expression.rs"},"region":{"startLine":3413}}}],"partialFingerprints":{"codehealthFindingId/v1":"a264a671ae5efedee4f7c6ec151a7f57ce29c2120dc2e4031e7a31651b21e1e8"}},{"ruleId":"D2","level":"warning","message":{"text":"ExprTyper::infer_bit_segment (cognitive 22): ExprTyper::infer_bit_segment has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 1 (5 pts), loops 1 (2 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-core/src/type_/expression.rs"},"region":{"startLine":1718}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdd3577252303983c041edac8ab0a43136505dd1e5a4588b7167f55e0761783b"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleAnalyzer::infer_module (cognitive 21): ModuleAnalyzer::infer_module has cognitive complexity 21 (threshold 15). Drivers by points: loops 9 (12 pts), match/switch 4 (6 pts), if/else 2 (3 pts) (nesting depth added 6). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/analyse.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"a47c399711dfc881ef024327f9a45a29233627a245da9fa40c815a781ad571c4"}},{"ruleId":"D2","level":"warning","message":{"text":"ErlangSourceBuilder::new_expression (cognitive 21): ErlangSourceBuilder::new_expression has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (18 pts), match/switch 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"erlang-generation/src/lib.rs"},"region":{"startLine":2701}}}],"partialFingerprints":{"codehealthFindingId/v1":"276cc5a9d3be369d49151e9992bf870217b2525d08f200c088387f0dd8721324"}},{"ruleId":"D2","level":"warning","message":{"text":"gleam_language_server::rename::rename_module_occurrences (cognitive 21): gleam_language_server::rename::rename_module_occurrences has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 3 (4 pts), 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":"language-server/src/rename.rs"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"121ef39a86fe009cafb0e97753dfdd5ac4fcfff594b0cb64571910ad4b202731"}},{"ruleId":"D2","level":"warning","message":{"text":"DependencyManager::resolve_and_download_versions (cognitive 20): DependencyManager::resolve_and_download_versions has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2 (4 pts), match/switch 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-cli/src/dependencies/dependency_manager.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"e76b55d2c755f9a3d0a3fea7b639bea6dc880f64581f2f35e7f46dde423c0089"}},{"ruleId":"D2","level":"warning","message":{"text":"FieldMap::reorder (cognitive 20): FieldMap::reorder has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 3 (6 pts), loops 3, 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-core/src/type_/fields.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"cde897e075f91b78fa5febdf25f9004475205899647e5f7b17decb70041f3bac"}},{"ruleId":"D2","level":"warning","message":{"text":"gleam_core::strings::convert_string_escape_chars (cognitive 20): gleam_core::strings::convert_string_escape_chars has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (13 pts), match/switch 2 (5 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-core/src/strings.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ba52a104d360bba9806b1bc7324cadc48bad1fe89a38a5b7c638ce2b595b7b1"}},{"ruleId":"D2","level":"warning","message":{"text":"CollapseNestedCase::code_actions (cognitive 20): CollapseNestedCase::code_actions has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 3 (5 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"language-server/src/code_action.rs"},"region":{"startLine":9907}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ea83245242a37beb69657138e1678adae107881c1ad70e907fcfcb686a52c18"}},{"ruleId":"D2","level":"warning","message":{"text":"gleam_language_server::code_action::code_action_add_missing_patterns (cognitive 20): gleam_language_server::code_action::code_action_add_missing_patterns has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 3 (6 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"language-server/src/code_action.rs"},"region":{"startLine":1416}}}],"partialFingerprints":{"codehealthFindingId/v1":"72883eb571effce0c95e308937eb5c4892763da08c1bee0fc98366663a066afb"}},{"ruleId":"D2","level":"warning","message":{"text":"gleam_language_server::rename::alias_references_in_module (cognitive 20): gleam_language_server::rename::alias_references_in_module has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 3 (4 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"language-server/src/rename.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"6505b672178a04cad8dee21b0a00803547a02accbfe7430336334ae7caa7f17a"}},{"ruleId":"D2","level":"warning","message":{"text":"Manifest::to_toml (cognitive 19): Manifest::to_toml has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 4 (6 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-core/src/manifest.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"72e69b72dc469d779efc2a28a9f6bf90e33ee2ade3ccb3bd08c253b9b2254c94"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_case_clause_guard_unit (cognitive 19): Parser::parse_case_clause_guard_unit has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 7 (17 pts), loops 1 (2 pts) (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/parse.rs"},"region":{"startLine":1883}}}],"partialFingerprints":{"codehealthFindingId/v1":"986ebb0059d5d272175b23c53cd05dfbacdbd284f39d176cdea120ffadd759c2"}},{"ruleId":"D2","level":"warning","message":{"text":"ExprTyper::infer_fn_with_known_types (cognitive 19): ExprTyper::infer_fn_with_known_types has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/type_/expression.rs"},"region":{"startLine":4096}}}],"partialFingerprints":{"codehealthFindingId/v1":"135288dde4cf79e932d7ce845ac4e4eeb244e608cb4b395b857a6c574be1230d"}},{"ruleId":"D2","level":"warning","message":{"text":"PatternTyper::infer_pattern_segment (cognitive 19): PatternTyper::infer_pattern_segment has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 6 (12 pts), boolean chains 3, if/else 2, loops 1 (2 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-core/src/type_/pattern.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"8301168458622e8871297ab5e81e5202c9d5c447b9568dddf25aa49f8fd3fe6d"}},{"ruleId":"D2","level":"warning","message":{"text":"gleam_language_server::reference::reference_for_ast_node (cognitive 19): gleam_language_server::reference::reference_for_ast_node has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 5 (9 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":"language-server/src/reference.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"87cc1c025a216df3d00b852a3eaa9ad538443034742a9955b5d5743521e0c557"}},{"ruleId":"D2","level":"warning","message":{"text":"CallGraphBuilder::constant (cognitive 18): CallGraphBuilder::constant has cognitive complexity 18 (threshold 15). Drivers by points: loops 6 (13 pts), if/else 2 (4 pts), 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-core/src/call_graph.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"be73ae1d2ea62da165b6fdeb91b412588c6513df7cd5c3dd9a8f0b4b791e99e0"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionGenerator::expression (cognitive 18): FunctionGenerator::expression has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 3 (6 pts), match/switch 2 (3 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-core/src/erlang.rs"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4c39ce30ae3463243e8870df37362175c59c3826e4f601d068190459b3093df"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_import (cognitive 18): Parser::parse_import has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/parse.rs"},"region":{"startLine":3130}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3cda3710ef2c09a97afcb4b8fc4807ef38c0e728d40f7cc86b3ea665aa6748e"}},{"ruleId":"D2","level":"warning","message":{"text":"gleam_cli::add::command (cognitive 17): gleam_cli::add::command has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2, 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-cli/src/add.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ae42be31e0bfb47ae0563914dadab573a94a8c75417568c1cca0ea68a333ba4"}},{"ruleId":"D2","level":"warning","message":{"text":"PackageCompiler::compile (cognitive 17): PackageCompiler::compile has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (13 pts), match/switch 2 (3 pts), loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/build/package_compiler.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"f05feac5b0262d46a411bc511a10a27c9699fc39e16627a9210ec73fc4906100"}},{"ruleId":"D2","level":"warning","message":{"text":"CaseToCompile::bit_array_to_tests (cognitive 17): CaseToCompile::bit_array_to_tests has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 3 (6 pts), boolean chains 1, loops 1 (nesting depth added 7). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/exhaustiveness.rs"},"region":{"startLine":3831}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aefa31620cfc62c17f0b52ca54d8081ed3716497b723b832735fb3a8261eb9a"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_const_record_finish (cognitive 17): Parser::parse_const_record_finish has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), match/switch 3 (8 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-core/src/parse.rs"},"region":{"startLine":3692}}}],"partialFingerprints":{"codehealthFindingId/v1":"1557b2602883bee2b67224746d285921e69bcab894d59a8098fe83edad669e28"}},{"ruleId":"D2","level":"warning","message":{"text":"ExprTyper::infer_binop (cognitive 17): ExprTyper::infer_binop has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 4, 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-core/src/type_/expression.rs"},"region":{"startLine":1837}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd45db45e91e081a2682b3e4cea36df55417a401fb7f140515c981d5084e925f"}},{"ruleId":"D2","level":"warning","message":{"text":"gleam_core::error::break_line (cognitive 17): gleam_core::error::break_line has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 2 (5 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/error.rs"},"region":{"startLine":5593}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1d5a8dcaf96f8d095517eaf03fc95e97b79edb8a224e438a0f8b3ba63cb3373"}},{"ruleId":"D2","level":"warning","message":{"text":"Formatter::module (cognitive 17): Formatter::module has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (4 pts), match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"format/src/lib.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"55a1a0e5a4a54f2aeca202e915a9e9bebfb5e37842f094e7ddb00f6bbfdbd0b0"}},{"ruleId":"D2","level":"warning","message":{"text":"gleam_format::printed_comments (cognitive 17): gleam_format::printed_comments has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 2 (5 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":"format/src/lib.rs"},"region":{"startLine":4421}}}],"partialFingerprints":{"codehealthFindingId/v1":"508c884079da79cf324d48de5039fd63c8b5553985d409b1930dec10c5515b8c"}},{"ruleId":"D2","level":"warning","message":{"text":"gleam_cli::export::escript (cognitive 16): gleam_cli::export::escript has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-cli/src/export.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5de1ccad2fda548856547d3f8df52b5f092a5792a84cdf6b63922048849592d"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeScriptGenerator::collect_imports (cognitive 16): TypeScriptGenerator::collect_imports has cognitive complexity 16 (threshold 15). Drivers by points: loops 9 (14 pts), match/switch 1 (2 pts) (nesting depth added 6). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/javascript/typescript.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"df99d5fb54391810bf65c6906e17c8a8d04741bcbdbe2757f7ed95f37bb959bb"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_bit_array_option (cognitive 16): Parser::parse_bit_array_option has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 4 (13 pts), if/else 2 (3 pts) (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-core/src/parse.rs"},"region":{"startLine":3992}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaa80c66a287c9216b8dddf0bbb1ce1225f9ed444a6edfea636b0ad18883ca16"}},{"ruleId":"D2","level":"warning","message":{"text":"ExprTyper::infer_field_access (cognitive 16): ExprTyper::infer_field_access has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 3 (4 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/type_/expression.rs"},"region":{"startLine":1389}}}],"partialFingerprints":{"codehealthFindingId/v1":"75269a8392a4b1a460cfbfefa6b811fd077da2463a848310acac3caf5773c6ba"}},{"ruleId":"D2","level":"warning","message":{"text":"gleam_core::ast::pattern_and_expression_are_the_same (cognitive 16): gleam_core::ast::pattern_and_expression_are_the_same has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 6 (11 pts), boolean chains 5 (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-core/src/ast.rs"},"region":{"startLine":2231}}}],"partialFingerprints":{"codehealthFindingId/v1":"58d1e6978ca76249c825e3ff3958b32950dd89559db61862fb1f25b5094954c9"}},{"ruleId":"D2","level":"warning","message":{"text":"Formatter::list (cognitive 16): Formatter::list has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 7 (10 pts), if/else 4 (5 pts), loops 1 (nesting depth added 4). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"format/src/lib.rs"},"region":{"startLine":2747}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e73e3dac048fbef8f9834c7c236389e702b24ff86446946b2f25ed26ee7344f"}},{"ruleId":"D2","level":"warning","message":{"text":"ConvertFromUse::code_actions (cognitive 16): ConvertFromUse::code_actions has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 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":"language-server/src/code_action.rs"},"region":{"startLine":2881}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ca067f3ffb51e696ac02493308035bea1f311d283b099cb1e689473ca6d1e36"}},{"ruleId":"D2","level":"warning","message":{"text":"RemoveUnreachableCaseClauses::visit_typed_expr_case (cognitive 16): RemoveUnreachableCaseClauses::visit_typed_expr_case has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"language-server/src/code_action.rs"},"region":{"startLine":10295}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6967424b2e43ecfe88c44f792458982eec65d96b418c6ed9477c053ebbca27d"}},{"ruleId":"D2","level":"warning","message":{"text":"LanguageServerEngine::hover (cognitive 16): LanguageServerEngine::hover has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 3 (4 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"language-server/src/engine.rs"},"region":{"startLine":1350}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b1b52cec6a58493a1e88fecb83bfc7fd6081dac6a57491386339970703e047f"}},{"ruleId":"D2","level":"warning","message":{"text":"gleam_language_server::code_action::code_action_inexhaustive_let_to_case (cognitive 16): gleam_language_server::code_action::code_action_inexhaustive_let_to_case has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"language-server/src/code_action.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"22e185317b1a5c15cfc51c84f54c79c5f9ddbb8db05c6e6743d26a8b2ae701cd"}},{"ruleId":"D2","level":"warning","message":{"text":"gleam_language_server::signature_help::active_parameter_index (cognitive 16): gleam_language_server::signature_help::active_parameter_index has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"language-server/src/signature_help.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"66e86c3ee98ea6ccd260cc5faef7380b6de1bd8c5ed0eca7c46699299a2fcf01"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/code_action.rs: FileTooLong \u2014 7873 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 32 free functions. The bar is 500 significant lines; this is 7373 over it, 15.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":"language-server/src/code_action.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"62b3c0d8e8ea967f15fd2e9c1ede9d16adbb28567454ea280139c9034c8a309f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Error.to_diagnostics: MethodTooLong \u2014 to_diagnostics runs 1194 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1094 over it, 11.94\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values 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-core/src/error.rs"},"region":{"startLine":1092}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd418995b8724c1010bab94fe41c4ac41a0ae653c4cfd6574311dc1d663e24ee"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Warning.to_diagnostic: MethodTooLong \u2014 to_diagnostic runs 986 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 886 over it, 9.86\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/warning.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"39cd166ea54fff43d9d38f99f1edc291d366ee83f42fe8f249cee1dbf3bd129b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/error.rs: FileTooLong \u2014 4038 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 3538 over it, 8.08\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/error.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"46bc2ed0307f0d32566280a919c3ab9568b4ce26693712dcf20d98c37e8daf1e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/parse.rs: FileTooLong \u2014 3527 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 3027 over it, 7.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-core/src/parse.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7ebc00450625949c1a55f63d94851b90f3b6217aac1922846343d9ce944d93c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ExprTyper: ClassTooLong \u2014 2757 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 78 methods, 2 blocks, lines 278-4471. The bar is 400 significant lines; this is 2357 over it, 6.89\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-core/src/type_/expression.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d394df31f489bb701c37fe00524f08dcc6c81cde88365795178c358df6f7bc9"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Formatter: ClassTooLong \u2014 2710 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 91 methods, 2 blocks, lines 107-4023. The bar is 400 significant lines; this is 2310 over it, 6.78\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":"format/src/lib.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3f27a775940b9808ea4ca04c3f9fbf2248937cc738e13eea8a16adbd6f95658"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: type_/expression.rs: FileTooLong \u2014 3333 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 83% of them inside a single declaration: ExprTyper (2 blocks, 278-4471). The bar is 500 significant lines; this is 2833 over it, 6.67\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/type_/expression.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"63f3b7fb92a1e0dbeda937d05f21b2cd363d00654bdbcb0887d0d47142d1000e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 3123 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 87% of them inside a single declaration: Formatter (2 blocks, 107-4023). The bar is 500 significant lines; this is 2623 over it, 6.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":"format/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbcb1e24013f003065f87dd1db40fba090101e4b84f95791227bc8be02fb16b2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/ast.rs: FileTooLong \u2014 2998 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 2498 over it, 6.00\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-core/src/ast.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"634273f2ce885da65fbca2224a4b78f90e21d18d0cd5322b1c658fc4f886faa5"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Generator: ClassTooLong \u2014 2385 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 69 methods, 2 blocks, lines 227-3561. The bar is 400 significant lines; this is 1985 over it, 5.96\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-core/src/javascript/expression.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cfe49f2e177359bde3940ab234df2455fd265762b91fd7ce12f17ae184d3cc9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: javascript/expression.rs: FileTooLong \u2014 2756 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 87% of them inside a single declaration: Generator (2 blocks, 227-3561). The bar is 500 significant lines; this is 2256 over it, 5.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-core/src/javascript/expression.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2643a5dac6904baffcdaaaea36983c5b7a63c9fff2c6a287067b29600c7d4838"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 2635 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 2135 over it, 5.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":"erlang-generation/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"57880e5548e6b6bc164f0365893fd3b7a4f821530b69b27ba01a6fb12b0193db"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/erlang.rs: FileTooLong \u2014 2626 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 67% of them inside a single declaration: FunctionGenerator (2 blocks, 125-3429). The bar is 500 significant lines; this is 2126 over it, 5.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-core/src/erlang.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"928160fc30737547527f02d60819d38d75d366f67870f3691da257473ceb9201"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: FunctionGenerator: ClassTooLong \u2014 1764 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 49 methods, 2 blocks, lines 125-3429. The bar is 400 significant lines; this is 1364 over it, 4.41\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/erlang.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf95ae47556aaf52c3b208b87ed8714c209298439e67dc7134bf2d4359d04e20"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/exhaustiveness.rs: FileTooLong \u2014 2066 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 1566 over it, 4.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-core/src/exhaustiveness.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ead575eb101c1a8889ccc2bdfdce6f619e10d2305acf29cbbb062e660b82a18e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gleam_language_server::reference::reference_for_ast_node: FunctionTooLong \u2014 gleam_language_server::reference::reference_for_ast_node runs 382 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 282 over it, 3.82\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"language-server/src/reference.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"49b7613974edc58403fe5e04d664744e9d968cce9bb5d8f99dc264445333e8e1"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Error: ClassTooLong \u2014 1524 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 10 methods, 3 blocks, lines 130-2753. The bar is 400 significant lines; this is 1124 over it, 3.81\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-core/src/error.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"270c87bb609d0dc4bb4bcedd05e872ba8f647efeb4ec71d1055177d119b8fa2a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ConstantTyper.do_infer: MethodTooLong \u2014 do_infer runs 348 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 248 over it, 3.48\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/type_/constant.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c88001a9e6de1f07592f80cd61f77ea5a74cea14ceeb841d5f48d3136c6a44b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/engine.rs: FileTooLong \u2014 1720 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 1220 over it, 3.44\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":"language-server/src/engine.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1b992a4dd0f3d53db7afa7791d6258a660a009800c76ac9019b06f112cf6c0e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ast/visit.rs: FileTooLong \u2014 1704 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 82 free functions. The bar is 500 significant lines; this is 1204 over it, 3.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-core/src/ast/visit.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"17191f0eb749cf5e9ebdf2f6c659a3f0806422034de7fcd785ae89dbcb0bfa86"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TypedExpr: ClassTooLong \u2014 1315 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 37 methods, 5 blocks, lines 15-1929. The bar is 400 significant lines; this is 915 over it, 3.29\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-core/src/ast/typed.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee270681c0998291d7854f88b1a9a6ba991a422d31003470b30020f0f5a3b4af"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Parser: TooManyMethods \u2014 92 methods. The bar is 30 methods; this is 62 over it, 3.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/parse.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d87dd2bbc8e768dd8330758693c175103abb737cc18b33c93017e279ca8c225"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gleam_core::erlang::echo::inspect_maybe_gleam_atom: FunctionTooLong \u2014 gleam_core::erlang::echo::inspect_maybe_gleam_atom runs 304 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 204 over it, 3.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-core/src/erlang/echo.rs"},"region":{"startLine":1292}}}],"partialFingerprints":{"codehealthFindingId/v1":"be8b797b9e192e51f0e82125bc77904f319c5e8bd6af90f387362fc1a025cc7c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Formatter: TooManyMethods \u2014 91 methods. The bar is 30 methods; this is 61 over it, 3.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":"format/src/lib.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"430161ddbca8fe7bdbeef5dcd8393c0cee6c2c20283a528d71cffecd7382b3aa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/analyse.rs: FileTooLong \u2014 1515 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 70% of them inside a single declaration: ModuleAnalyzer (2 blocks, 193-1767). The bar is 500 significant lines; this is 1015 over it, 3.03\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/analyse.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5b80e2043abcb65095d631c4e20eeec93ae9040e8eefb37238dfe246a092bd1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: javascript/decision.rs: FileTooLong \u2014 1426 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 926 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-core/src/javascript/decision.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e43d473f693935c0f9112277a2652515a20f1f964d517b940f12e6d71a885fb9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: erlang/echo.rs: FileTooLong \u2014 1358 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 858 over it, 2.72\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/erlang/echo.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6c49561ef753211cb4c94116bf6c5d899fb51b2ab4fef073cff0c77f6672662"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ast/typed.rs: FileTooLong \u2014 1337 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 98% of them inside a single declaration: TypedExpr (5 blocks, 15-1929). The bar is 500 significant lines; this is 837 over it, 2.67\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/ast/typed.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de1678c444663e1f4cc5c19bb92c1996d61089b315a6965b86ca6598de58c7f6"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ModuleAnalyzer: ClassTooLong \u2014 1061 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 20 methods, 2 blocks, lines 193-1767. The bar is 400 significant lines; this is 661 over it, 2.65\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/analyse.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"7db0363ef6fe1d892d32f9e4e6182835201ec4087f32bae34e548135527cb9c0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/ast_folder.rs: FileTooLong \u2014 1325 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 825 over it, 2.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-core/src/ast_folder.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"49c8a861f083db66ecef69a3a86f6e3d9ab7750f2a194fcc1dd15ee44560aa1a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ExprTyper: TooManyMethods \u2014 78 methods. The bar is 30 methods; this is 48 over it, 2.60\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/type_/expression.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b37ddbc24edaa66b72f341cf1f06b02147601b02cfbc0dfe11b1a4d16e7e23c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PatternTyper: ClassTooLong \u2014 1021 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 19 methods, 2 blocks, lines 27-1636. The bar is 400 significant lines; this is 621 over it, 2.55\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-core/src/type_/pattern.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"97ca10db9881e30d8356454fc957e4a672954b0494b5d5444c1379f5625672aa"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Warning: ClassTooLong \u2014 1014 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 3 methods, 2 blocks, lines 162-1617. The bar is 400 significant lines; this is 614 over it, 2.54\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-core/src/warning.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"762fa82feeb5a761d4808d97277f335e53c7700cb1756c9ba4a465bc9c265a8b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gleam_core::type_::prelude::build_prelude: FunctionTooLong \u2014 gleam_core::type_::prelude::build_prelude runs 251 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 151 over it, 2.51\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/type_/prelude.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"52d9517afc450640a459129e11c27b93e876902fa9102b582fa81d680e016e65"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gleam_core::docs::generate_html: FunctionTooLong \u2014 gleam_core::docs::generate_html runs 247 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 147 over it, 2.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-core/src/docs.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ce946fe778e5743b762b8c55e0d64f43635bfcc878d9569789f2a1fcf2f1e37"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Generator: TooManyMethods \u2014 69 methods. The bar is 30 methods; this is 39 over it, 2.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-core/src/javascript/expression.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"69efc6cc9e8d205d2a5373aea85bcd7c77aabe284726949544a364ead47cfc40"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/dependencies.rs: FileTooLong \u2014 1149 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 45 free functions. The bar is 500 significant lines; this is 649 over it, 2.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-cli/src/dependencies.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"85121ceeb297822c89eebb7403164d9ab71a45dac1d9a21d70d63188ba4fb8b2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/warning.rs: FileTooLong \u2014 1149 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 88% of them inside a single declaration: Warning (2 blocks, 162-1617). The bar is 500 significant lines; this is 649 over it, 2.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-core/src/warning.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"79e95c630a02f6fa242c15548d5eb6a50cfd68a47137b82ada9b037c8ad014f2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: type_/error.rs: FileTooLong \u2014 1144 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 644 over it, 2.29\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/type_/error.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d629c308589362ace19f78094d17de3977e8bf9768f7e2daefede916a46704de"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/javascript.rs: FileTooLong \u2014 1114 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 72% of them inside a single declaration: Generator (2 blocks, 96-1294). The bar is 500 significant lines; this is 614 over it, 2.23\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/javascript.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"320d06a02809895ed574bb9be0197dddc36d0495b336471576ae9638411257e4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/type_.rs: FileTooLong \u2014 1113 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 613 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-core/src/type_.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"03b7877e9a25d40d4603f21e8fd0649e7e14ed0941224fb18ba93ef1aaaabd21"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: type_/pattern.rs: FileTooLong \u2014 1074 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 95% of them inside a single declaration: PatternTyper (2 blocks, 27-1636). The bar is 500 significant lines; this is 574 over it, 2.15\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-core/src/type_/pattern.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"397075d2e0b359180c44afa71d2af33dc257709fb06658a86e561183e235ab15"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FunctionGenerator.expression: MethodTooLong \u2014 expression runs 212 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 112 over it, 2.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/erlang.rs"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"23760993d2f2b62f6bbac69c9655e2696c5a9bd331951d0c957dfc3828f28958"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 1011 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 55 free functions. The bar is 500 significant lines; this is 511 over it, 2.02\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hexpm/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c464023f9ecaca643e8eef7481519683f7888f502a67f45c025e91b1733a5e1"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Generator: ClassTooLong \u2014 802 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 25 methods, 2 blocks, lines 96-1294. The bar is 400 significant lines; this is 402 over it, 2.01\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/javascript.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"584c1edbef37c74edb15b0bdfc2bddcc84448da8a748b7f683587f3dd95eece7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypedExpr.syntactically_eq: MethodTooLong \u2014 syntactically_eq runs 200 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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-core/src/ast/typed.rs"},"region":{"startLine":1536}}}],"partialFingerprints":{"codehealthFindingId/v1":"96a8af231e4efdb3f37a64b25eb867d63feffa8f9841fabd7badd4a83895e82d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: UntypedExprFolder.walk_expr: MethodTooLong \u2014 walk_expr runs 191 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 91 over it, 1.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/ast_folder.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"910e0d03bfb78c520fef64fd811bba61c77cd4e368e84e568820451ad39c1d69"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypedExpr.find_node: MethodTooLong \u2014 find_node runs 190 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 90 over it, 1.90\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/ast/typed.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"365e4ddb9e5190c647b4efa77bf49df6c6c82c07856610f8c16798f936c1af06"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/completer.rs: FileTooLong \u2014 937 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 71% of them inside a single declaration: Completer (2 blocks, 323-1420). The bar is 500 significant lines; this is 437 over it, 1.87\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":"language-server/src/completer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"43ee75326f72257dc94ed89b774d0a7623f2b358a1a44479da6f49aeb93f0608"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TypeScriptGenerator: ClassTooLong \u2014 735 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 28 methods, 2 blocks, lines 187-1260. The bar is 400 significant lines; this is 335 over it, 1.84\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-core/src/javascript/typescript.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d4c31fedc06262321671e03d54c18983aeadb3d1ba44118595a2f883ae3451f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ModuleAnalyzer.infer_function: MethodTooLong \u2014 infer_function runs 182 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 82 over it, 1.82\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/analyse.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"139a819eaa2116db250b8bd69cec6a8d0b7a99ac1112d390f001e8e35eae77b0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GuardTyper.do_infer: MethodTooLong \u2014 do_infer runs 181 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 81 over it, 1.81\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/type_/guard.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e96206a9279cdb71760cc84e6ffd8579c7a1fde26e4f91204ea4f2628a25b33"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 859 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 359 over it, 1.72\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pretty-arena/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aebfae6d9cfd999f61f3c327e2418a8148a9070e7fd8e729e79252420282f0a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: javascript/typescript.rs: FileTooLong \u2014 856 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 86% of them inside a single declaration: TypeScriptGenerator (2 blocks, 187-1260). The bar is 500 significant lines; this is 356 over it, 1.71\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/javascript/typescript.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a03632938f8bfa1eb3686d017a13408dc652712728e2f3e4f0e86fb953e8e189"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gleam_core::ast::pattern_and_expression_are_the_same: FunctionTooLong \u2014 gleam_core::ast::pattern_and_expression_are_the_same runs 171 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 71 over it, 1.71\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/ast.rs"},"region":{"startLine":2231}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc321132ebed85d86f038916f415bef66e3f7e6ed8b38f84a7f0362694da187e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ExprTyper.infer_record_update_arguments: MethodTooLong \u2014 infer_record_update_arguments runs 171 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 71 over it, 1.71\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/type_/expression.rs"},"region":{"startLine":2826}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0d8dbbdc57bc9965a75d1479c255340da34c95e4cd134e0d17a56a9c81308c7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/reference.rs: FileTooLong \u2014 849 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 349 over it, 1.70\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"language-server/src/reference.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"942907d88baeadc4e91f2e7ec76f00a00ff7afccb5ff01868c18495db68857f5"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Variables: ClassTooLong \u2014 678 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 30 methods, 2 blocks, lines 1204-2356. The bar is 400 significant lines; this is 278 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-core/src/javascript/decision.rs"},"region":{"startLine":1204}}}],"partialFingerprints":{"codehealthFindingId/v1":"01de4433ba1ececc2576b83e58317990ded3a5337bba94f5b483af548758d5e5"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Completer: ClassTooLong \u2014 668 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 19 methods, 2 blocks, lines 323-1420. The bar is 400 significant lines; this is 268 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":"language-server/src/completer.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b3af98109a6b877c1b2da2ddf1003e942dcea7aa6b51399e71b94307edc9c09"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ConstantTyper: ClassTooLong \u2014 662 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 10 methods, 2 blocks, lines 32-1043. The bar is 400 significant lines; this is 262 over it, 1.66\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-core/src/type_/constant.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbee7b8ba535d260a5f9c458892f07e1925b5f6c8d742ca47da335e986968b2b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gleam_core::ast::visit::visit_typed_expr: FunctionTooLong \u2014 gleam_core::ast::visit::visit_typed_expr runs 164 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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-core/src/ast/visit.rs"},"region":{"startLine":1296}}}],"partialFingerprints":{"codehealthFindingId/v1":"e00c87c07f73b207690af4bb8f545b700c47370bcf61ce1fe434076c0e63556c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: FunctionGenerator: 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-core/src/erlang.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4dcad7b07a8d9d533038943038311e0adec3b14f3f7d1157703e81b607fa316"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LanguageServerEngine.hover: MethodTooLong \u2014 hover runs 161 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 61 over it, 1.61\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"language-server/src/engine.rs"},"region":{"startLine":1350}}}],"partialFingerprints":{"codehealthFindingId/v1":"9735a44a4c44a4c2059041e589cf7825ff70ca75e99b01173ba4c0533be400c6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Variables.runtime_check: MethodTooLong \u2014 runtime_check runs 160 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 60 over it, 1.60\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/javascript/decision.rs"},"region":{"startLine":1497}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dbd199dc149ee7ea4e3ac9a9a9b87c038423c09ce4605e54bbf2a6e68374978"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FunctionGenerator.assert: MethodTooLong \u2014 assert runs 159 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 59 over it, 1.59\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/erlang.rs"},"region":{"startLine":1503}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd456a4a85205d3cd8a1b7f1724b595ef578e32293876a98ba523b2411142380"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RemapIds.constant: MethodTooLong \u2014 constant runs 159 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 59 over it, 1.59\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/metadata.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"68c8e963842d4fab0e4db98749f423a0fd98edce2ec8d8b19bb214ee8e8a22f4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gleam_core::bit_array::type_options: FunctionTooLong \u2014 gleam_core::bit_array::type_options runs 158 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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-core/src/bit_array.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"93cbafc74bfadc5e27f7b398524955a67d28f62cedd29560425aa458d6b119cd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Completer.completion_values: MethodTooLong \u2014 completion_values runs 158 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"language-server/src/completer.rs"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a0d988fa0ea056e1caff25fd7d34669ef74281de603ec0bf364bb5e5c3b47c3"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Environment: ClassTooLong \u2014 624 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 39 methods, 3 blocks, lines 50-1073. The bar is 400 significant lines; this is 224 over it, 1.56\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/type_/environment.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2846280fd5a0e8774d2411ef39d88033ec2867d33ca19e4f562cac815327465"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ModuleAnalyzer.register_values_from_custom_type: MethodTooLong \u2014 register_values_from_custom_type runs 156 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 56 over it, 1.56\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/analyse.rs"},"region":{"startLine":1126}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a45a06100e8b01fc670824f8b7f9c882a675f372cc0f63898bbbdd42b14ad6c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Hydrator.type_from_ast: MethodTooLong \u2014 type_from_ast runs 155 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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-core/src/type_/hydrator.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4a04f5a3d4bc6d92072dc9a60ea3eecb769be05a84699d2e924223cb2bd1581"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: type_/environment.rs: FileTooLong \u2014 760 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 82% of them inside a single declaration: Environment (3 blocks, 50-1073). The bar is 500 significant lines; this is 260 over it, 1.52\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-core/src/type_/environment.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"49104c2601361c7292c10be5c6a68864fd05cb4d9a975cc4d62d93e12dec4b85"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: templates/prelude.mjs: FileTooLong \u2014 758 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 258 over it, 1.52\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-core/templates/prelude.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fff65792fe0d1035584e2416e0979df15b82c9cd660cadf32fa4d04860c4380"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Command.run: MethodTooLong \u2014 run runs 150 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 50 over it, 1.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-cli/src/lib.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"eec685cf46e1dd334dca901cf048be5cd03dc1b23328c0447042a5e04ccecf92"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PatternTyper.infer_pattern_segment: MethodTooLong \u2014 infer_pattern_segment runs 149 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 49 over it, 1.49\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/type_/pattern.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"89ed3024fea49810480c4f7c6b4184fd40b0b6fb6ce414147633128aae437326"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parse/error.rs: FileTooLong \u2014 729 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 229 over it, 1.46\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-core/src/parse/error.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"76a15e95159ad6986905f9303812c611d487ec68709824977338bcd19d94b5d1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ConstantTyper.infer_record: MethodTooLong \u2014 infer_record runs 145 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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-core/src/type_/constant.rs"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"df722c64e029241d21206eedc63f727f00375df1ee6e30e36357bc0de4eec4ec"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PatternGenerator.pattern: MethodTooLong \u2014 pattern runs 143 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 43 over it, 1.43\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/erlang/pattern.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5f1cc9658aae535c60431179c6ac6176a2a210dcb599c43a1dcd6bd082447cc"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Printer: ClassTooLong \u2014 562 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 24 methods, 2 blocks, lines 44-874. The bar is 400 significant lines; this is 162 over it, 1.41\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/docs/printer.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"238dd65bf49a11255d2cbd7d47201a6c379e19f607cd8bbbd5b9a5cbfa4efd57"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/fs.rs: FileTooLong \u2014 694 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 43 free functions. The bar is 500 significant lines; this is 194 over it, 1.39\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-cli/src/fs.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"42902981b242d4315480a12dc62de3042547f8965856e9aadd90128174ca4471"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: type_/constant.rs: FileTooLong \u2014 683 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 97% of them inside a single declaration: ConstantTyper (2 blocks, 32-1043). The bar is 500 significant lines; this is 183 over it, 1.37\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/type_/constant.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e309f77abfb4488e539ddc0fc4ce69d47ae2a4aa54f1f1a2064d0f94ddbfdeb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ExprTyper.do_infer_call_with_known_fun: MethodTooLong \u2014 do_infer_call_with_known_fun runs 136 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 36 over it, 1.36\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/type_/expression.rs"},"region":{"startLine":3718}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdea1f97218371dd8de4ca0c2bb0b259f3dd2bee44c56d650765e4d27838307a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Visit: ClassTooLong \u2014 543 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 82 methods. The bar is 400 significant lines; this is 143 over it, 1.36\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/ast/visit.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6cbb6dbf062b74749c915c1078633e1c9b0bef3bde366149b83bc27820abfc2"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: UntypedExprFolder: ClassTooLong \u2014 538 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 32 methods. The bar is 400 significant lines; this is 138 over it, 1.35\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-core/src/ast_folder.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"a28d42aecc3a480125e433a4fe931d30c42b675442100484bed20dbdd0f85d37"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ModuleAnalyzer.infer_module: MethodTooLong \u2014 infer_module runs 134 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 34 over it, 1.34\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values 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-core/src/analyse.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"0466075d8222ba5b0fb65e5c649b1556859d62c730e54d8d700bc06ea1319f32"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: RemapIds: ClassTooLong \u2014 530 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 16 methods, 2 blocks, lines 40-670. The bar is 400 significant lines; this is 130 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-core/src/metadata.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"76931b32a9be17371cf5733b6c7e65e2697b09a1ace2afac0f7add3f71679d8f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Generator.assert_check: MethodTooLong \u2014 assert_check runs 132 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 32 over it, 1.32\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/javascript/expression.rs"},"region":{"startLine":1299}}}],"partialFingerprints":{"codehealthFindingId/v1":"261c324b8c4eed709055607e787c1b3c086d7472e9139bc0da48120793fee6e0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gleam_core::type_::expression::static_compare: FunctionTooLong \u2014 gleam_core::type_::expression::static_compare runs 132 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 32 over it, 1.32\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/type_/expression.rs"},"region":{"startLine":5012}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce8094dfc4429a37d1f98407250a0e5055e2308d718271e9c1352495fa692217"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LanguageServerEngine.find_references_in_scope: MethodTooLong \u2014 find_references_in_scope runs 131 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 31 over it, 1.31\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"language-server/src/engine.rs"},"region":{"startLine":1094}}}],"partialFingerprints":{"codehealthFindingId/v1":"09434c477cdde6c86ff6827e1a29f2ae6164c3681f599f4ca7d4f88ece4c8bb0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Environment: 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-core/src/type_/environment.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"0724adc9d585bc8d2dda3d3a3b1e9b909a4cb202c0318053ee03108dbfcfbd80"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CasePrinter.switch: MethodTooLong \u2014 switch runs 130 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/javascript/decision.rs"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cb7cb62a14f86421f8eb0a8d6624ed3c69b973e9e8d73fa9f0ae36526186c3f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Generator.constant_expression: MethodTooLong \u2014 constant_expression runs 130 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/javascript/expression.rs"},"region":{"startLine":2671}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8dc06af43c512bc9bc678aae32114020d6868621db41213a08ab126e65a9ad6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: build/package_compiler.rs: FileTooLong \u2014 647 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 147 over it, 1.29\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/build/package_compiler.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"87025782d488d96bfe5af5204905680ab7e113929b6bf9ae8e4f1efa88e9cea1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FunctionGenerator.inlined_constant: MethodTooLong \u2014 inlined_constant runs 127 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 27 over it, 1.27\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/erlang.rs"},"region":{"startLine":2433}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ea96186e3d041d5ec65d94a3eb24a256cbc0293a4311334d2e7721713fa872e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ExprTyper.infer_field_access: MethodTooLong \u2014 infer_field_access runs 127 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 27 over it, 1.27\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/type_/expression.rs"},"region":{"startLine":1389}}}],"partialFingerprints":{"codehealthFindingId/v1":"3371b5962bde22dce27f17efb8531c82ff9b99388cde72820afc5342523dd5e7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Generator.constant_bit_array: MethodTooLong \u2014 constant_bit_array runs 125 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 25 over it, 1.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/javascript/expression.rs"},"region":{"startLine":2870}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5fc2315d2a37ebc49a56d8a7a7c368264ad5d890b8fc93d225f2755f13dbeef"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TypedExpr: TooManyMethods \u2014 37 methods, declared across 2 files: ast/typed.rs (36), javascript/expression.rs (1). The bar is 30 methods; this is 7 over it, 1.23\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. 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-core/src/ast/typed.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"605cf02c173b0ecb10d5bb196da09cc73f4abc8b4c9ee60211adea16d76bf15e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Generator.bit_array: MethodTooLong \u2014 bit_array runs 123 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 23 over it, 1.23\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/javascript/expression.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"db3a415a899783f96a804c9cddd56889fbb69a6e41cede9b339bd6a676b3f181"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gleam_core::erlang::echo::echo_inspect: FunctionTooLong \u2014 gleam_core::erlang::echo::echo_inspect runs 122 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/erlang/echo.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cb4679027681f9acc72297aa49e53e0ff60f26816ddf51cbdf097838b08a8b2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LanguageServerEngine.code_actions: MethodTooLong \u2014 code_actions runs 122 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"language-server/src/engine.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"793317f686d82038b08d9b63553aabef95d4d2d377edf31da8baa71926acabf2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/config.rs: FileTooLong \u2014 607 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 107 over it, 1.21\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/config.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"046ec2d9355afc2c5c62afcf0439335a645370f66ac05d990f56894f4a9fe71f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/publish.rs: FileTooLong \u2014 606 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 106 over it, 1.21\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-cli/src/publish.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac69175042367f6f00d886380bbe14c00edeb4474c3dace31f30a5d0de8fa38b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ModuleAnalyzer.do_analyse_custom_type: MethodTooLong \u2014 do_analyse_custom_type runs 120 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 20 over it, 1.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/analyse.rs"},"region":{"startLine":967}}}],"partialFingerprints":{"codehealthFindingId/v1":"08ba9138f92fd969797b4e175765cdca46f8e0162013e60468a3b8f7cfb85aec"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ExprTyper.infer_or_error: MethodTooLong \u2014 infer_or_error runs 120 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 20 over it, 1.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/type_/expression.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"30f341637dc50dce205a6e642c4ede4ec11d60b5fd549e08c532f0fa6dd20b33"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: docs/printer.rs: FileTooLong \u2014 596 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 94% of them inside a single declaration: Printer (2 blocks, 44-874). The bar is 500 significant lines; this is 96 over it, 1.19\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/docs/printer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bca2d2648240f222beec08f55d178ba47e27d1a6077ea1e73659f6c0ca51b9d0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ModuleInterface.from_interface: MethodTooLong \u2014 from_interface runs 117 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 17 over it, 1.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/package_interface.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"133b581114789d5fc2cfd0dc12e933090dc4b0272ef150de1545f9d848b11032"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: gleam_cli::cli: TooManyFunctions \u2014 35 free functions. The bar is 30 free functions; this is 5 over it, 1.17\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-cli/src/cli.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8cce5c66ec20842eb6e6c74e22166041b3ebc58cfb7ca32cf874589caccb37d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Generator.compile: MethodTooLong \u2014 compile runs 115 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 15 over it, 1.15\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/javascript.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"feffc5a711b2e4f41980bc3a9b84ef91204b088f594e9dddda8186dd6db526f0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 571 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 71 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":"compiler-cli/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac912d9e4bd1e465d1df520da86906a6e627109bd8973be270396475cee49678"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gleam_cli::publish::do_build_hex_tarball: FunctionTooLong \u2014 gleam_cli::publish::do_build_hex_tarball runs 114 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 14 over it, 1.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-cli/src/publish.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bb83a1b58c9863f884a6b9f39e13b05062d59905de30f06e95a1da0550dcea9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Type: 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":"compiler-core/src/type_.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"391eff3c5bd2db709234f675f6ed45820a9f8d6690741e7661299ef68c971deb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Generator.guard_expression: MethodTooLong \u2014 guard_expression runs 113 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/javascript/expression.rs"},"region":{"startLine":3080}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb341a92008f11a9d8df98f3fcfdac8bd6da5181c16e70c0c39cada6233d1a58"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/server.rs: FileTooLong \u2014 556 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 64% of them inside a single declaration: LanguageServer (2 blocks, 44-543). The bar is 500 significant lines; this is 56 over it, 1.11\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"language-server/src/server.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9029d211b1a1c18e59ff602223b2dd3293988a57f177e5f70305fa4c56b63d36"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: LanguageServer: 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":"language-server/src/server.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f70cf2c52fc1f6f8f9d89e3ba6066b33512b64bb4538d5258704560b1e91fa1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/metadata.rs: FileTooLong \u2014 548 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 97% of them inside a single declaration: RemapIds (2 blocks, 40-670). The bar is 500 significant lines; this is 48 over it, 1.10\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/metadata.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd57b7ce67f2518f60aacd48893296ffb4b5cf01f74dfd847e85e56f0b3638d9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gleam_core::erlang::echo::inspect_list_loop: FunctionTooLong \u2014 gleam_core::erlang::echo::inspect_list_loop runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/erlang/echo.rs"},"region":{"startLine":1157}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d2b63cb0b92ddb61faa6ce7da813a22f9447ff31950a5a446b24239e148f5a6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Formatter.expr: MethodTooLong \u2014 expr runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"format/src/lib.rs"},"region":{"startLine":1268}}}],"partialFingerprints":{"codehealthFindingId/v1":"043c89b1712cf57b825b06245c3aa2f3e257510802f5f08dedf8c831b9d51a28"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LanguageServerEngine.completion: MethodTooLong \u2014 completion runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"language-server/src/engine.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"5939d4c8460257ac45c660241ee03e7ba38746d5e9d367236d4f44b6d8ed1863"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypedExpr.find_statement: MethodTooLong \u2014 find_statement runs 108 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/ast/typed.rs"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"4850dfa2da9d00fa9fd5c2e5a9bb9dd55132d957efd1c6a9cd832ac92ae23f83"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Generator.expression: MethodTooLong \u2014 expression runs 107 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/javascript/expression.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd7d586b49d51caa759de8d6ea9b20df5eb1fd2b9289304362a8edec72628e75"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Formatter.const_expr: MethodTooLong \u2014 const_expr runs 107 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"format/src/lib.rs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4bb6b82e7e69931bbcd67f34eee1ac55d5b443fc22bfd0aa04695d019feecf4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gleam_core::type_::expression::invalid_constant_with_annotated_type: FunctionTooLong \u2014 gleam_core::type_::expression::invalid_constant_with_annotated_type runs 106 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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-core/src/type_/expression.rs"},"region":{"startLine":4502}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb0119ddf70deabfc0b7fdb69bfe68dc6f21fb2f99261e7e25a45c6b97764eeb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: UntypedConstantFolder.walk_constant: MethodTooLong \u2014 walk_constant runs 105 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/ast_folder.rs"},"region":{"startLine":1227}}}],"partialFingerprints":{"codehealthFindingId/v1":"25f3080b94549c24f06fb52a21684e862e3cdd1f63170aa137673849bbe5cdbc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Formatter.definition: MethodTooLong \u2014 definition runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"format/src/lib.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b4589e458ceae1388839abef4ac0dfac62b43a8f593f79bab2c1e1c978ffe43"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/docs.rs: FileTooLong \u2014 501 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 1 over it, 1.00\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-core/src/docs.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c533a965bbcc8936bed8ec276275c5a43945cf147a74bb2e4fcd0b11d6e6dd89"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (6 members, 19 shared lines): compiler-core/src/ast/typed.rs:931-964 | compiler-core/src/ast/typed.rs:1253-1293 | compiler-core/src/ast/typed.rs:1298-1338 | compiler-core/src/ast/typed.rs:1343-1382 | compiler-core/src/ast/typed.rs:1388-1423 | compiler-core/src/javascript/expression.rs:1477-1532 \u2014 These 6 members are variants of one another: a block of 19 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/ast/typed.rs"},"region":{"startLine":931}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1c1cd2fab6492b88374d9cc0c4d7bd914cad25ce720b0148a55d569a8ef1707"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (5 members, 23 shared lines): compiler-core/src/ast/typed.rs:1253-1293 | compiler-core/src/ast/typed.rs:1298-1338 | compiler-core/src/javascript/expression.rs:2287-2376 | language-server/src/code_action.rs:7627-7671 | language-server/src/engine.rs:2426-2473 \u2014 These 5 members are variants of one another: a block of 23 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/ast/typed.rs"},"region":{"startLine":1253}}}],"partialFingerprints":{"codehealthFindingId/v1":"f63d84338229e21d50e8b9e57452f3cff0a55b6fe2d45348f28cc322a795add9"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (5 members, 20 shared lines): compiler-core/src/ast/typed.rs:1253-1293 | compiler-core/src/ast/typed.rs:1298-1338 | compiler-core/src/ast/typed.rs:1343-1382 | compiler-core/src/ast/typed.rs:1388-1423 | language-server/src/engine.rs:2426-2473 \u2014 These 5 members are variants of one another: a block of 20 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/ast/typed.rs"},"region":{"startLine":1253}}}],"partialFingerprints":{"codehealthFindingId/v1":"93017f1bf60b2ce51022586b38d9bbbac76f75f3fbd811999167fb13be2e9495"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (76 shared lines): format/src/lib.rs:698-806 | format/src/lib.rs:2753-2872 \u2014 These two members are variants of one another: 76 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":"format/src/lib.rs"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"226670d6f67f8febae59987695b959274ad1e592b9688124f3392993053396e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (44 shared lines): compiler-core/src/erlang.rs:2849-2919 | compiler-core/src/erlang.rs:2928-3002 \u2014 These two members are variants of one another: 44 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-core/src/erlang.rs"},"region":{"startLine":2849}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3209c789d845803e348ba12f129c7e51633246c4a04529bfc1a895bffb5d924"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): pretty-arena/src/lib.rs:1188-1379 | pretty-arena/src/lib.rs:1385-1541 \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":"pretty-arena/src/lib.rs"},"region":{"startLine":1188}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bdd2eded162a307e2d71e0ed1b4e2c9065d3a9694d27c9e3375c57c7e1c5c98"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (11 members, 50\u002B identical tokens): compiler-core/src/ast.rs:1952-1976 | compiler-core/src/ast/untyped.rs:251-279 | compiler-core/src/type_/expression.rs:3576-3635 | compiler-core/src/type_/pipe.rs:84-236 | compiler-core/src/type_/pipe.rs:408-436 | format/src/lib.rs:1973-2020 | format/src/lib.rs:2581-2607 | format/src/lib.rs:2976-3019 | format/src/lib.rs:3375-3409 | format/src/lib.rs:3415-3447 | format/src/lib.rs:3585-3613 \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":"compiler-core/src/ast.rs"},"region":{"startLine":1952}}}],"partialFingerprints":{"codehealthFindingId/v1":"88a7656dd4a6796b4b90e5ba1836aa42b6aee92fb4860f27b7b32700e086c05e"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (7 members, 50\u002B identical tokens): compiler-core/src/ast.rs:1551-1575 | compiler-core/src/erlang.rs:2437-2619 | compiler-core/src/error.rs:5484-5530 | compiler-core/src/javascript/expression.rs:1305-1471 | compiler-core/src/javascript/expression.rs:2676-2868 | compiler-core/src/javascript/expression.rs:3847-3872 | compiler-core/src/type_/constant.rs:45-557 \u2014 These 7 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 7 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 7 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/ast.rs"},"region":{"startLine":1551}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a0db5caded5bd7d32bd5bd784329576ecd21b4b4faee815e1d7c38d5357b2aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (7 members, 50\u002B identical tokens): hexpm/src/lib.rs:482-492 | hexpm/src/lib.rs:519-529 | hexpm/src/lib.rs:600-611 | hexpm/src/lib.rs:660-670 | hexpm/src/lib.rs:695-705 | hexpm/src/lib.rs:726-736 | hexpm/src/lib.rs:1226-1237 \u2014 These 7 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 7 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 7 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hexpm/src/lib.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ef844dcc8f9086813c640a1f3fce78a36571280cb10691079fb2a68beafb799"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): compiler-core/src/parse.rs:4254-4345 | compiler-core/src/parse.rs:4348-4431 | compiler-core/src/parse.rs:4945-5023 | compiler-core/src/parse.rs:5025-5103 | compiler-core/src/parse/token.rs:193-272 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/parse.rs"},"region":{"startLine":4254}}}],"partialFingerprints":{"codehealthFindingId/v1":"f86c4e5915c50cf32ac65cc7fbfe9db2dddec99842bc94dfd4c1de6794fa9c7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): compiler-cli/src/docs.rs:24-45 | compiler-cli/src/owner.rs:11-30 | compiler-cli/src/owner.rs:32-62 | compiler-cli/src/publish.rs:30-143 \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-cli/src/docs.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e187cc536e7155d33f4c9d706692908d917b897f2f28a0c0efe42315d67ea33"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): compiler-core/src/ast/typed.rs:695-722 | compiler-core/src/ast/typed.rs:724-751 | compiler-core/src/ast/untyped.rs:191-215 | compiler-core/src/ast/untyped.rs:217-241 \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-core/src/ast/typed.rs"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9ab393d6e0080622662d1b043b73b4f417c72c596b26295a5d15776af070565"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): compiler-core/src/erlang.rs:1331-1422 | compiler-core/src/erlang.rs:1883-1915 | compiler-core/src/erlang.rs:1925-1951 | compiler-core/src/erlang.rs:1960-1988 \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-core/src/erlang.rs"},"region":{"startLine":1331}}}],"partialFingerprints":{"codehealthFindingId/v1":"a333ffc4216694b4a9d771212f978db0a1aabc2a6807851390c2971026373428"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): compiler-core/src/parse.rs:2129-2179 | compiler-core/src/parse.rs:2498-2585 | compiler-core/src/parse.rs:3812-3868 | compiler-core/src/parse.rs:3872-3940 \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-core/src/parse.rs"},"region":{"startLine":2129}}}],"partialFingerprints":{"codehealthFindingId/v1":"164205df4f48e441f47997b05ebb77db99e7542bbacfe726eab445f7ebd64714"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201336 lines \u00D7 2): compiler-core/src/erlang.rs:2860-2883 | compiler-core/src/erlang.rs:2939-2974 \u2014 both copies are in the same file, so extract the block 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-core/src/erlang.rs"},"region":{"startLine":2860}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccda9a1d670b4dfe02c290f470e53db85615e2500b6acccdf90d3a0cb4bf74c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (36 lines \u00D7 2): language-server/src/completer.rs:812-847 | language-server/src/completer.rs:1084-1119 \u2014 both copies are in the same file, so extract the block 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":"language-server/src/completer.rs"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c47f859d20b1494d3384caccb3846eda5e9877647ef72327c0f4854ffb2ca61"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 5): compiler-core/src/parse.rs:4308-4340 | compiler-core/src/parse.rs:4394-4426 | compiler-core/src/parse.rs:4988-5020 | compiler-core/src/parse.rs:5068-5100 | compiler-core/src/parse/error.rs:555-587 \u2014 there are 5 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 5 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/parse.rs"},"region":{"startLine":4308}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e0aaeb44d26e4b84ec6af0a4142fe048d1e4ca22b278b3c4e728f53824bc33e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29\u201333 lines \u00D7 2): format/src/lib.rs:740-768 | format/src/lib.rs:2802-2834 \u2014 both copies are in the same file, so extract the block 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":"format/src/lib.rs"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa120897f771983ddff264d8040895fd980f431e0d41a89de88ed3a0860f3589"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30\u201331 lines \u00D7 5): compiler-core/src/parse.rs:4289-4319 | compiler-core/src/parse.rs:4375-4405 | compiler-core/src/parse.rs:5049-5079 | compiler-core/src/parse/error.rs:536-566 | compiler-core/src/parse/token.rs:240-269 \u2014 before extracting anything, compare \u0060compiler-core/src/parse.rs\u0060 and \u0060compiler-core/src/parse/token.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 63 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-core/src/parse.rs"},"region":{"startLine":4289}}}],"partialFingerprints":{"codehealthFindingId/v1":"382d3b573b70830872d7c91068715e48cb994fd94b41bd3fbd9a18d4b3032d59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): compiler-core/src/ast.rs:1882-1908 | compiler-core/src/ast.rs:1922-1948 \u2014 both copies are in the same file, so extract the block 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-core/src/ast.rs"},"region":{"startLine":1882}}}],"partialFingerprints":{"codehealthFindingId/v1":"842e2fa71a44f02e95ff7d92a7d7ed68e2b29c0d92e0eec32f27f0775a908d91"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): compiler-core/src/erlang/echo.rs:1510-1534 | compiler-core/src/erlang/echo.rs:1580-1604 \u2014 both copies are in the same file, so extract the block 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-core/src/erlang/echo.rs"},"region":{"startLine":1510}}}],"partialFingerprints":{"codehealthFindingId/v1":"08adf61d46685beacb6cfffac28905a4e35ca48c400ab0db2caaa9f21939f989"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): compiler-core/src/javascript/expression.rs:710-734 | compiler-core/src/javascript/expression.rs:3008-3032 \u2014 both copies are in the same file, so extract the block 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-core/src/javascript/expression.rs"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8324570cac236335ef34df0630c5a6781a66da0e3ea989ee118c2913f839fa1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): compiler-core/src/javascript/expression.rs:754-778 | compiler-core/src/javascript/expression.rs:3054-3078 \u2014 both copies are in the same file, so extract the block 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-core/src/javascript/expression.rs"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c65ca9173d12a9978d7452b44211d3ebc16f6b08f88e16720b18a5d74970417"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): compiler-core/src/javascript/typescript.rs:791-815 | compiler-core/src/javascript/typescript.rs:822-846 \u2014 both copies are in the same file, so extract the block 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-core/src/javascript/typescript.rs"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"d06da60b24e97998a2ff3c888abd53727aa4cd13a7dc42c5e781c9c2c0c66c05"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): compiler-core/src/ast/typed.rs:699-722 | compiler-core/src/ast/typed.rs:728-751 \u2014 both copies are in the same file, so extract the block 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-core/src/ast/typed.rs"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2ecc8c7d1b0c458c47fa64183c7472ee2f163799101013425cbdd1e09e2168e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): compiler-core/src/type_/expression.rs:4287-4309 | compiler-core/src/type_/pattern.rs:1526-1548 \u2014 before extracting anything, compare \u0060compiler-core/src/type_/expression.rs\u0060 and \u0060compiler-core/src/type_/pattern.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 125 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-core/src/type_/expression.rs"},"region":{"startLine":4287}}}],"partialFingerprints":{"codehealthFindingId/v1":"d98dd30d43a09e3859b5b0a0255517756be0350e7513102ec6b04a6c4eff2f33"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): format/src/lib.rs:770-792 | format/src/lib.rs:2836-2858 \u2014 both copies are in the same file, so extract the block 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":"format/src/lib.rs"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"045b43b8a171d5f3c64dd7bc3f6da20fbca5c9d6f3319a8e8850ed0c92848af1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): compiler-core/src/parse/lexer.rs:860-881 | compiler-core/src/parse/lexer.rs:930-951 \u2014 both copies are in the same file, so extract the block 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-core/src/parse/lexer.rs"},"region":{"startLine":860}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0d0d0932cfa41ec916f20f8a45a807e3434e829a6a0c2bac80b2b746aa9c314"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 3): compiler-core/src/analyse.rs:1731-1751 | compiler-core/src/type_/expression.rs:4292-4312 | compiler-core/src/type_/pattern.rs:1531-1551 \u2014 before extracting anything, compare \u0060compiler-core/src/type_/expression.rs\u0060 and \u0060compiler-core/src/type_/pattern.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 125 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-core/src/analyse.rs"},"region":{"startLine":1731}}}],"partialFingerprints":{"codehealthFindingId/v1":"44a97974af2774cad3c2773f031a37237d21b4be896329f50d90ead94a8fef56"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): compiler-core/src/ast/visit.rs:1998-2018 | compiler-core/src/ast/visit.rs:2284-2304 \u2014 both copies are in the same file, so extract the block 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-core/src/ast/visit.rs"},"region":{"startLine":1998}}}],"partialFingerprints":{"codehealthFindingId/v1":"8600576d7f6138704d599e794d4c80de308900b3840fd45951f286224d0011a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201321 lines \u00D7 2): compiler-core/src/erlang.rs:1772-1790 | compiler-core/src/erlang.rs:1841-1861 \u2014 both copies are in the same file, so extract the block 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-core/src/erlang.rs"},"region":{"startLine":1772}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5896f457b8e7f7bdc9be4d8f3070bf6c13ffc4779da3ce1d9a210cba3ec1372"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201320 lines \u00D7 2): compiler-core/src/parse.rs:672-689 | compiler-core/src/parse.rs:3534-3553 \u2014 both copies are in the same file, so extract the block 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-core/src/parse.rs"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e6277dd29090dac1ad1363d0ed028b0363e096edb5020a2df8947f9f1d51c92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): compiler-core/src/type_/pretty.rs:140-159 | compiler-core/src/type_/printer.rs:579-598 \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-core/src/type_/pretty.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"bce5de1b088c691325da17f73310c20b26c4b2267c146bf243bce7c685016997"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): format/src/lib.rs:1946-1965 | format/src/lib.rs:2001-2020 \u2014 both copies are in the same file, so extract the block 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":"format/src/lib.rs"},"region":{"startLine":1946}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fe3f4e5a18c48275610343565a78396e132a5ce91753ad2b36d81e0817308fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201320 lines \u00D7 2): language-server/src/code_action.rs:3705-3724 | language-server/src/code_action.rs:12648-12665 \u2014 both copies are in the same file, so extract the block 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":"language-server/src/code_action.rs"},"region":{"startLine":3705}}}],"partialFingerprints":{"codehealthFindingId/v1":"64b35cfcd06d3abc4be27e5c712fce0e30c1ef8d2bececdf870dcae4e5db325a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201319 lines \u00D7 6): compiler-core/src/ast.rs:1554-1572 | compiler-core/src/erlang.rs:2589-2605 | compiler-core/src/error.rs:5510-5527 | compiler-core/src/javascript/expression.rs:1349-1367 | compiler-core/src/javascript/expression.rs:2830-2846 | compiler-core/src/type_/constant.rs:472-488 \u2014 before extracting anything, compare \u0060compiler-core/src/ast.rs\u0060 and \u0060compiler-core/src/erlang.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 91 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-core/src/ast.rs"},"region":{"startLine":1554}}}],"partialFingerprints":{"codehealthFindingId/v1":"67a44042d6889399aad89791d81aacc0f80e0d8406730edd7fb630a186ecda2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 3): compiler-core/src/parse.rs:4270-4288 | compiler-core/src/parse.rs:4356-4374 | compiler-core/src/parse/token.rs:222-239 \u2014 before extracting anything, compare \u0060compiler-core/src/parse.rs\u0060 and \u0060compiler-core/src/parse/token.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 63 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-core/src/parse.rs"},"region":{"startLine":4270}}}],"partialFingerprints":{"codehealthFindingId/v1":"85e49af9c59cdfbb9c480cd9336fc778f269cd942f06594246cd12f7b60e114c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): format/src/lib.rs:2426-2444 | format/src/lib.rs:2462-2480 \u2014 both copies are in the same file, so extract the block 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":"format/src/lib.rs"},"region":{"startLine":2426}}}],"partialFingerprints":{"codehealthFindingId/v1":"e267eea43019379ecd235294ccfdce8c5d3106ba8897353c02095ae6200ecfe8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3): format/src/lib.rs:4240-4257 | format/src/lib.rs:4262-4279 | format/src/lib.rs:4284-4301 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"format/src/lib.rs"},"region":{"startLine":4240}}}],"partialFingerprints":{"codehealthFindingId/v1":"47be392d59a3a397dbaabbc20e65a74a48c6de3528b46b4d5f2d1ec651379c10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): compiler-cli/src/docs.rs:70-87 | compiler-cli/src/docs.rs:196-213 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-cli/src/docs.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aa88258aa043325d2411c3d6445168359828597fa2fdaf5e8d87ab15f452316"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201318 lines \u00D7 2): compiler-core/src/ast/typed.rs:1356-1371 | compiler-core/src/ast/typed.rs:1395-1412 \u2014 both copies are in the same file, so extract the block 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-core/src/ast/typed.rs"},"region":{"startLine":1356}}}],"partialFingerprints":{"codehealthFindingId/v1":"706750ca942729e24cc8e48a153a3089e8f4bb80cca7b123a857944bc04551f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): compiler-core/src/warning.rs:296-313 | compiler-core/src/warning.rs:321-337 \u2014 both copies are in the same file, so extract the block 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-core/src/warning.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"926cdd8aa03c0504e837f75b590dbba79d265047fa5268d5685c7f3fc0867b96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): format/src/lib.rs:820-837 | format/src/lib.rs:1642-1659 \u2014 both copies are in the same file, so extract the block 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":"format/src/lib.rs"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ce75c3fc43487ad6d52ee74e118773cd599d73c7f8de14c2cca5b791173a729"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): language-server/src/code_action.rs:538-555 | language-server/src/code_action.rs:1431-1447 \u2014 both copies are in the same file, so extract the block 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":"language-server/src/code_action.rs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"58189c8c64ca57fe8b387338e9585b123b4d86926744a5b7cd592247ead206f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): pretty-arena/src/lib.rs:1302-1319 | pretty-arena/src/lib.rs:1519-1536 \u2014 both copies are in the same file, so extract the block 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":"pretty-arena/src/lib.rs"},"region":{"startLine":1302}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e86b51b6ea2c7f03152e3d98ca93ab78698943f2f11835108cd9f98d79ced44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): compiler-core/src/analyse/imports.rs:238-254 | compiler-core/src/analyse/imports.rs:260-276 \u2014 both copies are in the same file, so extract the block 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-core/src/analyse/imports.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"c057166a64e54e09e61391de60373e9ae0f69e303f687bf23d314598a6898d45"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): compiler-core/src/warning.rs:628-644 | compiler-core/src/warning.rs:658-674 \u2014 both copies are in the same file, so extract the block 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-core/src/warning.rs"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"17d3ed3aae29bdf00d2f02819d65d74352309beef5d3c44e88a1cb5cad6abef0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 5): compiler-core/src/erlang.rs:2586-2601 | compiler-core/src/error.rs:5507-5522 | compiler-core/src/javascript/expression.rs:2827-2842 | compiler-core/src/javascript/expression.rs:3849-3864 | compiler-core/src/type_/constant.rs:469-484 \u2014 before extracting anything, compare \u0060compiler-core/src/erlang.rs\u0060 and \u0060compiler-core/src/javascript/expression.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 104 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-core/src/erlang.rs"},"region":{"startLine":2586}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e1c443ebdf57f60943b3103f50b8a8504e66d3471b1d7d4b54971a404a5a2b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): compiler-core/src/erlang.rs:1587-1602 | compiler-core/src/erlang.rs:1643-1658 | compiler-core/src/erlang.rs:1695-1710 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/erlang.rs"},"region":{"startLine":1587}}}],"partialFingerprints":{"codehealthFindingId/v1":"49bae81a1a1e9ca52fda21df1164f3a15b331095f6789df20af8ed47222d3e7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): compiler-core/src/docs/printer.rs:586-601 | compiler-core/src/type_/printer.rs:561-576 \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":"compiler-core/src/docs/printer.rs"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"b80991b74653e528700f381b124bbffcf0f9e6116457b840c9b6f8ddf4b434b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): compiler-core/src/erlang.rs:1671-1686 | compiler-core/src/javascript/expression.rs:1412-1427 \u2014 before extracting anything, compare \u0060compiler-core/src/erlang.rs\u0060 and \u0060compiler-core/src/javascript/expression.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 104 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-core/src/erlang.rs"},"region":{"startLine":1671}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3781acf079bffed47b38b681c5c261caae3ae68d7334c16e227d098cf58d2d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): compiler-core/src/erlang.rs:1900-1915 | compiler-core/src/erlang.rs:1936-1951 \u2014 both copies are in the same file, so extract the block 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-core/src/erlang.rs"},"region":{"startLine":1900}}}],"partialFingerprints":{"codehealthFindingId/v1":"29639fa7757c0f51ec75b077e899346c2d58c18b4699cae5cc56940345492e60"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): compiler-core/src/reference.rs:492-507 | compiler-core/src/reference.rs:526-541 \u2014 both copies are in the same file, so extract the block 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-core/src/reference.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"463ea18399d120f1f3e3ec14c686ce0f190867dd6546216ea9e816496415b82d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): format/src/lib.rs:722-735 | format/src/lib.rs:2782-2797 \u2014 both copies are in the same file, so extract the block 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":"format/src/lib.rs"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"745765ab3fb76b034b9f4a7749c5fafa3d051366ed1af392b4e4d61e54357235"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): language-server/src/code_action.rs:2556-2571 | language-server/src/code_action.rs:2593-2608 \u2014 both copies are in the same file, so extract the block 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":"language-server/src/code_action.rs"},"region":{"startLine":2556}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a22f9e1eddd1ac57bb358bfd5e90d78b58decc6b1bd983f2aa146e02e59a549"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 7): compiler-core/src/ast/typed.rs:1496-1510 | compiler-core/src/ast/typed.rs:1872-1886 | compiler-core/src/type_/expression.rs:2735-2749 | compiler-core/src/type_/expression.rs:3545-3559 | language-server/src/completer.rs:1228-1242 | language-server/src/engine.rs:2455-2469 | language-server/src/signature_help.rs:85-99 \u2014 before extracting anything, compare \u0060compiler-core/src/ast/typed.rs\u0060 and \u0060compiler-core/src/type_/expression.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 123 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-core/src/ast/typed.rs"},"region":{"startLine":1496}}}],"partialFingerprints":{"codehealthFindingId/v1":"75c82550efe46c7888cff1b3dcd0ab06888cc24c94a19afc37b9c489359fb2e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): compiler-core/src/erlang/echo.rs:1082-1096 | compiler-core/src/erlang/echo.rs:1103-1117 \u2014 both copies are in the same file, so extract the block 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-core/src/erlang/echo.rs"},"region":{"startLine":1082}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bc7e29ed2c672a0b08813644645ea65a6554da12e3f76a134a36dee8b5aaf1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): compiler-core/src/erlang/echo.rs:1536-1550 | compiler-core/src/erlang/echo.rs:1606-1620 \u2014 both copies are in the same file, so extract the block 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-core/src/erlang/echo.rs"},"region":{"startLine":1536}}}],"partialFingerprints":{"codehealthFindingId/v1":"18cc04c720b01b0665a7c2c4b1ffbe9d3242ec680af2575f4db8c24db50cfdea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): compiler-core/src/parse.rs:447-461 | compiler-core/src/parse.rs:3388-3402 \u2014 both copies are in the same file, so extract the block 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-core/src/parse.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"29c1299f6cfdb365749337afe619600ea0ac54093ce0c5ec8dc33d6c64578d92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): compiler-core/src/parse.rs:1410-1424 | compiler-core/src/parse.rs:1467-1481 \u2014 both copies are in the same file, so extract the block 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-core/src/parse.rs"},"region":{"startLine":1410}}}],"partialFingerprints":{"codehealthFindingId/v1":"01d70a1ef5d9db13d94f5e395c345146cb44fef479bb9edd5424396161eacb83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): compiler-core/src/reference.rs:651-665 | compiler-core/src/reference.rs:684-698 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/reference.rs"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"d17d976d15cd7af1b3ad34520fe3a30a31fa479c98cb953cd6ea5624f195fb0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): format/src/lib.rs:3740-3754 | format/src/lib.rs:3775-3789 \u2014 both copies are in the same file, so extract the block 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":"format/src/lib.rs"},"region":{"startLine":3740}}}],"partialFingerprints":{"codehealthFindingId/v1":"b389df3559083be292fb6144c832eb0b06f553986345572678ef121d578260b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 6): compiler-core/src/erlang/echo.rs:1345-1358 | compiler-core/src/erlang/echo.rs:1375-1388 | compiler-core/src/erlang/echo.rs:1402-1414 | compiler-core/src/erlang/echo.rs:1423-1435 | compiler-core/src/erlang/echo.rs:1449-1461 | compiler-core/src/erlang/echo.rs:1479-1492 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/erlang/echo.rs"},"region":{"startLine":1345}}}],"partialFingerprints":{"codehealthFindingId/v1":"4df6b126c166e74537c68bdb36d27ebf97e440dc0c5646f094fd474b10e04d10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 5): compiler-core/src/erlang/echo.rs:1350-1363 | compiler-core/src/erlang/echo.rs:1454-1466 | compiler-core/src/erlang/echo.rs:1484-1497 | compiler-core/src/erlang/echo.rs:1554-1567 | compiler-core/src/erlang/echo.rs:1596-1609 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/erlang/echo.rs"},"region":{"startLine":1350}}}],"partialFingerprints":{"codehealthFindingId/v1":"44b91e1a803180bbeb88e9626b84bf3f8d0e3729bf6da15dfb973e4d32eefe2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): compiler-core/src/erlang/echo.rs:1504-1517 | compiler-core/src/erlang/echo.rs:1574-1587 | compiler-core/src/erlang/echo.rs:1616-1629 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/erlang/echo.rs"},"region":{"startLine":1504}}}],"partialFingerprints":{"codehealthFindingId/v1":"007ed61e669caf932a6a63504db62db9ad3d3fc89ddc71e7f9ecd481b2e4f153"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): compiler-core/src/call_graph.rs:52-65 | compiler-core/src/call_graph.rs:74-87 \u2014 both copies are in the same file, so extract the block 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-core/src/call_graph.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbaca02e938998781d9710d89438e4c9863fe59d89f3c360dac9fdb9eb1cf732"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): compiler-core/src/exhaustiveness/printer.rs:87-98 | compiler-core/src/type_/printer.rs:485-498 \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":"compiler-core/src/exhaustiveness/printer.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"25205581ad13a15e0fef102e3826a1cd16b1d3c68cba5b22baf46481b01184a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): compiler-core/src/type_/expression.rs:1810-1822 | compiler-core/src/type_/expression.rs:3654-3667 \u2014 both copies are in the same file, so extract the block 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-core/src/type_/expression.rs"},"region":{"startLine":1810}}}],"partialFingerprints":{"codehealthFindingId/v1":"f73d31154e9f2643b2da2645dbb47ddc689bdb7b8ca0676f67fdd65b86e061b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): erlang-generation/src/lib.rs:1893-1906 | erlang-generation/src/lib.rs:1921-1934 \u2014 both copies are in the same file, so extract the block 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":"erlang-generation/src/lib.rs"},"region":{"startLine":1893}}}],"partialFingerprints":{"codehealthFindingId/v1":"60de03a062af8b60a0bbfe0b09a2b83c4d2180002aa4d96989b112823f70e7b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): language-server/src/code_action.rs:4132-4145 | language-server/src/code_action.rs:4342-4355 \u2014 both copies are in the same file, so extract the block 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":"language-server/src/code_action.rs"},"region":{"startLine":4132}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0b70992ed1f329d729677f9b613aac7b36c7a5da7ce03e35b74e5b669f325d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): compiler-core/src/parse.rs:4969-4981 | compiler-core/src/parse.rs:5032-5044 | compiler-core/src/parse/token.rs:218-230 \u2014 before extracting anything, compare \u0060compiler-core/src/parse.rs\u0060 and \u0060compiler-core/src/parse/token.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 63 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-core/src/parse.rs"},"region":{"startLine":4969}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f76b3c5639a82748d944c96fee6512f442f2b0ae922f75c9abf6f7744de37ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): compiler-cli/src/text_layout.rs:40-52 | compiler-cli/src/text_layout.rs:71-83 \u2014 both copies are in the same file, so extract the block 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-cli/src/text_layout.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"81af6b06f7d86d2706db89c56128b668b77f712dbc8f469820d2ad8c0dca2f25"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): compiler-core/src/ast/untyped.rs:264-276 | compiler-core/src/type_/expression.rs:3615-3627 \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":"compiler-core/src/ast/untyped.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"84e3e2b3fee8d7ad6daaf20765a6cfb6402b8924b14ec3feb16d9729a34aa790"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): compiler-core/src/ast_folder.rs:456-468 | compiler-core/src/ast_folder.rs:584-596 \u2014 both copies are in the same file, so extract the block 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-core/src/ast_folder.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"63de3b5801cdd74077d9831a72143dcafd38c42dd228aecfda3fabb6f5a6a0c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): compiler-core/src/build/native_file_copier.rs:226-238 | compiler-core/src/build/native_file_copier.rs:274-286 \u2014 both copies are in the same file, so extract the block 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-core/src/build/native_file_copier.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"002d4a1f60d6603de6bc90a723d6cd0ac0df88bf23d0fb4f1a49115a1f08e4c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): compiler-core/src/erlang.rs:2185-2197 | compiler-core/src/erlang.rs:2243-2255 \u2014 both copies are in the same file, so extract the block 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-core/src/erlang.rs"},"region":{"startLine":2185}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a7adf0f87330c13512943f41492ff3c8e4ac60864159ca93e219608b525f50f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): compiler-core/src/parse.rs:694-706 | compiler-core/src/parse.rs:3557-3569 \u2014 both copies are in the same file, so extract the block 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-core/src/parse.rs"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cdd4d2671308984fdb5e81e77f552e76f1530a04018c8b4b1e97a40301f150f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u201313 lines \u00D7 4): compiler-core/src/parse.rs:2130-2133 | compiler-core/src/parse.rs:2500-2510 | compiler-core/src/parse.rs:3815-3827 | compiler-core/src/parse.rs:3875-3877 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/parse.rs"},"region":{"startLine":2130}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ed9fb007785c7606f4d10f0c08f62014f9a268d5c9a5a7929dcf5485275206b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): compiler-core/src/warning.rs:814-826 | compiler-core/src/warning.rs:829-841 \u2014 both copies are in the same file, so extract the block 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-core/src/warning.rs"},"region":{"startLine":814}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ff51ff0ddfc6a364f16c5000c72cde8a0637983abbb5b028a49ee18b7c96166"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): compiler-core/src/warning.rs:1183-1195 | compiler-core/src/warning.rs:1223-1234 \u2014 both copies are in the same file, so extract the block 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-core/src/warning.rs"},"region":{"startLine":1183}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ad6759ed5c35c00c8c4a31dd369b78470d8da3dcd2d1b73e3bd23d06e17d4db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): erlang-generation/src/lib.rs:2151-2163 | erlang-generation/src/lib.rs:2175-2187 \u2014 both copies are in the same file, so extract the block 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":"erlang-generation/src/lib.rs"},"region":{"startLine":2151}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc38fb5071c25961a5ab64472ad53eba40c73b35add73433a42c690bf34f6f7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 5): compiler-core/src/parse/lexer.rs:231-242 | compiler-core/src/parse/lexer.rs:257-268 | compiler-core/src/parse/lexer.rs:288-299 | compiler-core/src/parse/lexer.rs:309-320 | compiler-core/src/parse/lexer.rs:382-393 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/parse/lexer.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"45504dd5c92d8088c934fea2c8565af0111bea04cfe690f0bf8f8ca1205d1aed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 4): compiler-core/src/erlang/echo.rs:1380-1391 | compiler-core/src/erlang/echo.rs:1407-1417 | compiler-core/src/erlang/echo.rs:1428-1438 | compiler-core/src/erlang/echo.rs:1526-1537 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/erlang/echo.rs"},"region":{"startLine":1380}}}],"partialFingerprints":{"codehealthFindingId/v1":"321524921599809d704f6a32e2dceed5ee41a54f71aae89d8816555a9d554301"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): format/src/lib.rs:1985-1996 | format/src/lib.rs:3387-3398 | format/src/lib.rs:3429-3440 | format/src/lib.rs:3595-3606 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"format/src/lib.rs"},"region":{"startLine":1985}}}],"partialFingerprints":{"codehealthFindingId/v1":"8429d8bca738ee3470c98906c6eee32f346720545560e8ecbb4d88e0a42b8364"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): compiler-core/src/erlang/echo.rs:1521-1532 | compiler-core/src/erlang/echo.rs:1591-1602 | compiler-core/src/erlang/echo.rs:1631-1642 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/erlang/echo.rs"},"region":{"startLine":1521}}}],"partialFingerprints":{"codehealthFindingId/v1":"3799086c992296f874dc1801e2d1a1d03b6b5ea26dc2a6bd4f520561c20a44c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): compiler-core/src/warning.rs:860-871 | compiler-core/src/warning.rs:893-904 | compiler-core/src/warning.rs:928-939 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/warning.rs"},"region":{"startLine":860}}}],"partialFingerprints":{"codehealthFindingId/v1":"b05fb9960fdd3544c3bbb5f8fb39b39e14495cab6e46419f8f3cd4fd64cff334"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): compiler-core/src/ast/typed.rs:754-765 | compiler-core/src/ast/typed.rs:783-794 \u2014 both copies are in the same file, so extract the block 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-core/src/ast/typed.rs"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"49338398ee02b4b3a9672bb24db22d94cbc773e2f4582bd1ce030406326db374"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): compiler-core/src/erlang.rs:2908-2919 | compiler-core/src/erlang.rs:2991-3002 \u2014 both copies are in the same file, so extract the block 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-core/src/erlang.rs"},"region":{"startLine":2908}}}],"partialFingerprints":{"codehealthFindingId/v1":"65fa8220b624b55163031ccc3a0a03ced75866f65e872a4b5859a4fba7846f93"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): compiler-core/src/erlang/echo.rs:395-409 | compiler-core/src/erlang/echo.rs:832-843 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/erlang/echo.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e0fcc2066ca61b01d8066d9fc7f23ecad7f64a51b281222b13de5d5aedfaf61"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): compiler-core/src/erlang/echo.rs:558-567 | compiler-core/src/erlang/echo.rs:750-761 \u2014 both copies are in the same file, so extract the block 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-core/src/erlang/echo.rs"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"5abbc3dba40b477d3bb972c149fd1a296e38da77cb65849fe7b4c4c65db33845"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): compiler-core/src/erlang/echo.rs:1360-1371 | compiler-core/src/erlang/echo.rs:1390-1401 \u2014 both copies are in the same file, so extract the block 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-core/src/erlang/echo.rs"},"region":{"startLine":1360}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cd34516a6607cb6e108970d1c535b6576f63fd047d9b460c64d861a1b4b3ccd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): compiler-core/src/erlang/echo.rs:1693-1704 | compiler-core/src/erlang/echo.rs:1719-1730 \u2014 both copies are in the same file, so extract the block 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-core/src/erlang/echo.rs"},"region":{"startLine":1693}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6817952079d4fb12e0bb65c9b5e10551cde4b4cdbfe57550710b105a73c9064"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): format/src/lib.rs:705-714 | format/src/lib.rs:2762-2773 \u2014 both copies are in the same file, so extract the block 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":"format/src/lib.rs"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ca68a6622cabcb522a936c0a5cf3dc5eab2662e263f43ba52d6407487ecd2f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): format/src/lib.rs:2191-2201 | format/src/lib.rs:2209-2220 \u2014 both copies are in the same file, so extract the block 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":"format/src/lib.rs"},"region":{"startLine":2191}}}],"partialFingerprints":{"codehealthFindingId/v1":"bad106ede3f1ee81bea608a34f5b080d0aa4a762fed05e0bee7631f9f5579cc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): hexpm/src/lib.rs:367-378 | hexpm/src/lib.rs:447-457 \u2014 both copies are in the same file, so extract the block 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":"hexpm/src/lib.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"842d6439e1314c7eb3c8ff6b6dea6a2e5aa3c986538542b6daf9075db10d638b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): hexpm/src/version.rs:91-102 | hexpm/src/version.rs:108-119 \u2014 both copies are in the same file, so extract the block 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":"hexpm/src/version.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"c15edff3402c41bdd746fc2b3ac12b47394ffee12615b906673b2442fedd9ab1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): compiler-core/src/ast.rs:1959-1969 | compiler-core/src/type_/pipe.rs:419-429 | format/src/lib.rs:3002-3012 \u2014 before extracting anything, compare \u0060compiler-core/src/ast.rs\u0060 and \u0060compiler-core/src/type_/pipe.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 57 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-core/src/ast.rs"},"region":{"startLine":1959}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b6a43417108ba9675c651dda59ef572cc62343c18e35ef750366187e6341980"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): compiler-core/src/javascript/expression.rs:1511-1521 | compiler-core/src/type_/expression.rs:4353-4363 | language-server/src/code_action.rs:9679-9689 \u2014 \u0060compiler-core/src/javascript/expression.rs\u0060 and \u0060compiler-core/src/type_/expression.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 11 separate duplicated blocks between them, totalling at least 100 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/javascript/expression.rs"},"region":{"startLine":1511}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a4510e57b895c1e18ad24ff21a154dec144842023ea0b10daa5361a7e302333"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): compiler-core/src/parse/lexer.rs:199-209 | compiler-core/src/parse/lexer.rs:871-881 | compiler-core/src/parse/lexer.rs:941-951 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/parse/lexer.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"266e7d461b99e67995653bd567b6d37c58c95796a4e0b62d24b58db88e5c6969"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): compiler-core/src/type_/pattern.rs:548-558 | compiler-core/src/type_/pattern.rs:598-608 | compiler-core/src/type_/pattern.rs:640-650 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/type_/pattern.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"d215bd51ac4f5a143d163a6bbe469d3a162df86d7e09bb4170e211540913dae0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): compiler-core/src/ast.rs:4376-4386 | compiler-core/src/ast.rs:4400-4410 \u2014 both copies are in the same file, so extract the block 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-core/src/ast.rs"},"region":{"startLine":4376}}}],"partialFingerprints":{"codehealthFindingId/v1":"0847461f834b96f683b1e744102107c624fe35a45919c3a71cf8a800c673f31a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): compiler-core/src/ast/constant.rs:626-636 | compiler-core/src/ast/constant.rs:644-654 \u2014 both copies are in the same file, so extract the block 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-core/src/ast/constant.rs"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"7678d48e6046d61b4de162c0006bb38ff77c79e4f302ecd34f5d2af39e51ae7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): compiler-core/src/ast/typed.rs:1265-1275 | language-server/src/engine.rs:2447-2456 \u2014 before extracting anything, compare \u0060compiler-core/src/ast/typed.rs\u0060 and \u0060language-server/src/engine.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 89 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-core/src/ast/typed.rs"},"region":{"startLine":1265}}}],"partialFingerprints":{"codehealthFindingId/v1":"d59ee9955e5af1a339aa01221758c5493001043bb74da53a2bf3196107174263"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): compiler-core/src/erlang.rs:503-513 | compiler-core/src/type_/pattern.rs:563-573 \u2014 before extracting anything, compare \u0060compiler-core/src/erlang.rs\u0060 and \u0060compiler-core/src/type_/pattern.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 75 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-core/src/erlang.rs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab9ba8f1e8d50f4d937a01ea80793020551e3acd1b2ea56fce3e941df776863d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): compiler-core/src/erlang.rs:1781-1791 | compiler-core/src/erlang.rs:1800-1811 \u2014 both copies are in the same file, so extract the block 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-core/src/erlang.rs"},"region":{"startLine":1781}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea9186b3c274561268cbcb9b32efedbd3e0392a381324543cdb9ff362f3485e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): compiler-core/src/io/memory.rs:244-254 | compiler-core/src/io/memory.rs:266-276 \u2014 both copies are in the same file, so extract the block 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-core/src/io/memory.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"97e339531145e8a3d5278e63f26747e6092ccdb85817c52507388a68d8b5af14"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u201311 lines \u00D7 3): compiler-core/src/javascript/decision.rs:1584-1587 | compiler-core/src/javascript/decision.rs:2176-2186 | compiler-core/src/javascript/decision.rs:2219-2228 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/javascript/decision.rs"},"region":{"startLine":1584}}}],"partialFingerprints":{"codehealthFindingId/v1":"c01f52be8ad79a44c9d81f0b0021d72fd704db5d9dca7e5aaa5821f44354423d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): compiler-core/src/javascript/expression.rs:1409-1419 | compiler-core/src/javascript/expression.rs:1915-1925 \u2014 both copies are in the same file, so extract the block 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-core/src/javascript/expression.rs"},"region":{"startLine":1409}}}],"partialFingerprints":{"codehealthFindingId/v1":"3836c7db6969c989c376f6b93ed7d2a0d570c7ba3ac074b4495db9f7d2bf9047"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): compiler-core/src/javascript/expression.rs:2111-2121 | compiler-core/src/javascript/expression.rs:2154-2164 \u2014 both copies are in the same file, so extract the block 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-core/src/javascript/expression.rs"},"region":{"startLine":2111}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd766b08262264672e61b7237f1b33a1406fd279a412dab1fa0b29c614951afc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): compiler-core/src/type_/constant.rs:1013-1026 | compiler-core/src/type_/expression.rs:4330-4340 \u2014 before extracting anything, compare \u0060compiler-core/src/type_/constant.rs\u0060 and \u0060compiler-core/src/type_/expression.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 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-core/src/type_/constant.rs"},"region":{"startLine":1013}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7f52e1d6a3932820bf66e6ad019022f9d5466031af61f42922a561b30d1c81a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): compiler-core/src/warning.rs:570-580 | compiler-core/src/warning.rs:1069-1079 \u2014 both copies are in the same file, so extract the block 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-core/src/warning.rs"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"f015f0a6317df50172787f07683128942091aa83cfc04b0f6e4f947d77e331b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): compiler-core/src/warning.rs:1049-1059 | compiler-core/src/warning.rs:1444-1454 \u2014 both copies are in the same file, so extract the block 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-core/src/warning.rs"},"region":{"startLine":1049}}}],"partialFingerprints":{"codehealthFindingId/v1":"294955ebf7663d963edb0f5f72f600a80c6652a0af073a150680c1a1007ceabc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): language-server/src/code_action.rs:11317-11327 | language-server/src/code_action.rs:11408-11418 \u2014 both copies are in the same file, so extract the block 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":"language-server/src/code_action.rs"},"region":{"startLine":11317}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a03f6c6a00639a3521d6e7cbbdcf410b34e75340a55aafd2f72200645f48bd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): language-server/src/reference.rs:1032-1042 | language-server/src/reference.rs:1125-1135 \u2014 both copies are in the same file, so extract the block 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":"language-server/src/reference.rs"},"region":{"startLine":1032}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cf205638169d4a2f18ac56f395001d10ba5b7f4c851032eb7bace12f226830f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 23): compiler-core/src/ast.rs:1853-1862 | compiler-core/src/ast.rs:2434-2443 | compiler-core/src/ast/typed.rs:950-959 | compiler-core/src/ast/typed.rs:1188-1197 | compiler-core/src/ast/typed.rs:1233-1242 | compiler-core/src/ast/typed.rs:1278-1287 | compiler-core/src/ast/typed.rs:1323-1332 | compiler-core/src/ast/typed.rs:1367-1376 | compiler-core/src/ast/typed.rs:1408-1417 | compiler-core/src/erlang.rs:1679-1688 | compiler-core/src/erlang.rs:3756-3765 | compiler-core/src/javascript/expression.rs:886-895 | compiler-core/src/javascript/expression.rs:1420-1429 | compiler-core/src/javascript/expression.rs:1514-1523 | compiler-core/src/javascript/expression.rs:1928-1937 | compiler-core/src/javascript/expression.rs:2361-2370 | compiler-core/src/type_/expression.rs:4356-4365 | compiler-core/src/type_/expression.rs:4746-4755 | compiler-core/src/type_/pattern.rs:380-389 | language-server/src/code_action.rs:6900-6909 | language-server/src/code_action.rs:9682-9691 | language-server/src/code_action.rs:10215-10224 | language-server/src/code_action.rs:11596-11605 \u2014 before extracting anything, compare \u0060compiler-core/src/ast.rs\u0060 and \u0060compiler-core/src/ast/typed.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 100 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-core/src/ast.rs"},"region":{"startLine":1853}}}],"partialFingerprints":{"codehealthFindingId/v1":"94b4dfb4554f514328fb7e410df0e387ebd8fd9c57cf5e7a95936038380344f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 13): compiler-core/src/ast.rs:2425-2434 | compiler-core/src/ast/typed.rs:941-950 | compiler-core/src/ast/typed.rs:1224-1233 | compiler-core/src/ast/typed.rs:1269-1278 | compiler-core/src/ast/typed.rs:1314-1323 | compiler-core/src/ast/typed.rs:1867-1876 | compiler-core/src/javascript/expression.rs:1919-1928 | compiler-core/src/javascript/expression.rs:2352-2361 | compiler-core/src/type_/expression.rs:1209-1218 | compiler-core/src/type_/expression.rs:4737-4746 | language-server/src/code_action.rs:6891-6900 | language-server/src/code_action.rs:7648-7657 | language-server/src/engine.rs:2450-2459 \u2014 before extracting anything, compare \u0060compiler-core/src/ast.rs\u0060 and \u0060compiler-core/src/ast/typed.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 100 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-core/src/ast.rs"},"region":{"startLine":2425}}}],"partialFingerprints":{"codehealthFindingId/v1":"137e1349df9d57e702c0cb751c522c7ea67a2dc1ffd9fa9ea41aa03bc113bec9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 9): compiler-core/src/ast/typed.rs:1284-1293 | compiler-core/src/ast/typed.rs:1329-1338 | compiler-core/src/ast/typed.rs:1373-1382 | compiler-core/src/ast/typed.rs:1414-1423 | compiler-core/src/javascript/expression.rs:2367-2376 | compiler-core/src/type_/pattern.rs:386-395 | language-server/src/code_action.rs:7662-7671 | language-server/src/completer.rs:1237-1246 | language-server/src/engine.rs:2464-2473 \u2014 before extracting anything, compare \u0060compiler-core/src/ast/typed.rs\u0060 and \u0060compiler-core/src/javascript/expression.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 99 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-core/src/ast/typed.rs"},"region":{"startLine":1284}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d2808806c331ad2d71ce3658cdf7c6357290baeadfc05ce47e95164156bfd5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 8): compiler-core/src/ast.rs:1844-1853 | compiler-core/src/ast/typed.rs:984-993 | compiler-core/src/ast/typed.rs:1491-1500 | compiler-core/src/type_/expression.rs:2730-2739 | compiler-core/src/type_/expression.rs:3540-3549 | compiler-core/src/type_/pattern.rs:371-380 | language-server/src/completer.rs:1223-1232 | language-server/src/signature_help.rs:80-89 \u2014 before extracting anything, compare \u0060compiler-core/src/ast.rs\u0060 and \u0060compiler-core/src/ast/typed.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 100 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-core/src/ast.rs"},"region":{"startLine":1844}}}],"partialFingerprints":{"codehealthFindingId/v1":"8036aa5883e38fa6f54d59290327b524e247d1e8c722084f005c068aa177310f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 8): compiler-core/src/ast.rs:1963-1972 | compiler-core/src/type_/pipe.rs:211-220 | compiler-core/src/type_/pipe.rs:423-432 | format/src/lib.rs:1989-1998 | format/src/lib.rs:3006-3015 | format/src/lib.rs:3391-3400 | format/src/lib.rs:3433-3442 | format/src/lib.rs:3599-3608 \u2014 before extracting anything, compare \u0060compiler-core/src/ast.rs\u0060 and \u0060compiler-core/src/type_/pipe.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 57 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-core/src/ast.rs"},"region":{"startLine":1963}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd838dc6a4d1d4b33e7d3ad0287af7d8e2a73ca0db7b92fed9e8b5687a626bdd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 8): compiler-core/src/ast.rs:3938-3947 | compiler-core/src/ast.rs:4188-4197 | compiler-core/src/ast.rs:4347-4356 | compiler-core/src/ast.rs:4372-4381 | compiler-core/src/ast.rs:4396-4405 | compiler-core/src/erlang.rs:506-515 | compiler-core/src/metadata.rs:501-510 | compiler-core/src/type_/pattern.rs:566-575 \u2014 before extracting anything, compare \u0060compiler-core/src/ast.rs\u0060 and \u0060compiler-core/src/erlang.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 91 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-core/src/ast.rs"},"region":{"startLine":3938}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c6630f59f1e6938512c1fed970b1bcc1441e9fa3f21b0a4dec4ba23c2c46080"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 5): compiler-core/src/warning.rs:860-870 | compiler-core/src/warning.rs:893-903 | compiler-core/src/warning.rs:928-938 | compiler-core/src/warning.rs:1049-1058 | compiler-core/src/warning.rs:1444-1453 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/warning.rs"},"region":{"startLine":860}}}],"partialFingerprints":{"codehealthFindingId/v1":"578b9c6ddbea19da9d1269409a7e4370a59f692b07a3b311c757a27ed4f972bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): compiler-core/src/ast.rs:1955-1964 | compiler-core/src/type_/expression.rs:3611-3620 | compiler-core/src/type_/pipe.rs:415-424 \u2014 before extracting anything, compare \u0060compiler-core/src/ast.rs\u0060 and \u0060compiler-core/src/type_/expression.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 119 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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-core/src/ast.rs"},"region":{"startLine":1955}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3125fb2ad2d80ec694403027c2696b84df756592a7ba7c8957c753034dfe4aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): compiler-core/src/javascript/expression.rs:2110-2119 | compiler-core/src/javascript/expression.rs:2153-2162 | compiler-core/src/javascript/expression.rs:2191-2200 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/javascript/expression.rs"},"region":{"startLine":2110}}}],"partialFingerprints":{"codehealthFindingId/v1":"f68828f9efaa4971d17346708d5390d395eee6a0b7f589950368d1e1795e37db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): compiler-core/src/type_/constant.rs:1012-1021 | compiler-core/src/type_/expression.rs:4329-4338 | compiler-core/src/type_/pattern.rs:1568-1577 \u2014 before extracting anything, compare \u0060compiler-core/src/type_/constant.rs\u0060 and \u0060compiler-core/src/type_/expression.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 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-core/src/type_/constant.rs"},"region":{"startLine":1012}}}],"partialFingerprints":{"codehealthFindingId/v1":"457c84e15bc600ad43d70fd75f7f5021f4c2ab80c73a07e985f9fdd1a34c140d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): compiler-cli/src/fs.rs:551-560 | compiler-cli/src/fs.rs:568-577 \u2014 both copies are in the same file, so extract the block 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-cli/src/fs.rs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"c71570f2c69fadf42e46790aa1663e7a7fce7d5b16c904aa65a3340d0ef88054"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): compiler-core/src/ast/typed.rs:769-778 | compiler-core/src/ast/typed.rs:797-806 \u2014 both copies are in the same file, so extract the block 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-core/src/ast/typed.rs"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c6822a85dc7328350ed359084344dc49de9a3b46210d9f3f9325465a6ca7def"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): compiler-core/src/ast/typed.rs:1633-1642 | compiler-core/src/ast/typed.rs:1802-1811 \u2014 both copies are in the same file, so extract the block 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-core/src/ast/typed.rs"},"region":{"startLine":1633}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aa317ebcdce28d1498a98f053f4097cb2f70b9a8ba6a2fdb258637ee3498a95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): compiler-core/src/ast/untyped.rs:203-212 | compiler-core/src/ast/untyped.rs:229-238 \u2014 both copies are in the same file, so extract the block 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-core/src/ast/untyped.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"6312df0fb2ef40f230b1eaf4f4f41b0a57f8f560e43da4bb9e81bc80301f826b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): compiler-core/src/parse.rs:3244-3253 | compiler-core/src/parse.rs:3262-3270 \u2014 both copies are in the same file, so extract the block 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-core/src/parse.rs"},"region":{"startLine":3244}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb6a7cffba648e5fa4f4416ede41daed9c0cee5fe182880617146ef8aa366770"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): erlang-generation/src/lib.rs:4062-4071 | erlang-generation/src/lib.rs:4083-4092 \u2014 both copies are in the same file, so extract the block 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":"erlang-generation/src/lib.rs"},"region":{"startLine":4062}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba3f87bbf0b5de33af62a78927712642f4b761f0dcca57d5fdcfe61ce0537d41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): format/src/lib.rs:2586-2595 | format/src/lib.rs:2997-3006 \u2014 both copies are in the same file, so extract the block 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":"format/src/lib.rs"},"region":{"startLine":2586}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed14a1dcac886ac1f15534ca7441c40effed405f144795d93a70aa03b5584ec9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): language-server/src/code_action.rs:9106-9114 | language-server/src/code_action.rs:10206-10215 \u2014 both copies are in the same file, so extract the block 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":"language-server/src/code_action.rs"},"region":{"startLine":9106}}}],"partialFingerprints":{"codehealthFindingId/v1":"4047698d6443b232ffedc63f2c01d9a48fb04c53c28159d305563bf2fc799b9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 30): compiler-core/src/ast.rs:1857-1865 | compiler-core/src/ast.rs:2438-2446 | compiler-core/src/ast/typed.rs:1192-1200 | compiler-core/src/ast/typed.rs:1237-1245 | compiler-core/src/ast/typed.rs:1282-1290 | compiler-core/src/ast/typed.rs:1327-1335 | compiler-core/src/ast/typed.rs:1371-1379 | compiler-core/src/ast/typed.rs:1412-1420 | compiler-core/src/ast/typed.rs:1503-1511 | compiler-core/src/ast/typed.rs:1879-1887 | compiler-core/src/erlang.rs:1683-1691 | compiler-core/src/erlang.rs:3760-3768 | compiler-core/src/javascript/expression.rs:890-898 | compiler-core/src/javascript/expression.rs:1424-1432 | compiler-core/src/javascript/expression.rs:1932-1940 | compiler-core/src/javascript/expression.rs:2365-2373 | compiler-core/src/type_/expression.rs:2742-2750 | compiler-core/src/type_/expression.rs:3552-3560 | compiler-core/src/type_/expression.rs:4360-4368 | compiler-core/src/type_/expression.rs:4750-4758 | compiler-core/src/type_/pattern.rs:384-392 | language-server/src/code_action.rs:6904-6912 | language-server/src/code_action.rs:7660-7668 | language-server/src/code_action.rs:9116-9124 | language-server/src/code_action.rs:9686-9694 | language-server/src/code_action.rs:10219-10227 | language-server/src/code_action.rs:11600-11608 | language-server/src/completer.rs:1235-1243 | language-server/src/engine.rs:2462-2470 | language-server/src/signature_help.rs:92-99 \u2014 before extracting anything, compare \u0060compiler-core/src/ast.rs\u0060 and \u0060compiler-core/src/ast/typed.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 100 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-core/src/ast.rs"},"region":{"startLine":1857}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b654b1c44680ce614698f1e561ccd33980dfc6acb87632f257df8df5f8d1e41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 24): compiler-core/src/ast.rs:1855-1863 | compiler-core/src/ast.rs:2436-2444 | compiler-core/src/ast/typed.rs:952-960 | compiler-core/src/ast/typed.rs:1190-1198 | compiler-core/src/ast/typed.rs:1235-1243 | compiler-core/src/ast/typed.rs:1280-1288 | compiler-core/src/ast/typed.rs:1325-1333 | compiler-core/src/ast/typed.rs:1369-1377 | compiler-core/src/ast/typed.rs:1410-1418 | compiler-core/src/erlang.rs:1681-1689 | compiler-core/src/erlang.rs:3758-3766 | compiler-core/src/javascript/expression.rs:888-896 | compiler-core/src/javascript/expression.rs:1422-1430 | compiler-core/src/javascript/expression.rs:1516-1524 | compiler-core/src/javascript/expression.rs:1930-1938 | compiler-core/src/javascript/expression.rs:2363-2371 | compiler-core/src/type_/expression.rs:4358-4366 | compiler-core/src/type_/expression.rs:4748-4756 | compiler-core/src/type_/pattern.rs:382-390 | language-server/src/code_action.rs:6902-6910 | language-server/src/code_action.rs:7658-7666 | language-server/src/code_action.rs:9684-9692 | language-server/src/code_action.rs:10217-10225 | language-server/src/code_action.rs:11598-11606 \u2014 before extracting anything, compare \u0060compiler-core/src/ast.rs\u0060 and \u0060compiler-core/src/ast/typed.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 100 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-core/src/ast.rs"},"region":{"startLine":1855}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ccc89c8832185ca6438368fee99124a7b1d93f4742bbebb9654db3d82979009"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 16): compiler-core/src/ast.rs:1850-1858 | compiler-core/src/ast.rs:2431-2439 | compiler-core/src/ast/typed.rs:947-955 | compiler-core/src/ast/typed.rs:1230-1238 | compiler-core/src/ast/typed.rs:1275-1283 | compiler-core/src/ast/typed.rs:1320-1328 | compiler-core/src/erlang.rs:3753-3761 | compiler-core/src/javascript/expression.rs:883-891 | compiler-core/src/javascript/expression.rs:1925-1933 | compiler-core/src/javascript/expression.rs:2358-2366 | compiler-core/src/type_/expression.rs:1215-1223 | compiler-core/src/type_/expression.rs:4743-4751 | compiler-core/src/type_/pattern.rs:377-385 | language-server/src/code_action.rs:6897-6905 | language-server/src/code_action.rs:10212-10220 | language-server/src/code_action.rs:11593-11601 \u2014 before extracting anything, compare \u0060compiler-core/src/ast.rs\u0060 and \u0060compiler-core/src/ast/typed.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 100 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-core/src/ast.rs"},"region":{"startLine":1850}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b61fbfa136c8eaa78c4aa3a3d29051415775e1f2664aafceb11cab676ebc9f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 14): compiler-core/src/ast.rs:2424-2432 | compiler-core/src/ast/typed.rs:940-948 | compiler-core/src/ast/typed.rs:1223-1231 | compiler-core/src/ast/typed.rs:1268-1276 | compiler-core/src/ast/typed.rs:1313-1321 | compiler-core/src/ast/typed.rs:1866-1874 | compiler-core/src/javascript/expression.rs:1505-1513 | compiler-core/src/javascript/expression.rs:1918-1926 | compiler-core/src/javascript/expression.rs:2351-2359 | compiler-core/src/type_/expression.rs:1208-1216 | compiler-core/src/type_/expression.rs:4736-4744 | language-server/src/code_action.rs:6890-6898 | language-server/src/code_action.rs:7647-7655 | language-server/src/engine.rs:2449-2457 \u2014 before extracting anything, compare \u0060compiler-core/src/ast.rs\u0060 and \u0060compiler-core/src/ast/typed.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 100 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-core/src/ast.rs"},"region":{"startLine":2424}}}],"partialFingerprints":{"codehealthFindingId/v1":"06a7ecec1b76e27dc8379e14bd38e7049daf08da3aca29a7e25791216d478883"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 13): compiler-core/src/ast.rs:2428-2436 | compiler-core/src/ast/typed.rs:944-952 | compiler-core/src/ast/typed.rs:1227-1235 | compiler-core/src/ast/typed.rs:1272-1280 | compiler-core/src/ast/typed.rs:1317-1325 | compiler-core/src/ast/typed.rs:1870-1878 | compiler-core/src/javascript/expression.rs:1922-1930 | compiler-core/src/javascript/expression.rs:2355-2363 | compiler-core/src/type_/expression.rs:1212-1220 | compiler-core/src/type_/expression.rs:4740-4748 | language-server/src/code_action.rs:6894-6902 | language-server/src/code_action.rs:10209-10217 | language-server/src/engine.rs:2453-2461 \u2014 before extracting anything, compare \u0060compiler-core/src/ast.rs\u0060 and \u0060compiler-core/src/ast/typed.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 100 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-core/src/ast.rs"},"region":{"startLine":2428}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0bc79e3dcca9ab25f4b091223ca39fef16ec34ec5ad599d3bb84cd05a5ccd5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 8): compiler-core/src/ast.rs:1847-1855 | compiler-core/src/ast/typed.rs:1494-1502 | compiler-core/src/erlang.rs:3750-3758 | compiler-core/src/type_/expression.rs:2733-2741 | compiler-core/src/type_/expression.rs:3543-3551 | compiler-core/src/type_/pattern.rs:374-382 | language-server/src/completer.rs:1226-1234 | language-server/src/signature_help.rs:83-91 \u2014 before extracting anything, compare \u0060compiler-core/src/ast.rs\u0060 and \u0060compiler-core/src/ast/typed.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 100 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-core/src/ast.rs"},"region":{"startLine":1847}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab1b3e0f8065c39d89c446e6acee9f96edbc02e36e95294727c607cdb604cfbd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 8): compiler-core/src/ast.rs:1966-1973 | compiler-core/src/type_/expression.rs:3621-3628 | compiler-core/src/type_/pipe.rs:214-221 | compiler-core/src/type_/pipe.rs:426-433 | format/src/lib.rs:1992-1999 | format/src/lib.rs:2597-2604 | format/src/lib.rs:3009-3016 | format/src/lib.rs:3602-3610 \u2014 before extracting anything, compare \u0060compiler-core/src/ast.rs\u0060 and \u0060compiler-core/src/type_/expression.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 119 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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-core/src/ast.rs"},"region":{"startLine":1966}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0886c90fbacc3977f81217de1ed30e0b60dd14c7fc143df02895bc056cc5480"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 8): compiler-core/src/ast.rs:1965-1973 | compiler-core/src/type_/pipe.rs:213-221 | compiler-core/src/type_/pipe.rs:425-433 | format/src/lib.rs:1991-1999 | format/src/lib.rs:2596-2604 | format/src/lib.rs:3008-3016 | format/src/lib.rs:3435-3442 | format/src/lib.rs:3601-3609 \u2014 before extracting anything, compare \u0060compiler-core/src/ast.rs\u0060 and \u0060compiler-core/src/type_/pipe.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 57 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-core/src/ast.rs"},"region":{"startLine":1965}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6956aaa6e69ca0ccca0417fad133c1632ddcb8de3327c69db65f958e7bcc53b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 7): compiler-core/src/ast.rs:3935-3943 | compiler-core/src/ast.rs:4186-4193 | compiler-core/src/ast.rs:4251-4257 | compiler-core/src/ast.rs:4345-4352 | compiler-core/src/ast.rs:4370-4377 | compiler-core/src/ast.rs:4394-4401 | compiler-core/src/metadata.rs:499-506 \u2014 there are 7 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 7 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/ast.rs"},"region":{"startLine":3935}}}],"partialFingerprints":{"codehealthFindingId/v1":"30c12486545548a045ed3e1692499f8c9df67e066c19dbaf4bd18dd9f5257923"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 4): compiler-core/src/ast/typed.rs:711-719 | compiler-core/src/ast/typed.rs:740-748 | compiler-core/src/ast/untyped.rs:205-212 | compiler-core/src/ast/untyped.rs:231-238 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/ast/typed.rs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"72292c46ace5330cd4231af3f26f8fe17620c07e91ad7d14a9e9e02440253652"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): compiler-core/src/type_/pattern.rs:478-486 | compiler-core/src/type_/pattern.rs:551-559 | compiler-core/src/type_/pattern.rs:601-609 | compiler-core/src/type_/pattern.rs:643-651 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/type_/pattern.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c5d70afa99d8b452e2f585d4bbbe1cae1ed2d289743f7d5aa5638ecc847ea11"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): compiler-core/src/build/package_loader.rs:232-240 | compiler-core/src/build/package_loader.rs:247-255 | compiler-core/src/build/package_loader.rs:260-268 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/build/package_loader.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"39cd574f54c5ef9010dcafa43c146d94ee5724c6dc8351e364a58479a05c00b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): language-server/src/code_action.rs:2012-2021 | language-server/src/code_action.rs:2049-2057 | language-server/src/code_action.rs:2120-2128 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"language-server/src/code_action.rs"},"region":{"startLine":2012}}}],"partialFingerprints":{"codehealthFindingId/v1":"39d3eb6c0c73a1ebe429e8de9266d55a26a63341e50bb84300a23c248ecdacc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler-cli/src/fs.rs:509-517 | compiler-cli/src/fs.rs:529-537 \u2014 both copies are in the same file, so extract the block 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-cli/src/fs.rs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"5693699dbd10014f7844c959a6aef2667c26b8ce797216c9667960bc8700b1ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler-core/src/erlang.rs:1402-1410 | compiler-core/src/erlang.rs:1975-1983 \u2014 both copies are in the same file, so extract the block 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-core/src/erlang.rs"},"region":{"startLine":1402}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ba3d42f4d4507ed002815c5323708688651c5fbe1dd35f9c8fb62b622ee34a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler-core/src/erlang.rs:2742-2750 | compiler-core/src/type_/constant.rs:198-206 \u2014 before extracting anything, compare \u0060compiler-core/src/erlang.rs\u0060 and \u0060compiler-core/src/type_/constant.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 44 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-core/src/erlang.rs"},"region":{"startLine":2742}}}],"partialFingerprints":{"codehealthFindingId/v1":"f83f4ee1b084946eec1142163ce59570cc4ce91e3473266ba9e48ae90086da12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler-core/src/erlang/echo.rs:1177-1186 | compiler-core/src/erlang/echo.rs:1196-1204 \u2014 both copies are in the same file, so extract the block 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-core/src/erlang/echo.rs"},"region":{"startLine":1177}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfa56cc7668148ed84534937a32601ec601639d4d90ba34cb2c8c7de16c328cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler-core/src/parse.rs:3631-3639 | compiler-core/src/parse.rs:3662-3670 \u2014 both copies are in the same file, so extract the block 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-core/src/parse.rs"},"region":{"startLine":3631}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dd4e27ba54677574d6a5cfc19afd5db858a002c4bdc88ca57bc7ba2806a886c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler-core/src/type_/environment.rs:405-413 | compiler-core/src/type_/environment.rs:427-435 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/type_/environment.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"394d9bec80d42fc17eb2b12a58e16c185c74d68cc302452d4341e34cd21c35f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler-core/src/type_/prelude.rs:477-485 | compiler-core/src/type_/prelude.rs:495-503 \u2014 both copies are in the same file, so extract the block 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-core/src/type_/prelude.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"d683166786651ddb09f5e0c8709d20b170a2dd3926a48807997e6cf658a7e57b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): erlang-generation/src/lib.rs:4474-4482 | erlang-generation/src/lib.rs:4513-4521 \u2014 both copies are in the same file, so extract the block 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":"erlang-generation/src/lib.rs"},"region":{"startLine":4474}}}],"partialFingerprints":{"codehealthFindingId/v1":"aab2b2e67b91b52c5f63535dad50d89931df2f20715bfdd47caca69ba0fa4f34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): language-server/src/code_action.rs:11192-11200 | language-server/src/code_action.rs:11262-11269 \u2014 both copies are in the same file, so extract the block 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":"language-server/src/code_action.rs"},"region":{"startLine":11192}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dddba189e9beb72279da78dba21abe4f72e942b962ae9b100378ed86e096ac0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 25): compiler-core/src/ast.rs:1856-1863 | compiler-core/src/ast.rs:2437-2444 | compiler-core/src/ast/typed.rs:953-960 | compiler-core/src/ast/typed.rs:1191-1198 | compiler-core/src/ast/typed.rs:1236-1243 | compiler-core/src/ast/typed.rs:1281-1288 | compiler-core/src/ast/typed.rs:1326-1333 | compiler-core/src/ast/typed.rs:1370-1377 | compiler-core/src/ast/typed.rs:1411-1418 | compiler-core/src/erlang.rs:1682-1689 | compiler-core/src/erlang.rs:3759-3766 | compiler-core/src/javascript/expression.rs:889-896 | compiler-core/src/javascript/expression.rs:1423-1430 | compiler-core/src/javascript/expression.rs:1517-1524 | compiler-core/src/javascript/expression.rs:1931-1938 | compiler-core/src/javascript/expression.rs:2364-2371 | compiler-core/src/type_/expression.rs:4359-4366 | compiler-core/src/type_/expression.rs:4749-4756 | compiler-core/src/type_/pattern.rs:383-390 | language-server/src/code_action.rs:6903-6910 | language-server/src/code_action.rs:7659-7666 | language-server/src/code_action.rs:9115-9122 | language-server/src/code_action.rs:9685-9692 | language-server/src/code_action.rs:10218-10225 | language-server/src/code_action.rs:11599-11606 \u2014 before extracting anything, compare \u0060compiler-core/src/ast.rs\u0060 and \u0060compiler-core/src/ast/typed.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 100 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-core/src/ast.rs"},"region":{"startLine":1856}}}],"partialFingerprints":{"codehealthFindingId/v1":"969330b69260c5609ae6865c948412d679e7b6d923472bf13ea3e4156b97ccbd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 15): compiler-core/src/ast.rs:2429-2436 | compiler-core/src/ast/typed.rs:945-952 | compiler-core/src/ast/typed.rs:1228-1235 | compiler-core/src/ast/typed.rs:1273-1280 | compiler-core/src/ast/typed.rs:1318-1325 | compiler-core/src/ast/typed.rs:1871-1878 | compiler-core/src/erlang.rs:3913-3920 | compiler-core/src/javascript/expression.rs:1923-1930 | compiler-core/src/javascript/expression.rs:2356-2363 | compiler-core/src/type_/expression.rs:1213-1220 | compiler-core/src/type_/expression.rs:4741-4748 | language-server/src/code_action.rs:6895-6902 | language-server/src/code_action.rs:10210-10217 | language-server/src/code_action.rs:11591-11598 | language-server/src/engine.rs:2454-2461 \u2014 before extracting anything, compare \u0060compiler-core/src/ast.rs\u0060 and \u0060compiler-core/src/ast/typed.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 100 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-core/src/ast.rs"},"region":{"startLine":2429}}}],"partialFingerprints":{"codehealthFindingId/v1":"0502b3b5c671db4852731639561e01649346ccb868ee564b63aae6fe1c5897bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 9): compiler-core/src/ast.rs:1965-1972 | compiler-core/src/type_/pipe.rs:213-220 | compiler-core/src/type_/pipe.rs:425-432 | format/src/lib.rs:1991-1998 | format/src/lib.rs:2596-2603 | format/src/lib.rs:3008-3015 | format/src/lib.rs:3393-3400 | format/src/lib.rs:3435-3442 | format/src/lib.rs:3601-3608 \u2014 before extracting anything, compare \u0060compiler-core/src/ast.rs\u0060 and \u0060compiler-core/src/type_/pipe.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 57 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-core/src/ast.rs"},"region":{"startLine":1965}}}],"partialFingerprints":{"codehealthFindingId/v1":"125b7138a84c659bd10c2c788e822d551eabd6174207d80438bdd830a5afe0b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 8): compiler-core/src/ast/typed.rs:940-947 | compiler-core/src/ast/typed.rs:1268-1275 | compiler-core/src/ast/typed.rs:1313-1320 | compiler-core/src/ast/typed.rs:1358-1365 | compiler-core/src/ast/typed.rs:1399-1406 | compiler-core/src/javascript/expression.rs:1505-1512 | compiler-core/src/type_/expression.rs:1208-1215 | language-server/src/engine.rs:2449-2456 \u2014 before extracting anything, compare \u0060compiler-core/src/ast/typed.rs\u0060 and \u0060compiler-core/src/javascript/expression.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 99 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-core/src/ast/typed.rs"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"66c8c8fe8b686a3652a78fe290a94437e0d15ceeef7db5c93e3707045162e6d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5): compiler-core/src/ast.rs:2424-2431 | compiler-core/src/javascript/expression.rs:1409-1419 | compiler-core/src/javascript/expression.rs:1915-1925 | compiler-core/src/javascript/expression.rs:2351-2358 | language-server/src/code_action.rs:7647-7654 \u2014 before extracting anything, compare \u0060compiler-core/src/ast.rs\u0060 and \u0060compiler-core/src/javascript/expression.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 111 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-core/src/ast.rs"},"region":{"startLine":2424}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0449796bba292edf8a2aeb8c52f8d06ed21a488b371456e4424ee2fe00433fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): compiler-core/src/erlang.rs:1759-1768 | compiler-core/src/erlang.rs:1772-1779 | compiler-core/src/erlang.rs:1841-1849 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/erlang.rs"},"region":{"startLine":1759}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2e42e429e40d2b2088f31ad0b729e3d5d823cf2011059b588ede96980886cc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): format/src/lib.rs:2997-3004 | format/src/lib.rs:3383-3390 | format/src/lib.rs:3425-3432 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"format/src/lib.rs"},"region":{"startLine":2997}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef9ef9df5a7eaf636d7bc33c06185095effd7183bf010de190ab6f773f3b7414"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler-cli/src/fs.rs:390-397 | compiler-cli/src/fs.rs:434-441 \u2014 both copies are in the same file, so extract the block 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-cli/src/fs.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5c45373fdbf8c83f2c07360b977239e80fea00dd2f8f3ed1fe12afe1d3c03bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler-core/src/erlang.rs:1671-1678 | language-server/src/code_action.rs:6890-6897 \u2014 before extracting anything, compare \u0060compiler-core/src/erlang.rs\u0060 and \u0060language-server/src/code_action.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 61 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-core/src/erlang.rs"},"region":{"startLine":1671}}}],"partialFingerprints":{"codehealthFindingId/v1":"87137d389aa6cad3a8816c879c06ae7849af3677c46fd09c3a77175367cbba7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler-core/src/erlang.rs:2896-2903 | compiler-core/src/erlang.rs:2979-2986 \u2014 both copies are in the same file, so extract the block 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-core/src/erlang.rs"},"region":{"startLine":2896}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bf16db056f34d70e33b6e507bebb2dd8798e257a5782197f87ee8f615b98868"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler-core/src/erlang/echo.rs:813-820 | compiler-core/src/erlang/echo.rs:1311-1319 \u2014 both copies are in the same file, so extract the block 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-core/src/erlang/echo.rs"},"region":{"startLine":813}}}],"partialFingerprints":{"codehealthFindingId/v1":"72f445a4ad872052febcce47aa93a7980a54c3a19fa961ede5fc61ec79594bec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler-core/src/erlang/echo.rs:1395-1402 | compiler-core/src/erlang/echo.rs:1499-1506 \u2014 both copies are in the same file, so extract the block 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-core/src/erlang/echo.rs"},"region":{"startLine":1395}}}],"partialFingerprints":{"codehealthFindingId/v1":"657f97ec7afc9867f7f56a442798752fbec59a94537c974f57389c97c79303f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler-core/src/erlang/echo.rs:1442-1449 | compiler-core/src/erlang/echo.rs:1569-1576 \u2014 both copies are in the same file, so extract the block 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-core/src/erlang/echo.rs"},"region":{"startLine":1442}}}],"partialFingerprints":{"codehealthFindingId/v1":"15effa096d75331e94219e7de38006df32defddaa586891f1e927b06e7bc109d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler-core/src/javascript/decision.rs:845-852 | compiler-core/src/javascript/decision.rs:876-883 \u2014 both copies are in the same file, so extract the block 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-core/src/javascript/decision.rs"},"region":{"startLine":845}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b78cc34e62273b6a1d707199d0efcb57326256cc6204274365938a0ac381c82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler-core/src/javascript/expression.rs:3590-3597 | compiler-core/src/javascript/expression.rs:3623-3630 \u2014 both copies are in the same file, so extract the block 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-core/src/javascript/expression.rs"},"region":{"startLine":3590}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a1490aa23a597ae31792716bad31d28d035dbe7f2e2b2eef801d9545f5994fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): hexpm/src/lib.rs:239-246 | hexpm/src/lib.rs:271-278 \u2014 both copies are in the same file, so extract the block 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":"hexpm/src/lib.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"932b6687eafcc7f07ffefe20f17dd3b53193916fa26353d27f9e5b95b1325591"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 6): compiler-core/src/parse/lexer.rs:221-227 | compiler-core/src/parse/lexer.rs:247-253 | compiler-core/src/parse/lexer.rs:273-279 | compiler-core/src/parse/lexer.rs:325-331 | compiler-core/src/parse/lexer.rs:345-351 | compiler-core/src/parse/lexer.rs:365-371 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/parse/lexer.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3a864b33fb8c111c12bbe0b25346ba3d59956016be7295eb74e5e4b4e9f91fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 6): compiler-core/src/warning.rs:631-637 | compiler-core/src/warning.rs:661-667 | compiler-core/src/warning.rs:678-684 | compiler-core/src/warning.rs:723-729 | compiler-core/src/warning.rs:739-745 | compiler-core/src/warning.rs:755-761 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/warning.rs"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a426af86e8cc4ab990783c2637c34c6e359f87dd83c106352559a7d3130555c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): hexpm/src/lib.rs:483-489 | hexpm/src/lib.rs:601-607 | hexpm/src/lib.rs:661-667 | hexpm/src/lib.rs:696-702 | hexpm/src/lib.rs:727-733 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hexpm/src/lib.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cdaf49ecbdb1505623c92304cab747e0e3efcd9af4cf7f5a353f5d35c4a1e7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): compiler-core/src/type_/constant.rs:1000-1006 | compiler-core/src/type_/expression.rs:4317-4323 | compiler-core/src/type_/pattern.rs:1556-1562 \u2014 before extracting anything, compare \u0060compiler-core/src/type_/constant.rs\u0060 and \u0060compiler-core/src/type_/expression.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 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-core/src/type_/constant.rs"},"region":{"startLine":1000}}}],"partialFingerprints":{"codehealthFindingId/v1":"fda1e2ffc8c1ea38ef10840682464aee7e9b529e935b1264f6f8162e2dbc4e54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler-cli/src/fix.rs:55-61 | compiler-cli/src/remove.rs:18-24 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-cli/src/fix.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"e22f9dde35d697b5d71af4046fbe4d718fa972140da0cb39a52bb8e62e1d2515"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler-core/src/analyse.rs:1681-1687 | compiler-core/src/analyse.rs:1970-1976 \u2014 both copies are in the same file, so extract the block 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-core/src/analyse.rs"},"region":{"startLine":1681}}}],"partialFingerprints":{"codehealthFindingId/v1":"5043c7013e9893ad180b3eb5e48028e32ff228f3a3c8e130a99078888e30aabf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler-core/src/erlang.rs:1555-1564 | compiler-core/src/erlang.rs:1568-1574 \u2014 both copies are in the same file, so extract the block 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-core/src/erlang.rs"},"region":{"startLine":1555}}}],"partialFingerprints":{"codehealthFindingId/v1":"85b7ce2ac75b76d66099df74dda1a8276d5be3f03d122ae3dc96e11017e1644b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler-core/src/erlang/echo.rs:971-977 | compiler-core/src/erlang/echo.rs:1038-1044 \u2014 both copies are in the same file, so extract the block 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-core/src/erlang/echo.rs"},"region":{"startLine":971}}}],"partialFingerprints":{"codehealthFindingId/v1":"a72f5d8635aec911672be7ae300a02789c318650bd8c1cbe52cd4914f49087ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler-core/src/javascript/expression.rs:2726-2732 | compiler-core/src/javascript/expression.rs:3372-3378 \u2014 both copies are in the same file, so extract the block 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-core/src/javascript/expression.rs"},"region":{"startLine":2726}}}],"partialFingerprints":{"codehealthFindingId/v1":"10e7b8a40be0a0a40a05a179ca1efb5f925a39fa9b9dd7f6fb9e48685a26367c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler-core/src/type_/environment.rs:1184-1190 | compiler-core/src/type_/environment.rs:1200-1206 \u2014 both copies are in the same file, so extract the block 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-core/src/type_/environment.rs"},"region":{"startLine":1184}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dfc53e331b0965549f9fd128c95892bb4ce82e78aac4935b9ffaab72309a720"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6): hexpm/src/lib.rs:487-492 | hexpm/src/lib.rs:524-529 | hexpm/src/lib.rs:665-670 | hexpm/src/lib.rs:700-705 | hexpm/src/lib.rs:731-736 | hexpm/src/lib.rs:1232-1237 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hexpm/src/lib.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc427cfc5b4c7be6b3e4aed5a6ae2c831f8b24c80b7cc843cc5edecff7d104b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): compiler-core/src/ast/typed.rs:758-763 | compiler-core/src/ast/typed.rs:787-792 | compiler-core/src/ast/untyped.rs:171-176 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/ast/typed.rs"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"25a91c488ff23d3d25f401f03ae27c777059ef4bbf5d8e0cc2139f77abcb05ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): compiler-core/src/ast/typed.rs:772-777 | compiler-core/src/ast/typed.rs:800-805 | compiler-core/src/ast/typed.rs:871-876 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/ast/typed.rs"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c1124cde200e0d0aa2d69a0aac5fc83847fb9c7f1e36dd6e9e328be4eed4652"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): compiler-core/src/erlang.rs:1402-1407 | compiler-core/src/erlang.rs:1902-1907 | compiler-core/src/erlang.rs:1938-1943 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/erlang.rs"},"region":{"startLine":1402}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2bf273fee03181fde23e9ada4f0d9d6fd20a783a7fb42cb27eb559de0e8ad56"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20136 lines \u00D7 4): compiler-cli/src/docs.rs:25-27 | compiler-cli/src/owner.rs:12-14 | compiler-cli/src/owner.rs:42-47 | compiler-cli/src/publish.rs:84-89 \u2014 there are 4 copies across 3 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-cli/src/docs.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"b87e50f9206839f42f2125101d2bbf35adef1bf6e14697be6d5863b2ce82917e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler-core/src/ast/typed.rs:407-412 | compiler-core/src/ast/typed.rs:425-430 \u2014 both copies are in the same file, so extract the block 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-core/src/ast/typed.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"a55120f2b0d0f2ba819baf8065d0f1b6ee069221d08f4d6a335e07f1bdc6614d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler-core/src/erlang/echo.rs:767-772 | compiler-core/src/erlang/echo.rs:897-902 \u2014 both copies are in the same file, so extract the block 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-core/src/erlang/echo.rs"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"594b63e380831fe0bd2d9b214afcb523f342667ec5e7b3afd5c4840beb43f164"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): language-server/src/engine.rs:2037-2042 | language-server/src/engine.rs:2050-2055 \u2014 both copies are in the same file, so extract the block 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":"language-server/src/engine.rs"},"region":{"startLine":2037}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f44f6795aba24baf5fd1bdac83235bc3374e648275202268785f085128fd386"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): compiler-core/src/analyse.rs:779-783 | compiler-core/src/analyse.rs:1683-1687 | compiler-core/src/analyse.rs:1972-1976 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/analyse.rs"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"82940f6896aa456d5e4ee180ad214690e329515e7c251370a82ffdabd3202c20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): language-server/src/code_action.rs:1146-1154 | language-server/src/completer.rs:1614-1620 \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":"language-server/src/code_action.rs"},"region":{"startLine":1146}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aa9700a369cd80e11527b9015560d988182be9a7aed17eed40b1d5c3c32c908"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): compiler-core/src/javascript.rs:1423-1430 | compiler-core/src/javascript/typescript.rs:131-138 | compiler-core/src/javascript/typescript.rs:146-153 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/javascript.rs"},"region":{"startLine":1423}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dce7350609ae54409e6058a341d2bfd892bb03f7fb8a90244b05d8cb85b64af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): compiler-core/src/parse/extra.rs:46-58 | format/src/lib.rs:139-151 \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":"compiler-core/src/parse/extra.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"92bca710d983150125de4ad3786e11a76e75795fefd092134905ae95043c866f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 5): compiler-core/src/error.rs:1413-1427 | compiler-core/src/error.rs:1431-1445 | compiler-core/src/error.rs:1449-1464 | compiler-core/src/error.rs:1468-1483 | compiler-core/src/error.rs:1512-1527 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/error.rs"},"region":{"startLine":1413}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0351dd6c03edc2a2f49eea0912fbf6a27d1146bad23f3d7ff714bed342a9a32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): compiler-core/src/erlang/echo.rs:353-363 | compiler-core/src/erlang/echo.rs:935-948 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/erlang/echo.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"33d439176a808a70bce19f95ec68f357c82445f736d800d3504c20abbd36d4fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 5): compiler-core/src/warning.rs:302-313 | compiler-core/src/warning.rs:326-337 | compiler-core/src/warning.rs:346-357 | compiler-core/src/warning.rs:369-381 | compiler-core/src/warning.rs:416-426 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/warning.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"29c81033e75c39c91e5091f9b2bd385f85e3eafaf49028ea8077e26f4099de0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): compiler-core/src/warning.rs:442-452 | compiler-core/src/warning.rs:1321-1333 \u2014 both copies are in the same file, so extract the block 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-core/src/warning.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fc555db595ae016f5639abd19eb6da20a971e7ddf09ecd95b648e41dac74e83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): compiler-cli/src/run.rs:218-229 | compiler-cli/src/run.rs:242-253 | compiler-cli/src/run.rs:342-353 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-cli/src/run.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"92d4debdac2859df3f813197e78c853cab704d737658538854df9a8963ab450d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): compiler-core/src/warning.rs:392-400 | compiler-core/src/warning.rs:442-451 | compiler-core/src/warning.rs:1321-1332 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/warning.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"b969af83f8d1c93090debaa701dcb473ef06d50f4d5184137d396affc7045f80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): compiler-core/src/build/project_compiler.rs:368-379 | compiler-core/src/build/project_compiler.rs:441-452 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/build/project_compiler.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"51c37f7237ebe001adbc39956564f758df91830ca0213b17ad909d5bcf12ac13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): compiler-core/src/warning.rs:962-973 | compiler-core/src/warning.rs:1104-1115 \u2014 both copies are in the same file, so extract the block 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-core/src/warning.rs"},"region":{"startLine":962}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b20948dba0b01e882564580fc3dcb56768d43df3aff0275a321f10c2e38f3be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): compiler-core/src/erlang/echo.rs:1213-1224 | compiler-core/src/erlang/echo.rs:1257-1267 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/erlang/echo.rs"},"region":{"startLine":1213}}}],"partialFingerprints":{"codehealthFindingId/v1":"82d1e8c0a43fd5defe970e113e8cb44334bc6f56eef3f3498ee20db8ba2c0917"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler-core/src/erlang/echo.rs:82-88 | compiler-core/src/erlang/echo.rs:279-289 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/erlang/echo.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"b225ceaf692c047b709476c01e116451fcfe09e3b6fffa3efc480f17fa75324a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): language-server/src/server.rs:178-188 | language-server/src/server.rs:249-258 \u2014 both copies are in the same file, so extract the block 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":"language-server/src/server.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc4e1ec9fa5801fc9ca0d6b7947935d1b7dab94448e2b753655550e464c6ee35"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 8): compiler-core/src/warning.rs:296-306 | compiler-core/src/warning.rs:321-330 | compiler-core/src/warning.rs:342-350 | compiler-core/src/warning.rs:364-373 | compiler-core/src/warning.rs:411-420 | compiler-core/src/warning.rs:1085-1094 | compiler-core/src/warning.rs:1243-1252 | compiler-core/src/warning.rs:1580-1589 \u2014 all 8 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/warning.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"de5601ac288ff6967a69f7ede1c1153234bd507fd6872a04e206a73adb3155a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler-core/src/erlang/echo.rs:494-503 | compiler-core/src/erlang/echo.rs:570-577 \u2014 both copies are in the same file, so extract the block 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-core/src/erlang/echo.rs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"efc6befb1e85179751093afa1dd185c394ff9e7a8d2230feaed098d55e398dab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 9): compiler-core/src/warning.rs:605-613 | compiler-core/src/warning.rs:681-689 | compiler-core/src/warning.rs:709-718 | compiler-core/src/warning.rs:726-734 | compiler-core/src/warning.rs:742-750 | compiler-core/src/warning.rs:758-766 | compiler-core/src/warning.rs:817-825 | compiler-core/src/warning.rs:832-840 | compiler-core/src/warning.rs:1034-1042 \u2014 all 9 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/warning.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9612030fcc98b78b7b8831a161ae6960b64c1764d9edfe25273f0c1be8fd6be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): compiler-core/src/warning.rs:1088-1097 | compiler-core/src/warning.rs:1246-1255 | compiler-core/src/warning.rs:1563-1572 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/warning.rs"},"region":{"startLine":1088}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a06bf8da7773e2ac83592cd287eb41a731ce3ec55a5bcd2cd688ce4c99fe7e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): compiler-core/src/warning.rs:1067-1076 | compiler-core/src/warning.rs:1344-1353 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/warning.rs"},"region":{"startLine":1067}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bf9f74f00dd26d293fc185e4913e6c83bd3b128b36e0a591868172e78f6ab0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 5): compiler-core/src/warning.rs:555-564 | compiler-core/src/warning.rs:571-580 | compiler-core/src/warning.rs:589-598 | compiler-core/src/warning.rs:1070-1079 | compiler-core/src/warning.rs:1347-1356 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/warning.rs"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff871028e163592ef5fdfdadfd0152950e4ae5a66bcfa8ef85cfd0f351fff825"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 6): language-server/src/code_action.rs:9743-9750 | language-server/src/code_action.rs:10284-10291 | language-server/src/code_action.rs:10471-10478 | language-server/src/code_action.rs:10553-10562 | language-server/src/code_action.rs:12373-12380 | language-server/src/code_action.rs:13078-13085 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"language-server/src/code_action.rs"},"region":{"startLine":9743}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c5d46eb3f7325824284254c858a14a26894656b60699deb46dcdeddaed8d2a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5): compiler-core/src/warning.rs:798-807 | compiler-core/src/warning.rs:815-823 | compiler-core/src/warning.rs:830-838 | compiler-core/src/warning.rs:1031-1040 | compiler-core/src/warning.rs:1463-1471 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/warning.rs"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe4e263e881276de79ee936c27675e95e239b186257b196dc50f7c54dcd8dda7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 7): compiler-core/src/warning.rs:465-473 | compiler-core/src/warning.rs:535-543 | compiler-core/src/warning.rs:555-563 | compiler-core/src/warning.rs:571-579 | compiler-core/src/warning.rs:589-597 | compiler-core/src/warning.rs:1070-1078 | compiler-core/src/warning.rs:1347-1355 \u2014 all 7 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/warning.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"18d931b89d39ad4784d74cd2212f7ba3adb0be5f81c348df576ee1aad3ae0f77"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler-core/src/warning.rs:975-983 | compiler-core/src/warning.rs:1048-1056 \u2014 both copies are in the same file, so extract the block 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-core/src/warning.rs"},"region":{"startLine":975}}}],"partialFingerprints":{"codehealthFindingId/v1":"70469142c5bb06282d2f099777de0c1a497c0ff24c87776dd5c75c62020f49d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): language-server/src/code_action.rs:4748-4756 | language-server/src/code_action.rs:5402-5410 \u2014 both copies are in the same file, so extract the block 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":"language-server/src/code_action.rs"},"region":{"startLine":4748}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7e7533ac0e30196b45dc6a703a226b463c00c1d2382299657b8f2fa9be7ad0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler-core/src/type_/prelude.rs:467-475 | compiler-core/src/type_/prelude.rs:485-493 \u2014 both copies are in the same file, so extract the block 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-core/src/type_/prelude.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"19338f43575c37b1ae80e82972987c7651f0cc3ef0b0fe47c80d0b7da4322943"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler-core/src/erlang/echo.rs:625-633 | compiler-core/src/erlang/echo.rs:642-650 \u2014 both copies are in the same file, so extract the block 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-core/src/erlang/echo.rs"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8025dd9a35adaef74a00ac124ccfb21419614ad21022f27b0e1a1ba98535736"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler-core/src/parse/lexer.rs:991-998 | compiler-core/src/parse/lexer.rs:1021-1028 \u2014 both copies are in the same file, so extract the block 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-core/src/parse/lexer.rs"},"region":{"startLine":991}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2fc849c0705ce608b5742eae53368b78accbe356bbfe22048d9811b58d7b708"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler-core/src/erlang/echo.rs:521-528 | compiler-core/src/erlang/echo.rs:710-717 \u2014 both copies are in the same file, so extract the block 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-core/src/erlang/echo.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"73b3f1ac66b471b001a2d2b1cf7b943ba07690924f11fd6d8fce8be20faed265"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): language-server/src/code_action.rs:8718-8725 | language-server/src/code_action.rs:8816-8823 \u2014 both copies are in the same file, so extract the block 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":"language-server/src/code_action.rs"},"region":{"startLine":8718}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc4525e39ca8cf22a1ad604e65ade6146c0fe86021a3708c049a75066c4288ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler-core/src/erlang/echo.rs:73-79 | compiler-core/src/erlang/echo.rs:148-155 \u2014 both copies are in the same file, so extract the block 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-core/src/erlang/echo.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffa8eae98fffd469d6a5d33fbcae27d3050060a59ef7e04770c1adaa6519d6b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler-core/src/erlang/echo.rs:321-328 | compiler-core/src/erlang/echo.rs:894-901 \u2014 both copies are in the same file, so extract the block 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-core/src/erlang/echo.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c0586e5cf925bae27ce1bf3d794a9accce11f6391fc2b2b09813b810e8d14d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): compiler-core/src/erlang/echo.rs:1467-1474 | compiler-core/src/erlang/echo.rs:1540-1547 | compiler-core/src/erlang/echo.rs:1610-1617 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/erlang/echo.rs"},"region":{"startLine":1467}}}],"partialFingerprints":{"codehealthFindingId/v1":"faafcc9fd673e8e6b2db9e8c54ac25d93fbce8174b6fb811444c756af20b86f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): language-server/src/code_action.rs:3477-3484 | language-server/src/code_action.rs:4234-4241 | language-server/src/code_action.rs:9080-9087 | language-server/src/code_action.rs:11068-11075 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"language-server/src/code_action.rs"},"region":{"startLine":3477}}}],"partialFingerprints":{"codehealthFindingId/v1":"aab155d68be00380fcb9cdf1e7ea59258fdfbd145c0d6361a082da4672bbe1ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 12): language-server/src/code_action.rs:1774-1781 | language-server/src/code_action.rs:3040-3047 | language-server/src/code_action.rs:3190-3197 | language-server/src/code_action.rs:4425-4432 | language-server/src/code_action.rs:7868-7875 | language-server/src/code_action.rs:8267-8274 | language-server/src/code_action.rs:8496-8503 | language-server/src/code_action.rs:8721-8728 | language-server/src/code_action.rs:8819-8826 | language-server/src/code_action.rs:10080-10087 | language-server/src/code_action.rs:10621-10628 | language-server/src/code_action.rs:12137-12144 \u2014 all 12 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"language-server/src/code_action.rs"},"region":{"startLine":1774}}}],"partialFingerprints":{"codehealthFindingId/v1":"746f262d959f659f0d31a6ee50aac4cae6926eb0cf0226220195082357e028d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): language-server/src/code_action.rs:9575-9582 | language-server/src/code_action.rs:9626-9633 \u2014 both copies are in the same file, so extract the block 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":"language-server/src/code_action.rs"},"region":{"startLine":9575}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c62a5a90de4f1d61a5c0124636fb17ccb7e1012e72c2993085a91b618d753d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler-core/src/erlang/echo.rs:1020-1027 | compiler-core/src/erlang/echo.rs:1624-1631 \u2014 both copies are in the same file, so extract the block 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-core/src/erlang/echo.rs"},"region":{"startLine":1020}}}],"partialFingerprints":{"codehealthFindingId/v1":"2499e237dbe75922848a634f1abc56a7cc99960094002526b29fc39d2bdc698e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler-core/src/erlang/echo.rs:1205-1210 | compiler-core/src/erlang/echo.rs:1268-1274 \u2014 both copies are in the same file, so extract the block 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-core/src/erlang/echo.rs"},"region":{"startLine":1205}}}],"partialFingerprints":{"codehealthFindingId/v1":"77a1f69c0fd174218a61b19318491a7f75e205811c398d50e17004263cf635e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): compiler-core/src/erlang/echo.rs:523-529 | compiler-core/src/erlang/echo.rs:712-718 | compiler-core/src/erlang/echo.rs:848-854 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/erlang/echo.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6ef54348fce31bc91f0b516ec9bfd5968095233e109d681f61346187398f1db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler-cli/src/fs.rs:689-694 | compiler-cli/src/fs.rs:703-707 \u2014 both copies are in the same file, so extract the block 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-cli/src/fs.rs"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7c1ead6e519e79f6ef6c566ed0c35ae44ba77170f4c614774caef92b0531541"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): compiler-core/src/erlang/echo.rs:1419-1424 | compiler-core/src/erlang/echo.rs:1643-1648 \u2014 both copies are in the same file, so extract the block 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-core/src/erlang/echo.rs"},"region":{"startLine":1419}}}],"partialFingerprints":{"codehealthFindingId/v1":"c412ed297da2949ad0b35f67864b3e4daee56c8f1622b099f01f3779adaf4a80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler-cli/src/hex.rs:39-43 | compiler-cli/src/hex.rs:102-106 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-cli/src/hex.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"e679b90510126882a9d059210ec869bdb3ed3fc5ff8ca37cafcd6bf52ab4eb6d"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: erlang-term-format: erlang-term-format: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"4672ba70d1e95960f81d7faf77920680f90ef89489c749bbfbc954fa9f6eb276"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: src-span: src-span: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 4 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e732bb4da2ebaefa81d4f38782c2d1eed15ee0e98a75869056f9e75537632f10"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: hexpm: hexpm: abstractness 0.05, instability 0.00, distance 0.95 \u2014 zone of pain \u2014 concrete and depended on by 4 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"190b3a62a68cac7899b35a4906db40949cde487853be708918af2b064b1317bd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler-core/src/error.rs: compiler-core/src/error.rs changed 30 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 160 in gleam_core::error::failed_module_diagnostics at line 2772. 5 of those changes were fix/bug commits, and the other 25 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-26 12:15:17 \u002B01:00\u0027 --until=\u00272026-10-24 12:15:17 \u002B01:00\u0027 --full-history --no-merges -- compiler-core/src/error.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/error.rs"},"region":{"startLine":2772}}}],"partialFingerprints":{"codehealthFindingId/v1":"03c75e965559c18ba5f6cc1636a23ed31663b74ec08d6a65758f2162e249ed57"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler-core/src/parse.rs: compiler-core/src/parse.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 47 in Parser::parse_expression_unit at line 518. 3 of those changes were fix/bug commits, and the other 21 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-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-26 12:15:17 \u002B01:00\u0027 --until=\u00272026-10-24 12:15:17 \u002B01:00\u0027 --full-history --no-merges -- compiler-core/src/parse.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/parse.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"c11e9f2191c810a226b90a3041d6291dc112205dd899f86adedf27792c68dff5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler-core/src/erlang.rs: compiler-core/src/erlang.rs changed 33 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in FunctionGenerator::expression at line 881. 7 of those changes were fix/bug commits, and the other 26 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-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-26 12:15:17 \u002B01:00\u0027 --until=\u00272026-10-24 12:15:17 \u002B01:00\u0027 --full-history --no-merges -- compiler-core/src/erlang.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/erlang.rs"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eedcdb21bc84869a0fdd6bdcd774673fb245eb80102e5f3fafdfb588a128b2c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler-core/src/type_/expression.rs: compiler-core/src/type_/expression.rs changed 34 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in gleam_core::type_::expression::static_compare at line 5012. 3 of those changes were fix/bug commits, and the other 31 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-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-26 12:15:17 \u002B01:00\u0027 --until=\u00272026-10-24 12:15:17 \u002B01:00\u0027 --full-history --no-merges -- compiler-core/src/type_/expression.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/type_/expression.rs"},"region":{"startLine":5012}}}],"partialFingerprints":{"codehealthFindingId/v1":"baed8d35f57848280b5ee1bde18d39ba625d6d316aa90db7396a614c7c86d3e1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler-cli/src/lib.rs: compiler-cli/src/lib.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in Command::run at line 457. 5 of those changes were fix/bug commits, and the other 16 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-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-26 12:15:17 \u002B01:00\u0027 --until=\u00272026-10-24 12:15:17 \u002B01:00\u0027 --full-history --no-merges -- compiler-cli/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-cli/src/lib.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"059eeadf753e91acea919adbd75e658a6cee8276cdeb74e082b0ee705ba577f6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: language-server/src/reference.rs: language-server/src/reference.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in gleam_language_server::reference::reference_for_ast_node at line 90. 1 of those changes was a fix/bug commit, 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-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-26 12:15:17 \u002B01:00\u0027 --until=\u00272026-10-24 12:15:17 \u002B01:00\u0027 --full-history --no-merges -- language-server/src/reference.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"language-server/src/reference.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"32d34a7e3b29513e6ca80f8095d75c4c7fa9fffc6e836fba0e0f9b8e01d7eb11"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler-core/src/type_/constant.rs: compiler-core/src/type_/constant.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in ConstantTyper::do_infer at line 45. 3 of those changes were fix/bug commits, and the other 8 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-26 12:15:17 \u002B01:00\u0027 --until=\u00272026-10-24 12:15:17 \u002B01:00\u0027 --full-history --no-merges -- compiler-core/src/type_/constant.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/type_/constant.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"14034e766881ed02eb7e7df9ff79e72510b7eccfd1473d794217aabf83bb48d2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler-core/src/javascript/expression.rs: compiler-core/src/javascript/expression.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in Generator::constant_expression at line 2671. 3 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-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-26 12:15:17 \u002B01:00\u0027 --until=\u00272026-10-24 12:15:17 \u002B01:00\u0027 --full-history --no-merges -- compiler-core/src/javascript/expression.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/javascript/expression.rs"},"region":{"startLine":2671}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d16c0fdad9d30a1af0864d6cb08e98e6e74bf538b5ddb0173b1e818fcb5895f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: erlang-generation/src/lib.rs: erlang-generation/src/lib.rs changed 28 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in ErlangBinaryBuilder::bit_array_segment_specifiers at line 4745. 2 of those changes were fix/bug commits, and the other 26 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-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-26 12:15:17 \u002B01:00\u0027 --until=\u00272026-10-24 12:15:17 \u002B01:00\u0027 --full-history --no-merges -- erlang-generation/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"erlang-generation/src/lib.rs"},"region":{"startLine":4745}}}],"partialFingerprints":{"codehealthFindingId/v1":"871531a334eec01778a0979ea47507cffe18478ddcf9a9a3a840fa5e25e89112"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler-core/src/warning.rs: compiler-core/src/warning.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 99 in Warning::to_diagnostic at line 271. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-26 12:15:17 \u002B01:00\u0027 --until=\u00272026-10-24 12:15:17 \u002B01:00\u0027 --full-history --no-merges -- compiler-core/src/warning.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/warning.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f0cc5bd30334f4c7eddc1908489672120fa1e16c18774ea2fa1cb2d51a54230"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler-core/src/type_/pattern.rs: compiler-core/src/type_/pattern.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 49 in PatternTyper::unify at line 671. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-26 12:15:17 \u002B01:00\u0027 --until=\u00272026-10-24 12:15:17 \u002B01:00\u0027 --full-history --no-merges -- compiler-core/src/type_/pattern.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/type_/pattern.rs"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"38c7d2943ab254c73622e19ecb9ed1685341ccc3aa054b213d2987159e4f353b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler-core/src/exhaustiveness.rs: compiler-core/src/exhaustiveness.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in Branch::move_unconditional_patterns at line 222. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-26 12:15:17 \u002B01:00\u0027 --until=\u00272026-10-24 12:15:17 \u002B01:00\u0027 --full-history --no-merges -- compiler-core/src/exhaustiveness.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/exhaustiveness.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb44c8de1493df01412fa99ee3e16cd2d2a0dc99dd1129abbe911d0acbdef862"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: language-server/src/engine.rs: language-server/src/engine.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in LanguageServerEngine::hover at line 1350. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-26 12:15:17 \u002B01:00\u0027 --until=\u00272026-10-24 12:15:17 \u002B01:00\u0027 --full-history --no-merges -- language-server/src/engine.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"language-server/src/engine.rs"},"region":{"startLine":1350}}}],"partialFingerprints":{"codehealthFindingId/v1":"e38d782f2a542c406748369172f266beb4114f8a83f03e7c288e2f41b65703f1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: format/src/lib.rs: format/src/lib.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in Formatter::expr at line 1268. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-26 12:15:17 \u002B01:00\u0027 --until=\u00272026-10-24 12:15:17 \u002B01:00\u0027 --full-history --no-merges -- format/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"format/src/lib.rs"},"region":{"startLine":1268}}}],"partialFingerprints":{"codehealthFindingId/v1":"65bed8ad53101b40fe40cca9f8c6662586545192de10dd886475526f2147f76b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler-core/src/analyse.rs: compiler-core/src/analyse.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in ModuleAnalyzer::infer_module at line 215. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-26 12:15:17 \u002B01:00\u0027 --until=\u00272026-10-24 12:15:17 \u002B01:00\u0027 --full-history --no-merges -- compiler-core/src/analyse.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/analyse.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"367a9e5baa5db126d821753875a0e87dd278caba04ec704a641045373a4670b1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler-core/src/type_/guard.rs: compiler-core/src/type_/guard.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in GuardTyper::do_infer at line 30. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-26 12:15:17 \u002B01:00\u0027 --until=\u00272026-10-24 12:15:17 \u002B01:00\u0027 --full-history --no-merges -- compiler-core/src/type_/guard.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/type_/guard.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ab66ba6d717455b92fc939a7535a31409f9ef6b2964fc0482fa3b3bf4e3214d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler-core/src/erlang/pattern.rs: compiler-core/src/erlang/pattern.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in PatternGenerator::pattern at line 131. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-26 12:15:17 \u002B01:00\u0027 --until=\u00272026-10-24 12:15:17 \u002B01:00\u0027 --full-history --no-merges -- compiler-core/src/erlang/pattern.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/erlang/pattern.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"b66ec9228a1b7f2c721a2be5afb83c077dc70efe4e6ac7e851634030fdccf387"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler-core/src/javascript.rs: compiler-core/src/javascript.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in Generator::compile at line 201. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-26 12:15:17 \u002B01:00\u0027 --until=\u00272026-10-24 12:15:17 \u002B01:00\u0027 --full-history --no-merges -- compiler-core/src/javascript.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/javascript.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c0bc6036c2846beed55306acb293386c14a3fb200552e06b9a0a02b0abd6691"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler-core/src/javascript/decision.rs: compiler-core/src/javascript/decision.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in CasePrinter::switch at line 555. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-26 12:15:17 \u002B01:00\u0027 --until=\u00272026-10-24 12:15:17 \u002B01:00\u0027 --full-history --no-merges -- compiler-core/src/javascript/decision.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/javascript/decision.rs"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e0e94bb357343b4484676efa7ef69a1160a07417849e904b2f1fc956f9dfb47"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler-core/src/ast_folder.rs: compiler-core/src/ast_folder.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in UntypedExprFolder::walk_expr at line 370. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-26 12:15:17 \u002B01:00\u0027 --until=\u00272026-10-24 12:15:17 \u002B01:00\u0027 --full-history --no-merges -- compiler-core/src/ast_folder.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/ast_folder.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"576b46f6af29a755b4b664b21501f7d9202a55c9860fd49db85563f485c2874d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler-core/src/parse/error.rs: compiler-core/src/parse/error.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in LexicalError::to_parse_error_info at line 897. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-26 12:15:17 \u002B01:00\u0027 --until=\u00272026-10-24 12:15:17 \u002B01:00\u0027 --full-history --no-merges -- compiler-core/src/parse/error.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/parse/error.rs"},"region":{"startLine":897}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e93b5ac74e692ba41958cade05377da63d5c7b298868bc641a8d5cf6319c5fd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pretty-arena/src/lib.rs: pretty-arena/src/lib.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in pretty_arena::format at line 1184. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-26 12:15:17 \u002B01:00\u0027 --until=\u00272026-10-24 12:15:17 \u002B01:00\u0027 --full-history --no-merges -- pretty-arena/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pretty-arena/src/lib.rs"},"region":{"startLine":1184}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f25c5682c509a25e03b5668c6277aa69d164fd0c239c09a54d82a783f721ecf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler-core/src/type_/hydrator.rs: compiler-core/src/type_/hydrator.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in Hydrator::type_from_ast at line 114. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-26 12:15:17 \u002B01:00\u0027 --until=\u00272026-10-24 12:15:17 \u002B01:00\u0027 --full-history --no-merges -- compiler-core/src/type_/hydrator.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/type_/hydrator.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"2218ace39277170173482484395b7e75c1aa70030f325d4f6cda39a49c419b8d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: hexpm/src/version/lexer.rs: hexpm/src/version/lexer.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in Lexer::next at line 212. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-26 12:15:17 \u002B01:00\u0027 --until=\u00272026-10-24 12:15:17 \u002B01:00\u0027 --full-history --no-merges -- hexpm/src/version/lexer.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hexpm/src/version/lexer.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"83df370bcd2ffa024f7b9d03b3ba4e3d06c3a9e6b686fa9b3b74d56426040cce"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 3 significant file(s) lose their only recent owner: erlang-term-format/src/tests.rs, compiler-core/src/tests.rs, compiler-cli/src/text_layout.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"55d6f015e1b9d40c7df677c0ed4b6d5ffbfb367c7dded633214f1e786402fb05"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 1 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 (4 single-owned of 144 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; 144 of the 162 production source files in this repository met that bar). They are anonymized user #2 (1 file(s)) \u2014 spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: hexpm/src/version/tests.rs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"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":"language-server/src/code_action.rs"},"region":{"startLine":2897}}}],"partialFingerprints":{"codehealthFindingId/v1":"47299c6ee03d7988fec812145196c3b9d9cffa0ed30922f4a0eea14ae2c7d21d"}},{"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":"language-server/src/code_action.rs"},"region":{"startLine":6607}}}],"partialFingerprints":{"codehealthFindingId/v1":"136174f6104f5ee3e2f3342348b60b62b2821abdf8b981ca76daff1020c73575"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: ///     _ -\u003E 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":"language-server/src/code_action.rs"},"region":{"startLine":9776}}}],"partialFingerprints":{"codehealthFindingId/v1":"279eb3be9dcbeeec1fe6f41742273d7de1790271aee98d16df39778e33893891"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //   _, _ -\u003E 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":"language-server/src/code_action.rs"},"region":{"startLine":10379}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e6bcc143cffb721d583effebe03f0521d6bd60c673182dbeb426fdc9657daf3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: ///   _ -\u003E 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":"language-server/src/code_action.rs"},"region":{"startLine":12043}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab7154cc38277ff8955660e5580a880565b8835d4dfca0580139aa78fc5cbf08"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: ///   _ -\u003E 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":"language-server/src/code_action.rs"},"region":{"startLine":12064}}}],"partialFingerprints":{"codehealthFindingId/v1":"c209382a047ec29bf6693de6cfa824ae3ad2ff6839f525f831b196e968730194"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: ///   _ -\u003E 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":"language-server/src/code_action.rs"},"region":{"startLine":12081}}}],"partialFingerprints":{"codehealthFindingId/v1":"2006b99779b060e00364ffc6caa5af5f64a0a2830edbcf3d1f8dc0e889f0b692"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: ///   _ -\u003E 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":"language-server/src/code_action.rs"},"region":{"startLine":12099}}}],"partialFingerprints":{"codehealthFindingId/v1":"25dc91a5ae85429ea17ef0c3d5a8d6e81652fb37d6fc436fe86ef8451cae2e69"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: ///   _ -\u003E 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-core/src/exhaustiveness.rs"},"region":{"startLine":1228}}}],"partialFingerprints":{"codehealthFindingId/v1":"eab776f5e0013dc290b26ed2a643d89632f194bdf05ef26d26d7a2548e3dec20"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: ///   _ -\u003E 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-core/src/exhaustiveness.rs"},"region":{"startLine":2179}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d150697b7fb4a68d4e643d4f20786c0534388e89b2c75600c59377e12c82131"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: ///   _ -\u003E 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-core/src/exhaustiveness.rs"},"region":{"startLine":2211}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2db5b4d27255bb4b6c2d15cd4c439de3d8e566989ba944b532d381650815806"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: ///   _ -\u003E 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-core/src/exhaustiveness.rs"},"region":{"startLine":2343}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcd9a8edc0b64d9ec5157617b020ec876c5083e0060094cf36097731c87acb88"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: ///   _ -\u003E 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-core/src/javascript/decision.rs"},"region":{"startLine":1402}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d742b392dd7721f64f4bf96255a9306aa80103efe9f05d80c645f455267e894"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: ///   _ -\u003E 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-core/src/javascript/decision.rs"},"region":{"startLine":2377}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5c15f0ed0d64bc279ed3ad3d5ed525bf15a98cf11961604351271c34d4b0b93"}},{"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":"language-server/src/engine.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9090ebeb1b991dc5dfdc50af10b19e335bc2ddaa220558184855d26f1da3cad"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: test. Ensure hover doesn\u0027t report as compiled \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"language-server/src/engine.rs"},"region":{"startLine":1335}}}],"partialFingerprints":{"codehealthFindingId/v1":"25208744441597f405ef6369e8e1efcb5fe07db074bea0ae3bed0737783ab5bc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: hover for statement \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"language-server/src/engine.rs"},"region":{"startLine":1364}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ab0297d1f4689d029a9b2d59849f4fbffc428f54a40b89e91603b17182e6bb4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: avoid clobbering warnings. They should be preserved rather than \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"language-server/src/feedback.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0886b0ec7236c01fe0e8b49e2b2176451cf93bf8a329ac0580c698b24b7bb68"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Redesign the diagnostic type so that we can be sure there is always \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"language-server/src/server.rs"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7746e24a3894fa141c0197063fb92595ba0e7365703729d6fe15c6cfc0f04bb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Borrow? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hexpm/src/version/parser.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"586ee7b72614a9fdf99010a23e0377a1eb4306d73f835481b2f4df0e936086d3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo to make it explicit it has an unimplemented callback. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"format/src/lib.rs"},"region":{"startLine":1209}}}],"partialFingerprints":{"codehealthFindingId/v1":"04213af808629ec3d009a53a1ee5ed1095efe54a3abbc813faa930c85237d53b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //   -\u003E 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":"format/src/lib.rs"},"region":{"startLine":2641}}}],"partialFingerprints":{"codehealthFindingId/v1":"999e223552b272a7ce287565c1d90c70372d344e18011e1235215df2d3b33a05"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //   | _, _ -\u003E 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":"format/src/lib.rs"},"region":{"startLine":2716}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bd1c95cdb637d0f33e8980def0d7592e881952decdf10ba8b1715f155cd791f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo as \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"format/src/lib.rs"},"region":{"startLine":3875}}}],"partialFingerprints":{"codehealthFindingId/v1":"de0a4cae0efae83ab94ac1f32d9571832454c09f58fd27c6dff293d527c238d8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo as \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"format/src/lib.rs"},"region":{"startLine":3937}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ae756d394eae969dac95e077c17fed3bce3d7bb21bce2e0a601315be7869cec"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// todo as \u0022message\u0022 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"format/src/lib.rs"},"region":{"startLine":4046}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc1aae0b41badfcc23d665af40a14e5d69a846275ef01a0d4386577716404c34"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: improve. This is too wide \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"format/src/tests.rs"},"region":{"startLine":4081}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b571d6eb4f7afff13d138b70e56a2300458571f76b9c4b52ca867c0f3fe30f5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: we could explore using ATOM_CACHE_REF in future. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"erlang-term-format/src/lib.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"e14cadf16f08b0e8314476d340aa7fb97fe828a15fc517683bdecf4b3d748ab0"}},{"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":"erlang-generation/src/lib.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"984547a8046a7b4b4ba01586053dd84760b7ca66f183752773baef988a8e92b0"}},{"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":"erlang-generation/src/lib.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"da8026bc10655dd254312df1ec5176b7474c52e9adfee166405687b4c26675aa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove this clone \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/analyse.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4937d6f5c183aac79b1d29291cf0eab70162d428933b3dad4ea9ec2108f4054"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Extract this into a class of its own! Or perhaps it just wants some \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/analyse.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0b3f7a8c6f38a4ff5e6c4c23265ebbad85e94366e676e8419081b02d7360676"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: split this into a new 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-core/src/analyse.rs"},"region":{"startLine":966}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aaaeac1760279b748dabc83b09f9bcccfac2e1e19242977742cec1ecee21daa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: improve the ownership here so that we can use 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-core/src/analyse.rs"},"region":{"startLine":1323}}}],"partialFingerprints":{"codehealthFindingId/v1":"94edd3630fbf3b7e2002e9dc4d08817b7683233c28811a02067a5269d4fda812"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: When precompiling for production (i.e. as a precompiled hex \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/codegen.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aac39064840845b4922ab6165a7a8b225ad9de6291869095939b1be27c56ee4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: test 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-core/src/codegen.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c8add1334df03357cb255e35e2732779fe21da0e02c76791d4d63c0efdba409"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: split this into locationed diagnostics and locationless diagnostics \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/diagnostic.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c6b9da7aa2c61813fc971ea567421621d2496211ca478b12600c1c895eb3233"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: parse markdown properly and extract the text nodes \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/docs.rs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3a8cbc0041fd8ddf35f3465120dca9706b900e63e8913aa08041383549a3def"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // Todo, panic, and echo. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/erlang.rs"},"region":{"startLine":1114}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a175f3b6c047a730d964a15d14623badd4fc2694c7687b18e7cbdb0396e5e16"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: be more precise. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/error.rs"},"region":{"startLine":3813}}}],"partialFingerprints":{"codehealthFindingId/v1":"4456b7421a9d7f6c2ade3a6988478dcf3d3a61bcd67f5ae2d661ebbc6440b9c1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We could also implement the interfering optimisation for \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/exhaustiveness.rs"},"region":{"startLine":1431}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef809bb29c5a301a010a0ab2c5295c3a5a9e5e2665ba26d985983bd877c38a06"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: The reader types are restrictive here. We should be more generic \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/io.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"b080cb52a9284cd31f503a04b01670fa7daa1d54b2c0f292c83c85f126752b7b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: strip shared prefixed between current module and imported \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/javascript.rs"},"region":{"startLine":1000}}}],"partialFingerprints":{"codehealthFindingId/v1":"b82b49f1204d64daaf41049e9272f6a81c709231a9218af238697c0cf294b647"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: strip shared prefixed between current module and imported \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/javascript/typescript.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"63b2865e5a635520cfd547dc0d9470876d43301ee89794be4b491837c4f26ad4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: enable once the false positive bug is solved \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/lib.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f497ccdb5d1410ae4c952f4789bb7b9d574babc879595267095eb3e01ad183c"}},{"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":"compiler-core/src/lib.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0b5431cef4bbe6ba26ca597c51613ddc345860077ec3a187caf471c9a0e4aa3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This branch should be \u0060unreachable!()\u0060 but because of \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/package_interface.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"93caf073d0e87daf8c2bce781eb1bfe42e85b65aae3b53113f1131881d65ef86"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: specialise this to just List. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/type_.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"63c80e38d7db5762afc31a9186b6b9852c8dd2e24a506223bf023f217bfc91fd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: smaller int. Doesn\u0027t need to be this big \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/type_.rs"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"047576b839eeeffb941658c6d2b8d1ed33be85a1e8b2098371b413e74e5748c1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove this clone with an rc clone \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/type_.rs"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaf24de48471b08375ac6d78bd9cf7655d4d81099d2ccf847bede78304c7780c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: ///   [..] -\u003E 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-core/src/warning.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"21626b262845482f641be015ae26b0d036c7ee1a700ab3e043879d877865f0b3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: in future we might want to make this more fault tolerant and \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/type_/constant.rs"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"a641ba6593e5231e8a443b3025a8809e79add567c14b787634d9e6806a55d3be"}},{"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":"compiler-core/src/type_/error.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd90387bd91a68554564b5efea17ca374a27f4356e056ddd93fc326ad7e6d65a"}},{"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":"compiler-core/src/type_/error.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"321b6adf4691b8b60c6c2c698eb8f2225a9f467dd46f279d4fc195981f71eec7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// todo(\u0022this won\u0027t appear in the error message\u0022) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/type_/error.rs"},"region":{"startLine":1149}}}],"partialFingerprints":{"codehealthFindingId/v1":"935edc004538a724bf05f5de22ea2db12831ec8fff8ab8c49c4b18f8f06e7fdd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: is this clone avoidable? we need to box the record for inference in both \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/type_/expression.rs"},"region":{"startLine":1436}}}],"partialFingerprints":{"codehealthFindingId/v1":"96f4524bd96e8817001c660b35cd15ee8e92a217223496374d4e8b8ee0618415"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //   _ -\u003E 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-core/src/type_/expression.rs"},"region":{"startLine":2378}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1f63a53de4d5f242ec274e1cbf99db01c9feb0c5f50a00a05d3843aa2226ea9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //   _ -\u003E 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-core/src/type_/expression.rs"},"region":{"startLine":4766}}}],"partialFingerprints":{"codehealthFindingId/v1":"87cf978f793fe832fdfcbac7109ac631094054b5be65dae92fd154de3d42134d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //   _ -\u003E 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-core/src/javascript/decision.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"da5e79e03687eec45a122ee2de75508160920696fef4b7ec6e72961cfae7fe75"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: For complex expressions we just give up, maybe in future 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-core/src/type_/expression.rs"},"region":{"startLine":5229}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aafa96d884245f8853d48d747c160b72a8879b339bde46eee5ef15203d5aa02"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use \u0060.with_unify_error_situation(UnifyErrorSituation::PipeTypeMismatch)\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-core/src/type_/pipe.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e31b4882b5a8b076a62ccaf7f5880b7e4ec9e215411d2c4b808534b8e0cfaee"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use \u0060.with_unify_error_situation(UnifyErrorSituation::PipeTypeMismatch)\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-core/src/type_/pipe.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa78175d0879deb86a9ef6de9e0d78014b73f7e32830cae9e0dedbb78d08157f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: have this function return a Document that borrows from the 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-core/src/type_/pretty.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf3abe6859996401ca9b56b1fa384357440dc16bafd09ccd881d633cff46deb9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: indicate that the module is not import and as such \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/type_/printer.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a819c61841a7506ed2adddce8b17b4d6d31eac8e10ae800c6cd97b5a57cc96a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Currently we do this here and also in the tests. It would 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":"compiler-core/src/type_/tests.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"11ce8426fe9c96dbb7caa592967d7e262ed027984279a53632bd8769b7630967"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Currently we do this here and also in the tests. It would 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":"compiler-core/src/type_/tests.rs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc206c99dc728287e206015da62feaa3da097166383cdd9f418c60a7f57bdd63"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Currently we do this here and also in the tests. It would 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":"compiler-core/src/type_/tests.rs"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1691d515c1a68b8ee336323c255446699ddb56206e93ef215aa095760fbbd5a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Currently we do this here and also in the tests. It would 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":"compiler-core/src/package_interface/tests.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dfc084c5262f30bf6933fe746e815be1f8cf6c859c19b31ea820da7710edae6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Currently we do this here and also in the tests. It would 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":"compiler-core/src/javascript/tests.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"96ae91f326cb2988384a7ee4fb89368dfb7b95eb919ee0e0412122c05de6ee72"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Currently we do this here and also in the tests. It would 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":"compiler-core/src/erlang/tests.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b4c2fbeca7d046e73bb50c851c497628c7ba8fa14dc92e42813c4541edc6e0a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Currently we do this here and also in the tests. It would 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":"compiler-core/src/build/package_compiler.rs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f77925a684ec968ced4cb3209c28b181a202b6a16dc7bc178a0b11bf195f5c0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Currently we do this here and also in the tests. It would 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":"compiler-core/src/ast/tests.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"8076b3525f3702c123996ec43f09a750af992b55e5672b84d5898567fe68174b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Currently we do this here and also in the tests. It would 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":"compiler-core/src/ast/tests.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"833528ef97c89b7b16f666434f490b6f0689990c52d0bbd8043529f8f61dadf1"}},{"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":"compiler-core/src/type_/tests.rs"},"region":{"startLine":966}}}],"partialFingerprints":{"codehealthFindingId/v1":"99dc9522599ca633b549ec451c9e87cae13d265246bb2cd5e7340f6ef19962e8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: all the bits above are basically copy pasted from the JavaScript \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/package_interface/tests.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbecc72d104e0df5ecabc1b1c19158bb2cdf4f3863990098ebf8e4e5c89e6be7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: 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":"compiler-core/src/javascript/expression.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e03b389b2814acb6f8db61b61f5f329a58db50f9558a89b400e4234286a108b"}},{"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":"compiler-core/src/io/memory.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"61f69b6d763a892c376d252c994f7f340c43f701c2c291b438b16559359a629c"}},{"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":"compiler-core/src/io/memory.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"53bb3cb9fa2dd7433cd08b8333a660367f420630b0a868f6f7bc3e89cece1a18"}},{"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":"compiler-core/src/ast/visit.rs"},"region":{"startLine":889}}}],"partialFingerprints":{"codehealthFindingId/v1":"91368bbc7100f6eca27451a73f9bb19f4258406b3afc96492f426b08278e2e91"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: we should be able to generalise \u0060id\u0060 and we should be \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/erlang/tests.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac0f34c8554620228142e5565fa0ca530f984137542c82096bc9af00d0667843"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: test \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/build/elixir_libraries.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe189bc505ea654eef790bc157baafe51f6c65b2d5c6ed55993d8ce804da5efc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: test \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/build/project_compiler.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e5a2b043d62549d334f3bf706923b361c8baea0da4db327c335d3d12ae439b6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: test \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/build/project_compiler.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"93164f0bf8f673fea284cf6d00c9b2d31334278bec10119a1e77daf17242eb05"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: test \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/build/project_compiler.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"321e080013f1b119950a06773b41090189770a8fd3955ef4d7263e620d6f1be8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: test \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/build/project_compiler.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e9b5b7fe03ed48e7b7453d71c34b9f7223d729b26f793bc37398d10c6a521c9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: test \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/build/project_compiler.rs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e5b34b651c4a48ca79e0a690fd4b9c764cd007ddbff6b0cf8b4e5ad5e86cf87"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: test \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/build/project_compiler.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc6d7678ed1f0b18727568d8ebbba1d934f3e0edbd87cc8900ef50cb3f9f668f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: test \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/build/project_compiler.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcf4b19456667e5c8e0c8af2cfcc66ea532a4aa90541bc86d5eb71e8251e077e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: test \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/ast/typed.rs"},"region":{"startLine":835}}}],"partialFingerprints":{"codehealthFindingId/v1":"a43386950fbd55a0ff9cbb6617418e550465febcc1af3a3396bc3d38a1ca6655"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: test \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/ast/typed.rs"},"region":{"startLine":839}}}],"partialFingerprints":{"codehealthFindingId/v1":"e28d564d41df693bef073a6664fa26b811be2813f70b1d9770de2d53d7882b07"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: test \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/ast/typed.rs"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f7c33ddb428dcdf2b107d9b55188735cc0465e27fb64879d0e4a8a1b6aac312"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: test \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-cli/src/dependencies.rs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d9b3ea4d9be974defc4305a29b53352ac9bf7c8dbb7c18dbfbf5221a7cb35eb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: test \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-cli/src/dependencies.rs"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c51fcbf7f604c2cf41491ba2f9c57471dfed8a370a65994c9e7dd8649311556"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: test \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-cli/src/publish.rs"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"02cf9d4a40afd25188144e4beb0d623d089d0b9eabe76d7dc5bbb5e8373f5e4b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: test \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-cli/src/dependencies/dependency_manager.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5d8d77eab57463880d139503b946351640bdde069cc87a52c3f3f389c10653d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: unit test \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/build/elixir_libraries.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"d871ea8a0807258b5815f7132f978f7c8ac93754e79a5f63b668d25fdfb8cfb9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: unit test \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/build/package_compiler.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"49122386747d4ac2839acdb88ebbedd79c0ad3326df537cbd895cece53365e26"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: unit test \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/build/project_compiler.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"f82358828f7dd830654f461d18b1ce30ce54f9f869843d4954838ec435476e32"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: unit test \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/build/project_compiler.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5fd72dabe2972732ac9c1684e6180244773c5792e10fa4abed17bc15fea0857"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: return the cached modules. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/build/package_compiler.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a907b4c22aa3de27f614be2724eb48c5a928c2c6b93a4cfa8d99a13a9205c86"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: emit warnings for cached modules even if they are not compiled again. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/build/package_loader.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff2d254893928c3550eb31d1e4ae23d10d1f26af80bbe3e12232e64296a54703"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: test that tests cannot be imported into src \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/build/project_compiler.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"f75cd392bacbb094206d49c963845dbbf440c94ae7a4baa9c32c368e762898ea"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: test that dep cycles are not allowed between 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-core/src/build/project_compiler.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"823ed13e58bdac0d7815de62e092097dfa406b4c3cc18352e20b4c7d2cf6858b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We could remove this clone if we split out the compilation of \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/build/project_compiler.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"a02d0d08392f42192a18e98d34359818a185a2bf8aaceacbdcf2e559f75fed81"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: test. This one is not covered by the integration 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":"compiler-core/src/build/project_compiler.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc062032fa7ee90040dc8d24c8f915a8532769d029c8e1e9de6a22295e2b029c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: extract and unit test \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/build/project_compiler.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"e34365244e5a35fcf23f17dff9227888cdddaea7091a249ad77fff7993ca45c1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/build/project_compiler.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a858d01f003a9df7d11ebe9eede537a4ee0f331b131587093ac906afe05529d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: definition \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/ast/typed.rs"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4651b3f03be1011af58ceaacaa0920821d5121ffea65420d3f50d022ec0db2d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: create new variant for captures specifically \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/ast/untyped.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7a9be26d4e847ccfeecc6b641de71ec0b0da59f53fde54ddb965c8ada76195c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We should also visit the typed patterns!! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/ast/visit.rs"},"region":{"startLine":1816}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ffa450ffe3686a90ee3c0617deeeb8332f1ed069ac47017af16e36d06e3e8ed"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: % TODO: This line can likely be removed if/when the build directory is cleaned before every compilation. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060% REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-cli/templates/gleam@@compile.erl"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"06fec938178c8f80ed9ced91b97f7a87ccb42c5bd869b6bd821835dd36a83f28"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: An example of the project in 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":"compiler-cli/src/new.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"19ce43e8ff714cdc9ffd47b99cb53e7b1ab260aba242188f142387535e720143"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: If any of the modules in the package contain a leaked internal type then \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-cli/src/publish.rs"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f9e3f296ba24dc04e8467631705ee14f21e00d121db5bba3e85ad023847dfcf"}},{"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."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d2bea044ff79d7d275f5a91a6e2f548586178eaf480274c33960ad020c854631"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 1 of 11 project(s) overshoot their size bounds, lowering Project Cohesion to 8.2/10. The most over is \u0060compiler-core\u0060 (95909 LoC, 420 module-visible types across 14 directories). Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d5a94650dc74886a0f1f08eb9fb6775f1fc395279ef7e901c970c9d26f767a72"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9fcfa0bf571a8938d3acaab43488c1b8be9c92cec435c026eb32a4faebb13537"},"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":"79c98ebe5b264162417e7f11a578c68dffee27789ebd67982d07b4d1783bb1fc"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9588459c45fda6212fd4a417761e71b43fa93cf868b535bfe864f891a90f53f1"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"13d90d38bb7d3bb787f089dbe626d4762573621376227f2f8de125ae5780d013"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c41990a8472b5a04b77fcf0950197a19906582840ebd4bef978c43e3e7c6f6fb"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8cec9d8b9294ed16b7b3f28d67c96ea59721d933e516b329d8f1269cc70e6f80"},"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":"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":"b91a9d44221596cb4c1f4a1f66b77a2ba93613e8a53722cfffac3649bf15499d"},"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":"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":"139b6ca8d1294cb09b4250dccb0d57ad8be8e434e7d689e1bce1a41182ebfb75"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9c278e2e40a2a90e867e5ef95f3c75771f9ade91f3c2f9951919add8d78ea9aa"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b6ec362bb9aa6149563e282fb923cb1378175f21fb4ff6ba689009ce96c3c541"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"49ba34aaf7be0ece834a73a0d77dc9989bd15e7d5dded3cb0cdfecc4f106ba90"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ae417fb6d08ef42483925490f3cba7bbc6e8f3a4060f63e5c2229c1b7e116f00"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d7fd101ed5dd4dee53a683cbcae4b1fed042186ac62c9cfd0a827a5e27472dd9"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6c87e581c14edc166bda827f308e7db17fd687397b8117827a9ba1a9db3a896c"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9bd9268c5d3114d84c3ad33f023ecc0ecac31b81393875d230ceb586ecda0891"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0d3f72eb9bb441a47024e5202c386670c0af93fb40b0b9c63270ce5e58d8c69f"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4bacff7cbcc65a38564a4a7bb8e330db75a352426df91a033fe085fccba98232"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"161c94545355d59b9fb2372d2fc2920333270144df221f8de5a3c0b7a2e15ddd"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"545fcb22baf32238f0bceb5fe127a10d4e033702d17a81364e13f0095eefbc52"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"02bd500996c377314c9d50f9af80427576207d3322506a24c87e8c76eeddc38a"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3010edafabd021d268dacfba80b70d91ee8eeb5c54c02c6d2bcca83c71be3fd3"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c29e01606de6c2b9f2109fd9f746be3ec3afacd564b7cd4f8d528a067cd85375"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"08e9d4f4a10b96a58ccc0f68fe04394fdaa65470cbda0d67cff77ad7495d6d5e"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c847a1cc9c83f3a60a4f19d23a01b93895c26860df88842038ceb26246116c64"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"44c7b094c30d2c47ae5b49f886598cdd293e27aa0b8540e9337b4951ff2a8810"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7ec937081c3ad6882e9c07735996d40cd6d5332ac535d70bb5252c6040e1f211"},"properties":{"dependency":{"package":"rustls-webpki","version":"0.103.15","advisory":"RUSTSEC-2026-0382","aliases":["[CVE redacted]","GO-2026-6809","RUSTSEC-2026-0381","RUSTSEC-2026-0383"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c78c7c829ffb431fb928ff724c9cf0276a780b7b7d9be87f32343d1209a988f8"},"properties":{"dependency":{"package":"webpki-root-certs","version":"1.0.9","advisory":"RUSTSEC-2026-0383","aliases":["[CVE redacted]","GO-2026-6809","RUSTSEC-2026-0381","RUSTSEC-2026-0382"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"aee23c0997519f9a53e2269c98d35b0a266e7a24cad6a6d93c1c088edb4f3e32"},"properties":{"dependency":{"package":"basic-toml","version":"0.1.10","advisory":"RUSTSEC-2026-0374","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2f88d3a70d29acb7742d775c7077dafff055d53d623adea4448751985efe8ee1"},"properties":{"dependency":{"package":"zip","version":"8.6.0","advisory":"RUSTSEC-2026-0367","aliases":["[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0368","RUSTSEC-2026-0369"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cc4db900d7247116e90ac1f55322889d7c04a2f09430308fea72e799e9229468"},"properties":{"dependency":{"package":"crypto-bigint","version":"0.5.5","advisory":"RUSTSEC-2026-0387","reachability":{"kind":"unknown"}}}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d225bca760666e9ec217155e7ca3982adb4960d30412f736e698f701c5c57d14"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"210c4f6ded8304b1fbd113aa2561867c40ff82cd210fafa20c4ba0978ba638c8"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b4577737c45229e6a9cf0699432c9ccdd70ff504a9570ced458833308ae1fd22"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"026a30a7950515842c99622c7b866a44a90c65ca182ce00e4cc4878534caf959"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b1194398e690c723aee645c7e67aea5748adae81f99f0b02d880eac545fa34ca"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"91151b5bbefa304139efadf387f64dc95959d9553a713c2cd4d0274ddfeba0c2"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8e72ac81fe6c4950c39a561575f751634a5b4a6b1bc9e6628d801a2ced69bbc7"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"83018c98c68b53f2369c089bbebd7239cda4a9fcf45718c41c2a50ad2e87d81d"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"975905706e8ad2b65b45ed869901c803dd4504a05e3469a96df29904a49294ba"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"483f872c6904d29067920a5fcb1260e2d44be86f9c0d4ebc8e59461ae1eaa2f7"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"76a4acd4701c50e023591611e4106b16be976b60289b3c4b89ef65acc04cd119"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"39aeeee7b0f84eea888ded6eb53fb74495bcc9652ac3429f2e2c379b7cfbfb53"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fbd6e8b542d6a4e0b40dd7f8e1340a8d3d6e1f0eb5d8cd3ee0243b070249596f"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4dd16647594d37729e214f4f01569d3be91aa04c2501118b91797ec62fecbab9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"816c8a6e981905e2a6f35fdf685b371a26148357668a048c563837ccbf531410"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7120ae40878737fbd39bc3bcd144da16d67628082f80a9eafb64f10194a87514"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"73bcd1c8c5d74cb04ed415952fc2346ceb316196231cfe5c42977493203035d8"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a81b2d0a07bf445ccd4d47a8dca0ba4c729e8a26bc48831832d3e7bba7d03e94"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"faf71a00ccdbb8465e1d3a97cc25311e416e8089e8c24d56def424afbf74584c"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: compile_package.rs \u2194 project_compiler.rs: \u0060compiler-cli/src/compile_package.rs\u0060 (context compiler-cli) and \u0060compiler-core/src/build/project_compiler.rs\u0060 (context compiler-core) sit in DIFFERENT parts of the tree yet change together 64% of the time (37 of the 58 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 37 shared commits counted here, the most recent 3 are \u0060aaa383fd\u0060 revert: stop reading manifest.toml in compile-package; \u0060de2e1431\u0060 generate .app file for compile-package, fix native module list on war\u2026; \u00608d21c119\u0060 address review comment \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-cli/src/compile_package.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c51bed2e7e39176dbe599edef007a652852b09fea58cac0305422ec40cbecf1c"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: call_graph.rs \u2194 lib.rs: \u0060compiler-core/src/call_graph.rs\u0060 (context compiler-core) and \u0060format/src/lib.rs\u0060 (context format) sit in DIFFERENT parts of the tree yet change together 60% of the time (50 of the 83 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 50 shared commits counted here, the most recent 3 are \u0060e8dea6d2\u0060 rename variant; \u0060564272b1\u0060 PipeLine -\u003E Pipeline; \u006046511d11\u0060 allow binops to be parsed in constants \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/call_graph.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"81093463fb1bec20375462a4d488903c492132ba3d12f30de825ba4552b7da2a"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: ast_folder.rs \u2194 lib.rs: \u0060compiler-core/src/ast_folder.rs\u0060 (context compiler-core) and \u0060format/src/lib.rs\u0060 (context format) sit in DIFFERENT parts of the tree yet change together 60% of the time (43 of the 72 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 43 shared commits counted here, the most recent 3 are \u0060a96cd7cc\u0060 use \u0060#[expect(...)]\u0060 instead of \u0060#[allow(...)]\u0060; \u006017d56f57\u0060 ls: make \u0060discard unused variable\u0060 properly discard left side assignm\u2026; \u0060564272b1\u0060 PipeLine -\u003E Pipeline \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/ast_folder.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cc85101e71a0e8159d41c8dbca4390116d5a124a97d18186c0239cbd245eccc"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: pretty.rs \u2194 lib.rs: \u0060compiler-core/src/type_/pretty.rs\u0060 (context compiler-core) and \u0060format/src/lib.rs\u0060 (context format) sit in DIFFERENT parts of the tree yet change together 52% of the time (11 of the 21 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 11 shared commits counted here, the most recent 3 are \u00604567b001\u0060 t -\u003E type_ (at that commit the file was still \u0060compiler-core/src/format.rs\u0060); \u00608f9c752d\u0060 Replace String with EcoString (at that commit the file was still \u0060compiler-core/src/format.rs\u0060); \u00606ca13948\u0060 Replace constructor with builder function (at that commit the file was still \u0060compiler-core/src/format.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/type_/pretty.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2642b8097135b287b2e83f3b23daac2d7e676cab28cbe0af966394d905f4f67"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: wasm_filesystem.rs \u2194 files.rs: \u0060compiler-wasm/src/wasm_filesystem.rs\u0060 (context compiler-wasm) and \u0060language-server/src/files.rs\u0060 (context language-server) sit in DIFFERENT parts of the tree yet change together 50% of the time (15 of the 30 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 15 shared commits counted here, the most recent 3 are \u0060b35eceaf\u0060 remove unused result; \u0060cf46796a\u0060 Copy source files for source maps; \u006087f26706\u0060 introduce \u0060Command\u0060 struct and split \u0060run\u0060 to make it easier to test (at that commit the file was still \u0060compiler-core/src/language_server/files.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-wasm/src/wasm_filesystem.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0fe627db91cba6c7c65880624a2e05935cc88e2f129dfc57b5ba3384dd9fb67"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: ast_folder.rs \u2194 expression.rs: \u0060compiler-core/src/ast_folder.rs\u0060 and \u0060compiler-core/src/type_/expression.rs\u0060 change together 67% of the time (48 of the 72 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 48 shared commits counted here, the most recent 3 are \u0060564272b1\u0060 PipeLine -\u003E Pipeline; \u006046511d11\u0060 allow binops to be parsed in constants; \u006028131be9\u0060 refactor: store only the arguments start position for Constant::Record \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/ast_folder.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9010e89211277e4e59cadc59b59d38cd19a01fe3ee5143b0bbd75ca2b913557"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: tests.rs \u2194 tests.rs: \u0060compiler-core/src/build/module_loader/tests.rs\u0060 and \u0060compiler-core/src/build/package_loader/tests.rs\u0060 change together 60% of the time (6 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u00609c9bb80e\u0060 store a set of files that had partial compilations done instead of al\u2026; \u006075f8b8fb\u0060 Fingerprint gleam.toml; \u0060bfc3d96f\u0060 read and write line numbers to cache \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/build/module_loader/tests.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"80a7d28d4453f97940637a81ae5007137842f7b7ce83d237d125250da8b88a3b"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: call_graph.rs \u2194 expression.rs: \u0060compiler-core/src/call_graph.rs\u0060 and \u0060compiler-core/src/type_/expression.rs\u0060 change together 52% of the time (43 of the 83 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 43 shared commits counted here, the most recent 3 are \u0060564272b1\u0060 PipeLine -\u003E Pipeline; \u006046511d11\u0060 allow binops to be parsed in constants; \u0060e210c37d\u0060 make constant records with no arguments not an error \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/call_graph.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4377a36b2cc61f0091ab665f31c5a4835a28cc23e8d92c1b6ffeea8393ad4a0a"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: visit.rs \u2194 ast_folder.rs: \u0060compiler-core/src/ast/visit.rs\u0060 and \u0060compiler-core/src/ast_folder.rs\u0060 change together 50% of the time (36 of the 72 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 36 shared commits counted here, the most recent 3 are \u0060a96cd7cc\u0060 use \u0060#[expect(...)]\u0060 instead of \u0060#[allow(...)]\u0060; \u006017d56f57\u0060 ls: make \u0060discard unused variable\u0060 properly discard left side assignm\u2026; \u006046511d11\u0060 allow binops to be parsed in constants \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/ast/visit.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ad7f8b062a3a7cf212c171c0838ec76fff016a4d7c62e341adad2a580c56ad4"}},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"81615c33b45af56b87725abce47305a390dbef582ca664179f6bb59afa077157"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4f1e7684f8281bd255ddef97105c7055c2ebae06964c8745716b83e174debe83"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c593d4dbd23724f337bfb8d2c1653812f143ae255bd9b59d4b3e9c37779fa6f4"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/templates/docs-js/index.js"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"434b6be70d8d0638474e8ec862b898272980268b27fd0ee5542341ff4617a90b"}},{"ruleId":"AC3","level":"error","message":{"text":"\u003Chtml\u003E without a lang: The page declares no language, so assistive tech can\u0027t pick the right pronunciation. Add lang (e.g. lang=\u0022en\u0022)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/templates/documentation_layout.html"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"d396493dd3ba5d3c59800c0cb199487823463afa89e9ff3efed61dd61c7e2577"}},{"ruleId":"AC4","level":"warning","message":{"text":"Positive tabindex (1): A positive tabindex forces a manual tab order that fights the DOM and is fragile. Use tabindex=\u00220\u0022 (or restructure the DOM)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/templates/documentation_layout.html"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"e862e09b6e35357c6acb7ca7a7d935d5ce916638a3e17fd314de96f950d6bb73"}},{"ruleId":"AC4","level":"warning","message":{"text":"Anchor without href: An \u003Ca\u003E with no href, role or tabindex isn\u0027t focusable or keyboard-activatable. Give it a real href, or use a \u003Cbutton\u003E for an action."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/templates/documentation_layout.html"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"63f2bfc3c9aa65a9781f62447e9383c71c5589e983aa0285eaaf5e0f8ed932ec"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cfooter\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/templates/documentation_layout.html"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"31eeead08b7c6104f0d622cf746d1ce45bae7bebdb3042139bddecd110d47b5f"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (1.5:1): \u0060.page-header\u0060 sets color: #fdf1d4 on background-color: #ffaff3 \u2014 1.5:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/templates/docs-css/index.css"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c7f7cae46b85c521d2244fe84338da236dafba7d3484febf704656668302e1c"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.search-input:focus\u0060 sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/templates/docs-css/index.css"},"region":{"startLine":963}}}],"partialFingerprints":{"codehealthFindingId/v1":"06ff04c0f4785a7ad226b1b6fabf32db6dc26fd43777d71d8e5fb4928e904564"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.sidebar\u0060 moves (\u0060transition: transform 0.5s ease\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/templates/docs-css/index.css"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"682dae0e1abc161c9f958a65903d699c840a446c21a37107efcc45d12e855f60"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.search-input-wrap\u0060 moves (\u0060transition: height linear 200ms\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/templates/docs-css/index.css"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"abec934d27b0e663eccda748f026ca734b22365e73c0ddf42edf3601511142d4"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.search-input-wrap\u0060 moves (\u0060transition: width ease 400ms\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/templates/docs-css/index.css"},"region":{"startLine":934}}}],"partialFingerprints":{"codehealthFindingId/v1":"77fa0759c95ad1a65d69b91dc6320150c0822c9c7bee689fd72aab392982db54"}},{"ruleId":"AC7","level":"warning","message":{"text":"Accessibility enforcement below the top rung: No accessibility enforcement found \u2014 no automated accessibility check runs over the HTML your app renders. Assert the accessibility invariants over that HTML in the test suite you already have (parse the output and assert, or drive a browser), and gate that test in CI so a regression blocks the merge. What was searched, so you can tell an absence from a miss: the 4 markup file(s) this pass actually assessed, the linter configuration checked in beside them, and this repository\u0027s test and CI files \u2014 matched by name against the accessibility checkers this dimension carries. An audit run outside the repository, a hosted scanner, or a check whose name is not one of those, is not seen here."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d46019b86eff5ddad9db289e6802ac158899e980df54c34f67722442787ead62"}},{"ruleId":"M1","level":"note","message":{"text":"Thin README: The root README is 90 words, against a bar of 120. Of the three newcomer-critical sections this check looks for by heading, it found no a build/run or getting-started section, 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":[],"partialFingerprints":{"codehealthFindingId/v1":"5fc8f78bec0b6b3daab9d9139ba49b687f61b54f8310b64c159df9616f47e38e"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"M2","level":"note","message":{"text":"No architecture diagram/doc: No C4/Structurizr/PlantUML/Mermaid/Graphviz/D2 diagram, no drawn diagram named for the architecture, no file named \u0060architecture\u0060 or \u0060design\u0060 in any markup this check reads, and nothing in the README, docs or contributor guides that announces the shape \u2014 no \u0060## Architecture\u0060 heading, no \u0022architecture overview\u0022/\u0022high-level design\u0022 phrasing, no \u0022the architecture is \u2026\u0022 introduction, no guided code tour. A shape laid out in prose that never names itself as the architecture is not visible to this check, and neither is one kept outside the repository, so this row reports the absence of a re-findable shape document \u2014 not evidence that nobody wrote the shape down."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0c190e7c159d1850ee706c3ac4486e151e8a4fe169de4bf61436b9f399654f06"}},{"ruleId":"P2","level":"note","message":{"text":"Logging is not universal: Only 4/8 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060.\u0060, \u0060format\u0060, \u0060gleam-bin\u0060, \u0060src-span\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"R1","level":"warning","message":{"text":"Type Safety: 3 typed \u00B7 12 plain JS \u2014 the untyped files are compiler-core/templates/docs-js/highlightjs-gleam.js, compiler-core/templates/docs-js/index.js, compiler-core/templates/echo.mjs, compiler-core/templates/prelude.mjs, test/external_only_javascript/src/external_only_javascript_ffi.mjs, test/hello_world/src/nest/bird.js (\u002B6 more)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d00ee7953f55325a823d27e5db9657c80ca9b9861c0c0abf8fe487cd3fa586d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): compiler-core/templates/prelude.mjs:969 \u00B7 compiler-core/templates/prelude.mjs:1091 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/templates/prelude.mjs"},"region":{"startLine":969}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a180da7c5b3810cc2f99dd87f0dc30c438d2d1047b0733888f82c7e2c995ab4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): compiler-core/templates/prelude.mjs:874 \u00B7 compiler-core/templates/prelude.mjs:921 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/templates/prelude.mjs"},"region":{"startLine":874}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ceb19a5727bbd67b00b6638dbf0dc3fc5370cebfa22f1e2401da939de52a902"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): compiler-core/templates/prelude.mjs:1056 \u00B7 compiler-core/templates/prelude.mjs:1178 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/templates/prelude.mjs"},"region":{"startLine":1056}}}],"partialFingerprints":{"codehealthFindingId/v1":"04c99fd004d914c062900b7690e7503492a0d2264ca7793a2c06b667692bfdda"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): compiler-core/templates/prelude.mjs:1036 \u00B7 compiler-core/templates/prelude.mjs:1158 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/templates/prelude.mjs"},"region":{"startLine":1036}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a12fb3f43f850ae9655a56f427824ab83afcf478bd4bbf2801dcc9c17dd4f15"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function addResult (cyclomatic 22, cognitive 58): addResult has cyclomatic complexity 22 and cognitive complexity 58; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/templates/docs-js/index.js"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"295d2116346db3be99289e1e94083afc8621b183d7a8115403219e09f157f896"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inspect (cyclomatic 22, cognitive 23): inspect has cyclomatic complexity 22 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/templates/echo.mjs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"37525dbf6b7017b7fe15ee4078cef49a3a324eed665b71b66be6ffc7134afe97"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isEqual (cyclomatic 18, cognitive 28): isEqual has cyclomatic complexity 18 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/templates/prelude.mjs"},"region":{"startLine":1481}}}],"partialFingerprints":{"codehealthFindingId/v1":"f94a6bb41a79d54b9b1aada8bf394546c439e5c95a6442af32c837be1adf2614"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function toBitArray (cyclomatic 17, cognitive 34): toBitArray has cyclomatic complexity 17 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/templates/prelude.mjs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb2272bcf979303cc1fff74e8f3bacbafbd218f4b775cf3d52f7bcd4af2b0e74"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sizedInt (cyclomatic 16, cognitive 36): sizedInt has cyclomatic complexity 16 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/templates/prelude.mjs"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"c615a9f1272d15fa82352ded51a72abe79a27b8d1b8764ee275424efc6800429"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function intFromUnalignedSliceUsingNumber (cyclomatic 12, cognitive 27): intFromUnalignedSliceUsingNumber has cyclomatic complexity 12 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/templates/prelude.mjs"},"region":{"startLine":986}}}],"partialFingerprints":{"codehealthFindingId/v1":"005e80a9f3dab9968e67b3e3505e8266a4da3ad02d89ecbb821c494816cf636f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function intFromUnalignedSliceUsingBigInt (cyclomatic 12, cognitive 27): intFromUnalignedSliceUsingBigInt has cyclomatic complexity 12 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/templates/prelude.mjs"},"region":{"startLine":1108}}}],"partialFingerprints":{"codehealthFindingId/v1":"db53fc322ca2ca363ed6927235a524dfd62b3ab10745e05273995463ed776611"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function equals (cyclomatic 12, cognitive 24): equals has cyclomatic complexity 12 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/templates/prelude.mjs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b033ea3f99fd0e95f075f3e1c7cba9ce285459f0367f82bfb8feeca43b4bab3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 21): (anonymous) has cyclomatic complexity 11 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/templates/docs-js/index.js"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"66c4e7d4b2471130e3216a5fd79cb73611d9d109930ed732cf4557107a43cbdf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function numberToFp16Uint (cyclomatic 11, cognitive 15): numberToFp16Uint has cyclomatic complexity 11 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/templates/prelude.mjs"},"region":{"startLine":1248}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d73f9d36a513151bb8f94115d230d7a75f07b9a8fec78f191d2709d4f8ca19a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function bitArraySliceToFloat (cyclomatic 11, cognitive 11): bitArraySliceToFloat has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/templates/prelude.mjs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab3515ebdb0bc70cf0de378570526a1c9e06842bac3fe087b93f04b4155fa99c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #string (cyclomatic 11, cognitive 9): #string 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":"compiler-core/templates/echo.mjs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb9dd8d4cb7ec239a552fce83b8e469a7f9fbbd39ff26ab14539246fa4619cd5"}},{"ruleId":"R3","level":"warning","message":{"text":"compiler-core/templates/prelude.mjs: 1377 lines of code: compiler-core/templates/prelude.mjs has 1377 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":"compiler-core/templates/prelude.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d63c2d485b5ed291d79f7cb4f969420c9d2215efa7d1842a5c3e5e88291b2622"}},{"ruleId":"R3","level":"warning","message":{"text":"compiler-core/templates/docs-js/index.js: 582 lines of code: compiler-core/templates/docs-js/index.js has 582 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":"compiler-core/templates/docs-js/index.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbd9259c4b58e09d2cc94bfbb6f341d980242dc6a082a3a6735dff9cdf290a7e"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: test/language/test/ffi_javascript.mjs:4 imports \u0027./gleam.mjs\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/language/test/ffi_javascript.mjs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"473c7337b163bb357df79369f266b8e59edf390f3c05dea17c44c87a3c4c475a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/templates/docs-js/index.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"37958aa67cbe632b76865250bd334581c2f50f05cec48d1dfba42a8f4b02c528"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/templates/echo.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"72d45fd5318cfa1bf66cf0d77ac3885be676311029f88c4c74b73bcea84d4f41"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/templates/docs-js/highlightjs-gleam.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9933b4b2dbcca7ddc32eb9ef91ee3563edba5ef7db1e643fb8d595d433821318"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060argument.label_location \u0026\u0026 argument.implicit.is_none()\u0060 appears character-identically in 2 files \u2014 compiler-core/src/type_/constant.rs, compiler-core/src/type_/expression.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/type_/constant.rs"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa9c27d19e5c39ec5bea8483ed9724d514842ac9356da78a13fc649c8d4e8176"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060index == other_index \u0026\u0026 tuple.syntactically_eq(other_tuple)\u0060 appears character-identically in 2 files \u2014 compiler-core/src/ast.rs, compiler-core/src/ast/typed.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/ast.rs"},"region":{"startLine":2767}}}],"partialFingerprints":{"codehealthFindingId/v1":"963b7c867fbeb0d191bd53ba65aa68538ea7943525b9def6cfc79535fbde002a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060label == other_label \u0026\u0026 module_alias == other_module_alias\u0060 appears character-identically in 2 files \u2014 compiler-core/src/ast.rs, compiler-core/src/ast/typed.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/ast.rs"},"region":{"startLine":2793}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4bbf6387f3e435982bd030656f3ef2c17c02eb9cd22867776e15e6623a46a6e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060operator == other_operator \u0026\u0026 left.syntactically_eq(other_left) \u0026\u0026 right.syntactically_eq(other_right)\u0060 appears character-identically in 3 files \u2014 compiler-core/src/ast.rs, compiler-core/src/ast/constant.rs, compiler-core/src/ast/typed.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/ast.rs"},"region":{"startLine":3053}}}],"partialFingerprints":{"codehealthFindingId/v1":"c428a591416aca3293f71a85b615d6e8b1dc08a82454a9f3db42dfcf0aea4df0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060package == self.module.type_info.package || package.is_empty()\u0060 appears character-identically in 2 files \u2014 compiler-core/src/javascript.rs, compiler-core/src/javascript/typescript.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/javascript.rs"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"66b2f71b7ea668444617f52e4503d71d9c4583e6fd4c9fa0b1075cbd44fc57e6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.module.type_info.accessors.get(name) \u0026\u0026 !accessors_map.shared_accessors.is_empty() \u0026\u0026 constructors.len() != 1 \u0026\u0026 constructor_publicity.\u2026\u0060 appears character-identically in 2 files \u2014 compiler-core/src/javascript.rs, compiler-core/src/javascript/typescript.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/javascript.rs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"910920d81059db1564062f12aaafe08dd13ea337359a738c695280368ccd0fad"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060config.values.reduce((acc,item,index)=\u003E{const tooltip=item.label?\u0060alt=\u0022${item.label}\u0022 title=\u0022${item.label}\u0022\u0060:\u0022\u0022;let i\u2026\u0060 is text this program did not author, and it is written into the text of an element through \u0060insertAdjacentHTML\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":"compiler-core/templates/docs-js/index.js"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d2ddd25e767809a4457e16e26b9e54e0718365c78735a17d3913f7c25ddfc0a"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060searchItem.parentTitle\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":"compiler-core/templates/docs-js/index.js"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"94924b43c69587bd842488bfe31771bf611bd2b009c793bc3a4bd931e97679dc"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060searchItem.title\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":"compiler-core/templates/docs-js/index.js"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf8d3dbf7fcde579c6818e8f02243bb2452846bb85832cf7d00c5c3ebf7b35e5"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060text.substring(index,position[0])\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":"compiler-core/templates/docs-js/index.js"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebaaa1444919f4ec077dfc0d5f3d40c1bfd7f268aab9903882931e675dea4fb5"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060text.substring(position[0],index)\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":"compiler-core/templates/docs-js/index.js"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"43dedadc997b0508c38ecfeb00300c88ec99c7dc4317f36fe01a7ab189339e26"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060text.substring(index,end)\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":"compiler-core/templates/docs-js/index.js"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b9bf30a4469a6eafd811120936726d3391bf7dead67e729df5bb755b77b423c"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060title.innerHTML.replace(/([A-Z])|([_/])/g,\u0022$2\u003Cwbr\u003E$1\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":"compiler-core/templates/docs-js/index.js"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b8ef32613198c4383cf3de23abd88268cd613a09cc723e584d9360eed977d00"}},{"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-core/templates/prelude.mjs"},"region":{"startLine":1505}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b7b23487fb8d07fcd61c0f5ff796a6239ada2d5794e19fdfb66aedc13e819ca"}},{"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-core/templates/docs-js/index.js"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"d019f487cfd9c0ad0b516e8586a3ac7d6e4718e7df804163a2086ff3fcc7095a"}},{"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-core/templates/docs-js/index.js"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"20cb871c9b6d2b2021cf79d4355fa62c19a1eabf63ad9d024bc6c6836ea9b2d0"}},{"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-core/templates/docs-js/index.js"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5d4b00b963011dfa208618718dc857bc9c8e729ca38cbe3c68c845e84493210"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 45 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-wasm/src/wasm_filesystem.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"a408c97a407d464a1432eec3f6239acb611bce75a459f8f87668803eeee8e4a8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 57 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-wasm/src/wasm_filesystem.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"36c23fbd575429784a011493375d35904a2cb289d36697f4099b6e80b55a749b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 70 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-wasm/src/wasm_filesystem.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"77dda29997fd458f245cac998497dc182f753a8212956e36d3e901ec109ba8e0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 75 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-wasm/src/wasm_filesystem.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0529756560b156c62ebaa2ef0477f37bf94a831aec72a24387cae221c2fcb53"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 80 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-wasm/src/wasm_filesystem.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"d257fe144937c447f4bccd656782387baff081f3d8b6594ec33ffb51800c31ae"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 91 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-wasm/src/wasm_filesystem.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"64e2e919a61ddcccb2c27c38413360703af33139f2c2bed866abcb304316ea66"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 96 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-wasm/src/wasm_filesystem.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"d99acd841a831b5d217a615301eb2afee104603b61a75a07a768ef8a227e9de7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 101 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-wasm/src/wasm_filesystem.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"15d39baa297618163f1a10bcefd5e35363644bc35541dc22b98065f67a8297b7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 106 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-wasm/src/wasm_filesystem.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"023731e401e2deed15efa6bf99ecdd4931c9158385906e2fd152d99bea64039a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 111 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-wasm/src/wasm_filesystem.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7bf212018fd74a204e1526be19d7a7b26fa7cf3d63312a216b446960d890bc4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 44 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/hex.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc872d286f5b48a695a63a74d5c810e0758bee2bc8c34122e69a296222707aac"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 83 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/hex.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8b9ff53944b346a31ea877117d54a339303c15d5131ea133a2c9371cc77be13"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 106 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/hex.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa670446abaaaefc577c5cc10a81c4526000646a3c36cc505a103c33b299c21b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 128 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/build/elixir_libraries.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"49bb1d20ff91c0b770c4bb96a17c8644852c0a157aede6f22b5115e60833353d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 1755 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/build/package_loader.rs"},"region":{"startLine":1755}}}],"partialFingerprints":{"codehealthFindingId/v1":"58086bee2b853eb92bf36dfea61d18165f79e40683dd0a6eea158680747c3956"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 1841 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/build/package_loader.rs"},"region":{"startLine":1841}}}],"partialFingerprints":{"codehealthFindingId/v1":"7100380ea6b39ac6a313890df22a4cadf4adec55d49f39b03b858efe4cb39846"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 487 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/build/project_compiler.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"52834f47ec8c825ac5cbe73524c27b64b30251bef4e69853d02be031e72c88e0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 521 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-core/src/build/project_compiler.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb07fb7fa83fd2d6b60d8a34b79e50ccc65dafc8cca8374bb49e14b39cce55fe"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 322 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-cli/src/fs.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bb572bd698f84c14e9d64c29498d0fb193d790f8d0719c339f87e13af778168"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 331 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-cli/src/fs.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcca4749326e4cffe01fdff5be3cf8018830e41445943bde7df76a6d1f11de77"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 118 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-cli/src/http.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"e66317474052d727b16e9b23052b5f9ac254c5e09c8ab5d1d58d00f4e69744bc"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 47 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-cli/src/shell.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"37ef1764e2f3cfd2c9e2a4977cc7ff2fe6eea879995a3d659c9810fbaee68567"}}],"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-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-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-16","guid":"659db3ea-affc-8453-8add-c1218fbfcb92","name":"Configuration","shortDescription":{"text":"Configuration"},"helpUri":"https://cwe.mitre.org/data/definitions/16.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-732","guid":"1da27e8f-b330-7650-ab63-bd61953eae5d","name":"Incorrect Permission Assignment for Critical Resource","shortDescription":{"text":"Incorrect Permission Assignment for Critical Resource"},"helpUri":"https://cwe.mitre.org/data/definitions/732.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A06:2025","guid":"491554d7-b8e4-9652-91a9-53700dc92ece","name":"Insecure Design","shortDescription":{"text":"Insecure Design"},"helpUri":"https://top10.owasp.org/2025/A06_2025-Insecure_Design/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"}]}],"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":52,"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."]}]}